The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Avrim Blum
    Machine Learning: My Favorite Results, Directions, and Open Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:2-0 [Conf]
  2. Dana Randall
    Mixing. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:4-0 [Conf]
  3. Eli Upfal
    Performance Analysis of Dynamic Network Processes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:18-0 [Conf]
  4. Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic
    A Polynomial Algorithm for Recognizing Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:20-27 [Conf]
  5. Milena Mihail, Christos H. Papadimitriou, Amin Saberi
    On Certain Connectivity Properties of the Internet Topology. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:28-35 [Conf]
  6. Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, Kunal Talwar
    Paths, Trees, and Minimum Latency Tours. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:36-45 [Conf]
  7. Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff
    Approximation Algorithms for Orienteering and Discounted-Reward TSP. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:46-55 [Conf]
  8. Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
    Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:56-0 [Conf]
  9. Oded Goldreich, Shafi Goldwasser, Asaf Nussboim
    On the Implementation of Huge Random Objects. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:68-79 [Conf]
  10. Silvio Micali, Michael O. Rabin, Joe Kilian
    Zero-Knowledge Sets. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:80-91 [Conf]
  11. Jesse Kamp, David Zuckerman
    Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:92-101 [Conf]
  12. Shafi Goldwasser, Yael Tauman Kalai
    On the (In)security of the Fiat-Shamir Paradigm. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:102-0 [Conf]
  13. László Babai, Amir Shpilka, Daniel Stefankovic
    Locally Testable Cyclic Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:116-125 [Conf]
  14. Luca Trevisan
    List-Decoding Using The XOR Lemma. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:126-135 [Conf]
  15. Elchanan Mossel, Amir Shpilka, Luca Trevisan
    On e-Biased Generators in NC0. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:136-145 [Conf]
  16. Adi Akavia, Shafi Goldwasser, Shmuel Safra
    Proving Hard-Core Predicates Using List Decoding. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:146-0 [Conf]
  17. Rajat Bhattacharjee, Ashish Goel
    Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:160-167 [Conf]
  18. Chandra Nair, Balaji Prabhakar, Mayank Sharma
    Proofs of the Parisi and Coppersmith-Sorkin Conjectures for the Finite Random Assignment Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:168-178 [Conf]
  19. Alon Orlitsky, Narayana P. Santhanam, Junan Zhang
    Always Good Turing: Asymptotically Optimal Probability Estimation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:179-188 [Conf]
  20. Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
    Learning DNF from Random Walks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:189-0 [Conf]
  21. Scott Aaronson, Andris Ambainis
    Quantum Search of Spatial Regions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:200-209 [Conf]
  22. Dorit Aharonov, Oded Regev
    A Lattice Problem in Quantum NP. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:210-219 [Conf]
  23. Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
    A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:220-229 [Conf]
  24. Andris Ambainis
    Polynomial Degree vs. Quantum Query Complexity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:230-0 [Conf]
  25. Gianni Franceschini, Viliam Geffert
    An In-Place Sorting with O(n log n) Comparisons and O(n) Moves. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:242-250 [Conf]
  26. Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung
    Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:251-260 [Conf]
  27. Lars Arge, Norbert Zeh
    I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:261-270 [Conf]
  28. Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz
    The Cost of Cache-Oblivious Searching. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:271-282 [Conf]
  29. Piotr Indyk, David P. Woodruff
    Tight Lower Bounds for the Distinct Elements Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:283-0 [Conf]
  30. Subhash Khot
    Hardness of Approximating the Shortest Vector Problem in High Lp Norms. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:290-297 [Conf]
  31. Michael Alekhnovich
    More on Average Case vs Approximation Complexity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:298-307 [Conf]
  32. Andrej Bogdanov, Luca Trevisan
    On Worst-Case to Average-Case Reductions for NP Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:308-317 [Conf]
  33. Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi
    Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:318-0 [Conf]
  34. Michael Molloy, Mohammad R. Salavatipour
    The Resolution Complexity of Random Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:330-339 [Conf]
  35. Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi
    Algorithms and Complexity Results for #SAT and Bayesian Inference. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:340-351 [Conf]
  36. Michael Alekhnovich, Eli Ben-Sasson
    Linear Upper Bounds for Random Walk on Small Density Random 3-CNF. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:352-361 [Conf]
  37. Dimitris Achlioptas, Assaf Naor, Yuval Peres
    On the Maximum Satisfiability of Random Formulas. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:362-0 [Conf]
  38. Russell Impagliazzo, Bruce M. Kapron
    Logics for Reasoning about Cryptographic Constructions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:372-383 [Conf]
  39. Boaz Barak, Yehuda Lindell, Salil P. Vadhan
    Lower Bounds for Non-Black-Box Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:384-393 [Conf]
  40. Yehuda Lindell
    General Composition and Universal Composability in Secure Multi-Party Computation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:394-403 [Conf]
  41. Rafael Pass, Alon Rosen
    Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:404-0 [Conf]
  42. Daniel A. Spielman, Shang-Hua Teng
    Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time 0(m1.31). [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:416-427 [Conf]
  43. Amos Beimel, Enav Weinreb
    Separating the Power of Monotone Span Programs over Different Fields. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:428-437 [Conf]
  44. Henry Cohn, Christopher Umans
    A Group-Theoretic Approach to Fast Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:438-449 [Conf]
  45. Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
    Symmetric Polynomials over Zm and Simultaneous Communication Protocol. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:450-0 [Conf]
  46. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld
    Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:462-471 [Conf]
  47. Aris Anagnostopoulos, Adam Kirsch, Eli Upfal
    Stability and Efficiency of a Random Local Load Balancing Protocol. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:472-481 [Conf]
  48. David Kempe, Alin Dobra, Johannes Gehrke
    Gossip-Based Computation of Aggregate Information. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:482-491 [Conf]
  49. Artur Czumaj, Wojciech Rytter
    Broadcasting Algorithms in Radio Networks with Unknown Topology. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:492-501 [Conf]
  50. Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An Zhu
    Switch Scheduling via Randomized Edge Coloring. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:502-0 [Conf]
  51. Bo Brinkman, Moses Charikar
    On the Impossibility of Dimension Reduction in l1. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:514-523 [Conf]
  52. Moses Charikar, Venkatesan Guruswami, Anthony Wirth
    Clustering with Qualitative Information. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:524-533 [Conf]
  53. Anupam Gupta, Robert Krauthgamer, James R. Lee
    Bounded Geometries, Fractals, and Low-Distortion Embeddings. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:534-543 [Conf]
  54. Timothy M. Chan
    On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:544-0 [Conf]
  55. Martin Grohe
    The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:552-561 [Conf]
  56. Andrei A. Bulatov, Víctor Dalmau
    Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:562-0 [Conf]
  57. Ron Lavi, Ahuva Mu'alem, Noam Nisan
    Towards a Characterization of Truthful Combinatorial Auctions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:574-583 [Conf]
  58. Martin Pál, Éva Tardos
    Group Strategyproof Mechanisms via Primal-Dual Algorithms. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:584-593 [Conf]
  59. Robert D. Kleinberg, Frank Thomson Leighton
    The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:594-605 [Conf]
  60. Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden
    Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:606-0 [Conf]
  61. Thomas P. Hayes, Eric Vigoda
    A Non-Markovian Coupling for Randomly Sampling Colorings. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:618-627 [Conf]
  62. Fabio Martinelli, Alistair Sinclair, Dror Weitz
    The Ising Model on Trees: Boundary Conditions and Mixing Time. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:628-639 [Conf]
  63. László Lovász, Santosh Vempala
    Logconcave Functions: Geometry and Efficient Sampling Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:640-649 [Conf]
  64. László Lovász, Santosh Vempala
    Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:650-0 [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