Conferences in DBLP
Carlos Mochon Quantum Weak Coin-Flipping with Bias of 0.192. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:2-11 [Conf ] Hartmut Klauck , Robert Spalek , Ronald de Wolf Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:12-21 [Conf ] Andris Ambainis Quantum Walk Algorithm for Element Distinctness. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:22-31 [Conf ] Mario Szegedy Quantum Speed-Up of Markov Chain Based Algorithms. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:32-41 [Conf ] Dorit Aharonov , Wim van Dam , Julia Kempe , Zeph Landau , Seth Lloyd , Oded Regev Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:42-51 [Conf ] Moses Charikar , Anthony Wirth Maximizing Quadratic Programs: Extending Grothendieck's Inequality. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:54-60 [Conf ] Lap Chi Lau An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:61-70 [Conf ] Chandra Chekuri , Sanjeev Khanna , F. Bruce Shepherd Edge-Disjoint Paths in Planar Graphs. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:71-80 [Conf ] Julia Chuzhoy , Sudipto Guha , Sanjeev Khanna , Joseph Naor Machine Minimization for Scheduling Jobs with Interval Constraints. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:81-90 [Conf ] Jirí Matousek , Tibor Szabó Random Edge Can Be Exponential on Abstract Cubes. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:92-100 [Conf ] Moses Charikar , Michel X. Goemans , Howard J. Karloff On the Integrality Ratio for Asymmetric TSP. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:101-107 [Conf ] Julia Chuzhoy , Joseph Naor The Hardness of Metric Labeling. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:108-114 [Conf ] Matthew Andrews Hardness of Buy-at-Bulk Network Design. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:115-124 [Conf ] Subhash Khot Hardness of Approximating the Shortest Vector Problem in Lattices. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:126-135 [Conf ] Subhash Khot Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:136-145 [Conf ] Subhash Khot , Guy Kindler , Elchanan Mossel , Ryan O'Donnell Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:146-154 [Conf ] Irit Dinur , Omer Reingold Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:155-164 [Conf ] Benny Applebaum , Yuval Ishai , Eyal Kushilevitz Cryptography in NC^{0} . [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:166-175 [Conf ] Salil P. Vadhan An Unconditional Study of Computational Zero Knowledge. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:176-185 [Conf ] Boaz Barak , Ran Canetti , Jesper Buus Nielsen , Rafael Pass Universally Composable Protocols with Relaxed Set-Up Assumptions. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:186-195 [Conf ] Yevgeniy Dodis , Shien Jin Ong , Manoj Prabhakaran , Amit Sahai On the (Im)possibility of Cryptography with Imperfect Randomness. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:196-205 [Conf ] Brian C. Dean , Michel X. Goemans , Jan Vondrák Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:208-217 [Conf ] Anupam Gupta , R. Ravi , Amitabh Sinha An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:218-227 [Conf ] David B. Shmoys , Chaitanya Swamy Stochastic Optimization is (Almost) as easy as Deterministic Optimization. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:228-237 [Conf ] Sanjeev Arora , Elad Hazan , Satyen Kale 0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n^{2} ) Time. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:238-247 [Conf ] Marcin Mucha , Piotr Sankowski Maximum Matchings via Gaussian Elimination. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:248-255 [Conf ] Rahul Savani , Bernhard von Stengel Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:258-267 [Conf ] George Karakostas , Stavros G. Kolliopoulos Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:268-276 [Conf ] Lisa Fleischer , Kamal Jain , Mohammad Mahdian Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:277-285 [Conf ] Kamal Jain A Polynomial Time Algorithm for Computing the Arrow-Debreu Market Equilibrium for Linear Utilities. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:286-294 [Conf ] Elliot Anshelevich , Anirban Dasgupta , Jon M. Kleinberg , Éva Tardos , Tom Wexler , Tim Roughgarden The Price of Stability for Network Design with Fair Cost Allocation. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:295-304 [Conf ] Leslie G. Valiant Holographic Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:306-315 [Conf ] Lance Fortnow , Rahul Santhanam Hierarchy Theorems for Probabilistic Polynomial Time. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:316-324 [Conf ] Michael Langberg Private Codes or Succinct Random Codes That Are (Almost) Perfect. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:325-334 [Conf ] Qi Cheng , Daqing Wan On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract). [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:335-341 [Conf ] Ran Raz Multilinear-NC neq Multilinear-NC. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:344-351 [Conf ] Steve Chien , Alistair Sinclair Algebras with Polynomial Identities and Computing the Determinant. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:352-361 [Conf ] Dorit Aharonov , Oded Regev Lattice Problems in NP cap coNP. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:362-371 [Conf ] Daniele Micciancio , Oded Regev Worst-Case to Average-Case Reductions Based on Gaussian Measures. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:372-381 [Conf ] Boaz Barak , Russell Impagliazzo , Avi Wigderson Extracting Randomness Using Few Independent Sources. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:384-393 [Conf ] Ariel Gabizon , Ran Raz , Ronen Shaltiel Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:394-403 [Conf ] Yonatan Bilu , Nathan Linial Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral Gap. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:404-412 [Conf ] Tali Kaufman , Dana Ron Testing Polynomials over General Fields. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:413-422 [Conf ] Charanjit S. Jutla , Anindya C. Patthak , Atri Rudra , David Zuckerman Testing Low-Degree Polynomials over Prime Fields. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:423-432 [Conf ] Robert Krauthgamer , James R. Lee , Manor Mendel , Assaf Naor Measured Descent: A New Embedding Method for Finite Metrics. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:434-443 [Conf ] Jon M. Kleinberg , Aleksandrs Slivkins , Tom Wexler Triangulation and Embedding Using Small Sets of Beacons. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:444-453 [Conf ] Amit Kumar , Yogish Sabharwal , Sandeep Sen A Simple Linear Time (1+ ) -Approximation Algorithm for k-Means Clustering in Any Dimensions. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:454-462 [Conf ] Nir Halman On the Power of Discrete and of Lexicographic Helly-Type Theorems. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:463-472 [Conf ] Amit Chakrabarti , Oded Regev An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:473-482 [Conf ] Erik D. Demaine , Dion Harmon , John Iacono , Mihai Patrascu Dynamic Optimality -- Almost. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:484-490 [Conf ] Gianni Franceschini , Roberto Grossi No Sorting? Better Searching! [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:491-498 [Conf ] Liam Roditty , Uri Zwick Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:499-508 [Conf ] Piotr Sankowski Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract). [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:509-517 [Conf ] Nikhil Bansal , Tracy Kimbrel , Kirk Pruhs Dynamic Speed Scaling to Manage Energy and Temperature. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:520-529 [Conf ] John Augustine , Sandy Irani , Chaitanya Swamy Optimal Power-Down Strategies. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:530-539 [Conf ] Gagan Aggarwal , Mayur Datar , Sridhar Rajagopalan , Matthias Ruhl On the Streaming Model Augmented with a Sorting Primitive. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:540-549 [Conf ] Ziv Bar-Yossef , T. S. Jayram , Robert Krauthgamer , Ravi Kumar Approximating Edit Distance Efficiently. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:550-559 [Conf ] Leslie Ann Goldberg , Russell A. Martin , Mike Paterson trong Spatial Mixing for Lattice Graphs with Fewer Colours. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:562-571 [Conf ] Elchanan Mossel , Yuval Peres , Alistair Sinclair Shuffling by Semi-Random Transpositions. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:572-581 [Conf ] Martin E. Dyer , Alan M. Frieze , Thomas P. Hayes , Eric Vigoda Randomly Coloring Constant Degree Graphs. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:582-589 [Conf ] Harold S. Connamacher , Michael Molloy The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:590-599 [Conf ] Anirban Dasgupta , John E. Hopcroft , Frank McSherry Spectral Analysis of Random Graphs with Skewed Degree Distributions. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:602-610 [Conf ] Laurence Bisht , Nader H. Bshouty , Lawrance Khoury Learning with Errors in Answers to Membership Queries. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:611-620 [Conf ] Michael Alekhnovich , Mark Braverman , Vitaly Feldman , Adam R. Klivans , Toniann Pitassi Learnability and Automatizability. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:621-630 [Conf ]