Conferences in DBLP
Avrim Blum Machine Learning: My Favorite Results, Directions, and Open Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Dana Randall Mixing. [Citation Graph (0, 0)][DBLP ] Conf ] Eli Upfal Performance Analysis of Dynamic Network Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Gérard Cornuéjols , Xinming Liu , Kristina Vuskovic A Polynomial Algorithm for Recognizing Perfect Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Milena Mihail , Christos H. Papadimitriou , Amin Saberi On Certain Connectivity Properties of the Internet Topology. [Citation Graph (0, 0)][DBLP ] Conf ] Kamalika Chaudhuri , Brighten Godfrey , Satish Rao , Kunal Talwar Paths, Trees, and Minimum Latency Tours. [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , Shuchi Chawla , David R. Karger , Terran Lane , Adam Meyerson , Maria Minkoff Approximation Algorithms for Orienteering and Discounted-Reward TSP. [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Moshe Lewenstein , Nira Shafrir , Maxim Sviridenko Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich , Shafi Goldwasser , Asaf Nussboim On the Implementation of Huge Random Objects. [Citation Graph (0, 0)][DBLP ] Conf ] Silvio Micali , Michael O. Rabin , Joe Kilian Zero-Knowledge Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Jesse Kamp , David Zuckerman Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography. [Citation Graph (0, 0)][DBLP ] Conf ] Shafi Goldwasser , Yael Tauman Kalai On the (In)security of the Fiat-Shamir Paradigm. [Citation Graph (0, 0)][DBLP ] Conf ] László Babai , Amir Shpilka , Daniel Stefankovic Locally Testable Cyclic Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Luca Trevisan List-Decoding Using The XOR Lemma. [Citation Graph (0, 0)][DBLP ] Conf ] Elchanan Mossel , Amir Shpilka , Luca Trevisan On e-Biased Generators in NC0. [Citation Graph (0, 0)][DBLP ] Conf ] Adi Akavia , Shafi Goldwasser , Shmuel Safra Proving Hard-Core Predicates Using List Decoding. [Citation Graph (0, 0)][DBLP ] Conf ] Rajat Bhattacharjee , Ashish Goel Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Nair , Balaji Prabhakar , Mayank Sharma Proofs of the Parisi and Coppersmith-Sorkin Conjectures for the Finite Random Assignment Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Orlitsky , Narayana P. Santhanam , Junan Zhang Always Good Turing: Asymptotically Optimal Probability Estimation. [Citation Graph (0, 0)][DBLP ] Conf ] Nader H. Bshouty , Elchanan Mossel , Ryan O'Donnell , Rocco A. Servedio Learning DNF from Random Walks. [Citation Graph (0, 0)][DBLP ] Conf ] Scott Aaronson , Andris Ambainis Quantum Search of Spatial Regions. [Citation Graph (0, 0)][DBLP ] Conf ] Dorit Aharonov , Oded Regev A Lattice Problem in Quantum NP. [Citation Graph (0, 0)][DBLP ] Conf ] Rahul Jain , Jaikumar Radhakrishnan , Pranab Sen A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. [Citation Graph (0, 0)][DBLP ] Conf ] Andris Ambainis Polynomial Degree vs. Quantum Query Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Gianni Franceschini , Viliam Geffert An In-Place Sorting with O(n log n) Comparisons and O(n) Moves. [Citation Graph (0, 0)][DBLP ] Conf ] Wing-Kai Hon , Kunihiko Sadakane , Wing-Kin Sung Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Arge , Norbert Zeh I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Bender , Gerth Stølting Brodal , Rolf Fagerberg , Dongdong Ge , Simai He , Haodong Hu , John Iacono , Alejandro López-Ortiz The Cost of Cache-Oblivious Searching. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk , David P. Woodruff Tight Lower Bounds for the Distinct Elements Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Subhash Khot Hardness of Approximating the Shortest Vector Problem in High Lp Norms. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Alekhnovich More on Average Case vs Approximation Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Andrej Bogdanov , Luca Trevisan On Worst-Case to Average-Case Reductions for NP Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Josh Buresh-Oppenheim , Nicola Galesi , Shlomo Hoory , Avner Magen , Toniann Pitassi Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Molloy , Mohammad R. Salavatipour The Resolution Complexity of Random Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Fahiem Bacchus , Shannon Dalmao , Toniann Pitassi Algorithms and Complexity Results for #SAT and Bayesian Inference. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Alekhnovich , Eli Ben-Sasson Linear Upper Bounds for Random Walk on Small Density Random 3-CNF. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Achlioptas , Assaf Naor , Yuval Peres On the Maximum Satisfiability of Random Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Russell Impagliazzo , Bruce M. Kapron Logics for Reasoning about Cryptographic Constructions. [Citation Graph (0, 0)][DBLP ] Conf ] Boaz Barak , Yehuda Lindell , Salil P. Vadhan Lower Bounds for Non-Black-Box Zero Knowledge. [Citation Graph (0, 0)][DBLP ] Conf ] Yehuda Lindell General Composition and Universal Composability in Secure Multi-Party Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Rafael Pass , Alon Rosen Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel A. Spielman , Shang-Hua Teng Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m1.31 ). [Citation Graph (0, 0)][DBLP ] Conf ] Amos Beimel , Enav Weinreb Separating the Power of Monotone Span Programs over Different Fields. [Citation Graph (0, 0)][DBLP ] Conf ] Henry Cohn , Christopher Umans A Group-Theoretic Approach to Fast Matrix Multiplication. [Citation Graph (0, 0)][DBLP ] Conf ] Nayantara Bhatnagar , Parikshit Gopalan , Richard J. Lipton Symmetric Polynomials over Zm and Simultaneous Communication Protocol. [Citation Graph (0, 0)][DBLP ] Conf ] Luca Becchetti , Stefano Leonardi , Alberto Marchetti-Spaccamela , Guido Schäfer , Tjark Vredeveld Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Aris Anagnostopoulos , Adam Kirsch , Eli Upfal Stability and Efficiency of a Random Local Load Balancing Protocol. [Citation Graph (0, 0)][DBLP ] Conf ] David Kempe , Alin Dobra , Johannes Gehrke Gossip-Based Computation of Aggregate Information. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Wojciech Rytter Broadcasting Algorithms in Radio Networks with Unknown Topology. [Citation Graph (0, 0)][DBLP ] Conf ] Gagan Aggarwal , Rajeev Motwani , Devavrat Shah , An Zhu Switch Scheduling via Randomized Edge Coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Bo Brinkman , Moses Charikar On the Impossibility of Dimension Reduction in l1 . [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar , Venkatesan Guruswami , Anthony Wirth Clustering with Qualitative Information. [Citation Graph (0, 0)][DBLP ] Conf ] Anupam Gupta , Robert Krauthgamer , James R. Lee Bounded Geometries, Fractals, and Low-Distortion Embeddings. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Grohe The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei A. Bulatov , Víctor Dalmau Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Ron Lavi , Ahuva Mu'alem , Noam Nisan Towards a Characterization of Truthful Combinatorial Auctions. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Pál , Éva Tardos Group Strategyproof Mechanisms via Primal-Dual Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Robert D. Kleinberg , Frank Thomson Leighton The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions. [Citation Graph (0, 0)][DBLP ] Conf ] Anupam Gupta , Amit Kumar , Martin Pál , Tim Roughgarden Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas P. Hayes , Eric Vigoda A Non-Markovian Coupling for Randomly Sampling Colorings. [Citation Graph (0, 0)][DBLP ] Conf ] Fabio Martinelli , Alistair Sinclair , Dror Weitz The Ising Model on Trees: Boundary Conditions and Mixing Time. [Citation Graph (0, 0)][DBLP ] Conf ] László Lovász , Santosh Vempala Logconcave Functions: Geometry and Efficient Sampling Algorithms [Citation Graph (0, 0)][DBLP ] Conf ] László Lovász , Santosh Vempala Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] 