Optimal Algorithms 1989: Varna, Bulgaria

@proceedings{DBLP:conf/oa/1989,
  editor    = {Hristo Djidjev},
  title     = {Optimal Algorithms, International Symposium, Varna, Bulgaria,
               May 29 - June 2, 1989, Proceedings},
  booktitle = {Optimal Algorithms},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {401},
  year      = {1989},
  isbn      = {3-540-51859-2},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• John H. Reif, Sandeep Sen: Randomization in Parallel Algorithms and its Impact on Computational Geometry. 1-8 BibTeX
• Christos Levcopoulos, Andrzej Lingas: Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees. 9-13 BibTeX
• Frank K. H. A. Dehne: Computing Digitized Voronoi Diagrams on a Systolic Screen and Applications to Clustering. 14-24 BibTeX
• Costas S. Iliopoulos, William F. Smyth: PRAM Algorithms for Identifying Polygon Similarity. 25-32 BibTeX
• Vijaya Ramachandran: A Framework for Parallel Graph Algorithm Design. 33-40 BibTeX
• Theodore S. Papatheodorou, N. Tsantanis: Fast Soliton Automata. 41-47 BibTeX
• Sam M. Kim, Robert McNaughton, Robert McCloskey: An Upper Bound on the Order of Locally Testable Deterministic Finite Automata. 48-65 BibTeX
• Didier Caucal: A Fast Algorithm to Decide on Simple Grammars Equivalence. 66-85 BibTeX
• Michel Cosnard, El Mostafa Daoudi, Yves Robert: Complexity of the Parallel Givens Facotrization on Shared Memory Architectures. 86-105 BibTeX
• Arne Andersson: Optimal Bounds on the Dictionary Problem. 106-114 BibTeX
• B. John Oommen, David T. H. Ng: Optimal Constant Space Move-to-Rear List Organization. 115-125 BibTeX
• Lyudmil Aleksandrov, Hristo Djidjev: Improved Bounds on the Size of Separators of Toroidal Graphs. 126-138 BibTeX
• Renzo Sprugnoli, Elena Barcucci, Alessandra Chiuderi, Renzo Pinzani: On Some Properties of (a, b)-Trees. 139-152 BibTeX
• Doron Nussbaum, Jörg-Rüdiger Sack: Disassembling Two-Dimensional Composite Parts via Translations. 153-167 BibTeX
• Gautam Das, Deborah Joseph: Which Triangulations Approximate the Complete Graph?. 168-192 BibTeX
• Maria J. Serna, Paul G. Spirakis: The Approximability of Problems Complete for P. 193-204 BibTeX
• Danilo Bruschi, Deborah Joseph, Paul Young: A Structural Overview of NP Optimization Problems. 205-231 BibTeX
• Bogdan S. Chlebus: Sorting within Distance Bound on a Mesh-Connected Processor Array. 232-238 BibTeX
• Jyrki Katajainen, Christos Levcopoulos, Ola Petersson: Local Insertion Sort Revisited. 239-253 BibTeX
• Manfred Kunde: Packet Routing on Grids of Processors. 254-265 BibTeX
• Krzysztof Diks, Wojciech Rytter: Optimal Parallel Computations for Halin Graphs. 266-273 BibTeX
• Constantine N. K. Osiakwan, Selim G. Akl: Optimal Parallel Algorithms for b-Matchings in Trees. 274-308 BibTeX