The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on the Theory of Computing (STOC) (stoc)
2003 (conf/stoc/2003)

  1. Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen
    Hidden translation and orbit coset in quantum computing. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:1-9 [Conf]
  2. Leonid Gurvits
    Classical deterministic complexity of Edmonds' Problem and quantum entanglement. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:10-19 [Conf]
  3. Dorit Aharonov, Amnon Ta-Shma
    Adiabatic quantum state generation and statistical zero knowledge. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:20-29 [Conf]
  4. Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
    Better streaming algorithms for clustering problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:30-39 [Conf]
  5. C. Greg Plaxton
    Approximation algorithms for hierarchical location problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:40-49 [Conf]
  6. Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani
    Approximation schemes for clustering problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:50-58 [Conf]
  7. Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman
    Exponential algorithmic speedup by a quantum walk. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:59-68 [Conf]
  8. Hartmut Klauck
    Quantum time-space tradeoffs for sorting. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:69-76 [Conf]
  9. Andrew Chi-Chih Ya
    On the power of quantum fingerprinting. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:77-81 [Conf]
  10. Yossi Azar, Yossi Richter
    Management of multi-queue switches in QoS networks. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:82-89 [Conf]
  11. Eyal Amir, Robert Krauthgamer, Satish Rao
    Constant factor approximation of vertex-cuts in planar graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:90-99 [Conf]
  12. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
    The online set cover problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:100-105 [Conf]
  13. Iordanis Kerenidis, Ronald de Wolf
    Exponential lower bound for 2-query locally decodable codes via a quantum argument. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:106-115 [Conf]
  14. Gábor Tardos
    Optimal probabilistic fingerprint codes. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:116-125 [Conf]
  15. Venkatesan Guruswami, Piotr Indyk
    Linear time encodable and list decodable codes. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:126-135 [Conf]
  16. Don Coppersmith, Madhu Sudan
    Reconstructing curves in three (and higher) dimensional space from noisy data. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:136-142 [Conf]
  17. Lukasz Kowalik, Maciej Kurowski
    Short path queries in planar graphs in constant time. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:143-148 [Conf]
  18. Mikkel Thorup
    Integer priority queues with decrease key in constant time and the single source shortest paths problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:149-158 [Conf]
  19. Camil Demetrescu, Giuseppe F. Italiano
    A new approach to dynamic all pairs shortest paths. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:159-166 [Conf]
  20. Richard Cole, Ramesh Hariharan
    A fast algorithm for computing steiner edge connectivity. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:167-176 [Conf]
  21. Robert Rettinger, Klaus Weihrauch
    The computational complexity of some julia sets. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:177-185 [Conf]
  22. Martin Sauerhoff, Philipp Woelfel
    Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:186-195 [Conf]
  23. Adam Kalai, Rocco A. Servedio
    Boosting in the presence of noise. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:195-205 [Conf]
  24. Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
    Learning juntas. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:206-212 [Conf]
  25. Jeong Han Kim, Van H. Vu
    Generating random regular graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:213-222 [Conf]
  26. Dimitris Achlioptas, Yuval Peres
    The threshold for random k-SAT is 2k (ln 2 - O(k)). [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:223-231 [Conf]
  27. René Beier, Berthold Vöcking
    Random knapsack in expected polynomial time. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:232-241 [Conf]
  28. Nikhil Bansal, Kirk Pruhs
    Server scheduling in the Lp norm: a rising tide lifts all boat. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:242-250 [Conf]
  29. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    Work-competitive scheduling for cooperative computing with dynamic groups. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:251-258 [Conf]
  30. Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert
    A tight time lower bound for space-optimal implementations of multi-writer snapshots. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:259-268 [Conf]
  31. Thomas P. Hayes
    Randomly coloring graphs of girth at least five. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:269-278 [Conf]
  32. Ben Morris, Yuval Peres
    Evolving sets and mixin. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:279-286 [Conf]
  33. Sergey Bobkov, Prasad Tetali
    Modified log-sobolev inequalities, mixing and hypercontractivity. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:287-296 [Conf]
  34. Anna C. Gilbert, Howard J. Karloff
    On the fractal behavior of TCP. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:297-306 [Conf]
  35. Gerth Stølting Brodal, Rolf Fagerberg
    On the limits of cache-obliviousness. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:307-315 [Conf]
  36. Tugkan Batu, Funda Ergün, Joe Kilian, Avner Magen, Sofya Raskhodnikova, Ronitt Rubinfeld, Rahul Sami
    A sublinear algorithm for weakly approximating edit distance. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:316-324 [Conf]
  37. Ryan O'Donnell, Rocco A. Servedio
    New degree bounds for polynomial threshold functions. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:325-334 [Conf]
  38. Ziv Bar-Yossef
    Sampling lower bounds via information theory. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:335-344 [Conf]
  39. Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
    Some 3CNF properties are hard to test. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:345-354 [Conf]
  40. Valentine Kabanets, Russell Impagliazzo
    Derandomizing polynomial identity tests means proving circuit lower bounds. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:355-364 [Conf]
  41. Anupam Gupta, Amit Kumar, Tim Roughgarden
    Simpler and better approximation algorithms for network design. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:365-372 [Conf]
  42. Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram
    Meet and merge: approximation algorithms for confluent flows. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:373-382 [Conf]
  43. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
    Optimal oblivious routing in polynomial time. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:383-388 [Conf]
  44. Jochen Könemann, R. Ravi
    Primal-dual meets local search: approximating MST's with nonuniform degree bounds. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:389-395 [Conf]
  45. Miklós Ajtai
    The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:396-406 [Conf]
  46. Oded Regev
    New lattice based cryptographic constructions. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:407-416 [Conf]
  47. Rosario Gennaro, Yael Gertner, Jonathan Katz
    Lower bounds on the efficiency of encryption and digital signature schemes. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:417-425 [Conf]
  48. Ivan Damgård, Jens Groth
    Non-interactive and reusable non-malleable commitment schemes. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:426-437 [Conf]
  49. Robert Krauthgamer, James R. Lee
    The intrinsic dimensionality of graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:438-447 [Conf]
  50. Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
    A tight bound on approximating arbitrary metrics by tree metrics. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:448-455 [Conf]
  51. Yuri Rabinovich
    On average distortion of embedding metrics into the line and into L1. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:456-462 [Conf]
  52. Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor
    On metric ramsey-type phenomena. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:463-472 [Conf]
  53. Moshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. Mitchell
    Touring a sequence of polygons. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:473-482 [Conf]
  54. Jie Gao, Li Zhang
    Well-separated pair decomposition for the unit-disk graph metric and its applications. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:483-492 [Conf]
  55. Tamal K. Dey, Joachim Giesen, Matthias John
    Alpha-shapes and flow shapes are homotopy equivalent. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:493-502 [Conf]
  56. Baruch Awerbuch, Yossi Azar, Adam Meyerson
    Reducing truth-telling online mechanisms to online optimization. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:503-510 [Conf]
  57. Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler
    Near-optimal network design with selfish agents. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:511-520 [Conf]
  58. Richard Cole, Yevgeniy Dodis, Tim Roughgarden
    Pricing network edges for heterogeneous selfish users. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:521-530 [Conf]
  59. Bernard Chazelle, Ding Liu, Avner Magen
    Sublinear geometric algorithms. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:531-540 [Conf]
  60. Boris Aronov, János Pach, Micha Sharir, Gábor Tardos
    Distinct distances in three and higher dimensions. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:541-546 [Conf]
  61. Boris Aronov, Vladlen Koltun, Micha Sharir
    Cutting triangular cycles of lines in space. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:547-555 [Conf]
  62. Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup
    OPT versus LOAD in dynamic storage allocation. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:556-564 [Conf]
  63. Robert D. Kleinberg, Frank Thomson Leighton
    Consistent load balancing via spread minimization. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:565-574 [Conf]
  64. Micah Adler, Eran Halperin, Richard M. Karp, Vijay V. Vazirani
    A stochastic process on the hypercube with applications to peer-to-peer networks. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:575-584 [Conf]
  65. Eran Halperin, Robert Krauthgamer
    Polylogarithmic inapproximability. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:585-594 [Conf]
  66. Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
    A new multilayered PCP and the hardness of hypergraph vertex cover. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:595-601 [Conf]
  67. Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson
    Extractors: optimal up to constant factors. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:602-611 [Conf]
  68. Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson
    Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:612-621 [Conf]
  69. Anna Östlin, Rasmus Pagh
    Uniform hashing in constant time and linear space. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:622-628 [Conf]
  70. Martin Dietzfelbinger, Philipp Woelfel
    Almost random graphs with simple hash functions. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:629-638 [Conf]
  71. Haim Kaplan, Eyal Molad, Robert Endre Tarjan
    Dynamic rectangular intersection with priorities. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:639-648 [Conf]
  72. Mikkel Thorup
    Space efficient dynamic stabbing with fast queries. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:649-658 [Conf]
  73. Anna Gál, Adi Rosén
    Lower bounds on the amount of randomness in private computation. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:659-666 [Conf]
  74. T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani
    Cell-probe lower bounds for the partial match problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:667-672 [Conf]
  75. T. S. Jayram, Ravi Kumar, D. Sivakumar
    Two applications of information complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:673-682 [Conf]
  76. Yehuda Lindell
    Bounded-concurrent secure two-party computation without setup assumptions. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:683-692 [Conf]
  77. Martin E. Dyer
    Approximate counting by dynamic programming. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:693-699 [Conf]
  78. Noga Alon, Asaf Shapira
    Testing subgraphs in directed graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:700-709 [Conf]
  79. Toshiya Itoh, Yoshinori Takei, Jun Tarui
    On the sample size of k-restricted min-wise independent permutations and other k-wise distributions. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:710-719 [Conf]
  80. Joel Friedman
    A proof of Alon's second eigenvalue conjecture. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:720-724 [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