Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1. WADS 1989: Ottawa, Canada
- Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro:
Algorithms and Data Structures, Workshop WADS '89, Ottawa, Canada, August 17-19, 1989, Proceedings. Lecture Notes in Computer Science 382, Springer 1989, ISBN 3-540-51542-9
- Ricardo A. Baeza-Yates
, Gaston H. Gonnet:
Efficient Text Searching of Regular Expressions. 1-2 - Franco P. Preparata, Roberto Tamassia:
Efficient Spatial Point Location (Extended Abstract). 3-11 - Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap:
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). 12-23 - Walter Cunto, Gustavo Lau, Philippe Flajolet:
Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations. 24-38 - Paul F. Dietz:
Optimal Algorithms for List Indexing and Subset Rank. 39-46 - J. Mark Keil, Carl A. Gutwin:
The Delauney Triangulation Closely Approximates the Complete Euclidean Graph. 47-56 - David Rappaport:
Computing the Furthest Site Voronoi Diagram for a Set of Discs (Preliminary Report). 57-66 - Paul F. Dietz:
Fully Persistent Arrays (Extended Array). 67-74 - Ricardo A. Baeza-Yates:
String Searching Algorithms Revisited. 75-96 - Mikhail J. Atallah, Susanne E. Hambrusch:
Optimal Channel Placement for Multi-Terminal Nets. 97-114 - Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri:
Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version). 115-134 - Yan Ke, Joseph O'Rourke:
Computing the Kernel of a Point Set in a Polygon (Extended Abstract). 135-146 - Marek Chrobak, Joseph Naor, Mark B. Novick:
Using Bounded Degree Spanning Trees in the Design of Efficient Algorithms on Claw-Free Graphs. 147-162 - Rongyao Zhao:
Linear Time Algorithms for Computing Reachability Regions from Polygonal Figures. 163-170 - Matthew Díaz, Joseph O'Rourke:
Computing the Center of Area of a Polygon. 171-182 - Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert:
Weighted Orthogonal Linear L∞-Approximation and Applications. 183-193 - Fabrizio Luccio, Mireille Régnier, René Schott:
Discs and Other Related Data Structures. 192-205 - Wojciech Szpankowski:
Digital Data Structures and Order Statistics. 206-217 - Danièle Gardy, Philippe Flajolet, Claude Puech:
On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees. 218-229 - Luc Devroye:
Probabilistic Analysis of Algorithms and Data Structures. 230 - Michael T. Goodrich, Jack Snoeyink:
Stabbing Parallel Segments with a Convex Polygon (Extended Abstract). 231-242 - Jeffrey S. Salowe:
Selecting the kth Largest-Area Convex Polygon. 243-250 - Yie-Huei Hwang, Ruei-Chuan Chang, Hung-Yi Tu:
Finding All Shortest Path Edge Sequences on a Convex Polyhedron. 251-266 - A. Srinivasa Rao, C. Pandu Rangan:
Linear Algorithms for Parity Path and Two Path Problems on Circular-Arc Graph. 267-290 - Lin Chen:
NC Algorithms for Circular-Arc Graphs. 291-302 - Samir Khuller:
Parallel Algorithms for the Subgraph Homeomorphism Problem. 303-315 - Jurek Czyzowicz, Ivan Rival, Jorge Urrutia:
Galleries, Light Matchings and Visibility Graphs. 316-324 - David G. Kirkpatrick, Stephen K. Wismath:
Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract). 325-334 - Gur Saran Adhar, Shietung Peng:
Parallel Algorithms for Cographs Recognition and Applications. 335-351 - Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni:
Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version). 352-372 - Chee-Keng Yap, Helmut Alt:
Motion Planning in the CL-Environment (Extended Abstract). 373-380 - Murray Sherk:
Self-Adjusting k-ary Search Trees. 381-392 - Arne Andersson:
Improving Partial Rebuilding by Using Simple Balance Criteria. 393-402 - Oscar H. Ibarra, Michael A. Palis:
An Efficient All-Parses Systolic Algorithm for General Context-Free Parsing. 403-419 - Sam M. Kim, Robert McNaughton, Robert McCloskey:
A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. 420-436 - William W. Pugh:
Skip Lists: A Probabilistic Alternative to Balanced Trees. 437-449 - Graeme S. Port, Alistair Moffat:
A Fast Algorithm for Melding Splay Trees. 450-459 - Heinz Breu:
An Efficient Algorithm for Finding all Maximal Square Blocks in a Matrix. 460-471 - Naomi Nishimura:
Complexity Issues in Tree-Based Version Control. 472-486 - Bertha Scholten, Jan van Leeuwen:
Structured NC. 487-498 - Christos Levcopoulos, Ola Petersson:
Heapsort - Adapted for Presorted Files. 499-509 - Mark Allen Weiss, Jainendra K. Navlakha:
The Distribution of Keys in a Binary Heap. 510-516 - Russ Miller, Quentin F. Stout:
Optimal Hypercube Algorithms for Labeled Images (Preliminary Version). 517-528 - Adair Dingle, Ivan Hal Sudborough:
On the Complexity of Single Row Routing Problems. 529-540 - Philippe Derome:
A New Search Time Update Time Tradeoff for the Implicit Dictionary. 541-551 - J. Ian Munro, Venkatesh Raman:
Sorting with Minimum Data Movement (Preliminary Draft). 552-562 - David Fernández-Baca, Mark A. Williams:
Augmentation Problems on Hierarchically Defined Graphs (Preliminary Version). 563-576 - Hans L. Bodlaender:
On Linear Time Minor Tests and Depth First Search. 577-590 - Herbert Edelsbrunner:
Combinatorial and Computational Results for Line Arrangements in Space. 591
a service of 
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 2023-03-26 23:18 CEST 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:
