Search results for "WADS"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Bernard M. E. Moret, Henry D. Shapiro	An Emperical Analysis of Algorithms for Constructing a Minimum Spanning Tree.	WADS	1991	DBLP DOI BibTeX RDF
1	Lin Yu, Daniel J. Rosenkrantz	A Linear-Time Scheme for Version Reconstruction (Extended Abstract).	WADS	1991	DBLP DOI BibTeX RDF
1	Gautam Das 0001, Giri Narasimhan	Geometric Searching and Link Distance (Extended Abstract).	WADS	1991	DBLP DOI BibTeX RDF
1	Yijie Han	A Fast Derandomization Schemes and Its Applications.	WADS	1991	DBLP DOI BibTeX RDF
1	Josep Díaz, Alan Gibbons, Mike Paterson, Jacobo Torán	The MINSUMCUT Problem.	WADS	1991	DBLP DOI BibTeX RDF
1	Jeffrey S. Salowe	Shallow Interdistnace Selection and Interdistance Enumeration.	WADS	1991	DBLP DOI BibTeX RDF
1	Goos Kant, Hans L. Bodlaender	Planar Graph Augmentation Problems (Extended Abstract).	WADS	1991	DBLP DOI BibTeX RDF
1	Gert Vegter	Dynamically Maintaining the Visibility Graph.	WADS	1991	DBLP DOI BibTeX RDF
1	Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan	Treewidth of Circular-Arc Graphs (Abstract).	WADS	1991	DBLP DOI BibTeX RDF
1	Eric N. Hanson	The Interval Skip List: A Data Structure for Finding All Intervals that Overlap a Point.	WADS	1991	DBLP DOI BibTeX RDF
1	John Hershberger 0001, Jack Snoeyink	Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract).	WADS	1991	DBLP DOI BibTeX RDF
1	Philippe Jacquet, Wojciech Szpankowski	What Can We Learn about Suffix Trees from Independent Tries?	WADS	1991	DBLP DOI BibTeX RDF
1	Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos	Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons.	WADS	1991	DBLP DOI BibTeX RDF
1	Oscar R. Anguilar, Ajoy Kumar Datta, Sukumar Ghosh	Sharing Memory in Asynchronous Message Passing Systems.	WADS	1991	DBLP DOI BibTeX RDF
1	Bengt J. Nilsson, Sven Schuierer	An Optimal Algorithm for the Rectilinear Link Center of a Rectangular Polygon.	WADS	1991	DBLP DOI BibTeX RDF
1	Paul J. Heffernan, Joseph S. B. Mitchell	An Optimal Algorithm for Computing Visibility in the Plane.	WADS	1991	DBLP DOI BibTeX RDF
1	Hristo N. Djidjev, Andrzej Lingas	On Computing the Voronoi Diagram for Restricted Planar Figures.	WADS	1991	DBLP DOI BibTeX RDF
1	Selim G. Akl	Memory Access in Models of Parallel Computation: From Folklore to Synergy and Beyond.	WADS	1991	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Jirí Matousek 0001, Subhash Suri	Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions.	WADS	1991	DBLP DOI BibTeX RDF
1	Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni	Competitive Algorithms for the Weighted List Update Problem.	WADS	1991	DBLP DOI BibTeX RDF
1	David Eppstein	Offline Algorithms for Dynamic Minimum Spanning Tree Problems.	WADS	1991	DBLP DOI BibTeX RDF
1	Thomas Lengauer, Dirk Theune	Unstructured Path Problems and the Making of Semirings (Preliminary Version).	WADS	1991	DBLP DOI BibTeX RDF
1	A. Srinivasa Rao, C. Pandu Rangan	Linear Algorithms for Parity Path and Two Path Problems on Circular-Arc Graph.	WADS	1989	DBLP DOI BibTeX RDF
1	Mikhail J. Atallah, Susanne E. Hambrusch	Optimal Channel Placement for Multi-Terminal Nets.	WADS	1989	DBLP DOI BibTeX RDF
1	Paul F. Dietz	Optimal Algorithms for List Indexing and Subset Rank.	WADS	1989	DBLP DOI BibTeX RDF
1	Yan Ke, Joseph O'Rourke	Computing the Kernel of a Point Set in a Polygon (Extended Abstract).	WADS	1989	DBLP DOI BibTeX RDF
1	Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert 0001	Weighted Orthogonal Linear L∞-Approximation and Applications.	WADS	1989	DBLP DOI BibTeX RDF
1	Philippe Derome	A New Search Time Update Time Tradeoff for the Implicit Dictionary.	WADS	1989	DBLP DOI BibTeX RDF
1	Walter Cunto, Gustavo Lau, Philippe Flajolet	Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations.	WADS	1989	DBLP DOI BibTeX RDF
1	Rongyao Zhao	Linear Time Algorithms for Computing Reachability Regions from Polygonal Figures.	WADS	1989	DBLP DOI BibTeX RDF
1	Alok Aggarwal, Shlomo Moran, Peter W. Shor, Subhash Suri	Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version).	WADS	1989	DBLP DOI BibTeX RDF
1	Heinz Breu	An Efficient Algorithm for Finding all Maximal Square Blocks in a Matrix.	WADS	1989	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender	On Linear Time Minor Tests and Depth First Search.	WADS	1989	DBLP DOI BibTeX RDF
1	Ricardo A. Baeza-Yates, Gaston H. Gonnet	Efficient Text Searching of Regular Expressions.	WADS	1989	DBLP DOI BibTeX RDF
1	Matthew Díaz, Joseph O'Rourke	Computing the Center of Area of a Polygon.	WADS	1989	DBLP DOI BibTeX RDF
1	Fabrizio Luccio, Mireille Régnier, René Schott	Discs and Other Related Data Structures.	WADS	1989	DBLP DOI BibTeX RDF
1	Jeffrey S. Salowe	Selecting the kth Largest-Area Convex Polygon.	WADS	1989	DBLP DOI BibTeX RDF
1	Sam M. Kim, Robert McNaughton, Robert McCloskey	A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata.	WADS	1989	DBLP DOI BibTeX RDF
1	David G. Kirkpatrick, Stephen K. Wismath	Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract).	WADS	1989	DBLP DOI BibTeX RDF
1	Danièle Gardy, Philippe Flajolet, Claude Puech	On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees.	WADS	1989	DBLP DOI BibTeX RDF
1	Yie-Huei Hwang, Ruei-Chuan Chang, Hung-Yi Tu	Finding All Shortest Path Edge Sequences on a Convex Polyhedron.	WADS	1989	DBLP DOI BibTeX RDF
1	Christos Levcopoulos, Ola Petersson	Heapsort - Adapted for Presorted Files.	WADS	1989	DBLP DOI BibTeX RDF
1	Wojciech Szpankowski	Digital Data Structures and Order Statistics.	WADS	1989	DBLP DOI BibTeX RDF
1	Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni	Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version).	WADS	1989	DBLP DOI BibTeX RDF
1	Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap	Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version).	WADS	1989	DBLP DOI BibTeX RDF
1	Paul F. Dietz	Fully Persistent Arrays (Extended Array).	WADS	1989	DBLP DOI BibTeX RDF
1	Marek Chrobak, Joseph Naor, Mark B. Novick	Using Bounded Degree Spanning Trees in the Design of Efficient Algorithms on Claw-Free Graphs.	WADS	1989	DBLP DOI BibTeX RDF
1	J. Ian Munro, Venkatesh Raman 0001	Sorting with Minimum Data Movement (Preliminary Draft).	WADS	1989	DBLP DOI BibTeX RDF
1	David Rappaport	Computing the Furthest Site Voronoi Diagram for a Set of Discs (Preliminary Report).	WADS	1989	DBLP DOI BibTeX RDF
1	Luc Devroye	Probabilistic Analysis of Algorithms and Data Structures.	WADS	1989	DBLP DOI BibTeX RDF
1	Ricardo A. Baeza-Yates	String Searching Algorithms Revisited.	WADS	1989	DBLP DOI BibTeX RDF
1	J. Mark Keil, Carl A. Gutwin	The Delauney Triangulation Closely Approximates the Complete Euclidean Graph.	WADS	1989	DBLP DOI BibTeX RDF
1	Herbert Edelsbrunner	Combinatorial and Computational Results for Line Arrangements in Space.	WADS	1989	DBLP DOI BibTeX RDF
1	Samir Khuller	Parallel Algorithms for the Subgraph Homeomorphism Problem.	WADS	1989	DBLP DOI BibTeX RDF
1	David Fernández-Baca, Mark A. Williams	Augmentation Problems on Hierarchically Defined Graphs (Preliminary Version).	WADS	1989	DBLP DOI BibTeX RDF
1	Arne Andersson	Improving Partial Rebuilding by Using Simple Balance Criteria.	WADS	1989	DBLP DOI BibTeX RDF
1	Gur Saran Adhar, Shietung Peng	Parallel Algorithms for Cographs Recognition and Applications.	WADS	1989	DBLP DOI BibTeX RDF
1	Chee-Keng Yap, Helmut Alt	Motion Planning in the CL-Environment (Extended Abstract).	WADS	1989	DBLP DOI BibTeX RDF
1	Naomi Nishimura	Complexity Issues in Tree-Based Version Control.	WADS	1989	DBLP DOI BibTeX RDF
1	Adair Dingle, Ivan Hal Sudborough	On the Complexity of Single Row Routing Problems.	WADS	1989	DBLP DOI BibTeX RDF
1	Lin Chen 0001	NC Algorithms for Circular-Arc Graphs.	WADS	1989	DBLP DOI BibTeX RDF
1	William W. Pugh	Skip Lists: A Probabilistic Alternative to Balanced Trees.	WADS	1989	DBLP DOI BibTeX RDF
1	Mark Allen Weiss, Jainendra K. Navlakha	The Distribution of Keys in a Binary Heap.	WADS	1989	DBLP DOI BibTeX RDF
1	Jurek Czyzowicz, Ivan Rival, Jorge Urrutia	Galleries, Light Matchings and Visibility Graphs.	WADS	1989	DBLP DOI BibTeX RDF
1	Russ Miller, Quentin F. Stout	Optimal Hypercube Algorithms for Labeled Images (Preliminary Version).	WADS	1989	DBLP DOI BibTeX RDF
1	Oscar H. Ibarra, Michael A. Palis	An Efficient All-Parses Systolic Algorithm for General Context-Free Parsing.	WADS	1989	DBLP DOI BibTeX RDF
1	Murray Sherk	Self-Adjusting k-ary Search Trees.	WADS	1989	DBLP DOI BibTeX RDF
1	Michael T. Goodrich, Jack Snoeyink	Stabbing Parallel Segments with a Convex Polygon (Extended Abstract).	WADS	1989	DBLP DOI BibTeX RDF
1	Graeme S. Port, Alistair Moffat	A Fast Algorithm for Melding Splay Trees.	WADS	1989	DBLP DOI BibTeX RDF
1	Bertha Scholten, Jan van Leeuwen	Structured NC.	WADS	1989	DBLP DOI BibTeX RDF
1	Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro (eds.)	Algorithms and Data Structures, Workshop WADS '89, Ottawa, Canada, August 17-19, 1989, Proceedings	WADS	1989	DBLP DOI BibTeX RDF
1	Franco P. Preparata, Roberto Tamassia	Efficient Spatial Point Location (Extended Abstract).	WADS	1989	DBLP DOI BibTeX RDF

Publications at "WADS"( http://dblp.L3S.de/Venues/WADS )