Conferences in DBLP
David R. Karger , Rajeev Motwani , Madhu Sudan Approximate Graph Coloring by Semidefinite Programming [Citation Graph (0, 0)][DBLP ] Conf ] Naveen Garg , Huzur Saran , Vijay V. Vazirani Finding separator cuts in planar graphs within twice the optimal [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Alan M. Frieze , Dominic Welsh Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs [Citation Graph (0, 0)][DBLP ] Conf ] Mario Szegedy A note on the Theta number of Lovász and the generalized Delsarte bound [Citation Graph (0, 0)][DBLP ] Conf ] Jeffrey C. Jackson An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform Distribution [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty , Zhixiang Chen , Steven Homer On Learning Discretized Geometric Concepts (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Aditi Dhagat , Lisa Hellerstein PAC Learning with Irrelevant Attributes [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Bender , Donna K. Slonim The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Leonard M. Adleman Algorithmic Number Theory-The Complexity Contribution [Citation Graph (0, 0)][DBLP ] Conf ] Daniel R. Simon On the Power of Quantum Cryptography [Citation Graph (0, 0)][DBLP ] Conf ] Peter W. Shor Algorithms for Quantum Computation: Discrete Logarithms and Factoring [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Richard J. Lipton , Yechezkel Zalcstein The Complexity of the Membership Problem for 2-generated Commutative Semigroups of Rational Matrices [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Wolfgang H. J. Fuchs , Dexter Kozen , Zicheng Liu Efficient Average-Case Algorithms for the Modular Group [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Finding the k Shortest Paths [Citation Graph (1, 0)][DBLP ] Conf ] S. Rao Kosaraju , James K. Park , Clifford Stein Long Tours and Short Superstrings (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Karsten Weihe Maximum (s, t)-Flows in Planar Networks in O(|V| log |V|) Time [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen Estimating the Size of the Transitive Closure in Linear Time [Citation Graph (0, 0)][DBLP ] Conf ] R. Ravi Rapid Rumor Ramification: Approximating the minimum broadcast time (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Moni Naor , Avishai Wool The Load, Capacity and Availability of Quorum Systems [Citation Graph (0, 0)][DBLP ] Conf ] Gene Itkis , Leonid A. Levin Fast and Lean Self-Stabilizing Asynchronous Protocols [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Yossi Azar Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation [Citation Graph (0, 0)][DBLP ] Conf ] David R. Karger , Daphne Koller (De)randomized Construction of Small Sample Spaces in \calNC [Citation Graph (0, 0)][DBLP ] Conf ] Aravind Srinivasan , David Zuckerman Computing with Very Weak Random Sources [Citation Graph (0, 0)][DBLP ] Conf ] Mihir Bellare , John Rompel Randomness-Efficient Oblivious Sampling [Citation Graph (0, 0)][DBLP ] Conf ] Ronitt Rubinfeld On the robustness of functional equations [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Chi-Chih Yao A Lower Bound for the Monotone Depth of Connectivity [Citation Graph (0, 0)][DBLP ] Conf ] Rakesh K. Sinha , Jayram S. Thathachar Efficient Oblivious Branching Programs for Threshold Functions [Citation Graph (0, 0)][DBLP ] Conf ] Noam Nisan , Steven Rudich , Michael E. Saks Products and Help Bits in Decision Trees [Citation Graph (0, 0)][DBLP ] Conf ] Daniel J. Kleitman , Frank Thomson Leighton , Yuan Ma On the Design of Reliable Boolean Circuits that Contain Partially Unreliable Gates [Citation Graph (0, 0)][DBLP ] Conf ] Abhiram G. Ranade , Saul Schleimer , Daniel Shawcross Wilkerson Nearly Tight Bounds for Wormhole Routing [Citation Graph (0, 0)][DBLP ] Conf ] Robert D. Blumofe Scheduling Multithreaded Computations by Work Stealing [Citation Graph (0, 0)][DBLP ] Conf ] Miroslaw Kutylowski , Krzysztof Lorys , Brigitte Oesterdiekhoff , Rolf Wanka Fast and Feasible Periodic Sorting Networks of Constant Depth [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Blum , Hal Wasserman Program Result-Checking: A Theory of Testing Meets a Test of Theory [Citation Graph (0, 0)][DBLP ] Conf ] Elias Koutsoupias , Christos H. Papadimitriou Beyond Competitive Analysis [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai , James Aspnes , Cynthia Dwork , Orli Waarts A Theory of Competitive Analysis for Distributed Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Rainer Gawlick , Frank Thomson Leighton , Yuval Rabani On-line Admission Control and Circuit Routing for High Performance Computing and Communication [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Lund , Steven Phillips , Nick Reingold IP over connection-oriented networks and distributional paging [Citation Graph (0, 0)][DBLP ] Conf ] Silvio Micali CS Proofs (Extended Abstracts) [Citation Graph (0, 0)][DBLP ] Conf ] Alfredo De Santis , Giovanni Di Crescenzo , Giuseppe Persiano , Moti Yung On Monotone Formula Closure of SZK [Citation Graph (0, 0)][DBLP ] Conf ] Joe Kilian On the complexity of Bounded-Interaction and Noninteractive Zero-Knowledge Proofs [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Kushilevitz , Silvio Micali , Rafail Ostrovsky Reducibility and Completeness in Multi-Party Private Computations [Citation Graph (0, 0)][DBLP ] Conf ] David Aldous , Umesh V. Vazirani ``Go With the Winners'' Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Gärtner , Günter M. Ziegler Randomized Simplex Algorithms on Klee-Mintny Cubes [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou , Prabhakar Raghavan , Madhu Sudan , Hisao Tamaki Motion Planning on a Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Jon M. Kleinberg The Localization Problem for Mobile Robots [Citation Graph (0, 0)][DBLP ] Conf ] Michael Ben-Or Algebraic Computation Trees in Characteristi p>0 (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] C. Andrew Neff , John H. Reif An O(n^1+epsilon log b) Algorithm for the Complex Roots Problem [Citation Graph (0, 0)][DBLP ] Conf ] Dima Grigoriev , Nicolai Vorobjov Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates [Citation Graph (0, 0)][DBLP ] Conf ] György Turán , Farrokh Vatan On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Michael Sipser , Daniel A. Spielman Expander Codes [Citation Graph (0, 0)][DBLP ] Conf ] Nathan Linial , Eran London , Yuri Rabinovich The geometry of graphs and some of its algorithmic applications [Citation Graph (1, 0)][DBLP ] Conf ] Anil Kamath , Rajeev Motwani , Krishna V. Palem , Paul G. Spirakis Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture [Citation Graph (0, 0)][DBLP ] Conf ] Andres Albanese , Johannes Blömer , Jeff Edmonds , Michael Luby , Madhu Sudan Priority Encoding Transmission [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Schwentick Graph Connectivity and Monadic NP [Citation Graph (0, 0)][DBLP ] Conf ] Yoram Hirshfeld , Mark Jerrum , Faron Moller A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes [Citation Graph (0, 0)][DBLP ] Conf ] Saugata Basu , Richard Pollack , Marie-Françoise Roy On the Combinatorial and Algebraic Complexity of Quantifier Elimination [Citation Graph (0, 0)][DBLP ] Conf ] Witold Charatonik , Leszek Pacholski Set constraints with projections are in NEXPTIME [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Kannan Markov Chains and Polynomial Time Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle A Spectral Approach to Lower Bounds [Citation Graph (0, 0)][DBLP ] Conf ] Nancy M. Amato , Michael T. Goodrich , Edgar A. Ramos Parallel Algorithms for Higher-Dimensional Convex Hulls [Citation Graph (0, 0)][DBLP ] Conf ] Kenneth L. Clarkson More Output-Sensitive Geometric Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Sunil Arya , David M. Mount , Michiel H. M. Smid Randomized and deterministic algorithms for geometric spanners of small diameter [Citation Graph (0, 0)][DBLP ] Conf ] Arne Andersson , Stefan Nilsson A New Efficient Radix Sort [Citation Graph (0, 0)][DBLP ] Conf ] Daniel H. Greene , Michal Parnas , F. Frances Yao Multi-Index Hashing for Information Retrieval [Citation Graph (0, 0)][DBLP ] Conf ] K. Bruce Erickson , Richard E. Ladner , Anthony LaMarca Optimizing Static Calendar Queues [Citation Graph (0, 0)][DBLP ] Conf ] Monika Rauch Henzinger Fully Dynamic Cycle-Equivalence in Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Dmitry Keselman , Amihood Amir Maximum Agreement Subtree in a Set of Evolutionary Trees-Metrics and Efficient Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] Martin Farach , Mikkel Thorup Optimal Evolutionary Tree Comparison by Sparse Dynamic Programming (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Ron Shamir , Robert Endre Tarjan Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping [Citation Graph (0, 0)][DBLP ] Conf ] Paul Beame , Russell Impagliazzo , Jan Krajícek , Toniann Pitassi , Pavel Pudlák Lower Bound on Hilbert's Nullstellensatz and propositional proofs [Citation Graph (0, 0)][DBLP ] Conf ] Eric Allender , Martin Strauss Measure on Small Complexity Classes, with Applications for BPP [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Khanna , Rajeev Motwani , Madhu Sudan , Umesh V. Vazirani On Syntactic versus Computational Views of Approximability [Citation Graph (0, 0)][DBLP ] Conf ] Noam Nisan , Avi Wigderson On Rank vs. Communication Complexity [Citation Graph (0, 0)][DBLP ] Conf ] 