Conferences in DBLP
Kamal Jain , Vijay V. Vazirani Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems. [Citation Graph (1, 0)][DBLP ] Conf ] Jon M. Kleinberg , Éva Tardos Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. [Citation Graph (0, 0)][DBLP ] Conf ] Lisa Fleischer Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. [Citation Graph (0, 0)][DBLP ] Conf ] Foto N. Afrati , Evripidis Bampis , Chandra Chekuri , David R. Karger , Claire Kenyon , Sanjeev Khanna , Ioannis Milis , Maurice Queyranne , Martin Skutella , Clifford Stein , Maxim Sviridenko Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Bläser A 5/2 n2 -Lower Bound for the Rank of n×n Matrix Multiplication over Arbitrary Fields. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Vigoda Improved Bounds for Sampling Colorings. [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai A Non-linear Time Lower Bound for Boolean Branching Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Bro Miltersen , N. V. Vinodchandran Derandomizing Arthur-Merlin Games Using Hitting Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Valerie King Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time. [Citation Graph (0, 0)][DBLP ] Conf ] Sariel Har-Peled Taking a Walk in a Planar Arrangement. [Citation Graph (0, 0)][DBLP ] Conf ] John Watrous PSPACE Has Constant-Round Quantum Interactive Proof Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Silvio Micali , Michael O. Rabin , Salil P. Vadhan Verifiable Random Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Berthold Vöcking How Asymmetry Helps Load Balancing. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige Noncryptographic Selection Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk A Sublinear Time Approximation Scheme for Clustering in Metric Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Arnon Amir , Alon Efrat , Piotr Indyk , Hanan Samet Efficient Regular Data Structures and Algorithms for Location and Proximity Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Farach-Colton , Piotr Indyk Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. [Citation Graph (0, 0)][DBLP ] Conf ] Russell Impagliazzo , Ronen Shaltiel , Avi Wigderson Near-Optimal Conversion of Hardness into Pseudo-Randomness. [Citation Graph (0, 0)][DBLP ] Conf ] Ran Raz , Omer Reingold , Salil P. Vadhan Error Reduction for Extractors. [Citation Graph (0, 0)][DBLP ] Conf ] Manindra Agrawal , Somenath Biswas Primality and Identity Testing via Chinese Remaindering. [Citation Graph (0, 0)][DBLP ] Conf ] Martin E. Dyer , Alan M. Frieze , Mark Jerrum On Counting Independent Sets in Sparse Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Borgs , Jennifer T. Chayes , Alan M. Frieze , Jeong Han Kim , Prasad Tetali , Eric Vigoda , Van H. Vu Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. [Citation Graph (0, 0)][DBLP ] Conf ] Ben Morris , Alistair Sinclair Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. [Citation Graph (0, 0)][DBLP ] Conf ] V. S. Anil Kumar , H. Ramesh Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain. [Citation Graph (0, 0)][DBLP ] Conf ] David Peleg , Vitaly Rubinovich A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction. [Citation Graph (0, 0)][DBLP ] Conf ] Yehuda Afek , Gideon Stupp , Dan Touitou ong-lived Adaptive Collect with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Rakesh D. Barve , Jeffrey Scott Vitter A Theoretical Framework for Memory-Adaptive Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Matteo Frigo , Charles E. Leiserson , Harald Prokop , Sridhar Ramachandran Cache-Oblivious Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Jon Feldman , Matthias Ruhl The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Setting Parameters by Example. [Citation Graph (0, 0)][DBLP ] Conf ] Zhi-Zhong Chen , Xin He , Chun-Hsi Huang Finding Double Euler Trails of Planar Graphs in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Karsten Weihe Edge-Disjoint Routing in Plane Switch Graphs in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] John Watrous On Quantum and Classical Space-bounded Processes with Algebraic Transition Amplitudes. [Citation Graph (0, 0)][DBLP ] Conf ] Andris Ambainis A Better Lower Bound for Quantum Algorithms Searching an Ordered List. [Citation Graph (0, 0)][DBLP ] Conf ] Harry Buhrman , Richard Cleve , Ronald de Wolf , Christof Zalka Bounds for Small-Error and Zero-Error Quantum Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Ashwin Nayak Optimal Lower Bounds for Quantum Automata and Random Access Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar , Sudipto Guha Improved Combinatorial Algorithms for the Facility Location and k-Median Problems. [Citation Graph (1, 0)][DBLP ] Conf ] Naoki Katoh , Takeshi Tokuyama Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Anupam Gupta , Ilan Newman , Yuri Rabinovich , Alistair Sinclair Cuts, Trees and l1 -Embeddings of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Uwe Schöning A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Eli Ben-Sasson , Russell Impagliazzo Random CNF's are Hard for the Polynomial Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Maria Luisa Bonet , Nicola Galesi A Study of Proof Search Algorithms for Resolution and Polynomial Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] S. Muthukrishnan , Rajmohan Rajaraman , Anthony Shaheen , Johannes Gehrke Online Scheduling to Minimize Average Stretch. [Citation Graph (0, 0)][DBLP ] Conf ] Elias Koutsoupias Weak Adversaries for the k-Server Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , Carl Burch , Adam Kalai Finely-Competitive Paging. [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Lipton , Anastasios Viglas On the Complexity of SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Christopher Umans Hardness of Approximating Sigma2 p Minimization Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Ilya Dumer , Daniele Micciancio , Madhu Sudan Hardness of Approximating the Minimum Distance of a Linear Code. [Citation Graph (0, 0)][DBLP ] Conf ] P. Oscar Boykin , Tal Mor , Matthew Pulver , Vwani P. Roychowdhury , Farrokh Vatan On Universal and Fault-Tolerant Quantum Computing: A Novel Basis and a New Constructive Proof of Universality for Shor's Basis. [Citation Graph (0, 0)][DBLP ] Conf ] Wojciech Plandowski Satisfiability of Word Equations with Constants is in PSPACE. [Citation Graph (0, 0)][DBLP ] Conf ] Joan Feigenbaum , Sampath Kannan , Martin Strauss , Mahesh Viswanathan An Approximate L1 -Difference Algorithm for Massive Data Streams. [Citation Graph (0, 0)][DBLP ] Conf ] Deborah Goldman , Sorin Istrail , Christos H. Papadimitriou Algorithmic Aspects of Protein Structure Similarity. [Citation Graph (0, 0)][DBLP ] Conf ] Cynthia Dwork , Moni Naor , Omer Reingold , Larry J. Stockmeyer Magic Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Jeong Han Kim , Daniel R. Simon , Prasad Tetali Limits on the Efficiency of One-Way Permutation-Based Hash Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Amit Sahai Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. [Citation Graph (0, 0)][DBLP ] Conf ] Tomas Sander , Adam Young , Moti Yung Non-Interactive CryptoComputing For NC1 . [Citation Graph (0, 0)][DBLP ] Conf ] Jon M. Kleinberg , Yuval Rabani , Éva Tardos Fairness in Routing and Load Balancing. [Citation Graph (0, 0)][DBLP ] Conf ] Ashish Goel , Piotr Indyk Stochastic Load Balancing and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Malwina J. Luczak , Eli Upfal Reducing Network Congestion and Blocking Probability Through Balanced Allocation. [Citation Graph (0, 0)][DBLP ] Conf ] Roman M. Kolpakov , Gregory Kucherov Finding Maximal Repetitions in a Word in Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Avi Shoshan , Uri Zwick All Pairs Shortest Paths in Undirected Graphs with Integer Weights. [Citation Graph (0, 0)][DBLP ] Conf ] Rosa I. Arriaga , Santosh Vempala An Algorithmic Theory of Learning: Robust Concepts and Random Projection. [Citation Graph (0, 0)][DBLP ] Conf ] Adam Klivans , Rocco A. Servedio Boosting and Hard-Core Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjoy Dasgupta Learning Mixtures of Gaussians. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Michael Krivelevich , Ilan Newman , Mario Szegedy Regular Languages Are Testable with a Constant Number of Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Eldar Fischer , Michael Krivelevich , Mario Szegedy Efficient Testing of Large Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] 