WADS B

58 papers

YearTitle / Authors
1993A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron.
Katrin Dobrindt, Kurt Mehlhorn, Mariette Yvinec
1993A Dynamic Separator Algorithm.
Deganit Armon, John H. Reif
1993A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs.
Philip N. Klein, Sairam Subramanian
1993A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms.
Lars Arge, Mikael B. Knudsen, Kirsten Larsen
1993A Generalization of Binary Search.
Richard M. Karp
1993A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects.
Thorsten Graf, Klaus H. Hinrichs
1993A Time-Randomness Tradeoff for Selection in Parallel.
Danny Krizanc
1993Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings
Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides
1993Algorithms for Polytope Covering and Approximation.
Kenneth L. Clarkson
1993An Algorithm for Finding Predecessors in Integer Sets.
Bruce M. Maggs, Monika Rauch
1993An Index Data Structure For Matrices, with Applications to Fast Two-Dimensional Pattern Matching.
Raffaele Giancarlo
1993An Optimal Algorithm for Finding the Separation of Simple Polygons.
Nancy M. Amato
1993An Optimal Algorithm for Roundness Determination on Convex Polygons.
Kurt Swanson
1993Approximating Shortest Superstrings with Constraints (Extended Abstract).
Tao Jiang, Ming Li
1993Balanced Search Trees Made Simple.
Arne Andersson
1993Combinatorial Complexity of Signed Discs (Extended Abstract).
Diane L. Souvaine, Chee-Keng Yap
1993Computing the All-Pairs Longest Chain in the Plane.
Mikhail J. Atallah, Danny Z. Chen
1993Computing the Smallest k-Enclosing Circle and Related Problems.
Alon Efrat, Micha Sharir, Alon Ziv
1993Connected Component and Simple Polygon Intersection Searching (Extended Abstract).
Pankaj K. Agarwal, Marc J. van Kreveld
1993Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs.
Hari Balakrishnan, Anand Rajaraman, C. Pandu Rangan
1993Counting and Reporting Red/Blue Segment Intersections.
Larry F. Palazzi, Jack Snoeyink
1993Deferred-Query - An Efficient Approach for Problems on interval and Circular-Arc Graphs (Extended Abstract).
Maw-Shang Chang, Sheng-Lung Peng, Jenn-Liang Liaw
1993Designing Multi-Commodity Flow Trees.
Samir Khuller, Balaji Raghavachari, Neal E. Young
1993Detecting Race Conditions in Parallel Programs that Use One Semaphore.
Hsueh-I Lu, Philip N. Klein, Robert H. B. Netzer
1993Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles.
Pinaki Mitra, Binay K. Bhattacharya
1993Fast Algorithms for One-Dimensional Compaction with Jog Insertion.
Matthias F. M. Stallmann, Thomas A. Hughes
1993Filling Polyhedral Molds.
Prosenjit Bose, Marc J. van Kreveld, Godfried T. Toussaint
1993Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization.
Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid
1993Generalized Approzimate Algorithms for Point Set Congruence.
Paul J. Heffernan
1993Global Strategies for Augmenting the Efficiency of TSP Heuristics.
Bruno Codenotti, Giovanni Manzini, Luciano Margara, Giovanni Resta
1993Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems.
Jeffery R. Westbrook, Dicky C. K. Yan
1993Groups and Algebraic Complexity (Abstract).
Andrew Chi-Chih Yao
1993Improved Parallel Depth-First Search in Undirected Planar Graphs.
Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama
1993Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs.
Andy Mirzaian
1993On Approximating the Longest Path in a Graph (Preliminary Version).
David R. Karger, Rajeev Motwani, G. D. S. Ramkumar
1993On Fat Partitioning, Fat Covering and the Union Size of Polygons (Extended Abstract).
Marc J. van Kreveld
1993On Reconfigurability of VLSI Linear Arrays.
Roberto De Prisco, Angelo Monti
1993On the Complexity of Graph Embeddings (Extended Abstract).
Jianer Chen, Saroja P. Kanchi, Arkady Kanevsky
1993Online Load Balancing of Temporary Tasks.
Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts
1993Parallel Construction of Quadtrees and Quality Triangulations.
Marshall W. Bern, David Eppstein, Shang-Hua Teng
1993Pattern Matching for Permutations.
Prosenjit Bose, Jonathan F. Buss, Anna Lubiw
1993Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract).
Paul F. Dietz, Rajeev Raman
1993Point Probe Decision Trees for Geometric Concept Classes.
Esther M. Arkin, Michael T. Goodrich, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko, Steven Skiena
1993Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems.
Jan Arne Telle, Andrzej Proskurowski
1993Probing a Set of Hyperplanes by Lines and Related Problems.
Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport
1993Reconstructing Strings from Substrings (Extended Abstract).
Steven Skiena, Gopalakrishnan Sundaram
1993Repetivive Hidden-Surface-Removal for Polyhedral Scenes.
Marco Pellegrini
1993Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers.
Olivier Devillers, Andreas Fabri
1993Separating the Power of EREW and CREW PRAMs with Small Communication Width.
Paul Beame, Faith E. Fich, Rakesh K. Sinha
1993Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs (Extended Abstract).
Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu
1993Static and Dynamic Algorithms for k-Point Clustering Problems.
Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, Michiel H. M. Smid
1993The Complexity of Finding Certain Trees in Tournaments.
R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan
1993The Exhaustion of Shared Memory: Stochastic Results.
Robert S. Maier, René Schott
1993The K-D Heap: An Efficient Multi-dimensional Priority Queue.
Yuzheng Ding, Mark Allen Weiss
1993Tolerating Faults in Meshes and Other Networks (Abstract).
Richard Cole
1993Towards a Better Understanding of the Pure Packet Routing.
Allan Borodin
1993Tree Reconstruction from Partial Orders.
Sampath Kannan, Tandy J. Warnow
1993Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs.
Omer Berkman, Yossi Matias, Prabhakar Ragde