Conferences in DBLP
Iftach Haitner , Omer Reingold Statistically-hiding commitment from any one-way function. [Citation Graph (0, 0)][DBLP ] Conf ] Jonathan Katz On achieving the "best of both worlds" in secure multiparty computation. [Citation Graph (0, 0)][DBLP ] Conf ] Yuval Ishai , Eyal Kushilevitz , Rafail Ostrovsky , Amit Sahai Zero-knowledge from secure multiparty computation. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan , Mihai Patrascu Voronoi diagrams in n·2osqrt(lg lg n) time. [Citation Graph (0, 0)][DBLP ] Conf ] Mihai Patrascu Lower bounds for 2-dimensional range counting. [Citation Graph (0, 0)][DBLP ] Conf ] Saugata Basu Combinatorial complexity in O-minimal geometry. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Fürer Faster integer multiplication. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Björklund , Thore Husfeldt , Petteri Kaski , Mikko Koivisto Fourier meets möbius: fast subset convolution. [Citation Graph (0, 0)][DBLP ] Conf ] Kobbi Nissim , Sofya Raskhodnikova , Adam Smith Smooth sensitivity and sampling in private data analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Cynthia Dwork , Frank McSherry , Kunal Talwar The price of privacy and the limits of LP decoding. [Citation Graph (0, 0)][DBLP ] Conf ] Claire Kenyon-Mathieu , Warren Schudy How to rank with few errors. [Citation Graph (0, 0)][DBLP ] Conf ] Sudipto Guha , Kamesh Munagala Approximation algorithms for budgeted learning problems. [Citation Graph (0, 0)][DBLP ] Conf ] Arash Asadpour , Amin Saberi An approximation algorithm for max-min fair allocation of indivisible goods. [Citation Graph (0, 0)][DBLP ] Conf ] Mohsen Bayati , David Gamarnik , Dimitriy A. Katz , Chandra Nair , Prasad Tetali Simple deterministic approximation algorithms for counting matchings. [Citation Graph (0, 0)][DBLP ] Conf ] Elchanan Mossel , Sébastien Roch On the submodularity of influence in social networks. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Borgs , Jennifer T. Chayes , Constantinos Daskalakis , Sébastien Roch First to market is not everything: an analysis of preferential attachment with fitness. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Andrews , Kyomin Jung , Alexander Stolyar Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads. [Citation Graph (0, 0)][DBLP ] Conf ] Hagit Attiya , Keren Censor Tight bounds for asynchronous randomized consensus. [Citation Graph (0, 0)][DBLP ] Conf ] Julia Chuzhoy , Venkatesan Guruswami , Sanjeev Khanna , Kunal Talwar Hardness of routing with congestion in directed graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Julia Chuzhoy , Sanjeev Khanna Polynomial flow-cut gaps and hardness of directed cut problems. [Citation Graph (0, 0)][DBLP ] Conf ] Per Austrin Balanced max 2-sat might not be the hardest. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Prasad Raghavendra A 3-query PCP over integers. [Citation Graph (0, 0)][DBLP ] Conf ] John Dunagan , Nicholas J. A. Harvey Iteratively constructing preconditioners via the conjugate gradient method. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Kiefer , Michael Luttenberger , Javier Esparza On the convergence of Newton's method for monotone systems of polynomial equations. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Arora , Satyen Kale A combinatorial, primal-dual approach to semidefinite programs. [Citation Graph (0, 0)][DBLP ] Conf ] Anna C. Gilbert , Martin J. Strauss , Joel A. Tropp , Roman Vershynin One sketch for all: fast algorithms for compressed sensing. [Citation Graph (0, 0)][DBLP ] Conf ] Nancy A. Lynch Distributed computing theory: algorithms, impossibility results, models, and proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Van H. Vu , Terence Tao The condition number of a randomly perturbed matrix. [Citation Graph (0, 0)][DBLP ] Conf ] Kunal Talwar , Udi Wieder Balanced allocations: the weighted case. [Citation Graph (0, 0)][DBLP ] Conf ] Sergey Yekhanin Towards 3-query locally decodable codes of subexponential length. [Citation Graph (0, 0)][DBLP ] Conf ] Rahul Santhanam Circuit lower bounds for Merlin-Arthur classes. [Citation Graph (0, 0)][DBLP ] Conf ] Amir Shpilka Interpolation of depth-3 arithmetic circuits with two multiplication gates. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander A. Sherstov Separating AC0 from depth-2 majority circuits. [Citation Graph (0, 0)][DBLP ] Conf ] Grant Schoenebeck , Luca Trevisan , Madhur Tulsiani Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan S. Dantchev Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Pagh , Rasmus Pagh , Milan Ruzic Linear probing with constant independence. [Citation Graph (0, 0)][DBLP ] Conf ] Gianni Franceschini , S. Muthukrishnan Optimal suffix selection. [Citation Graph (0, 0)][DBLP ] Conf ] Shahar Dobzinski , Noam Nisan Limitations of VCG-based mechanisms. [Citation Graph (0, 0)][DBLP ] Conf ] Sergiu Hart , Yishay Mansour The communication complexity of uncoupled nash equilibrium procedures. [Citation Graph (0, 0)][DBLP ] Conf ] Fang Wu , Li Zhang Proportional response dynamics leads to market equilibrium. [Citation Graph (0, 0)][DBLP ] Conf ] Kamal Jain , Vijay V. Vazirani Eisenberg-Gale markets: algorithms and structural properties. [Citation Graph (0, 0)][DBLP ] Conf ] Pinar Heggernes , Christophe Paul , Jan Arne Telle , Yngve Villanger Interval completion with few edges. [Citation Graph (0, 0)][DBLP ] Conf ] Ken-ichi Kawarabayashi , Buce Reed Computing crossing number in linear time. [Citation Graph (0, 0)][DBLP ] Conf ] Elliot Anshelevich , Adriana Karagiozova Terminal backup, 3D matching, and covering cubic graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Pinyan Lu Holographic algorithms: from art to science. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Holenstein Parallel repetition: simplifications and the no-signaling case. [Citation Graph (0, 0)][DBLP ] Conf ] Rafael Pass , Muthuramakrishnan Venkitasubramaniam An efficient parallel repetition theorem for Arthur-Merlin games. [Citation Graph (0, 0)][DBLP ] Conf ] Ronen Shaltiel , Christopher Umans Low-end uniform hardness vs. randomness tradeoffs for AM. [Citation Graph (0, 0)][DBLP ] Conf ] Shafi Goldwasser , Dan Gutfreund , Alexander Healy , Tali Kaufman , Guy N. Rothblum Verifying and decoding in constant depth. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas P. Hayes , Juan C. Vera , Eric Vigoda Randomly coloring planar graphs with fewer colors than the maximum degree. [Citation Graph (0, 0)][DBLP ] Conf ] Leslie Ann Goldberg , Mark Jerrum Inapproximability of the Tutte polynomial. [Citation Graph (0, 0)][DBLP ] Conf ] Ishay Haviv , Oded Regev Tensor-based hardness of the shortest vector problem to within almost polynomial factors. [Citation Graph (0, 0)][DBLP ] Conf ] Chris Peikert , Alon Rosen Lattices that admit logarithmic worst-case to average-case connection factors. [Citation Graph (0, 0)][DBLP ] Conf ] Vojtech Rödl , Mathias Schacht Property testing in hypergraphs and the removal lemma. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Alexandr Andoni , Tali Kaufman , Kevin Matulef , Ronitt Rubinfeld , Ning Xie Testing k-wise and almost k-wise independence. [Citation Graph (0, 0)][DBLP ] Conf ] Alex Samorodnitsky Low-degree tests at large distances. [Citation Graph (0, 0)][DBLP ] Conf ] Dmitry Gavinsky , Julia Kempe , Iordanis Kerenidis , Ran Raz , Ronald de Wolf Exponential separations for one-way quantum communication complexity, with applications to cryptography. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Høyer , Troy Lee , Robert Spalek Negative weights make adversaries stronger. [Citation Graph (0, 0)][DBLP ] Conf ] Cristopher Moore , Alexander Russell , Piotr Sniady On the impossibility of a quantum sieve algorithm for graph isomorphism. [Citation Graph (0, 0)][DBLP ] Conf ] Sham M. Kakade , Adam Tauman Kalai , Katrina Ligett Playing games with approximation algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Englert , Harald Räcke , Matthias Westermann Reordering buffers for general metric spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Gus Gutoski , John Watrous Toward a general theory of quantum games. [Citation Graph (0, 0)][DBLP ] Conf ] Frédéric Magniez , Ashwin Nayak , Jeremie Roland , Miklos Santha Search via quantum walk. [Citation Graph (0, 0)][DBLP ] Conf ] Virginia Vassilevska , Ryan Williams , Raphael Yuster All-pairs bottleneck paths for general graphs in truly sub-cubic time. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan More algorithms for all-pairs shortest paths in weighted graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Gyula Pap Some new results on node-capacitated packing of A-paths. [Citation Graph (0, 0)][DBLP ] Conf ] Ramesh Hariharan , Telikepalli Kavitha , Debmalya Panigrahi , Anand Bhalgat An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk Uncertainty principles, extractors, and explicit embeddings of l2 into l1. [Citation Graph (0, 0)][DBLP ] Conf ] Bo Brinkman , Adriana Karagiozova , James R. Lee Vertex cuts, random walks, and dimension reduction in series-parallel graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ittai Abraham , Yair Bartal , Ofer Neiman Local embeddings of metric spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Amit Deshpande , Kasturi R. Varadarajan Sampling-based dimension reduction for subspace approximation. [Citation Graph (0, 0)][DBLP ] Conf ] Lap Chi Lau , Joseph Naor , Mohammad R. Salavatipour , Mohit Singh Survivable network design with degree or order constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Mohit Singh , Lap Chi Lau Approximating minimum bounded degree spanning trees to within one of optimal. [Citation Graph (0, 0)][DBLP ] Conf ] Amit Agarwal , Noga Alon , Moses Charikar Improved approximation for directed cut problems. [Citation Graph (0, 0)][DBLP ] Conf ] P. Donovan , F. Bruce Shepherd , Adrian Vetta , Gordon T. Wilfong Degree-constrained network flows. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Beame , T. S. Jayram , Atri Rudra Lower bounds for randomized read/write stream algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Nati Linial , Adi Shraibman Lower bounds in communication complexity based on factorization norms. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Braverman , Michael Yampolsky Constructing non-computable Julia sets. [Citation Graph (0, 0)][DBLP ] Conf ] 