Conferences in DBLP
Minh-Huyen Nguyen , Shien Jin Ong , Salil P. Vadhan Statistical Zero-Knowledge Arguments for NP from Any One-Way Function. [Citation Graph (0, 0)][DBLP ] Conf ] Shafi Goldwasser , Elan Pavlov , Vinod Vaikuntanathan Fault-Tolerant Distributed Computing in Full-Information Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Craig Gentry , Zulfikar Ramzan , David P. Woodruff Explicit Exclusive Set Systems with Applications to Broadcast Encryption. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas P. Hayes A simple condition implying rapid mixing of single-site dynamics on spin systems. [Citation Graph (0, 0)][DBLP ] Conf ] Mikhail Belkin , Hariharan Narayanan , Partha Niyogi Heat Flow and a Faster Algorithm to Compute the Surface Area of a Convex Body. [Citation Graph (0, 0)][DBLP ] Conf ] László Lovász , Santosh Vempala Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Tomás Feder , Adam Guetz , Milena Mihail , Amin Saberi A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Elliot Anshelevich , F. Bruce Shepherd , Gordon T. Wilfong Strategic Network Formation through Peering and Service Agreements. [Citation Graph (0, 0)][DBLP ] Conf ] Valerie King , Jared Saia , Vishal Sanwalani , Erik Vee Towards Secure and Scalable Computation in Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP ] Conf ] James R. Lee , Assaf Naor Lp metrics on the Heisenberg group and the Goemans-Linial conjecture. [Citation Graph (0, 0)][DBLP ] Conf ] Manor Mendel , Assaf Naor Ramsey partitions and proximity data structures. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Krauthgamer , James R. Lee Algorithms on negatively curved spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Roman Vershynin Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method. [Citation Graph (0, 0)][DBLP ] Conf ] Tamás Sarlós Improved Approximation Algorithms for Large Matrices via Random Projections. [Citation Graph (0, 0)][DBLP ] Conf ] David Arthur , Sergei Vassilvitskii Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method. [Citation Graph (0, 0)][DBLP ] Conf ] Rafail Ostrovsky , Yuval Rabani , Leonard J. Schulman , Chaitanya Swamy The Effectiveness of Lloyd-Type Methods for the k-Means Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Amnon Ta-Shma , Christopher Umans Better lossless condensers through derandomized curve samplers. [Citation Graph (0, 0)][DBLP ] Conf ] Russell Impagliazzo , Ragesh Jaiswal , Valentine Kabanets Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. [Citation Graph (0, 0)][DBLP ] Conf ] Ziv Bar-Yossef , Yitzhak Birk , T. S. Jayram , Tomer Kol Index Coding with Side Information. [Citation Graph (0, 0)][DBLP ] Conf ] Eli Ben-Sasson , Swastik Kopparty , Jaikumar Radhakrishnan Subspace Polynomials and List Decoding of Reed-Solomon Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Subhash Khot , Ryan O'Donnell SDP gaps and UGC-hardness for MAXCUTGAIN. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Anindya C. Patthak Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded Alphabets. [Citation Graph (0, 0)][DBLP ] Conf ] Yuval Ishai , Eyal Kushilevitz , Rafail Ostrovsky , Amit Sahai Cryptography from Anonymity. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Ben-Or , Claude Crépeau , Daniel Gottesman , Avinatan Hassidim , Adam Smith Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority. [Citation Graph (0, 0)][DBLP ] Conf ] Xi Chen , Xiaotie Deng Settling the Complexity of Two-Player Nash Equilibrium. [Citation Graph (0, 0)][DBLP ] Conf ] Michel X. Goemans Minimum Bounded Degree Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Tamás Király , Lap Chi Lau Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Niv Buchbinder , Joseph Naor Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Arge , Gerth Stølting Brodal , Loukas Georgiadis Improved Dynamic Planar Point Location. [Citation Graph (0, 0)][DBLP ] Conf ] Dan Feldman , Amos Fiat , Micha Sharir Coresets forWeighted Facilities and Their Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Mihai Patrascu Planar Point Location in Sublogarithmic Time. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational Geometry. [Citation Graph (0, 0)][DBLP ] Conf ] Boaz Barak , Manoj Prabhakaran , Amit Sahai Concurrent Non-Malleable Zero Knowledge. [Citation Graph (0, 0)][DBLP ] Conf ] Yael Tauman Kalai , Ran Raz Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP. [Citation Graph (0, 0)][DBLP ] Conf ] Silvio Micali , Rafael Pass , Alon Rosen Input-Indistinguishable Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Krzysztof Onak , Pawel Parys Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders. [Citation Graph (0, 0)][DBLP ] Conf ] David P. Woodruff Lower Bounds for Additive Spanners, Emulators, and More. [Citation Graph (0, 0)][DBLP ] Conf ] Nadine Baumann , Martin Skutella Solving Evacuation Problems Efficiently--Earliest Arrival Flows with Multiple Sources. [Citation Graph (0, 0)][DBLP ] Conf ] Harry Buhrman , Richard Cleve , Monique Laurent , Noah Linden , Alexander Schrijver , Falk Unger New Limits on Fault-Tolerant Quantum Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Ben Reichardt Postselection threshold against biased noise. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaoming Sun , Andrew Chi-Chih Yao On the Quantum Query Complexity of Local Search in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Damien Woods , Turlough Neary On the time complexity of 2-tag systems and small universal Turing machines. [Citation Graph (0, 0)][DBLP ] Conf ] Alexandr Andoni , Piotr Indyk , Mihai Patrascu On the Optimality of the Dimensionality Reduction Method. [Citation Graph (0, 0)][DBLP ] Conf ] Alexandr Andoni , Piotr Indyk Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaoyang Gu , Jack H. Lutz , Elvira Mayordomo Points on Computable Curves. [Citation Graph (0, 0)][DBLP ] Conf ] Reid Andersen , Fan R. K. Chung , Kevin J. Lang Local Graph Partitioning using PageRank Vectors. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Rudelson Norm of the inverse of a random matrix. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , Jeong Han Kim , Eran Ofek Witnesses for non-satisfiability of dense random 3CNF formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Leslie G. Valiant Accidental Algorthims. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Borgs , Jennifer T. Chayes , Elchanan Mossel , Sébastien Roch The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels. [Citation Graph (0, 0)][DBLP ] Conf ] Nicholas J. A. Harvey Algebraic Structures and Algorithms for Matching and Matroid Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Prasad Raghavendra Hardness of Learning Halfspaces with Noise. [Citation Graph (0, 0)][DBLP ] Conf ] Adam R. Klivans , Alexander A. Sherstov Cryptographic Hardness for Learning Intersections of Halfspaces. [Citation Graph (0, 0)][DBLP ] Conf ] Vitaly Feldman , Parikshit Gopalan , Subhash Khot , Ashok Kumar Ponnuswami New Results for Learning Noisy Parities and Halfspaces. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Björklund , Thore Husfeldt Inclusion--Exclusion Algorithms for Counting Set Partitions. [Citation Graph (0, 0)][DBLP ] Conf ] Mikko Koivisto An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion. [Citation Graph (0, 0)][DBLP ] Conf ] Surender Baswana , Telikepalli Kavitha Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths. [Citation Graph (0, 0)][DBLP ] Conf ] Xi Chen , Xiaotie Deng , Shang-Hua Teng Computing Nash Equilibria: Approximation and Smoothed Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Heiner Ackermann , Heiko Röglin , Berthold Vöcking On the Impact of Combinatorial Structure on Congestion Games. [Citation Graph (0, 0)][DBLP ] Conf ] Jeff Edmonds , Kirk Pruhs Balanced Allocations of Cake. [Citation Graph (0, 0)][DBLP ] Conf ] Uli Wagner On a Geometric Generalization of the Upper Bound Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Mihai Patrascu , Mikkel Thorup Higher Lower Bounds for Near-Neighbor and Further Rich Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Assaf Naor , Gideon Schechtman Planar Earthmover is not in L_1. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , Jan Vondrák Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Mohammad Taghi Hajiaghayi , Guy Kortsarz , Mohammad R. Salavatipour Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. [Citation Graph (0, 0)][DBLP ] Conf ] Eden Chlamtac , Konstantin Makarychev , Yury Makarychev How to Play Unique Games Using Embeddings. [Citation Graph (0, 0)][DBLP ] Conf ] Nikhil Bansal , Alberto Caprara , Maxim Sviridenko Improved approximation algorithms for multidimensional bin packing problems. [Citation Graph (0, 0)][DBLP ] Conf ] Arkadev Chattopadhyay , Navin Goyal , Pavel Pudlák , Denis Thérien Lower bounds for circuits with MOD_m gates. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Harnik , Moni Naor On the Compressibility of NP Instances and Cryptographic Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Luis Rademacher , Santosh Vempala Dispersion of Mass and the Complexity of Randomized Geometric Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander A. Razborov , Sergey Yekhanin An Omega(n1/3 ) Lower Bound for Bilinear Group Based Private Information Retrieval. [Citation Graph (0, 0)][DBLP ] Conf ] 