Conferences in DBLP
Jirí Matousek Geometric Computation and the Art of Sampling. [Citation Graph (0, 0)][DBLP ] Conf ] Michael J. Kearns Theoretical Issues in Probabilistic Artificial Intelligence. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder , Monika Rauch Henzinger Information Retrieval on the Web. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Daniel Lewin , Madhu Sudan , Luca Trevisan A Tight Characterization of NP with 3 Query PCPs. [Citation Graph (0, 0)][DBLP ] Conf ] Madhu Sudan , Luca Trevisan Probabilistically Checkable Proofs with Low Amortized Query Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Madhu Sudan Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Andrews , Lisa Zhang The Access Network Design Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Yishay Mansour , Boaz Patt-Shamir Jitter Control in QoS Networks. [Citation Graph (0, 0)][DBLP ] Conf ] David Gamarnik Stability of Adversarial Queues via Fluid Models. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne Albers , Moses Charikar , Michael Mitzenmacher Delayed Information and Action in On-line Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Walter Unger The Complexity of the Approximation of the Bandwidth Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Daniele Micciancio The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant. [Citation Graph (0, 0)][DBLP ] Conf ] Irit Dinur , Guy Kindler , Shmuel Safra Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Claudio Gutiérrez Satisfiability of Word Equations with Constants is in Exponential Space. [Citation Graph (0, 0)][DBLP ] Conf ] Géraud Sénizergues Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree. [Citation Graph (0, 0)][DBLP ] Conf ] Zakaria Bouziane A Primitive Recursive Algorithm for the General Petri Net Reachability Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Mario Szegedy Algorithms to Tile the Infinite Grid with Finite Clusters. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk On Approximate Nearest Neighbors in Non-Euclidean Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] David E. Cardoze , Leonard J. Schulman Pattern Matching for Spatial Point Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk Faster Algorithms for String Matching Problems: Matching the Convolution Bound. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Farach , Paolo Ferragina , S. Muthukrishnan Overcoming the Memory Bottleneck in Suffix Tree Construction. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Bläser Bivariate Polynomial Multiplication. [Citation Graph (0, 0)][DBLP ] Conf ] Vadim Olshevsky , Victor Y. Pan A Unified Superfast Algorithm for Boundary Rational Tangential Interpolation Problems and for Inversion and Factorization of Dense Structured Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Alan R. Woods Unsatisfiable Systems of Equations, Over a Finite Field. [Citation Graph (0, 0)][DBLP ] Conf ] Arnold Schönhage Multiplicative Complexity of Taylor Shifts and a New Twist of the Substitution Method. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Kannan , Andreas Nolte Local Search in Smooth Convex Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Mao-cheng Cai , Xiaotie Deng , Wenan Zang A TDI System and its Application to Approximation Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Warren D. Smith , Nicholas C. Wormald Geometric Separator Theorems & Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Brieden , Peter Gritzmann , Ravi Kannan , Victor Klee , László Lovász , Miklós Simonovits Approximation of Diameters: Randomization Doesn't Help. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Beame , Michael E. Saks , Jayram S. Thathachar Time-Space Tradeoffs for Branching Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Jakob Pagter , Theis Rauhe Optimal Time-Space Trade-Offs for Sorting. [Citation Graph (0, 0)][DBLP ] Conf ] Dima Grigoriev , Alexander A. Razborov Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions Over Finite Fields. [Citation Graph (0, 0)][DBLP ] Conf ] Vince Grolmusz , Gábor Tardos Lower Bounds for (MOD p - MOD m) Circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Yefim Dinitz , Naveen Garg , Michel X. Goemans On the Single-Source Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Naveen Garg , Jochen Könemann Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Uri Zwick All Pairs Shortest Paths in Weighted Directed Graphs ¾ Exact and Almost Exact Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Kasturi R. Varadarajan A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Andris Ambainis , Rusins Freivalds 1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. [Citation Graph (0, 0)][DBLP ] Conf ] Andris Ambainis , Leonard J. Schulman , Amnon Ta-Shma , Umesh V. Vazirani , Avi Wigderson The Quantum Communication Complexity of Sampling. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Beals , Harry Buhrman , Richard Cleve , Michele Mosca , Ronald de Wolf Quantum Lower Bounds by Polynomials. [Citation Graph (0, 0)][DBLP ] Conf ] Wim van Dam Quantum Oracle Interrogation: Getting All Information for Almost Half the Price. [Citation Graph (0, 0)][DBLP ] Conf ] Alan M. Frieze , Ravi Kannan , Santosh Vempala Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations. [Citation Graph (1, 0)][DBLP ] Conf ] Moses Charikar , Chandra Chekuri , Ashish Goel , Sudipto Guha , Serge A. Plotkin Approximating a Finite Metric by a Small Number of Tree Metrics. [Citation Graph (0, 0)][DBLP ] Conf ] Santosh Vempala Random Projection: A New Approach to VLSI Layout. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup Map Graphs in Polynomial Time. [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , Carl Burch , John Langford On Learning Monotone Boolean Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Tao Jiang , Paul E. Kearney , Ming Li Orchestrating Quartets: Approximation and Data Correction. [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich , Shafi Goldwasser , Eric Lehman , Dana Ron Testing Monotonicity. [Citation Graph (0, 0)][DBLP ] Conf ] Mary Cryan , Leslie Ann Goldberg , Paul W. Goldberg Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model. [Citation Graph (0, 0)][DBLP ] Conf ] Kamal Jain Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar , Balaji Raghavachari The Finite Capacity Dial-A-Ride Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Wenceslas Fernandez de la Vega , Claire Kenyon A Randomized Approximation Scheme for Metric MAX-CUT. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Skutella Semidefinite Relaxations for Parallel Machine Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Joe Kilian , Erez Petrank , Charles Rackoff Lower Bounds for Zero Knowledge on the Internet. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Cachin , Claude Crépeau , Julien Marcil Oblivious Transfer with a Memory-Bounded Receiver. [Citation Graph (0, 0)][DBLP ] Conf ] Dominic Mayers , Andrew Chi-Chih Yao Quantum Cryptography with Imperfect Apparatus. [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad , Mats Näslund The Security of Individual RSA Bits. [Citation Graph (0, 0)][DBLP ] Conf ] Micah Adler , Bruce M. Maggs Protocols for Asymmetric Communication Channels. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Alstrup , Thore Husfeldt , Theis Rauhe Marked Ancestor Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Larry Carter , Kang Su Gatlin Towards an Optimal Bit-Reversal Permutation Program. [Citation Graph (0, 0)][DBLP ] Conf ] Christopher Umans The Minimum Equivalent DNF Problem and Shortest Implicants. [Citation Graph (0, 0)][DBLP ] Conf ] Luca de Alfaro , Thomas A. Henzinger , Orna Kupferman Concurrent Reachability Games. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Russell , David Zuckerman Perfect Information Leader Election in log*n + O (1) Rounds. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , David Eppstein , Leonidas J. Guibas , Monika Rauch Henzinger Parametric and Kinetic Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Saugata Basu On the Combinatorial and Topological Complexity of a Single Cell. [Citation Graph (0, 0)][DBLP ] Conf ] János Pach , Géza Tóth Which Crossing Number is it, Anyway? [Citation Graph (0, 0)][DBLP ] Conf ] Ramamohan Paturi , Pavel Pudlák , Michael E. Saks , Francis Zane An Improved Exponential-Time Algorithm for k -SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Maria Luisa Bonet , Juan Luis Esteban , Nicola Galesi , Jan Johannsen Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Dima Grigoriev Tseitin's Tautologies and Lower Bounds for Nullstellensatz Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Russell Impagliazzo , Ramamohan Paturi , Francis Zane Which Problems Have Strongly Exponential Complexity? [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Kumar , Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins Recommendation Systems: A Probabilistic Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , Joe Kilian Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-Random Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jaikumar Radhakrishnan , Aravind Srinivasan Improved Bounds and Algorithms for Hypergraph Two-Coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Yuval Rabani , Alistair Sinclair , Rolf Wanka Local Divergence of Markov Chains and the Analysis of Iterative Load Balancing Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Georg Gottlob , Nicola Leone , Francesco Scarcello The Complexity of Acyclic Conjunctive Queries. [Citation Graph (5, 0)][DBLP ] Conf ] Daniel Leivant A Characterization of NC by Tree Recurrence. [Citation Graph (0, 0)][DBLP ] Conf ] John C. Mitchell , Mark Mitchell , Andre Scedrov A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time. [Citation Graph (0, 0)][DBLP ] Conf ] Russell Impagliazzo , Avi Wigderson Randomness vs. Time: De-Randomization under a Uniform Assumption. [Citation Graph (0, 0)][DBLP ] Conf ] 