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