Partitioning circuits for improved testability Sandeep N. BhattFan R. K. ChungArnold L. Rosenberg OriginalPaper Pages: 37 - 48
Optimal tradeoffs for addition on systolic arrays Alok AggarwalJ. Lawrence CarterS. Rao Kosaraju OriginalPaper Pages: 49 - 71
Multiterminal global routing: A deterministic approximation scheme Prabhakar RaghavanClark D. Thompson OriginalPaper Pages: 73 - 82
Optimal multilayer channel routing with overlap Martin L. BradyDonna J. Brown OriginalPaper Pages: 83 - 101
A generic algorithm for one-dimensional homotopic compaction F. Miller Maley OriginalPaper Pages: 103 - 128
Multilayer grid embeddings for VLSI Alok AggarwalMaria KlawePeter Shor OriginalPaper Pages: 129 - 151
Search directions for interior linear-programming methods Clovis C. Gonzaga OriginalPaper Pages: 153 - 181
Probabilistic analysis of a grouping algorithm D. F. WongEdward M. Reingold OriginalPaper Pages: 192 - 206
AnO(n logn) plane-sweep algorithm forL 1 andL ∞ Delaunay triangulations Gary M. ShuteLinda L. DeneenClark D. Thomborson OriginalPaper Pages: 207 - 221
FFD bin packing for item sizes with uniform distributions on [0, 1/2] Sally FloydRichard M. Karp OriginalPaper Pages: 222 - 240
A lower bound on the area of permutation layouts Alok AggarwalMaria KlaweAvi Wigderson OriginalPaper Pages: 241 - 255
On the height of digital trees and related problems Wojciech Szpankowski OriginalPaper Pages: 256 - 277
Stochastic rearrangement rules for self-organizing data structures Sanjiv KapoorEdward M. Reingold OriginalPaper Pages: 278 - 291
An optimal algorithm for the boundary of a cell in a union of rays—corrigendum Panagiotis AlevizosJean -Daniel BoissonnatFranco P. Preparata OriginalPaper Pages: 292 - 293
A theoretical framework for simulated annealing Fabio RomeoAlberto Sangiovanni-Vincentelli OriginalPaper Pages: 302 - 345
Analysis of finite length annealing schedules Philip N. StrenskiScott Kirkpatrick OriginalPaper Pages: 346 - 366
Efficient simulated annealing on fractal energy landscapes Gregory B. Sorkin OriginalPaper Pages: 367 - 418
Simulated annealing type algorithms for multivariate optimization Saul B. GelfandSanjoy K. Mitter OriginalPaper Pages: 419 - 436
Boltzmann machines as a model for parallel annealing Emile H. L. AartsJan H. M. Korst OriginalPaper Pages: 437 - 465
Large parallel machines can be extremely slow for small problems Vince Grolmusz OriginalPaper Pages: 479 - 489
Order-k voronoi diagrams of sites with additive weights in the plane Harald Rosenberger OriginalPaper Pages: 490 - 521
On sorting triangles in a delaunay tessellation Leila De FlorianiBianca FalcidienoCaterina Pienovi OriginalPaper Pages: 522 - 532
Convex hulls of objects bounded by algebraic curves Chanderjit BajajMyung -Soo Kim OriginalPaper Pages: 533 - 553
Refinements to nearest-neighbor searching ink-dimensional trees Robert F. Sproull OriginalPaper Pages: 579 - 589
A flexible way of counting large numbers approximately in small registers J. B. KruskalA. G. Greenberg OriginalPaper Pages: 590 - 596
Maximum queue size and hashing with lazy deletion Claire M. KenyonJeffrey Scott Vitter OriginalPaper Pages: 597 - 619
Editor's foreword special issue on parallel algorithms for geometric problems on digitized pictures Frank Dehne EditorialNotes Pages: 621 - 623
Finding a minimal cover for binary images: An optimal parallel algorithm Dipen Moitra OriginalPaper Pages: 624 - 657
Computing convexity properties of images on a pyramid computer Russ MillerQuentin F. Stout OriginalPaper Pages: 658 - 684
Processor-time optimal parallel algorithms for digitized images on mesh-connected processor arrays Hussein M. AlnuweiriV. K. Prasanna Kumar OriginalPaper Pages: 698 - 733
Computational geometry algorithms for the systolic screen F. DehneA. -L. HassenkloverN. Santoro OriginalPaper Pages: 734 - 761
Topological numbering of features on a mesh Mikhail J. AtallahSusanne E. HambruschLynn E. TeWinkel OriginalPaper Pages: 762 - 769
On partitioning rectilinear polygons into star-shaped polygons Robin LiuSimeon Ntafos OriginalPaper Pages: 771 - 800
An efficient parallel algorithm for computing a large independent set in a planar graph Marek ChrobakJoseph Naor OriginalPaper Pages: 801 - 815
A strongly competitive randomized paging algorithm Lyle A. McGeochDaniel D. Sleator OriginalPaper Pages: 816 - 825
Heuristics for rapidly four-coloring large planar graphs Craig A. MorgensternHenry D. Shapiro OriginalPaper Pages: 869 - 891
