Conferences in DBLP
Marcus Schaefer , Eric Sedgwick , Daniel Stefankovic Recognizing string graphs in NP. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan Dynamic subgraph connectivity with geometric applications. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Eiter , Georg Gottlob , Kazuhisa Makino New results on monotone dualization and generating hypergraph transversals. [Citation Graph (0, 0)][DBLP ] Conf ] Leonard M. Adleman , Qi Cheng , Ashish Goel , Ming-Deh A. Huang , David Kempe , Pablo Moisset de Espanés , Paul W. K. Rothemund Combinatorial optimization problems in self-assembly. [Citation Graph (0, 0)][DBLP ] Conf ] Irit Dinur , Shmuel Safra The importance of being biased. [Citation Graph (0, 0)][DBLP ] Conf ] Johan Håstad , Srinivasan Venkatesh On the advantage over a random assignment. [Citation Graph (0, 0)][DBLP ] Conf ] Leslie Ann Goldberg , Steven Kelk , Mike Paterson The complexity of choosing an H-colouring (nearly) uniformly at random. [Citation Graph (0, 0)][DBLP ] Conf ] David R. Karger , Matthew S. Levine Random sampling in residual graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaotie Deng , Christos H. Papadimitriou , Shmuel Safra On the complexity of equilibria. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Andrew V. Goldberg , Jason D. Hartline , Anna R. Karlin Competitive generalized auctions. [Citation Graph (0, 0)][DBLP ] Conf ] Petros Drineas , Iordanis Kerenidis , Prabhakar Raghavan Competitive recommendation systems. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Molloy The Glauber dynamics on colourings of a graph with high girth and maximum degree. [Citation Graph (0, 0)][DBLP ] Conf ] Péter Gács Clairvoyant scheduling of random walks. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Bertsimas , Santosh Vempala Solving convex programs by random walks. [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou The Joy of Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Surender Baswana , Ramesh Hariharan , Sandeep Sen Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. [Citation Graph (0, 0)][DBLP ] Conf ] Spyros C. Kontogiannis Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne Albers On randomized online scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Ran Raz On the complexity of matrix product. [Citation Graph (0, 0)][DBLP ] Conf ] Anna C. Gilbert , Sudipto Guha , Piotr Indyk , S. Muthukrishnan , Martin Strauss Near-optimal sparse fourier representations via sampling. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Arora , Subhash Khot Fitting algebraic curves to noisy data. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Scharbrodt , Thomas Schickinger , Angelika Steger A new average case analysis for completion time scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Wun-Tat Chan , Tak Wah Lam , Hing-Fung Ting , Prudence W. H. Wong A unified analysis of hot video schedulers. [Citation Graph (0, 0)][DBLP ] Conf ] Anand Srinivasan , James H. Anderson Optimal rate-based scheduling on multiprocessors. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Achlioptas , Cristopher Moore Almost all graphs with average degree 4 are 3-colorable. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Molloy Models and thresholds for random constraint satisfaction problems. [Citation Graph (0, 0)][DBLP ] Conf ] Clifford D. Smyth Reimer's inequality and tardos' conjecture. [Citation Graph (0, 0)][DBLP ] Conf ] Steve Chien , Lars Eilstrup Rasmussen , Alistair Sinclair Clifford algebras and approximating the permanent. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Wenceslas Fernandez de la Vega , Ravi Kannan , Marek Karpinski Random sampling and approximation of MAX-CSP problems. [Citation Graph (0, 0)][DBLP ] Conf ] Mary Cryan , Martin E. Dyer A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. [Citation Graph (0, 0)][DBLP ] Conf ] Mihai Badoiu , Sariel Har-Peled , Piotr Indyk Approximate clustering via core-sets. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne Albers , Lene M. Favrholdt , Oliver Giel On paging with locality of reference. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Arge , Michael A. Bender , Erik D. Demaine , Bryan Holland-Minkley , J. Ian Munro Cache-oblivious priority queue and graph algorithm applications. [Citation Graph (0, 0)][DBLP ] Conf ] Eitan Bachmat Average case analysis for batched disk scheduling and increasing subsequences. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Piotr Krysta , Berthold Vöcking Selfish traffic allocation for server farms. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Sanjeev Khanna Approximation schemes for preemptive weighted flow time. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Cheriyan , Santosh Vempala , Adrian Vetta Approximation algorithms for minimum-cost k-vertex connected subgraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Kamal Jain , Vijay V. Vazirani Equitable cost allocations via primal-dual-type algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Cynthia Dwork , Larry J. Stockmeyer 2-round zero knowledge and proof auditors. [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich Concurrent zero-knowledge with timing, revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Dziembowski , Ueli M. Maurer Tight security proofs for the bounded-storage model. [Citation Graph (0, 0)][DBLP ] Conf ] Subhash Khot Hardness results for approximate hypergraph coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Michael E. Saks , Xiaodong Sun Space lower bounds for distance approximation in the data stream model. [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai , T. S. Jayram , Ravi Kumar , D. Sivakumar Approximate counting of inversions in a data stream. [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar Similarity estimation techniques from rounding algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Anna C. Gilbert , Sudipto Guha , Piotr Indyk , Yannis Kotidis , S. Muthukrishnan , Martin Strauss Fast, small-space algorithms for approximate histogram maintenance. [Citation Graph (0, 0)][DBLP ] Conf ] Elliot Anshelevich , David Kempe , Jon M. Kleinberg Stability of load balancing algorithms in dynamic adversarial systems. [Citation Graph (0, 0)][DBLP ] Conf ] Micah Adler Tradeoffs in probabilistic packet marking for IP traceback. [Citation Graph (0, 0)][DBLP ] Conf ] Colin Cooper , Alan M. Frieze Crawling on web graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Tim Roughgarden The price of anarchy is independent of the network topology. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Elkin , Guy Kortsarz Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Alekhnovich , Jan Johannsen , Toniann Pitassi , Alasdair Urquhart An exponential separation between regular and general resolution. [Citation Graph (0, 0)][DBLP ] Conf ] Eli Ben-Sasson Size space tradeoffs for resolution. [Citation Graph (0, 0)][DBLP ] Conf ] Lisa Hellerstein , Vijay Raghavan Exact learning of DNF formulas using DNF hypotheses. [Citation Graph (0, 0)][DBLP ] Conf ] Eldar Fischer , Eric Lehman , Ilan Newman , Sofya Raskhodnikova , Ronitt Rubinfeld , Alex Samorodnitsky Monotonicity testing over general poset domains. [Citation Graph (0, 0)][DBLP ] Conf ] Boaz Barak , Yehuda Lindell Strict polynomial-time in simulation and extraction. [Citation Graph (0, 0)][DBLP ] Conf ] Ran Canetti , Yehuda Lindell , Rafail Ostrovsky , Amit Sahai Universally composable two-party and multi-party secure computation. [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Ajtai The invasiveness of off-line memory checking. [Citation Graph (0, 0)][DBLP ] Conf ] Yehuda Lindell , Anna Lysyanskaya , Tal Rabin On the composition of authenticated byzantine agreement. [Citation Graph (0, 0)][DBLP ] Conf ] James Aspnes , Gauri Shah , Jatin Shah Wait-free consensus with infinite arrivals. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige Relations between average case complexity and approximation complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Jonas Holmerin Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon. [Citation Graph (0, 0)][DBLP ] Conf ] Ran Raz Resolution lower bounds for the weak pigeonhole principle. [Citation Graph (0, 0)][DBLP ] Conf ] Eli Ben-Sasson Hard examples for bounded depth frege. [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Nira Shafrir , Robert Endre Tarjan Meldable heaps and boolean union-find. [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal , George Lagogiannis , Christos Makris , Athanasios K. Tsakalidis , Kostas Tsichlas Optimal finger search trees in the pointer machine. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Ramesh Hariharan Verifying candidate matches in sparse and wildcard matching. [Citation Graph (0, 0)][DBLP ] Conf ] Yijie Han Deterministic sorting in O(nlog log n) time and linear space. [Citation Graph (0, 0)][DBLP ] Conf ] Daniele Micciancio Improved cryptographic hash functions with worst-case/average-case connection. [Citation Graph (0, 0)][DBLP ] Conf ] D. Sivakumar Algorithmic derandomization via complexity theory. [Citation Graph (0, 0)][DBLP ] Conf ] Christopher Umans Pseudo-random generators for all hardnesses. [Citation Graph (0, 0)][DBLP ] Conf ] Scott Aaronson Quantum lower bound for the collision problem. [Citation Graph (0, 0)][DBLP ] Conf ] Claude Crépeau , Daniel Gottesman , Adam Smith Secure multi-party quantum computation. [Citation Graph (0, 0)][DBLP ] Conf ] Sean Hallgren Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem. [Citation Graph (0, 0)][DBLP ] Conf ] Michael R. Capalbo , Omer Reingold , Salil P. Vadhan , Avi Wigderson Randomness conductors and constant-degree lossless expanders. [Citation Graph (0, 0)][DBLP ] Conf ] Roy Meshulam , Avi Wigderson Expanders from symmetric codes. [Citation Graph (0, 0)][DBLP ] Conf ] Tugkan Batu , Sanjoy Dasgupta , Ravi Kumar , Ronitt Rubinfeld The complexity of approximating entropy. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Beame , Erik Vee Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. [Citation Graph (0, 0)][DBLP ] Conf ] Ashwin Nayak , Julia Salzman On communication over an entanglement-assisted quantum channel. [Citation Graph (0, 0)][DBLP ] Conf ] Nathan Linial , Avner Magen , Assaf Naor Girth and euclidean distortion. [Citation Graph (0, 0)][DBLP ] Conf ] Saugata Basu Computing the betti numbers of arrangements. [Citation Graph (0, 0)][DBLP ] Conf ] Sunil Arya , Theocharis Malamatos , David M. Mount Space-efficient approximate Voronoi diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Kamal Jain , Mohammad Mahdian , Amin Saberi A new greedy approach for facility location problems. [Citation Graph (0, 0)][DBLP ] Conf ] David R. Karger , Matthias Ruhl Finding nearest neighbors in growth-restricted metrics. [Citation Graph (0, 0)][DBLP ] Conf ] Ryan O'Donnell Hardness amplification within NP. [Citation Graph (0, 0)][DBLP ] Conf ] Ian Agol , Joel Hass , William P. Thurston 3-manifold knot genus is NP-complet. [Citation Graph (0, 0)][DBLP ] Conf ] Subhash Khot On the power of unique 2-prover 1-round games. [Citation Graph (0, 0)][DBLP ] Conf ] Jeffrey C. Jackson , Adam Klivans , Rocco A. Servedio Learnability beyond AC0. [Citation Graph (0, 0)][DBLP ] Conf ] Mordecai J. Golin , Claire Kenyon , Neal E. Young Huffman coding with unequal letter costs. [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar , Eric Lehman , Ding Liu , Rina Panigrahy , Manoj Prabhakaran , April Rasala , Amit Sahai , Abhi Shelat Approximating the smallest grammar: Kolmogorov complexity in natural models. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami Limits to list decodability of linear codes. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Piotr Indyk Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. [Citation Graph (0, 0)][DBLP ] Conf ] 