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)
2000 (conf/focs/2000)

  1. Omer Reingold, Salil P. Vadhan, Avi Wigderson
    Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:3-13 [Conf]
  2. Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
    Universality and Tolerance. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:14-21 [Conf]
  3. Omer Reingold, Ronen Shaltiel, Avi Wigderson
    Extracting Randomness via Repeated Condensing. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:22-31 [Conf]
  4. Luca Trevisan, Salil P. Vadhan
    Extracting Randomness from Samplable Distributions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:32-42 [Conf]
  5. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Pseudorandom Generators in Propositional Proof Complexity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:43-53 [Conf]
  6. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, Eli Upfal
    Random graph models for the web graph. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:57-65 [Conf]
  7. Richard M. Karp, Elias Koutsoupias, Christos H. Papadimitriou, Scott Shenker
    Optimization Problems in Congestion Control. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:66-74 [Conf]
  8. Amit Kumar, Jon M. Kleinberg
    Fairness Measures for Resource Allocation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:75-85 [Conf]
  9. Christos H. Papadimitriou, Mihalis Yannakakis
    On the Approximability of Trade-offs and Optimal Access of Web Sources. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:86-92 [Conf]
  10. Tim Roughgarden, Éva Tardos
    How Bad is Selfish Routing? [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:93-102 [Conf]
  11. Uriel Feige, Robert Krauthgamer
    A polylogarithmic approximation of the minimum bisection. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:105-115 [Conf]
  12. Maxim Sviridenko, Gerhard J. Woeginger
    Approximability and in-approximability results for no-wait shop scheduling. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:116-125 [Conf]
  13. Sudipto Guha
    Nested Graph Dissection and Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:126-135 [Conf]
  14. Martin Skutella
    Approximating the single source unsplittable min-cost flow problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:136-145 [Conf]
  15. Venkatesan Guruswami, Johan Håstad, Madhu Sudan
    Hardness of Approximate Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:149-158 [Conf]
  16. Venkatesan Guruswami, Amit Sahai, Madhu Sudan
    "Soft-decision" Decoding of Chinese Remainder Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:159-168 [Conf]
  17. Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee
    Super-linear time-space tradeoff lower bounds for randomized computation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:169-179 [Conf]
  18. Jacobo Torán
    On the Hardness of Graph Isomorphism. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:180-186 [Conf]
  19. Piotr Indyk
    Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:189-197 [Conf]
  20. Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe
    New Data Structures for Orthogonal Range Searching. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:198-207 [Conf]
  21. Sunil Arya, Theocharis Malamatos, David M. Mount
    Nearly Optimal Expected-Case Planar Point Location. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:208-218 [Conf]
  22. Timothy M. Chan
    On Levels in Arrangements of Curves. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:219-227 [Conf]
  23. Jon M. Kleinberg
    Detecting a Network Failure. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:231-239 [Conf]
  24. Noga Alon, Seannie Dar, Michal Parnas, Dana Ron
    Testing of Clustering. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:240-250 [Conf]
  25. Ilan Newman
    Testing of Functions that have small width Branching Programs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:251-258 [Conf]
  26. Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White
    Testing that distributions are close. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:259-269 [Conf]
  27. Peter Auer
    Using Upper Confidence Bounds for Online Learning. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:270-279 [Conf]
  28. Cynthia Dwork, Moni Naor
    Zaps and Their Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:283-293 [Conf]
  29. Yuval Ishai, Eyal Kushilevitz
    Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:294-304 [Conf]
  30. Rosario Gennaro, Luca Trevisan
    Lower Bounds on the Efficiency of Generic Cryptographic Constructions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:305-313 [Conf]
  31. Juan A. Garay, Philip D. MacKenzie
    Concurrent Oblivious Transfer. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:314-324 [Conf]
  32. Yael Gertner, Sampath Kannan, Tal Malkin, Omer Reingold, Mahesh Viswanathan
    The Relationship between Public Key Encryption and Oblivious Transfer. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:325-335 [Conf]
  33. Ramgopal R. Mettu, C. Greg Plaxton
    The Online Median Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:339-348 [Conf]
  34. Rafail Ostrovsky, Yuval Rabani
    Polynomial Time Approximation Schemes for Geometric k-Clustering. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:349-358 [Conf]
  35. Sudipto Guha, Nina Mishra, Rajeev Motwani, Liadan O'Callaghan
    Clustering Data Streams. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:359-366 [Conf]
  36. Ravi Kannan, Santosh Vempala, Adrian Vetta
    On Clusterings - Good, Bad and Spectral. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:367-377 [Conf]
  37. Camil Demetrescu, Giuseppe F. Italiano
    Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:381-389 [Conf]
  38. Paolo Ferragina, Giovanni Manzini
    Opportunistic Data Structures with Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:390-398 [Conf]
  39. Michael A. Bender, Erik D. Demaine, Martin Farach-Colton
    Cache-Oblivious B-Trees. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:399-409 [Conf]
  40. Harold N. Gabow
    Using Expander Graphs to Find Vertex Connectivity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:410-420 [Conf]
  41. János Pach, Gábor Tardos
    On the boundary complexity of the union of fat triangles. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:423-431 [Conf]
  42. Robert Connelly, Erik D. Demaine, Günter Rote
    Straighting Polygonal Arcs and Convexifying Polygonal Cycles. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:432-442 [Conf]
  43. Ileana Streinu
    A Combinatorial Approach to Planar Non-colliding Robot Arm Motion Planning. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:443-453 [Conf]
  44. Herbert Edelsbrunner, David Letscher, Afra Zomorodian
    Topological Persistence and Simplification. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:454-463 [Conf]
  45. Jeff Kahn, Jeong Han Kim, László Lovász, Van H. Vu
    The Cover Time, the Blanket Time, and the Matthews Bound. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:467-475 [Conf]
  46. Igor Pak
    The product replacement algorithm is polynomial. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:476-485 [Conf]
  47. Adam Kalai, Santosh Vempala
    Efficient Algorithms for Universal Portfolios. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:486-491 [Conf]
  48. Russell A. Martin, Dana Randall
    Sampling Adsorbing Staircase Walks Using a New Markov Chain Decomposition Method. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:492-502 [Conf]
  49. James Allen Fill, Mark Huber
    The Randomness Recycler: A New Technique for Perfect Sampling. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:503-511 [Conf]
  50. Lisa Hales, Sean Hallgren
    An Improved Quantum Fourier Transform Algorithm and Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:515-525 [Conf]
  51. Richard Cleve, John Watrous
    Fast parallel circuits for the quantum Fourier transform. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:526-536 [Conf]
  52. John Watrous
    Succinct quantum proofs for properties of finite groups. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:537-546 [Conf]
  53. Andris Ambainis, Michele Mosca, Alain Tapp, Ronald de Wolf
    Private Quantum Channels. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:547-553 [Conf]
  54. Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
    The Quantum Complexity of Set Membership. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:554-562 [Conf]
  55. Richard M. Karp, Christian Schindelhauer, Scott Shenker, Berthold Vöcking
    Randomized Rumor Spreading. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:565-574 [Conf]
  56. Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
    Fast Broadcasting and Gossiping in Radio Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:575-581 [Conf]
  57. Claire Kenyon, Michael Mitzenmacher
    Linear Waste of Best Fit Bin Packing on Skewed Distributions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:582-589 [Conf]
  58. Dimitris Achlioptas, Gregory B. Sorkin
    Optimal myopic algorithms for random 3-SAT. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:590-600 [Conf]
  59. Sudipto Guha, Adam Meyerson, Kamesh Munagala
    Hierarchical Placement and Network Design Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:603-612 [Conf]
  60. David R. Karger, Maria Minkoff
    Building Steiner Trees with Incomplete Global Knowledge. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:613-623 [Conf]
  61. Adam Meyerson, Kamesh Munagala, Serge A. Plotkin
    Cost-Distance: Two Metric Network Design. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:624-630 [Conf]
  62. Moses Charikar, Venkatesan Guruswami, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
    Combinatorial feature selection problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:631-640 [Conf]
  63. Monika Maidl
    The Common Fragment of CTL and LTL. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:643-652 [Conf]
  64. Maurice Herlihy, Eric Ruppert
    On the Existence of Booster Types. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:653-663 [Conf]
  65. Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick
    Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:664-674 [Conf]
  66. Wayne Eberly, Mark Giesbrecht, Gilles Villard
    Computing the Determinant and Smith Form of an Integer Matrix. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:675-685 [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