default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOptimal Algorithms 1989: Varna, Bulgaria
- Hristo N. Djidjev:
Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29 - June 2, 1989, Proceedings. Lecture Notes in Computer Science 401, Springer 1989, ISBN 3-540-51859-2 - John H. Reif, Sandeep Sen:
Randomization in Parallel Algorithms and its Impact on Computational Geometry. 1-8 - Christos Levcopoulos, Andrzej Lingas:
Ther Are Planar Graphs Almost as Good as the Complete Graphs and as Short as Minimum Spanning Trees. 9-13 - Frank K. H. A. Dehne:
Computing Digitized Voronoi Diagrams on a Systolic Screen and Applications to Clustering. 14-24 - Costas S. Iliopoulos, William F. Smyth:
PRAM Algorithms for Identifying Polygon Similarity. 25-32 - Vijaya Ramachandran:
A Framework for Parallel Graph Algorithm Design. 33-40 - Theodore S. Papatheodorou, N. Tsantanis:
Fast Soliton Automata. 41-47 - Sam M. Kim, Robert McNaughton, Robert McCloskey:
An Upper Bound on the Order of Locally Testable Deterministic Finite Automata. 48-65 - Didier Caucal:
A Fast Algorithm to Decide on Simple Grammars Equivalence. 66-85 - Michel Cosnard, El Mostafa Daoudi, Yves Robert
:
Complexity of the Parallel Givens Facotrization on Shared Memory Architectures. 86-105 - Arne Andersson:
Optimal Bounds on the Dictionary Problem. 106-114 - B. John Oommen, David T. H. Ng:
Optimal Constant Space Move-to-Rear List Organization. 115-125 - Lyudmil Aleksandrov, Hristo N. Djidjev:
Improved Bounds on the Size of Separators of Toroidal Graphs. 126-138 - Renzo Sprugnoli, Elena Barcucci, Alessandra Chiuderi, Renzo Pinzani:
On Some Properties of (a, b)-Trees. 139-152 - Doron Nussbaum, Jörg-Rüdiger Sack:
Disassembling Two-Dimensional Composite Parts via Translations. 153-167 - Gautam Das, Deborah Joseph:
Which Triangulations Approximate the Complete Graph?. 168-192 - Maria J. Serna, Paul G. Spirakis:
The Approximability of Problems Complete for P. 193-204 - Danilo Bruschi, Deborah Joseph, Paul Young:
A Structural Overview of NP Optimization Problems. 205-231 - Bogdan S. Chlebus:
Sorting within Distance Bound on a Mesh-Connected Processor Array. 232-238 - Jyrki Katajainen, Christos Levcopoulos, Ola Petersson:
Local Insertion Sort Revisited. 239-253 - Manfred Kunde:
Packet Routing on Grids of Processors. 254-265 - Krzysztof Diks, Wojciech Rytter:
Optimal Parallel Computations for Halin Graphs. 266-273 - Constantine N. K. Osiakwan, Selim G. Akl:
Optimal Parallel Algorithms for b-Matchings in Trees. 274-308
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-27 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
