Conferences in DBLP
Fan R. K. Chung , S.-T. Yau A near optimal algorithm for edge separators (preliminary version). [Citation Graph (0, 0)][DBLP ] Conf ] Philip N. Klein , Robert Endre Tarjan A randomized linear-time algorithm for finding minimum spanning trees. [Citation Graph (1, 0)][DBLP ] Conf ] Edith Cohen Polylog-time and near-linear work approximation scheme for undirected shortest paths. [Citation Graph (0, 0)][DBLP ] Conf ] Philip N. Klein , Satish Rao , Monika Rauch Henzinger , Sairam Subramanian Faster shortest-path algorithms for planar graphs. [Citation Graph (2, 0)][DBLP ] Conf ] Keisuke Tanaka , Tetsuro Nishino On the complexity of negation-limited Boolean networks. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Krause , Pavel Pudlák On the computational power of depth 2 circuits with threshold and modulo gates. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Jakoby , Rüdiger Reischuk , Christian Schindelhauer Circuit complexity: from the worst case to the average case. [Citation Graph (0, 0)][DBLP ] Conf ] Vince Grolmusz A weight-size trade-off for circuits with MOD m gates. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle Computational geometry: a retrospective. [Citation Graph (0, 0)][DBLP ] Conf ] Marco Pellegrini On point location and motion planning among simplices. [Citation Graph (0, 0)][DBLP ] Conf ] Mark de Berg , Katrin Dobrindt , Otfried Schwarzkopf On lazy randomized incremental construction. [Citation Graph (0, 0)][DBLP ] Conf ] Bala Kalyanasundaram , Kirk Pruhs Fault-tolerant scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Anna R. Karlin , Greg Nelson , Hisao Tamaki On the fault tolerance of the butterfly. [Citation Graph (0, 0)][DBLP ] Conf ] Prabhakar Raghavan , Eli Upfal Efficient routing in all-optical networks. [Citation Graph (0, 0)][DBLP ] Conf ] Eric A. Brewer , Frederic T. Chong , Tom Leighton Scalable expanders: exploiting hierarchical random wiring. [Citation Graph (0, 0)][DBLP ] Conf ] Philip D. MacKenzie , C. Greg Plaxton , Rajmohan Rajaraman On contention resolution protocols and associated probabilistic phenomena. [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , Prasad Chalasani , Don Coppersmith , William R. Pulleyblank , Prabhakar Raghavan , Madhu Sudan The minimum latency problem. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , Joe Kilian Two prover protocols: low error at affordable rates. [Citation Graph (0, 0)][DBLP ] Conf ] Mihir Bellare , Madhu Sudan Improved non-approximability results. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Polishchuk , Daniel A. Spielman Nearly-linear size holographic proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander A. Razborov , Steven Rudich Natural proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Lenore Cowen , Mark A. Smith Efficient asynchronous distributed symmetry breaking. [Citation Graph (0, 0)][DBLP ] Conf ] Jae-Heon Yang , James H. Anderson Time bounds for mutual exclusion and related problems. [Citation Graph (0, 0)][DBLP ] Conf ] Rafail Ostrovsky , Sridhar Rajagopalan , Umesh V. Vazirani Simple and efficient leader election in the full information model. [Citation Graph (0, 0)][DBLP ] Conf ] Maurice Herlihy , Nir Shavit A simple constructive computability theorem for wait-free computation. [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , Merrick L. Furst , Jeffrey C. Jackson , Michael J. Kearns , Yishay Mansour , Steven Rudich Weakly learning DNF and characterizing statistical query learning using Fourier analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Auer , Philip M. Long Simulating access to hidden information while learning. [Citation Graph (0, 0)][DBLP ] Conf ] Michael J. Kearns , Yishay Mansour , Dana Ron , Ronitt Rubinfeld , Robert E. Schapire , Linda Sellie On the learnability of discrete distributions. [Citation Graph (0, 0)][DBLP ] Conf ] Kalvis Apsitis , Rusins Freivalds , Carl H. Smith Choosing a learning team: a topological approach. [Citation Graph (0, 0)][DBLP ] Conf ] Ramesh Hariharan Optimal parallel suffix tree construction. [Citation Graph (0, 0)][DBLP ] Conf ] Süleyman Cenk Sahinalp , Uzi Vishkin Symmetry breaking for suffix tree construction. [Citation Graph (0, 0)][DBLP ] Conf ] S. Rao Kosaraju Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version). [Citation Graph (0, 0)][DBLP ] Conf ] Arne Andersson , Torben Hagerup , Johan Håstad , Ola Petersson The complexity of searching a sorted array of strings. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Raphael Yuster , Uri Zwick Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew M. Odlyzko Search for the maximum of a random walk. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Nabil Kahale A spectral technique for coloring random 3-colorable graphs (preliminary version). [Citation Graph (0, 0)][DBLP ] Conf ] Russell Impagliazzo , Noam Nisan , Avi Wigderson Pseudorandomness for network algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Robert P. Kurshan The complexity of verification. [Citation Graph (0, 0)][DBLP ] Conf ] Yishay Mansour , Noam Nisan , Uzi Vishkin Trade-offs between communication throughput and parallel time. [Citation Graph (0, 0)][DBLP ] Conf ] Torben Hagerup Optimal parallel string algorithms: sorting, merging and computing the minimum. [Citation Graph (0, 0)][DBLP ] Conf ] Keju Ma , Joachim von zur Gathen The computational complexity of recognizing permutation functions. [Citation Graph (0, 0)][DBLP ] Conf ] Samir Khuller , Balaji Raghavachari , Neal E. Young Low degree spanning trees of small weight. [Citation Graph (0, 0)][DBLP ] Conf ] Michel X. Goemans , David P. Williamson .879-approximation algorithms for MAX CUT and MAX 2SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Magnús M. Halldórsson , Jaikumar Radhakrishnan Greed is good: approximating independent sets in sparse and bounded-degree graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Arora , Yuval Rabani , Umesh V. Vazirani Simulating quadratic dynamical systems is PSPACE-complete (preliminary version). [Citation Graph (0, 0)][DBLP ] Conf ] Madhav V. Marathe , Harry B. Hunt III , Richard Edwin Stearns , Venkatesh Radhakrishnan Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). [Citation Graph (0, 0)][DBLP ] Conf ] Meera Sitharam Pseudorandom generators and learning algorithms for AC. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Tom Leighton Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen A. Vavasis , Yinyu Ye An accelerated interior point method whose running time depends only on A (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Alfredo De Santis , Yvo Desmedt , Yair Frankel , Moti Yung How to share a function securely. [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich , Rafail Ostrovsky , Erez Petrank Computational complexity and knowledge complexity (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Josh Cohen Benaloh , Dwight Tuinstra Receipt-free secret-ballot elections (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , Joe Kilian , Moni Naor A minimal model for secure computation (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich , Avi Wigderson Tiny families of functions with random properties (preliminary version): a quality-size trade-off for hashing. [Citation Graph (0, 0)][DBLP ] Conf ] Suresh Chari , Pankaj Rohatgi , Aravind Srinivasan Improved algorithms via approximations of probability distributions (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Azar , Andrei Z. Broder , Anna R. Karlin , Eli Upfal Balanced allocations (extended abstract). [Citation Graph (1, 0)][DBLP ] Conf ] Ketan Mulmuley Lower bounds for parallel linear programming and other problems. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao Decision tree complexity and Betti numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Bro Miltersen Lower bounds for union-split-find related problems on random access machines. [Citation Graph (0, 0)][DBLP ] Conf ] Dima Grigoriev , Marek Karpinski , Nicolai Vorobjov Lower bounds on testing membership to a polyhedron by algebraic decision trees. [Citation Graph (0, 0)][DBLP ] Conf ] Avi Wigderson The amazing power of pairwise independence (abstract). [Citation Graph (0, 0)][DBLP ] Conf ] David R. Karger Random sampling in cut, flow, and network design problems. [Citation Graph (0, 0)][DBLP ] Conf ] Tao Jiang , Joel I. Seiferas , Paul M. B. Vitányi Two heads are better than two tapes. [Citation Graph (0, 0)][DBLP ] Conf ] Anne Condon , Lisa Hellerstein , Samuel Pottle , Avi Wigderson On the power of finite automata with both nondeterministic and probabilistic states (preliminary version). [Citation Graph (0, 0)][DBLP ] Conf ] Monika Rauch Improved data structures for fully dynamic biconnectivity. [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow Efficient splitting off algorithms for graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Johannes A. La Poutré Alpha-algorithms for incremental planarity testing (preliminary version). [Citation Graph (0, 0)][DBLP ] Conf ] Yefim Dinitz , Alek Vainshtein The connectivity carcass of a vertex subset in a graph and its incremental maintenance. [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou , Mihalis Yannakakis On complexity as bounded rationality (extended abstract). [Citation Graph (1, 0)][DBLP ] Conf ] Richard J. Lipton , Neal E. Young Simple strategies for large zero-sum games with applications to complexity theory. [Citation Graph (0, 0)][DBLP ] Conf ] Lance Fortnow , Duke Whang Optimality and domination in repeated games with bounded players. [Citation Graph (0, 0)][DBLP ] Conf ] Daphne Koller , Nimrod Megiddo , Bernhard von Stengel Fast algorithms for finding randomized strategies in game trees. [Citation Graph (0, 0)][DBLP ] Conf ] Tao Jiang , Eugene L. Lawler , Lusheng Wang Aligning sequences via an evolutionary tree: complexity and approximation. [Citation Graph (0, 0)][DBLP ] Conf ] S. Muthukrishnan , Krishna V. Palem Non-standard stringology: algorithms and complexity. [Citation Graph (1, 0)][DBLP ] Conf ] Philippe Jacquet , Wojciech Szpankowski A functional equation often arising in the analysis of algorithms (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Sridhar Rajagopalan , Leonard J. Schulman A coding theorem for distributed computation. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Alur , Hagit Attiya , Gadi Taubenfeld Time-adaptive algorithms for synchronization. [Citation Graph (0, 0)][DBLP ] Conf ] Boaz Patt-Shamir , Sergio Rajsbaum A theory of clock synchronization (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Mihir Bellare , Shafi Goldwasser , Carsten Lund , Alexander Russell Efficient probabilistic checkable proofs and applications to approximation. [Citation Graph (0, 0)][DBLP ] Conf ] 