The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Conferences in DBLP

Annual Symposium on Foundations of Computer Science (FOCS) (focs)
2001 (conf/focs/2001)

  1. Christos H. Papadimitriou
    Game Theory and Mathematical Economics: A Theoretical Computer Scientist's Introduction. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:4-8 [Conf]
  2. Piotr Indyk
    Algorithmic Applications of Low-Distortion Geometric Embeddings. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:10-33 [Conf]
  3. Madhu Sudan
    Coding Theory: Tutorial and Survey. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:36-53 [Conf]
  4. Vladlen Koltun
    Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:56-65 [Conf]
  5. Sariel Har-Peled, Kasturi R. Varadarajan
    Approximate Shape Fitting via Linearization. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:66-73 [Conf]
  6. 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:74-83 [Conf]
  7. Sariel Har-Peled
    Clustering Motion. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:84-93 [Conf]
  8. Sariel Har-Peled
    A Replacement for Voronoi Diagrams of Near Linear Size. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:94-103 [Conf]
  9. Boaz Barak
    How to Go Beyond the Black-Box Simulation Barrier. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:106-115 [Conf]
  10. Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell
    Resettably-Sound Zero-Knowledge and its Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:116-125 [Conf]
  11. Yael Gertner, Tal Malkin, Omer Reingold
    On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:126-135 [Conf]
  12. Ran Canetti
    Universally Composable Security: A New Paradigm for Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:136-145 [Conf]
  13. Anupam Gupta, Amit Kumar, Rajeev Rastogi
    Traveling with a Pez Dispenser (Or, Routing Issues in MPLS). [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:148-157 [Conf]
  14. Baruch Awerbuch, Petra Berenbrink, André Brinkmann, Christian Scheideler
    Simple Routing Strategies for Adversarial Systems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:158-167 [Conf]
  15. Matthew Andrews, Antonio Fernández, Ashish Goel, Lisa Zhang
    Source Routing and Scheduling in Packet Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:168-177 [Conf]
  16. Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg
    The Natural Work-Stealing Algorithm is Stable. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:178-187 [Conf]
  17. Michael Alekhnovich, Alexander A. Razborov
    Lower Bounds for Polynomial Calculus: Non-Binomial Case. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:190-199 [Conf]
  18. Russell Impagliazzo, Nathan Segerlind
    Counting Axioms Do Not Polynomially Simulate Counting Gates. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:200-209 [Conf]
  19. Michael Alekhnovich, Alexander A. Razborov
    Resolution is Not Automatizable Unless W[P] is Tractable. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:210-219 [Conf]
  20. Stefan S. Dantchev, Søren Riis
    "Planar" Tautologies Hard for Resolution. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:220-229 [Conf]
  21. Jittat Fakcharoenphol, Satish Rao
    Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:232-241 [Conf]
  22. Mikkel Thorup
    Compact Oracles for Reachability and Approximate Distances in Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:242-251 [Conf]
  23. John Hershberger, Subhash Suri
    Vickrey Prices and Shortest Paths: What is an Edge Worth?. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:252-259 [Conf]
  24. Camil Demetrescu, Giuseppe F. Italiano
    Fully Dynamic All Pairs Shortest Paths with Real Edge Weights. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:260-267 [Conf]
  25. Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew Chi-Chih Yao
    Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:270-278 [Conf]
  26. Wim van Dam, Michele Mosca, Umesh V. Vazirani
    How Powerful is Adiabatic Quantum Computation?. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:279-287 [Conf]
  27. Hartmut Klauck
    Lower Bounds for Quantum Communication Complexity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:288-297 [Conf]
  28. 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:298-307 [Conf]
  29. Jin-yi Cai
    On the Average-Case Hardness of CVP. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:308-317 [Conf]
  30. Joseph Cheriyan, Howard J. Karloff, Yuval Rabani
    Approximating Directed Multicuts. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:320-328 [Conf]
  31. Martin Pál, Éva Tardos, Tom Wexler
    Facility Location with Nonuniform Hard Capacities. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:329-338 [Conf]
  32. Lisa Fleischer, Kamal Jain, David P. Williamson
    An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:339-347 [Conf]
  33. 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:348-356 [Conf]
  34. Amir Shpilka
    Lower Bounds for Matrix Product. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:358-367 [Conf]
  35. Arne Storjohann
    Deterministic Computation of the Frobenius Form. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:368-377 [Conf]
  36. Peter Bürgisser
    The Complexity of Factors of Multivariate Polynomials. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:378-385 [Conf]
  37. Ross M. McConnell
    Linear-time Recognition of Circular-arc Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:386-394 [Conf]
  38. Yair Bartal, Béla Bollobás, Manor Mendel
    A Ramsy-type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:396-405 [Conf]
  39. Adam Meyerson, Kamesh Munagala, Serge A. Plotkin
    Designing Networks Incrementally. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:406-415 [Conf]
  40. Anupam Gupta, Amit Kumar
    Sorting and Selection with Structured Costs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:416-425 [Conf]
  41. Adam Meyerson
    Online Facility Location. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:426-431 [Conf]
  42. Noga Alon
    Testing Subgraphs in Large Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:434-441 [Conf]
  43. 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:442-451 [Conf]
  44. Petros Drineas, Ravi Kannan
    Fast Monte-Carlo Algorithms for Approximate Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:452-459 [Conf]
  45. Oded Goldreich, Luca Trevisan
    Three Theorems Regarding Testing Graph Properties. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:460-469 [Conf]
  46. Tim Roughgarden
    Designing Networks for Selfish Users is Hard. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:472-481 [Conf]
  47. Aaron Archer, Éva Tardos
    Truthful Mechanisms for One-Parameter Agents. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:482-491 [Conf]
  48. Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
    Building Low-Diameter P2P Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:492-499 [Conf]
  49. Dimitris Achlioptas, Amos Fiat, Anna R. Karlin, Frank McSherry
    Web Search via Hub Synthesis. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:500-509 [Conf]
  50. William Aiello, Fan R. K. Chung, Linyuan Lu
    Random Evolution in Massive Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:510-519 [Conf]
  51. Stavros G. Kolliopoulos, Neal E. Young
    Tight Approximation Results for General Covering Integer Programs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:522-528 [Conf]
  52. Frank McSherry
    Spectral Partitioning of Random Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:529-537 [Conf]
  53. Neal E. Young
    Sequential and Parallel Algorithms for Mixed Packing and Covering. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:538-546 [Conf]
  54. Tibor Szabó, Emo Welzl
    Unique Sink Orientations of Cubes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:547-555 [Conf]
  55. Tom Bohman, Alan M. Frieze
    Arc-Disjoint Paths in Expander Digraphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:558-567 [Conf]
  56. Claire Kenyon, Elchanan Mossel, Yuval Peres
    Glauber Dynamics on Trees and Hyperbolic Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:568-578 [Conf]
  57. 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:579-587 [Conf]
  58. Aravind Srinivasan
    Distributions on Level-Sets with Applications to Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:588-597 [Conf]
  59. Subhash Khot
    Improved Inaproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:600-609 [Conf]
  60. Johan Håstad, Subhash Khot
    Query Efficient PCPs with Perfect Completeness. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:610-619 [Conf]
  61. Jin-yi Cai
    Sp2 subseteq ZPPNP. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:620-629 [Conf]
  62. Noga Alon, Alexander Lubotzky, Avi Wigderson
    Semi-Direct Product in Groups and Zig-Zag Product in Graphs: Connections and Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:630-637 [Conf]
  63. Amnon Ta-Shma, David Zuckerman, Shmuel Safra
    Extractors from Reed-Muller Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:638-647 [Conf]
  64. Ronen Shaltiel, Christopher Umans
    Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:648-657 [Conf]
  65. Venkatesan Guruswami, Piotr Indyk
    Expander-Based Constructions of Efficiently Decodable Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:658-667 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002