Conferences in DBLP
Yossi Azar , Andrei Z. Broder , Anna R. Karlin , Nathan Linial , Steven Phillips Biased Random Walks [Citation Graph (0, 0)][DBLP ] Conf ] Guy Even , Oded Goldreich , Michael Luby , Noam Nisan , Boban Velickovic Approximations of General Independent Distributions [Citation Graph (0, 0)][DBLP ] Conf ] Leonard J. Schulman Sample Spaces Uniform on Neighborhoods [Citation Graph (0, 0)][DBLP ] Conf ] Tomás Feder , Milena Mihail Balanced Matroids [Citation Graph (0, 0)][DBLP ] Conf ] Yair Bartal , Amos Fiat , Yuval Rabani Competitive Algorithms for Distributed Data Management (Extended Abstract) [Citation Graph (5, 0)][DBLP ] Conf ] Yair Bartal , Amos Fiat , Howard J. Karloff , Rakesh Vohra New Algorithms for an Ancient Scheduling Problem [Citation Graph (1, 0)][DBLP ] Conf ] Amihood Amir , Gary Benson , Martin Farach Alphabet Independent Two Dimensional Matching [Citation Graph (0, 0)][DBLP ] Conf ] Zvi Galil A Constant-Time Optimal Parallel String-Matching Algorithm [Citation Graph (0, 0)][DBLP ] Conf ] Frank Thomson Leighton Methods for Message Routing in Parallel Machines [Citation Graph (0, 0)][DBLP ] Conf ] Joachim von zur Gathen , Victor Shoup Computing Frobenius Maps and Factoring Polynomials (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai Parallel Computation Over Hyperbolic Groups [Citation Graph (0, 0)][DBLP ] Conf ] Robert Beals , Ákos Seress Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time [Citation Graph (0, 0)][DBLP ] Conf ] Alexander I. Barvinok Feasibility Testing for Systems of Real Quadratic Equations [Citation Graph (0, 0)][DBLP ] Conf ] Geng Lin Fault Tolerant Planar Communication Networks [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder , Alan M. Frieze , Eli Upfal Existence and Construction of Edge Disjoint Paths on Expander Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Bruce M. Maggs , Ramesh K. Sitaraman Simple Algorithms for Routing on Butterfly Networks with Bounded Queues (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Yonatan Aumann , Michael Ben-Or Computing with Faulty Arrays [Citation Graph (0, 0)][DBLP ] Conf ] Anders Björner , László Lovász , Andrew Chi-Chih Yao Linear Decision Trees: Volume Estimates and Topological Bounds [Citation Graph (0, 0)][DBLP ] Conf ] Jeff Kahn , Jeong Han Kim Entropy and Sorting [Citation Graph (0, 0)][DBLP ] Conf ] Paul Beame , Joan Lawry Randomized versus Nondeterministic Communication Complexity [Citation Graph (0, 0)][DBLP ] Conf ] Paul Beame , Russell Impagliazzo , Jan Krajícek , Toniann Pitassi , Pavel Pudlák , Alan R. Woods Exponential Lower Bounds for the Pigeonhole Principle [Citation Graph (0, 0)][DBLP ] Conf ] Bruce A. Reed Finding Approximate Separators and Computing Tree Width Quickly [Citation Graph (0, 0)][DBLP ] Conf ] Satish Rao Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Elias Dahlhaus , David S. Johnson , Christos H. Papadimitriou , Paul D. Seymour , Mihalis Yannakakis The Complexity of Multiway Cuts (Extended Abstract) [Citation Graph (2, 0)][DBLP ] Conf ] Dorit Dor , Michael Tarsi Graph Decomposition Is NPC-A Complete Proof of Holyer's Conjecture [Citation Graph (0, 0)][DBLP ] Conf ] David Lee , Mihalis Yannakakis Online Minimization of Transition Systems (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Shmuel Safra Exponential Determinization for omega-Automata with Strong-Fairness Acceptance Condition (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Bellantoni , Stephen A. Cook A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract) [Citation Graph (5, 0)][DBLP ] Conf ] Adam J. Grove , Joseph Y. Halpern , Daphne Koller Asymptotic Conditional Probabilities for First-Order Logic [Citation Graph (1, 0)][DBLP ] Conf ] Zvi M. Kedem , Krishna V. Palem , Michael O. Rabin , A. Raghunathan Efficient Program Transformations for Resilient Parallel Computation via Randomization (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Richard M. Karp , Michael Luby , Friedhelm Meyer auf der Heide Efficient PRAM Simulation on a Distributed Memory Machine [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai , Nimrod Megiddo A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimension [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Kelsen On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph [Citation Graph (0, 0)][DBLP ] Conf ] Dana Angluin Computational Learning Theory: Survey and Selected Bibliography [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty , Thomas R. Hancock , Lisa Hellerstein Learning Arithmetic Read-Once Formulas [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , Steven Rudich Fast Learning of k-Term DNF Formulas with Queries [Citation Graph (0, 0)][DBLP ] Conf ] Shai Ben-David Can Finite Samples Detect Singularities of Real-Valued Functions? [Citation Graph (0, 0)][DBLP ] Conf ] Steven Lindell A Logspace Algorithm for Tree Canonization (Extended Abstract) [Citation Graph (1, 0)][DBLP ] Conf ] C. Greg Plaxton A Hypercubic Sorting Network with Nearly Logarithmic Depth [Citation Graph (0, 0)][DBLP ] Conf ] Michael Klugerman , C. Greg Plaxton Small-Depth Counting Networks [Citation Graph (0, 0)][DBLP ] Conf ] Mike Paterson , Uri Zwick Shallow Multiplication Circuits and Wise Financial Investments [Citation Graph (0, 0)][DBLP ] Conf ] László Babai , Robert Beals , Pál Takácsi-Nagy Symmetry and Complexity [Citation Graph (0, 0)][DBLP ] Conf ] Richard Beigel When Do Extra Majority Gates Help? Polylog(n) Majority Gates Are Equivalent to One [Citation Graph (0, 0)][DBLP ] Conf ] David A. Mix Barrington , Richard Beigel , Steven Rudich Representing Boolean Functions as Polynomials Modulo Composite Numbers (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Noam Nisan , Mario Szegedy On the Degree of Boolean Functions as Real Polynomials [Citation Graph (0, 0)][DBLP ] Conf ] Ramamohan Paturi On the Degree of Polynomials that Approximate Symmetric Boolean Functions (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Gil Kalai A Subexponential Randomized Simplex Algorithm (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Ilan Adler , Peter A. Beling Polynomial Algorithms for Linear Programming over the Algebraic Numbers [Citation Graph (0, 0)][DBLP ] Conf ] Zvi Galil , Giuseppe F. Italiano , Neil Sarnak Fully Dynamic Planarity Testing (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Michael T. Goodrich Planar Separators and Parallel Polygon Triangulation (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Jirí Matousek Ray Shooting and Parametric Search [Citation Graph (0, 0)][DBLP ] Conf ] Seth M. Malitz , Achilleas Papakostas On the Angular Resolution of Planar Graphs [Citation Graph (0, 0)][DBLP ] Conf ] Chi-Yuan Lo , Jirí Matousek , William L. Steiger Ham-Sandwich Cuts in R^d [Citation Graph (0, 0)][DBLP ] Conf ] Paul B. Callahan , S. Rao Kosaraju A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version) [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Boaz Patt-Shamir , David Peleg , Michael E. Saks Adapting to Asynchronous Dynamic Networks (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Shay Kutten , David Peleg Competitive Distributed Job Scheduling (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Alessandro Panconesi , Aravind Srinivasan Improved Distributed Algorithms for Coloring and Network Decomposition Problems [Citation Graph (0, 0)][DBLP ] Conf ] Manhoi Choy , Ambuj K. Singh Efficient Fault Tolerant Algorithms for Resource Allocation in Distributed Systems [Citation Graph (0, 0)][DBLP ] Conf ] Michael Sipser The History and Status of the P versus NP Question [Citation Graph (0, 0)][DBLP ] Conf ] Noam Nisan RL\subseteqSC [Citation Graph (0, 0)][DBLP ] Conf ] Janos Simon , Mario Szegedy On the Complexity of RAM with Various Operation Sets [Citation Graph (0, 0)][DBLP ] Conf ] Ramarathnam Venkatesan , Sivaramakrishnan Rajagopalan Average Case Intractability of Matrix and Diophantine Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , Carsten Lund On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Cynthia Dwork , Orli Waarts Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible! [Citation Graph (0, 0)][DBLP ] Conf ] Alain J. Mayer , Yoram Ofek , Rafail Ostrovsky , Moti Yung Self-Stabilizing Symmetry Breaking in Constant-Space (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Hagit Attiya , Roy Friedman A Correctness Condition for High-Performance Multiprocessors (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Graham Brightwell , Teunis J. Ott , Peter Winkler Target Shooting with Programmed Random Variables [Citation Graph (0, 0)][DBLP ] Conf ] Matthew K. Franklin , Moti Yung Communication Complexity of Secure Computation (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Mihir Bellare , Erez Petrank Making Zero-Knowledge Provers Efficient [Citation Graph (0, 0)][DBLP ] Conf ] Joe Kilian A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , László Lovász Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] Raimund Seidel On the All-Pairs-Shortest-Path Problem [Citation Graph (0, 0)][DBLP ] Conf ] Philip N. Klein , Sairam Sairam A Parallel Randomized Approximation Scheme for Shortest Paths [Citation Graph (0, 0)][DBLP ] Conf ] Samir Khuller , Uzi Vishkin Biconnectivity Approximations and Graph Carvings [Citation Graph (0, 0)][DBLP ] Conf ] Jyh-Han Lin , Jeffrey Scott Vitter epsilon-Approximations with Minimum Packing Constraint Violation (Extended Abstract) [Citation Graph (0, 0)][DBLP ] Conf ] 