Conferences in DBLP
Mihalis Yannakakis On the Approximation of Maximum Satisfiability. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Pittel On Likely Solutions of a Stable Matching Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Aditi Dhagat , Péter Gács , Peter Winkler On Playing "Twenty Questions" with a Liar. [Citation Graph (0, 0)][DBLP ] Conf ] Ronitt Rubinfeld , Madhu Sudan Self-Testing Polynomial Functions Efficiently and Over Rational Domains. [Citation Graph (0, 0)][DBLP ] Conf ] László Babai Deciding Finiteness of Matrix Groups in Las Vegas Polynomial Time. [Citation Graph (0, 0)][DBLP ] Conf ] Joel Spencer The Probabilistic Method. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Approximating the Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Jirí Matousek Relative Neighborhood Graphs in Three Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Nina Amenta Finding a Line Transversal of Axial Objects in Three Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Micha Sharir , Sivan Toledo Applications of Parametric Searching in Geometric Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein New Algorithms for Minimum Area k -gons. [Citation Graph (0, 0)][DBLP ] Conf ] Kurt Mehlhorn , Micha Sharir , Emo Welzl Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Philip D. MacKenzie Load Balancing Requires Omega(log* n ) Expected Time. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas R. Mathies Percolation Theory and Computing with Faulty Arrays of Processors. [Citation Graph (0, 0)][DBLP ] Conf ] Eran Aharonson , Hagit Attiya Counting Networks with Arbitrary Fan-Out. [Citation Graph (0, 0)][DBLP ] Conf ] Jyh-Jong Tsay Searching Tree Structures on a Mesh of Processors. [Citation Graph (0, 0)][DBLP ] Conf ] Yu Lin-Kriz , Victor Y. Pan On Parallel Complexity of Integer Linear Programming, GCD and the Iterated mod Function. [Citation Graph (0, 0)][DBLP ] Conf ] Milena Mihail , Peter Winkler On the Number of Eularian Orientations of a Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaofeng Han , Pierre Kelsen , Vijaya Ramachandran , Robert Endre Tarjan Computing Minimal Spanning Subgraphs in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] V. King , S. Rao , Robert Endre Tarjan A Faster Deterministic Maximum Flow Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Jianxiu Hao , James B. Orlin A Faster Algorithm for Finding the Minimum Cut in a Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Takeshi Tokuyama , Jun Nakano Efficient Algorithms for the Hitchcock Transportation Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Tomasz Radzik Minimizing Capacity Violations in a Transshipment Network. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Grötschel Theoretical and Practical Aspects of Combinatorial Problem Solving. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Chrobak , Lawrence L. Larmore Generosity Helps, or an 11-Competitive Algorithm for Three Servers. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Azar , Joseph Naor , Raphael Rom The Competitiveness of On-Line Assignments. [Citation Graph (2, 0)][DBLP ] Conf ] Magnús M. Halldórsson , Mario Szegedy Lower Bounds for On-Line Graph Coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Lucas Chi Kwong Hui , Charles U. Martel On Efficient Unsuccessful Search. [Citation Graph (0, 0)][DBLP ] Conf ] Sandy Irani , Anna R. Karlin , Steven Phillips Strongly Competitive Algorithms for Paging with Locality of Reference. [Citation Graph (0, 0)][DBLP ] Conf ] Eldad Bar-Eli , Piotr Berman , Amos Fiat , Peiyuan Yan On-Line Navigation in a Room. [Citation Graph (0, 0)][DBLP ] Conf ] Hanna Baumgarten , Hermann Jung , Kurt Mehlhorn Dynamic Point Location in General Subdivisions. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas J. Guibas , Rajeev Motwani , Prabhakar Raghavan The Robot Localization Problem in Two Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Esther M. Arkin , Joseph S. B. Mitchell , Subhash Suri Optimal Link Path Queries in a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Schwarz , Michiel H. M. Smid An O(n log n log log n) Algorithm for the On-Line Closest Pair Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Dan E. Willard Applications of the Fusion Tree Method to Computational Geometry and Searching. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph S. B. Mitchell , Subhash Suri Separation and Approximation of Polyhedral Objects. [Citation Graph (0, 0)][DBLP ] Conf ] Michel X. Goemans , David P. Williamson A General Approximation Technique for Constrained Forest Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Fürer , Balaji Raghavachari Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Viswanathan Ramaiyer Improved Approximations for the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Cheriyan , John H. Reif Directed s-t Bumberings, Rubber Bands, and Testing Digraph k -Vertex Connectivity. [Citation Graph (0, 0)][DBLP ] Conf ] André E. Kézdy , Patrick McGuinness Sequential and Parallel Algorithms to Find a K5 Minor. [Citation Graph (0, 0)][DBLP ] Conf ] H. Narayanan , Huzur Saran , Vijay V. Vazirani Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arboresences and Edge-Disjoint Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] J. Ian Munro , Thomas Papadakis , Robert Sedgewick Deterministic Skip Lists. [Citation Graph (0, 0)][DBLP ] Conf ] Teofilo F. Gonzalez The On-Line d -Dimensional Dictionary Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel M. Yellin Algorithms for Subset Testing and Finding Maximal Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Svante Carlsson , Jingsen Chen The Complexity of Heaps. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Yossi Azar Comparison-Sorting and Selecting in Totally Monotone Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Stein , Michael Werman Finding the Repeated Median Regression Line. [Citation Graph (0, 0)][DBLP ] Conf ] Colin McDiarmid , Ryan Hayward Strong Concentration for Quicksort. [Citation Graph (0, 0)][DBLP ] Conf ] Wojciech Szpankowski (Un)expected Behavior of Typical Suffix Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Dan Gusfield , K. Balasubramanian , Dalit Naor Parametric Optimization of Sequence Alignment. [Citation Graph (0, 0)][DBLP ] Conf ] Amihood Amir , Gary Benson Two-Dimensional Periodicity and Its Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Gad M. Landau , Uzi Vishkin Pattern Matching in a Digitized Image. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne Albers , Torben Hagerup Improved Parallel Integer Sorting Without Concurrent Writing. [Citation Graph (0, 0)][DBLP ] Conf ] 