The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Oded Regev: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Baruch Awerbuch, Yossi Azar, Oded Regev
    Maximizing job benefits on-line. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:42-50 [Conf]
  2. Venkatesan Guruswami, Daniele Micciancio, Oded Regev
    The Complexity of the Covering Radius Problem on Lattices and Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:161-173 [Conf]
  3. Ishay Haviv, Oded Regev
    Hardness of the Covering Radius Problem on Lattices. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:145-158 [Conf]
  4. Subhash Khot, Oded Regev
    Vertex Cover Might be Hard to Approximate to within 2-\varepsilon. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:379-0 [Conf]
  5. Oded Regev
    Improved Inapproximability of Lattice and Coding Problems with Preprocessing. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:363-370 [Conf]
  6. József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy
    Long monotone paths in line arrangements. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:124-128 [Conf]
  7. Oded Regev
    Lattice-Based Cryptography. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:131-141 [Conf]
  8. Yossi Azar, Oded Regev
    Off-Line Temporary Tasks Assignment. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:163-171 [Conf]
  9. Phong Q. Nguyen, Oded Regev
    Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2006, pp:271-288 [Conf]
  10. Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev
    Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:42-51 [Conf]
  11. Dorit Aharonov, Oded Regev
    A Lattice Problem in Quantum NP. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:210-219 [Conf]
  12. Dorit Aharonov, Oded Regev
    Lattice Problems in NP cap coNP. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:362-371 [Conf]
  13. Amit Chakrabarti, Oded Regev
    An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:473-482 [Conf]
  14. Irit Dinur, Oded Regev, Clifford D. Smyth
    The Hardness of 3 - Uniform Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:33-0 [Conf]
  15. Daniele Micciancio, Oded Regev
    Worst-Case to Average-Case Reductions Based on Gaussian Measures. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:372-381 [Conf]
  16. Oded Regev
    Quantum Computation and Lattice Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:520-529 [Conf]
  17. Julia Kempe, Alexei Kitaev, Oded Regev
    The Complexity of the Local Hamiltonian Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:372-383 [Conf]
  18. Noam Nisan, Shmulik London, Oded Regev, Noam Camiel
    Globally Distributed Computation over the Internet - The POPCORN Project. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1998, pp:592-601 [Conf]
  19. Yossi Azar, Oded Regev
    Strongly Polynomial Algorithms for the Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:15-29 [Conf]
  20. Yossi Azar, Oded Regev
    On-Line Bin-Stretching. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:71-81 [Conf]
  21. Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev
    Temporary tasks assignment resolved. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:116-124 [Conf]
  22. Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev
    Minimizing the Flow Time Without Migration. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:198-205 [Conf]
  23. 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]
  24. Irit Dinur, Elchanan Mossel, Oded Regev
    Conditional hardness for approximate coloring. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:344-353 [Conf]
  25. Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf
    Bounded-error quantum state identification and exponential separations in communication complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:594-603 [Conf]
  26. Oded Regev
    New lattice based cryptographic constructions. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:407-416 [Conf]
  27. Oded Regev
    On lattices, learning with errors, random linear codes, and cryptography. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:84-93 [Conf]
  28. Oded Regev, Ricky Rosen
    Lattice problems and norm embeddings. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:447-456 [Conf]
  29. Yossi Azar, Oded Regev
    Combinatorial Algorithms for the Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:1, pp:49-66 [Journal]
  30. Venkatesan Guruswami, Daniele Micciancio, Oded Regev
    The complexity of the covering radius problem. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:2, pp:90-121 [Journal]
  31. Irit Dinur, Oded Regev, Clifford D. Smyth
    The Hardness of 3-Uniform Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:5, pp:519-535 [Journal]
  32. Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
    A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  33. Oded Regev
    New Lattice Based Cryptographic Constructions [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  34. Oded Regev
    Quantum Computation and Lattice Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  35. Julia Kempe, Alexei Kitaev, Oded Regev
    The Complexity of the Local Hamiltonian Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  36. József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy
    Long Monotone Paths in Line Arrangements. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:2, pp:167-176 [Journal]
  37. Amit Chakrabarti, Oded Regev
    An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:070, pp:- [Journal]
  38. Irit Dinur, Elchanan Mossel, Oded Regev
    Conditional Hardness for Approximate Coloring [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:039, pp:- [Journal]
  39. Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev
    On-line restricted assignment of temporary tasks with unknown durations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:2, pp:67-72 [Journal]
  40. Oded Regev
    Priority algorithms for makespan minimization in the subset model. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:3, pp:153-157 [Journal]
  41. Dorit Aharonov, Oded Regev
    Lattice problems in NP cap coNP. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:5, pp:749-765 [Journal]
  42. Oded Regev
    New lattice-based cryptographic constructions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:6, pp:899-942 [Journal]
  43. Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev
    Minimizing the Flow Time Without Migration. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1370-1382 [Journal]
  44. Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
    A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:5, pp:1129-1146 [Journal]
  45. Julia Kempe, Alexei Kitaev, Oded Regev
    The Complexity of the Local Hamiltonian Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:5, pp:1070-1097 [Journal]
  46. Oded Regev
    Quantum Computation and Lattice Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:3, pp:738-760 [Journal]
  47. Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev
    Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:166-194 [Journal]
  48. Daniele Micciancio, Oded Regev
    Worst-Case to Average-Case Reductions Based on Gaussian Measures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:267-302 [Journal]
  49. Yossi Azar, Oded Regev
    On-line bin-stretching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:1, pp:17-41 [Journal]
  50. Yossi Azar, Oded Regev, Jiri Sgall, Gerhard J. Woeginger
    Off-line temporary tasks assignment. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:419-428 [Journal]
  51. Oded Regev
    Improved Inapproximability of Lattice and Coding Problems With Preprocessing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:9, pp:2031-2037 [Journal]
  52. Ishay Haviv, Oded Regev
    Tensor-based hardness of the shortest vector problem to within almost polynomial factors. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:469-477 [Conf]
  53. Irit Dinur, Elchanan Mossel, Oded Regev
    Conditional Hardness for Approximate Coloring [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]

  54. Learning with Errors over Rings. [Citation Graph (, )][DBLP]


  55. The Euclidean Distortion of Flat Tori. [Citation Graph (, )][DBLP]


  56. Better Gap-Hamming Lower Bounds via Better Round Elimination. [Citation Graph (, )][DBLP]


  57. No Strong Parallel Repetition with Entangled and Non-signaling Provers. [Citation Graph (, )][DBLP]


  58. The Learning with Errors Problem (Invited Survey). [Citation Graph (, )][DBLP]


  59. The Unique Games Conjecture with Entangled Provers is False. [Citation Graph (, )][DBLP]


  60. Lattice Enumeration Using Extreme Pruning. [Citation Graph (, )][DBLP]


  61. On Ideal Lattices and Learning with Errors over Rings. [Citation Graph (, )][DBLP]


  62. A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs. [Citation Graph (, )][DBLP]


  63. Simulating Quantum Correlations with Finite Communication. [Citation Graph (, )][DBLP]


  64. Rounding Parallel Repetitions of Unique Games. [Citation Graph (, )][DBLP]


  65. Unique Games with Entangled Provers are Easy. [Citation Graph (, )][DBLP]


  66. Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing. [Citation Graph (, )][DBLP]


  67. Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete. [Citation Graph (, )][DBLP]


  68. Impossibility of a Quantum Speed-Up with a Faulty Oracle. [Citation Graph (, )][DBLP]


  69. Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity [Citation Graph (, )][DBLP]


  70. No Strong Parallel Repetition with Entangled and Non-signaling Provers [Citation Graph (, )][DBLP]


  71. Better Gap-Hamming Lower Bounds via Better Round Elimination [Citation Graph (, )][DBLP]


  72. A Note on the Distribution of the Distance from a Lattice. [Citation Graph (, )][DBLP]


Search in 0.046secs, Finished in 0.048secs
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