default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd SWAT 1992: Helsinki, Finland
- Otto Nurmi, Esko Ukkonen:
Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings. Lecture Notes in Computer Science 621, Springer 1992, ISBN 3-540-55706-7 - Alexandros V. Gerbessiotis, Leslie G. Valiant:
Direct Bulk-Synchronous Parallel Algorithms. 1-18 - Rusins Freivalds, Carl H. Smith:
Memory Limited Inductive Inference Machines. 19-29 - Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde:
Retrieval of scattered information by EREW, CREW and CRCW PRAMs. 30-41 - Alexander A. Razborov:
On Small Depth Threshold Circuits. 42-52 - Nicholas Pippenger:
An Elementary Approach to Some Analytic Asymptotics. 53-61 - Artur Czumaj:
An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications. 62-72 - Guy Kortsarz, David Peleg:
Generating Sparse 2-spanners. 73-82 - Baruch Awerbuch, Bonnie Berger, Lenore Cowen
, David Peleg:
Low-Diameter Graph Decomposition is in NC. 83-93 - Xin He:
Parallel Algorithm for Cograph Recognition with Applications. 94-105 - Subir Kumar Ghosh, Anil Maheshwari:
Parallel Algorithms for All Minimum Link Paths and Link Center Problems. 106-117 - Michael Kaufmann, Jop F. Sibeyn:
Optimal Multi-Packet Routing on the Torus. 118-129 - Maria Cristina Pinotti, Geppino Pucci:
Parallel Algorithms for Priority Queue Operations. 130-139 - Paul F. Dietz:
Heap Construction in the Parallel Comparison Tree Model. 140-150 - Joan Boyar, Kim S. Larsen:
Efficient Rebalancing of Chromatic Search Trees. 151-164 - Andreas Jakoby, Rüdiger Reischuk:
The Complexity of Scheduling Problems with Communication Delays for Trees. 165-177 - Fabrizio d'Amore, Vincenzo Liberatore:
The List Update Problem and the Retrieval of Sets. 178-191 - Walter Cunto, Vicente Yriarte:
GKD-Trees: Binary Trees that Combine Multi-dimensional Data Handling, Node Size and Fringe Reorganization. 192-211 - Sandeep Sen:
Fractional Cascading Simplified. 212-220 - Dora Giammarresi, Giuseppe F. Italiano:
Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version). 221-232 - John Hershberger, Monika Rauch, Subhash Suri:
Fully Dynamic 2-Edge-Connectivity in Planar Graphs. 233-244 - Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd:
Non-Interfering Network Flows. 245-257 - Goos Kant, Hans L. Bodlaender:
Triangulating Planar Graphs While Minimizing the Maximum Degree. 258-271 - Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis:
How to Draw a Series-Parallel Digraph (Extended Abstract). 272-283 - Martin Fürer, C. R. Subramanian:
Coloring Random Graphs. 284-291 - Ton Kloks, Hans L. Bodlaender:
Testing Superperfection of k-Trees. 292-303 - David Fernández-Baca, Giora Slutzki:
Parametric Problems on Graphs of Bounded Tree-Width. 304-316 - Gaston H. Gonnet:
Efficient Two-dimensional Searching. 317 - L. Paul Chew, Klara Kedem:
Improvements on Geometric Pattern Matching Problems. 318-325 - Deborah Joseph, Joao Meidanis, Prasoon Tiwari:
Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs. 326-337 - Emo Welzl:
New Results on Linear Programming and Related Problems. 338-339 - Mordecai J. Golin:
Dynamic Closest Pairs - A Probabilistic Approach. 340-351 - Mark de Berg, Marc J. van Kreveld, Jack Snoeyink:
Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). 352-363 - Bernard Chazelle, Leonidas Palios:
Decomposing the Boundary of a Nonconvex Polyhedron. 364-375 - John Hershberger, Jack Snoeyink:
Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra. 376-387 - Hans-Peter Lenhof, Michiel H. M. Smid:
Maintaining the Visibility Map of Spheres while Moving the Viewpoint on a Circle at Infinity. 388-398 - Gerhard Albers, Thomas Roos:
Voronoi Diagrams of Moving Points in Higher Dimensional Spaces. 399-409 - Jyrki Katajainen, Tomi Pasanen:
Sorting Multisets Stably in Minimum Space. 410-421 - Ola Petersson, Alistair Moffat:
A Framework for Adaptive Sorting. 422-433
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:14 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:
