
Conferences in DBLP
 Christos H. Papadimitriou
Game Theory and Mathematical Economics: A Theoretical Computer Scientist's Introduction. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:48 [Conf]
 Piotr Indyk
Algorithmic Applications of LowDistortion Geometric Embeddings. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:1033 [Conf]
 Madhu Sudan
Coding Theory: Tutorial and Survey. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:3653 [Conf]
 Vladlen Koltun
Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:5665 [Conf]
 Sariel HarPeled, Kasturi R. Varadarajan
Approximate Shape Fitting via Linearization. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:6673 [Conf]
 Pankaj K. Agarwal, Boris Aronov, Micha Sharir
On the Complexity of Many Faces in Arrangements of Circles. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:7483 [Conf]
 Sariel HarPeled
Clustering Motion. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:8493 [Conf]
 Sariel HarPeled
A Replacement for Voronoi Diagrams of Near Linear Size. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:94103 [Conf]
 Boaz Barak
How to Go Beyond the BlackBox Simulation Barrier. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:106115 [Conf]
 Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell
ResettablySound ZeroKnowledge and its Applications. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:116125 [Conf]
 Yael Gertner, Tal Malkin, Omer Reingold
On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:126135 [Conf]
 Ran Canetti
Universally Composable Security: A New Paradigm for Cryptographic Protocols. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:136145 [Conf]
 Anupam Gupta, Amit Kumar, Rajeev Rastogi
