The SCEAS System
Navigation Menu

Conferences in DBLP

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


  1. FOCS 2005 - Copyright. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:- [Conf]

  2. Reviewers. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:- [Conf]

  3. Knuth Prize. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:- [Conf]

  4. Best Paper Awards. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:- [Conf]

  5. Committees. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:- [Conf]

  6. Foreword. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:- [Conf]

  7. FOCS 2005 - Title Page. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:- [Conf]

  8. Machtey Award. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:- [Conf]

  9. Corporate Sponsors. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:- [Conf]
  10. Subhash Khot
    On the Unique Games Conjecture. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:3- [Conf]
  11. Bernard Chazelle
    Algorithmic Techniques and Tools from Computational Geometry. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:7- [Conf]
  12. Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio
    Agnostically Learning Halfspaces. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:11-20 [Conf]
  13. Elchanan Mossel, Ryan O'Donnell, Krzysztof Oleszkiewicz
    Noise stability of functions with low in.uences invariance and optimality. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:21-30 [Conf]
  14. Ryan O'Donnell, Michael E. Saks, Oded Schramm, Rocco A. Servedio
    Every decision tree has an in.uential variable. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:31-39 [Conf]
  15. Navin Goyal, Guy Kindler, Michael E. Saks
    Lower Bounds for the Noisy Broadcast Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:40-52 [Conf]
  16. Subhash Khot, Nisheeth K. Vishnoi
    The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:53-62 [Conf]
  17. Dániel Marx
    The Closest Substring problem with small distances. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:63-72 [Conf]
  18. Nir Ailon, Moses Charikar
    Fitting tree metrics: Hierarchical clustering and Phylogeny. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:73-82 [Conf]
  19. Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins
    Metric Embeddings with Relaxed Guarantees. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:83-100 [Conf]
  20. Subhash Khot, Assaf Naor
    Nonembeddability theorems via Fourier analysis. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:101-112 [Conf]
  21. Timothy Abbott, Daniel Kane, Paul Valiant
    On the Complexity of Two-PlayerWin-Lose Games. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:113-122 [Conf]
  22. Imre Bárány, Santosh Vempala, Adrian Vetta
    Nash Equilibria in Random Games. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:123-131 [Conf]
  23. Jon M. Kleinberg, Prabhakar Raghavan
    Query Incentive Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:132-141 [Conf]
  24. Michel X. Goemans, Vahab S. Mirrokni, Adrian Vetta
    Sink Equilibria and Convergence. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:142-154 [Conf]
  25. Mark Braverman
    On the Complexity of Real Functions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:155-164 [Conf]
  26. Faith Ellen Fich, Danny Hendler, Nir Shavit
    Linear Lower Bounds on Real-World Implementations of Concurrent Objects. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:165-173 [Conf]
  27. Seth Pettie
    Towards a Final Analysis of Pairing Heaps. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:174-183 [Conf]
  28. Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan
    Structuring labeled trees for optimal succinctness, and beyond. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:184-196 [Conf]
  29. Luca Trevisan
    Approximation Algorithms for Unique Games. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:197-205 [Conf]
  30. Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra
    On Non-Approximability for Quadratic Programs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:206-215 [Conf]
  31. Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi
    Hardness of Approximating the Closest Vector Problem with Pre-Processing. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:216-225 [Conf]
  32. Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang
    Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:226-244 [Conf]
  33. Chandra Chekuri, Martin Pál
    A Recursive Greedy Algorithm for Walks in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:245-253 [Conf]
  34. V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan
    Approximation Algorithms for Scheduling on Multiple Machines. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:254-263 [Conf]
  35. Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani
    AdWords and Generalized On-line Matching. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:264-273 [Conf]
  36. Adam Meyerson
    The Parking Permit Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:274-284 [Conf]
  37. Farzad Parvaresh, Alexander Vardy
    Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:285-294 [Conf]
  38. Emmanuel J. Candès, Mark Rudelson, Terence Tao, Roman Vershynin
    Error Correction via Linear Programming. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:295-308 [Conf]
  39. Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman
    Error-Correcting Codes for Automatic Control. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:309-316 [Conf]
  40. Tali Kaufman, Simon Litsyn
    Almost Orthogonal Linear Codes are Locally Testable. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:317-326 [Conf]
  41. Michael Navon, Alex Samorodnitsky
    On Delsarte's Linear Programming Bounds for Binary Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:327-338 [Conf]
  42. Sanjeev Arora, Elad Hazan, Satyen Kale
    Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:339-348 [Conf]
  43. Amit Deshpande, Daniel A. Spielman
    Improved Smoothed Analysis of the Shadow Vertex Simplex Method. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:349-356 [Conf]
  44. Chaitanya Swamy, David B. Shmoys
    Sampling-based Approximation Algorithms for Multi-stage Stochastic. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:357-366 [Conf]
  45. Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Singh
    How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:367-378 [Conf]
  46. Henry Cohn, Robert D. Kleinberg, Balázs Szegedy, Christopher Umans
    Group-theoretic Algorithms for Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:379-388 [Conf]
  47. Raphael Yuster, Uri Zwick
    Answering distance queries in directed graphs using fast matrix multiplication. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:389-396 [Conf]
  48. Avi Wigderson, David Xiao
    A Randomness-Efficient Sampler for Matrix-valued Functions and Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:397-406 [Conf]
  49. Ariel Gabizon, Ran Raz
    Deterministic Extractors for Affine Sources over Large Fields. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:407-418 [Conf]
  50. Noga Alon, Asaf Shapira, Benny Sudakov
    Additive Approximation for Edge-Deletion Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:419-428 [Conf]
  51. Noga Alon, Asaf Shapira
    A Characterization of the (natural) Graph Properties Testable with One-Sided Error. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:429-438 [Conf]
  52. Penny E. Haxell, Brendan Nagle, Vojtech Rödl
    An Algorithmic Version of the Hypergraph Regularity Method. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:439-448 [Conf]
  53. Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner
    Cryptography In the Bounded Quantum-Storage Model. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:449-458 [Conf]
  54. Ran Raz
    Quantum Information and the PCP Theorem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:459-468 [Conf]
  55. Dave Bacon, Andrew M. Childs, Wim van Dam
    From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:469-478 [Conf]
  56. Cristopher Moore, Alexander Russell, Leonard J. Schulman
    The Symmetric Group Defies Strong Fourier Sampling. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:479-490 [Conf]
  57. Anirban Dasgupta, John E. Hopcroft, Jon M. Kleinberg, Mark Sandler
    On Learning Mixtures of Heavy-Tailed Distributions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:491-500 [Conf]
  58. Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
    Learning mixtures of product distributions over discrete domains. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:501-510 [Conf]
  59. Thomas P. Hayes, Alistair Sinclair
    A general lower bound for mixing of single-site dynamics on graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:511-520 [Conf]
  60. Tomás Brázdil, Javier Esparza, Antonín Kucera
    Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:521-530 [Conf]
  61. Orna Kupferman, Moshe Y. Vardi
    Safraless Decision Procedures. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:531-542 [Conf]
  62. Boaz Barak, Amit Sahai
    How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:543-552 [Conf]
  63. Shafi Goldwasser, Yael Tauman Kalai
    On the Impossibility of Obfuscation with Auxiliary Input. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:553-562 [Conf]
  64. Rafael Pass, Alon Rosen
    Concurrent Non-Malleable Commitments. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:563-572 [Conf]
  65. Moni Naor, Guy N. Rothblum
    The Complexity of Online Memory Checking. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:573-584 [Conf]
  66. Sergei Izmalkov, Silvio Micali, Matt Lepinski
    Rational Secure Computation and Ideal Mechanism Design. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:585-595 [Conf]
  67. Ron Lavi, Chaitanya Swamy
    Truthful and Near-Optimal Mechanism Design via Linear Programming. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:595-604 [Conf]
  68. Maria-Florina Balcan, Avrim Blum, Jason D. Hartline, Yishay Mansour
    Mechanism Design via Machine Learning. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:605-614 [Conf]
  69. Anna R. Karlin, David Kempe, Tami Tamir
    Beyond VCG: Frugality of Truthful Mechanisms. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:615-626 [Conf]
  70. Jon M. Kleinberg
    An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:627-636 [Conf]
  71. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ichi Kawarabayashi
    Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:637-646 [Conf]
  72. Philip N. Klein
    A linear-time approximation scheme for planar weighted TSP. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:647-657 [Conf]
  73. Nikhil Bansal, Andrea Lodi, Maxim Sviridenko
    A Tale of Two Dimensional Bin Packing. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:657-666 [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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002