Algorithmica, Volume 6, 1991

Volume 6, Number 1, 1991

Andrea S. LaPaugh, Frank Thomson Leighton: Editors' Introduction. 1-3 BibTeX
Charles E. Leiserson, James B. Saxe: Retiming Synchronous Circuitry. 5-35 BibTeX
Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg: Partitioning Circuits for Improved Testability. 37-48 BibTeX
Alok Aggarwal, J. Lawrence Carter, S. Rao Kosaraju: Optimal Tradeoffs for Addition on Systolic Arrays. 49-71 BibTeX
Prabhakar Raghavan, Clark D. Thompson: Multiterminal Global Routing: A Deterministic Approximation Scheme. 73-82 BibTeX
Martin L. Brady, Donna J. Brown: Optimal Multilayer Channel Routing with Overlap. 83-101 BibTeX
F. Miller Maley: A Generic Algorithm for One-Dimensional Homotopic Compaction. 103-128 BibTeX
Alok Aggarwal, Maria M. Klawe, Peter W. Shor: Multilayer Grid Embeddings for VLSI. 129-151 BibTeX

Clovis C. Gonzaga: Search Directions for Interior Linear-Programming Methods. 153-181 BibTeX
Hans Rohnert: Moving a Disc Between Polygons. 182-191 BibTeX
D. F. Wong, Edward M. Reingold: Probabilistic Analysis of a Grouping Algorithm. 192-206 BibTeX
Gary M. Shute, Linda L. Deneen, Clark D. Thomborson: An O(n log n) Plane-Sweep Algorithm for L_1 and L_\infty Delaunay Triangulations. 207-221 BibTeX
Sally Floyd, Richard M. Karp: FFD Bin Packing for Item Sizes with Uniform Distributions on [0, 1/2]. 222-240 BibTeX
Alok Aggarwal, Maria M. Klawe, David Lichtenstein, Nathan Linial, Avi Wigderson: A Lower Bound on the Area of Permutation Layouts. 241-255 BibTeX
Wojciech Szpankowski: On the Height of Digital Trees and Related Problems. 256-277 BibTeX
Sanjiv Kapoor, Edward M. Reingold: Stochastic Rearrangement Rules for Self-Organizing Data Structures. 278-291 BibTeX
Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata: An Optimal Algorithm for the Boundary of a Cell in a Union of Rays-Corrigendum. 292-293 BibTeX

Alberto L. Sangiovanni-Vincentelli: Editor's Foreword. 295-301 BibTeX
Fabio Romeo, Alberto L. Sangiovanni-Vincentelli: A Theoretical Framework for Simulated Annealing. 302-345 BibTeX
Philip N. Strenski, Scott Kirkpatrick: Analysis of Finite Length Annealing Schedules. 346-366 BibTeX
Gregory B. Sorkin: Efficient Simulated Annealing on Fractal Energy Landscapes. 367-418 BibTeX
Saul B. Gelfand, Sanjoy K. Mitter: Simulated Annealing Type Algorithms for Multivariate Optimization. 419-436 BibTeX
Emile H. L. Aarts, Jan H. M. Korst: Boltzmann Machines as a Model for Parallel Annealing. 437-465 BibTeX
Eugene Wong: Stochastic Neural Networks. 466-478 BibTeX

Vince Grolmusz: Large Parallel Machines Can Be Extremely Slow for Small Problems. 479-489 BibTeX
Harald Rosenberger: Order-k Voronoi Diagrams of Sites with Additive Weights in the Plane. 490-521 BibTeX
Leila De Floriani, Bianca Falcidieno, George Nagy, Caterina Pienovi: On Sorting Triangles in a Delaunay Tessellation. 522-532 BibTeX
Chandrajit L. Bajaj, Myung-Soo Kim: Convex Hulls of Objects Bounded by Algebraic Curves. 533-553 BibTeX
Daniel M. Gordon: Parallel Sorting on Cayley Graphs. 554-564 BibTeX
S. Alice Wu, Joseph JáJá: Optimal Algorithms for Adjacent Side Routing. 565-578 BibTeX
Robert F. Sproull: Refinements to Nearest-Neighbor Searching in k-Dimensional Trees. 579-589 BibTeX
J. B. Kruskal, Albert G. Greenberg: A Flexible Way of Counting Large Numbers Approximately in Small Registers. 590-596 BibTeX
Claire Kenyon, Jeffrey Scott Vitter: Maximum Queue Size and Hashing with Lazy Deletion. 597-619 BibTeX

Frank K. H. A. Dehne: Editor's Foreword Special Issue on Parallel Algorithms for Geometric Problems on Digitzed Pictures. 621-623 BibTeX
Dipen Moitra: Finding a Minimal Cover for Binary Images: An Optimal Parallel Algorithm. 624-657 BibTeX
Russ Miller, Quentin F. Stout: Computing Convexity Properties of Images on a Pyramid Computer. 658-684 BibTeX
Otfried Schwarzkopf: Parallel Computation of Disease Transforms. 685-697 BibTeX
Hussein M. Alnuweiri, Viktor K. Prasanna: Processor-Time Optimal Parallel Algorithms for Digitized Images on Mesh-Connected Processor Arrays. 698-733 BibTeX
Frank K. H. A. Dehne, Anne-Lise Hassenklover, Jörg-Rüdiger Sack, Nicola Santoro: Computational Geometry Algorithms for the Systolic Screen. 734-761 BibTeX
Mikhail J. Atallah, Susanne E. Hambrusch, Lynn E. Te Winkel: Topological Numbering of Features on a Mesh. 762-769 BibTeX

Robon Liu, Simeon C. Ntafos: On Partitioning Rectilinear Polygons into Star-Shaped Polygons. 771-800 BibTeX
Marek Chrobak, Joseph Naor: An Efficient Parallel Algorithm for Computing a Large Independent Set in Planar Graph. 801-815 BibTeX
Lyle A. McGeoch, Daniel Dominic Sleator: A Strongly Competitive Randomized Paging Algorithm. 816-825 BibTeX
Shigeru Masuyama, Toshihide Ibaraki: Chain Packing in Graphs. 826-839 BibTeX
Marc J. van Kreveld, Mark H. Overmars: Divided k-d Trees. 840-858 BibTeX
Richard J. Anderson, Gary L. Miller: Deterministic Parallel List Ranking. 859-868 BibTeX
Craig A. Morgenstern, Henry D. Shapiro: Heuristics for Rapidly Four-Coloring Large Planar Graphs. 869-891 BibTeX