Conferences in DBLP
Avrim Blum , Prasad Chalasani An On-Line Algorithm for Improving Performance in Navigation [Citation Graph (0, 0)][DBLP ] Conf ] Sandy Irani , Yuval Rabani On the Value of Information in Coordination Games (preliminary version) [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Yair Bartal , Amos Fiat Heat & Dump: Competitive Distributed Paging [Citation Graph (1, 0)][DBLP ] Conf ] Baruch Awerbuch , Yossi Azar , Serge A. Plotkin Throughput-Competitive On-Line Routing [Citation Graph (1, 0)][DBLP ] Conf ] Georg Gottlob NP Trees and Carnap's Modal Logic [Citation Graph (0, 0)][DBLP ] Conf ] Stavros S. Cosmadakis Logical Reducibility and Monadic NP [Citation Graph (1, 0)][DBLP ] Conf ] Vineet Gupta , Vaughan R. Pratt Gages Accept Concurrent Behavior [Citation Graph (0, 0)][DBLP ] Conf ] Peter Clote , Aleksandar Ignjatovic , Bruce M. Kapron Parallel computable higher type functionals (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] David R. Karger Random Sampling in Matroids, with Applications to Graph Connectivity and Minimum Spanning Trees [Citation Graph (1, 0)][DBLP ] Conf ] Mark Jerrum , Gregory B. Sorkin Simulated Annealing for Graph Bisection [Citation Graph (0, 0)][DBLP ] Conf ] Shenfeng Chen , John H. Reif Using Difficulty of Prediction to Decrease Computation: Fast Sort, Priority Queue and Convex Hull on Entropy Bounded Inputs [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad The shrinkage exponent is 2 [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad , Stasys Jukna , Pavel Pudlák Top-Down Lower Bounds for Depth 3 Circuits [Citation Graph (0, 0)][DBLP ] Conf ] Roman Smolensky On Representations by Low-Degree Polynomials [Citation Graph (0, 0)][DBLP ] Conf ] Richa Agarwala , David Fernández-Baca A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed [Citation Graph (0, 0)][DBLP ] Conf ] Vineet Bafna , Pavel A. Pevzner Genome Rearrangements and Sorting by Reversals [Citation Graph (0, 0)][DBLP ] Conf ] Shang-Hua Teng , F. Frances Yao Approximating Shortest Superstrings [Citation Graph (0, 0)][DBLP ] Conf ] Ran Raz , Boris Spieker On the ``log rank''-Conjecture in Communication Complexity [Citation Graph (0, 0)][DBLP ] Conf ] David W. Juedes , Jack H. Lutz The Complexity and Distribution of Hard Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Shiva Chaudhuri Sensitive Functions and Approximate Problems [Citation Graph (0, 0)][DBLP ] Conf ] Yehuda Afek , Gideon Stupp Synchronization power depends on the register size (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Soma Chaudhuri , Maurice Herlihy , Nancy A. Lynch , Mark R. Tuttle A Tight Lower Bound for k-Set Agreement [Citation Graph (0, 0)][DBLP ] Conf ] C. K. Poon Space Bounds for Graph Connectivity Problems on Node-named JAGs and Node-ordered JAGs [Citation Graph (0, 0)][DBLP ] Conf ] Greg Barnes , Jeff Edmonds Time-Space Bounds for Directed s-t Connectivity on JAG Models (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige A Randomized Time-Space Tradefoff of \tildeO(m\tildeR) for USTCON [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Maxime Crochemore , Zvi Galil , Leszek Gasieniec , Ramesh Hariharan , S. Muthukrishnan , Kunsoo Park , Wojciech Rytter Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions [Citation Graph (0, 0)][DBLP ] Conf ] Philip N. Klein , Sairam Subramanian A linear-processor polylog-time algorithm for shortest paths in planar graphs [Citation Graph (0, 0)][DBLP ] Conf ] Yonatan Aumann , Zvi M. Kedem , Krishna V. Palem , Michael O. Rabin Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs [Citation Graph (0, 0)][DBLP ] Conf ] Javed A. Aslam , Scott E. Decatur General Bounds on Statistical Query Learning and PAC Learning with Noise via Hypothesis Bounding [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Shai Ben-David , Nicolò Cesa-Bianchi , David Haussler Scale-sensitive Dimensions, Uniform Convergence, and Learnability [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty Exact Learning via the Monotone Theory (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , Ravi Kannan Learning an Intersection of k Halfspaces over a Uniform Distribution [Citation Graph (0, 0)][DBLP ] Conf ] Sridhar Rajagopalan , Vijay V. Vazirani Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs [Citation Graph (0, 0)][DBLP ] Conf ] Paul B. Callahan Optimal Parallel All-Nearest-Neighbors Using the Well-Separated Pair Decomposition (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Christos Kaklamanis , Danny Krizanc , Satish Rao Universal Emulations with Sublogarithmic Slowdown [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao Quantum Circuit Complexity [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Brassard , Claude Crépeau , Richard Jozsa , Denis Langlois A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties [Citation Graph (0, 0)][DBLP ] Conf ] Rémi Gilleron , Sophie Tison , Marc Tommasi Solving Systems of Set Constraints with Negated Subset Relationships [Citation Graph (0, 0)][DBLP ] Conf ] Dan Halperin , Micha Sharir Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle Geometric Discrepancy Revisited [Citation Graph (0, 0)][DBLP ] Conf ] Hervé Brönnimann , Bernard Chazelle , Jirí Matousek Product Range Spaces, Sensitive Sampling, and Derandomization [Citation Graph (0, 0)][DBLP ] Conf ] Lavinia Egidi The Complexity of the Theory of p-adic Numbers [Citation Graph (0, 0)][DBLP ] Conf ] Guoqiang Ge Testing Equalities of Multiplicative Representations in Polynomial Time (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Robert Beals , László Babai Las Vegas algorithms for matrix groups [Citation Graph (0, 0)][DBLP ] Conf ] Tomasz Radzik Faster Algorithms for the Generalized Network Flow Problem [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow A Framework for Cost-scaling Algorithms for Submodular Flow Problems [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Frank Thomson Leighton A Simple Local-Control Approximation Algorithm for Multicommodity Flow [Citation Graph (0, 0)][DBLP ] Conf ] Gudmund Skovbjerg Frandsen , Peter Bro Miltersen , Sven Skyum Dynamic Word Problems [Citation Graph (0, 0)][DBLP ] Conf ] Haripriyan Hampapuram , Michael L. Fredman Optimal Bi-Weighted Binary Trees and the Complexity of Maintaining Partial Sums [Citation Graph (0, 0)][DBLP ] Conf ] Pascal Koiran A Weak Version of the Blum, Shub & Smale model [Citation Graph (0, 0)][DBLP ] Conf ] Micha Sharir Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions [Citation Graph (0, 0)][DBLP ] Conf ] John Hershberger , Subhash Suri Efficient Computation of Euclidean Shortest Paths in the Plane [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Micha Sharir The Union of Convex Polyhedra in Three Dimensions [Citation Graph (0, 0)][DBLP ] Conf ] Jeff Erickson , Raimund Seidel Better Lower Bounds on Detecting Affine and Spherical Degeneracies [Citation Graph (0, 0)][DBLP ] Conf ] Amir M. Ben-Amram , Zvi Galil When can we sort in o(n log n) time? [Citation Graph (0, 0)][DBLP ] Conf ] Richard Chang , William I. Gasarch On Bounded Queries and Approximation [Citation Graph (0, 0)][DBLP ] Conf ] David Shallcross , Victor Y. Pan , Yu Lin-Kriz The NC Equivalence of Planar Integer Linear Programming and Euclidean GCD [Citation Graph (0, 0)][DBLP ] Conf ] Alexander I. Barvinok A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is Fixed [Citation Graph (0, 0)][DBLP ] Conf ] Michael McAllister , David G. Kirkpatrick , Jack Snoeyink A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane [Citation Graph (0, 0)][DBLP ] Conf ] Scott A. Mitchell Refining a Triangulation of a Planar Straight-Line Graph to Eliminate Large Angles [Citation Graph (0, 0)][DBLP ] Conf ] William S. Evans , Leonard J. Schulman Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas [Citation Graph (0, 0)][DBLP ] Conf ] Magnús M. Halldórsson , Jaikumar Radhakrishnan , K. V. Subrahmanyam Directed vs. Undirected Monotone Contact Networks for Threshold Functions [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Deh A. Huang , Doug Ierardi Counting Rational Points on Curves over Finite Fields (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] John H. Reif An O(n log ^3 n) Algorithm for the Real Root Problem [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Bonnie Berger , Lenore Cowen , David Peleg Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen Fast algorithms for constructing t-spanners and paths with stretch t [Citation Graph (0, 0)][DBLP ] Conf ] Juan A. Garay , Shay Kutten , David Peleg A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Matthew K. Franklin , Zvi Galil , Moti Yung Eavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed Systems [Citation Graph (0, 0)][DBLP ] Conf ] David Gillman A Chernoff bound for random walks on expander graphs [Citation Graph (0, 0)][DBLP ] Conf ] Guy Kortsarz , David Peleg On Choosing a Dense Subgraph (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Charles E. Leiserson , Satish Rao , Sivan Toledo Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] Michael T. Goodrich , Jyh-Jong Tsay , Darren Erik Vengroff , Jeffrey Scott Vitter External-Memory Computational Geometry (Preliminary Version) [Citation Graph (8, 0)][DBLP ] Conf ] Sanjeev Arora , László Babai , Jacques Stern , Z. Sweedyk The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations [Citation Graph (1, 0)][DBLP ] Conf ] Frank Thomson Leighton , Yuan Ma Breaking the Theta(n log ^2 n) Barrier for Sorting with Faults (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] 