Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape Vladimir J. LumelskyAlexander A. Stepanov OriginalPaper Pages: 403 - 430
A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space S. SifronyM. Sharir OriginalPaper Pages: 367 - 402
Computing on a free tree via complexity-preserving mappings Bernard Chazelle OriginalPaper Pages: 337 - 361
The longest common subsequence problem revisited A. ApostolicoC. Guerra OriginalPaper Pages: 315 - 336
Algorithms for the compilation of regular expressions into PLAs Anna R. KarlinHoward W. TrickeyJeffrey D. Ullman OriginalPaper Pages: 283 - 314
Minimizing channel density in standard cell layout Jean R. S. BlairS. KapoorKenneth J. Supowit OriginalPaper Pages: 267 - 282
A minimum-area circuit forl-selection Pavol ĎurišOndrej SýkoraImrich Vrto OriginalPaper Pages: 251 - 265
An improved algorithm for finding the median distributively Francis ChinH. F. Ting OriginalPaper Pages: 235 - 249
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons Leonidas GuibasJohn HershbergerRobert E. Tarjan OriginalPaper Pages: 209 - 233
Geometric applications of a matrix-searching algorithm Alok AggarwalMaria M. KlaweRobert Wilber OriginalPaper Pages: 195 - 208
On approximation behavior of the greedy triangulation for convex polygons Christos LevcopoulosAndrzej Lingas OriginalPaper Pages: 175 - 193
A faster divide-and-conquer algorithm for constructing delaunay triangulations Rex A. Dwyer OriginalPaper Pages: 137 - 151
Global wire routing in two-dimensional arrays R. M. KarpF. T. LeightonV. V. Vazirani OriginalPaper Pages: 113 - 129
A linear time randomizing algorithm for searching ranked functions Eitan Zemel OriginalPaper Pages: 81 - 90
Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram Colm Ó'DúnlaingMicha SharirChee Yap OriginalPaper Pages: 27 - 59
A cautious scheduler for multistep transactions Naoki KatohTiko KamedaToshihide Ibaraki OriginalPaper Pages: 1 - 26
The iterative step in the linear programming algorithm of N. Karmarkar C. E. Blair OriginalPaper Pages: 537 - 539
A projective method for linear programming with box-type constraints G. Rinaldi OriginalPaper Pages: 517 - 527
Determining basic variables of optimal solutions in Karmarkar's new LP algorithm Masakazu Kojima OriginalPaper Pages: 499 - 515
A monotonic projective algorithm for fractional linear programming Kurt M. Anstreicher OriginalPaper Pages: 483 - 498
A multiplicative barrier function method for linear programming Masao IriHiroshi Imai OriginalPaper Pages: 455 - 482
A polynomial newton method for linear programming Guy de GhellinckJean -Philippe Vial OriginalPaper Pages: 425 - 453
An extension of Karmarkar's algorithm for linear programming using dual variables Michael J. ToddBruce P. Burrell OriginalPaper Pages: 409 - 424
A modification of karmarkar's linear programming algorithm Robert J. VanderbeiMarc S. MeketonBarry A. Freedman OriginalPaper Pages: 395 - 407
A time bound on the materialization of some recursively defined views Yannis E. Ioannidis OriginalPaper Pages: 361 - 385
Understanding the implications of view update policies Claudia Bauzer MedeirosFrank Wm. Tompa OriginalPaper Pages: 337 - 360
An evaluation of buffer management strategies for relational database systems Hong -Tai ChouDavid J. DeWitt OriginalPaper Pages: 311 - 336
Bit transposition for very large scientific and statistical databases Harry K. T. WongJ. Z. LiLinda Wong OriginalPaper Pages: 289 - 309
On-the-fly, incremental, consistent reading of entire databases Callon Pu OriginalPaper Pages: 271 - 287
Optimal book embeddings of the FFT, benes, and barrel shifter networks Richard A. Games OriginalPaper Pages: 233 - 250
Two-layer channel routing with vertical unit-length overlap Shaodi GaoSusanne Hambrusch OriginalPaper Pages: 223 - 232
Channel routing in knock-knee mode: Simplified algorithms and proofs Kurt MehlhornF. P. PreparataM. Sarrafzadeh OriginalPaper Pages: 213 - 221
Fractional cascading: II. Applications Bernard ChazelleLeonidas J. Guibas OriginalPaper Pages: 163 - 191
Fractional cascading: I. A data structuring technique Bernard ChazelleLeonidas J. Guibas OriginalPaper Pages: 133 - 162
The pairing heap: A new form of self-adjusting heap Michael L. FredmanRobert SedgewickRobert E. Tarjan OriginalPaper Pages: 111 - 129
Area-time lower-bound techniques with applications to sorting G. BilardiF. P. Preparata OriginalPaper Pages: 65 - 91
