default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. WADS 1993: Montréal, Canada
- Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides:
Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings. Lecture Notes in Computer Science 709, Springer 1993, ISBN 3-540-57155-8
Invited Presentations
- Mikhail J. Atallah, Danny Z. Chen:
Computing the All-Pairs Longest Chain in the Plane. 1-13 - Allan Borodin:
Towards a Better Understanding of the Pure Packet Routing. 14-25 - Richard Cole:
Tolerating Faults in Meshes and Other Networks (Abstract). 26 - Richard M. Karp:
A Generalization of Binary Search. 27-34 - Andrew Chi-Chih Yao:
Groups and Algebraic Complexity (Abstract). 35
Regular Presentations
- Pankaj K. Agarwal, Marc J. van Kreveld:
Connected Component and Simple Polygon Intersection Searching (Extended Abstract). 36-47 - Nancy M. Amato:
An Optimal Algorithm for Finding the Separation of Simple Polygons. 48-59 - Arne Andersson:
Balanced Search Trees Made Simple. 60-71 - Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport:
Probing a Set of Hyperplanes by Lines and Related Problems. 72-82 - Lars Arge, Mikael B. Knudsen, Kirsten Larsen:
A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms. 83-94 - Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko
, Steven Skiena:
Point Probe Decision Trees for Geometric Concept Classes. 95-106 - Deganit Armon, John H. Reif:
A Dynamic Separator Algorithm. 107-118 - Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts:
Online Load Balancing of Temporary Tasks. 119-130 - Hari Balakrishnan, Anand Rajaraman, C. Pandu Rangan:
Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs. 131-141 - R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan:
The Complexity of Finding Certain Trees in Tournaments. 142-150 - Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu:
Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs (Extended Abstract). 151-162 - Paul Beame, Faith E. Fich, Rakesh K. Sinha:
Separating the Power of EREW and CREW PRAMs with Small Communication Width. 163-174 - Omer Berkman, Yossi Matias, Prabhakar Ragde:
Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs. 175-187 - Marshall W. Bern, David Eppstein, Shang-Hua Teng:
Parallel Construction of Quadtrees and Quality Triangulations. 188-199 - Prosenjit Bose, Jonathan F. Buss, Anna Lubiw:
Pattern Matching for Permutations. 200-209 - Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint:
Filling Polyhedral Molds. 210-221 - Maw-Shang Chang, Sheng-Lung Peng, Jenn-Liang Liaw:
Deferred-Query - An Efficient Approach for Problems on interval and Circular-Arc Graphs (Extended Abstract). 222-233 - Jianer Chen, Saroja P. Kanchi, Arkady Kanevsky:
On the Complexity of Graph Embeddings (Extended Abstract). 234-245 - Kenneth L. Clarkson:
Algorithms for Polytope Covering and Approximation. 246-252 - Bruno Codenotti, Giovanni Manzini, Luciano Margara, Giovanni Resta:
Global Strategies for Augmenting the Efficiency of TSP Heuristics. 253-264 - Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid:
Static and Dynamic Algorithms for k-Point Clustering Problems. 265-276 - Olivier Devillers, Andreas Fabri:
Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers. 277-288 - Paul F. Dietz, Rajeev Raman:
Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract). 289-301 - Yuzheng Ding, Mark Allen Weiss:
The K-D Heap: An Efficient Multi-dimensional Priority Queue. 302-313 - Katrin Dobrindt, Kurt Mehlhorn, Mariette Yvinec:
A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron. 314-324 - Alon Efrat, Micha Sharir, Alon Ziv:
Computing the Smallest k-Enclosing Circle and Related Problems. 325-336 - Raffaele Giancarlo:
An Index Data Structure For Matrices, with Applications to Fast Two-Dimensional Pattern Matching. 337-348 - Thorsten Graf, Klaus H. Hinrichs:
A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects. 349-360 - Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. 361-372 - Paul J. Heffernan:
Generalized Approzimate Algorithms for Point Set Congruence. 373-384 - Tao Jiang, Ming Li:
Approximating Shortest Superstrings with Constraints (Extended Abstract). 385-396 - Sampath Kannan, Tandy J. Warnow:
Tree Reconstruction from Partial Orders. 397-408 - Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama:
Improved Parallel Depth-First Search in Undirected Planar Graphs. 409-420 - David R. Karger, Rajeev Motwani, G. D. S. Ramkumar:
On Approximating the Longest Path in a Graph (Preliminary Version). 421-432 - Samir Khuller, Balaji Raghavachari, Neal E. Young:
Designing Multi-Commodity Flow Trees. 433-441 - Philip N. Klein, Sairam Subramanian:
A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs. 442-451 - Marc J. van Kreveld:
On Fat Partitioning, Fat Covering and the Union Size of Polygons (Extended Abstract). 452-463 - Danny Krizanc:
A Time-Randomness Tradeoff for Selection in Parallel. 464-470 - Hsueh-I Lu, Philip N. Klein, Robert H. B. Netzer:
Detecting Race Conditions in Parallel Programs that Use One Semaphore. 471-482 - Bruce M. Maggs, Monika Rauch:
An Algorithm for Finding Predecessors in Integer Sets. 483-493 - Robert S. Maier, René Schott:
The Exhaustion of Shared Memory: Stochastic Results. 494-505 - Andy Mirzaian:
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs. 506-517 - Pinaki Mitra, Binay K. Bhattacharya:
Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles. 518-529 - Larry F. Palazzi, Jack Snoeyink:
Counting and Reporting Red/Blue Segment Intersections. 530-540 - Marco Pellegrini:
Repetivive Hidden-Surface-Removal for Polyhedral Scenes. 541-552 - Roberto De Prisco, Angelo Monti:
On Reconfigurability of VLSI Linear Arrays. 553-564 - Steven Skiena, Gopalakrishnan Sundaram:
Reconstructing Strings from Substrings (Extended Abstract). 565-576 - Diane L. Souvaine, Chee-Keng Yap:
Combinatorial Complexity of Signed Discs (Extended Abstract). 577-588 - Matthias F. M. Stallmann, Thomas A. Hughes:
Fast Algorithms for One-Dimensional Compaction with Jog Insertion. 589-600 - Kurt Swanson:
An Optimal Algorithm for Roundness Determination on Convex Polygons. 601-609 - Jan Arne Telle, Andrzej Proskurowski:
Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems. 610-621 - Jeffery R. Westbrook, Dicky C. K. Yan:
Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems. 622-633
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 2026-05-17 00:00 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:
