Conferences in DBLP

Optimal Algorithms (oa)
1989 (conf/oa/1989)

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