Traveling with a Pez Dispenser (Or, Routing Issues in MPLS). [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:148157 [Conf]
 Baruch Awerbuch, Petra Berenbrink, André Brinkmann, Christian Scheideler
Simple Routing Strategies for Adversarial Systems. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:158167 [Conf]
 Matthew Andrews, Antonio Fernández, Ashish Goel, Lisa Zhang
Source Routing and Scheduling in Packet Networks. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:168177 [Conf]
 Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg
The Natural WorkStealing Algorithm is Stable. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:178187 [Conf]
 Michael Alekhnovich, Alexander A. Razborov
Lower Bounds for Polynomial Calculus: NonBinomial Case. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:190199 [Conf]
 Russell Impagliazzo, Nathan Segerlind
Counting Axioms Do Not Polynomially Simulate Counting Gates. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:200209 [Conf]
 Michael Alekhnovich, Alexander A. Razborov
Resolution is Not Automatizable Unless W[P] is Tractable. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:210219 [Conf]
 Stefan S. Dantchev, Søren Riis
"Planar" Tautologies Hard for Resolution. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:220229 [Conf]
 Jittat Fakcharoenphol, Satish Rao
Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:232241 [Conf]
 Mikkel Thorup
Compact Oracles for Reachability and Approximate Distances in Planar Digraphs. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:242251 [Conf]
 John Hershberger, Subhash Suri
Vickrey Prices and Shortest Paths: What is an Edge Worth?. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:252259 [Conf]
 Camil Demetrescu, Giuseppe F. Italiano
Fully Dynamic All Pairs Shortest Paths with Real Edge Weights. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:260267 [Conf]
 Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew ChiChih Yao
Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:270278 [Conf]
 Wim van Dam, Michele Mosca, Umesh V. Vazirani
How Powerful is Adiabatic Quantum Computation?. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:279287 [Conf]
 Hartmut Klauck
Lower Bounds for Quantum Communication Complexity. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:288297 [Conf]
 Hubert Comon, Guillem Godoy, Robert Nieuwenhuis
The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:298307 [Conf]
 Jinyi Cai
On the AverageCase Hardness of CVP. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:308317 [Conf]
 Joseph Cheriyan, Howard J. Karloff, Yuval Rabani
Approximating Directed Multicuts. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:320328 [Conf]
 Martin Pál, Éva Tardos, Tom Wexler
Facility Location with Nonuniform Hard Capacities. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:329338 [Conf]
 Lisa Fleischer, Kamal Jain, David P. Williamson
An Iterative Rounding 2Approximation Algorithm for the Element Connectivity Problem. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:339347 [Conf]
 Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:348356 [Conf]
 Amir Shpilka
Lower Bounds for Matrix Product. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:358367 [Conf]
 Arne Storjohann
Deterministic Computation of the Frobenius Form. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:368377 [Conf]
 Peter Bürgisser
The Complexity of Factors of Multivariate Polynomials. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:378385 [Conf]
 Ross M. McConnell
Lineartime Recognition of Circulararc Graphs. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:386394 [Conf]
 Yair Bartal, Béla Bollobás, Manor Mendel
A Ramsytype Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:396405 [Conf]
 Adam Meyerson, Kamesh Munagala, Serge A. Plotkin
Designing Networks Incrementally. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:406415 [Conf]
 Anupam Gupta, Amit Kumar
Sorting and Selection with Structured Costs. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:416425 [Conf]
 Adam Meyerson
Online Facility Location. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:426431 [Conf]
 Noga Alon
Testing Subgraphs in Large Graphs. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:434441 [Conf]
 Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White
Testing Random Variables for Independence and Identity. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:442451 [Conf]
 Petros Drineas, Ravi Kannan
Fast MonteCarlo Algorithms for Approximate Matrix Multiplication. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:452459 [Conf]
 Oded Goldreich, Luca Trevisan
Three Theorems Regarding Testing Graph Properties. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:460469 [Conf]
 Tim Roughgarden
Designing Networks for Selfish Users is Hard. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:472481 [Conf]
 Aaron Archer, Éva Tardos
Truthful Mechanisms for OneParameter Agents. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:482491 [Conf]
 Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
Building LowDiameter P2P Networks. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:492499 [Conf]
 Dimitris Achlioptas, Amos Fiat, Anna R. Karlin, Frank McSherry
Web Search via Hub Synthesis. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:500509 [Conf]
 William Aiello, Fan R. K. Chung, Linyuan Lu
Random Evolution in Massive Graphs. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:510519 [Conf]
 Stavros G. Kolliopoulos, Neal E. Young
Tight Approximation Results for General Covering Integer Programs. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:522528 [Conf]
 Frank McSherry
Spectral Partitioning of Random Graphs. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:529537 [Conf]
 Neal E. Young
Sequential and Parallel Algorithms for Mixed Packing and Covering. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:538546 [Conf]
 Tibor Szabó, Emo Welzl
Unique Sink Orientations of Cubes. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:547555 [Conf]
 Tom Bohman, Alan M. Frieze
ArcDisjoint Paths in Expander Digraphs. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:558567 [Conf]
 Claire Kenyon, Elchanan Mossel, Yuval Peres
Glauber Dynamics on Trees and Hyperbolic Graphs. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:568578 [Conf]
 Martin E. Dyer, Alan M. Frieze
Randomly Colouring Graphs with Lower Bounds on Girth and Maximum Degree. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:579587 [Conf]
 Aravind Srinivasan
Distributions on LevelSets with Applications to Approximation Algorithms. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:588597 [Conf]
 Subhash Khot
Improved Inaproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:600609 [Conf]
 Johan Håstad, Subhash Khot
Query Efficient PCPs with Perfect Completeness. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:610619 [Conf]
 Jinyi Cai
S^{p}_{2} subseteq ZPP^{NP}. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:620629 [Conf]
 Noga Alon, Alexander Lubotzky, Avi Wigderson
SemiDirect Product in Groups and ZigZag Product in Graphs: Connections and Applications. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:630637 [Conf]
 Amnon TaShma, David Zuckerman, Shmuel Safra
Extractors from ReedMuller Codes. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:638647 [Conf]
 Ronen Shaltiel, Christopher Umans
Simple Extractors for All MinEntropies and a New PseudoRandom Generator. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:648657 [Conf]
 Venkatesan Guruswami, Piotr Indyk
ExpanderBased Constructions of Efficiently Decodable Codes. [Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:658667 [Conf]
