Conferences in DBLP
Svante Carlsson , J. Ian Munro , Patricio V. Poblete An Implicit Binomial Queue with Constant Insertion Time. [Citation Graph (0, 0)][DBLP ] Conf ] Tony W. Lai , Derick Wood Implicit Selection. [Citation Graph (0, 0)][DBLP ] Conf ] Svante Carlsson , Christer Mattsson An Extrapolation on the Interpolation Search. [Citation Graph (0, 0)][DBLP ] Conf ] Heikki Mannila , Esko Ukkonen Time Parameter and Arbitrary Deunions in the Set Union Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Draws , Patrik Eriksson , Erik Forslund , Leif Höglund , Sören Vallner , Thomas Strothotte Two New Algorithms for Constructing Min-Max Heaps. [Citation Graph (0, 0)][DBLP ] Conf ] Derick Wood Extremal Cost Tree Data Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas J. Guibas , Mark H. Overmars , Micha Sharir Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques. [Citation Graph (0, 0)][DBLP ] Conf ] R. P. Krishnaswamy , C. E. Kim Problems of Posting Sentries: Variations on the Art Gallery Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Oliver Günther A Lower Bound and Two Approximate Algorithms for the K-Partitioning of Rectilinear Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Subir Kumar Ghosh On Recognizing and Characterizing Visibility Graphs of Simple Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Mark H. Overmars Connectability Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Walter Cunto , Patricio V. Poblete Two Hybrid Methods for Collision Resolution in Open Addressing Hashing. [Citation Graph (0, 0)][DBLP ] Conf ] Wojciech Szpankowski On an Alternative Sum Useful in the Analysis of Some Data Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Svan-Olai Høyland Bin-Packing in 1.5 Dimension. [Citation Graph (0, 0)][DBLP ] Conf ] Chee-Keng Yap Applications of a Symbolic Perturbation Scheme (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Elias Dahlhaus , Marek Karpinski A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] John R. Gilbert , Hjálmtyr Hafsteinsson Parallel Solution of Space Linear Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Frank K. H. A. Dehne , Jörg-Rüdiger Sack , Ivan Stojmenovic A Note on Determinig the 3-Dimensional Convex Hull of a Set of Points on a Mesh of Processors. [Citation Graph (0, 0)][DBLP ] Conf ] Lefteris M. Kirousis , Paul G. Spirakis Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P. [Citation Graph (0, 0)][DBLP ] Conf ] Ricardo A. Baeza-Yates , Joseph C. Culberson , Gregory J. E. Rawlins Searching with Uncertainty (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Christos Levcopoulos , Jyrki Katajainen , Andrzej Lingas An Optimal Expected-Time Parallel Algorithm for Vornoi Diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej Proskurowski , Frank Ruskey Generating Binary Trees by Transpositions. [Citation Graph (0, 0)][DBLP ] Conf ] J. Mark Keil Approximating the Complete Euclidean Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Dietzfelbinger , Kurt Mehlhorn , Friedhelm Meyer auf der Heide , Hans Rohnert Upper and Lower Bounds for the Dictionary Problem (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Hristo Djidjev Linear Algorithms for Graph Separation Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Vijay V. Vazirani NC Algorithms for Computing the Number of Perfect Matchings in K3, 3-free Graphs and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Maciej M. Syslo , Pawel Winter Independent Covers in Outerplanar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Allen Weiss , Robert Sedgewick Tight Lower Bounds for Shellsort. [Citation Graph (0, 0)][DBLP ] Conf ] 