Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all domains
Limit my searches in the following domains
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Co-authors
(102)
Julia Kempe
14
Yossi Azar
11
Ronald De Wolf
10
Orkan M. Umurhan
9
Dorit Aharonov
8
Conferences
(16)
FOCS
10
STOC
5
CCC
4
ICALP
3
CoCo
3
Journals
(29)
SIAMCOMP
11
CORR
8
JACM
5
ASTRON ASTROPHYS
5
ASTROPHYS J
5
Keywords
(240)
Embed
Subscribe
Academic
Authors
Oded Regev
Edit
Oded Regev
Tel Aviv University
Publications: 132
|
Citations: 2390
|
G-Index: 45
|
H-Index: 29
The information is calculated based on the tens of millions of scholarly articles currently discoverable within Microsoft Academic Search. As more content gets indexed, the accuracy and completeness will continue to improve.
Interests:
Algorithms & Theory
,
Scientific Computing
,
Astrophysics & Space Science
View FAQ about top research area and research interests
Collaborated with
102 co-authors
from 1991 to 2011
; Cited by
1834 authors
Homepage
|
Bing
Cumulative
Annual
Order by:
Publications
(132)
BibTeX
|
RIS
|
RefWorks
Download
Near-Optimal and Explicit Bell Inequality Violations
(
Citations: 1
)
Harry Buhrman
,
Oded Regev
,
Giannicola Scarpa
,
Ronald de Wolf
Conference:
Annual IEEE Conference on Computational Complexity - CCC
, pp. 157-166, 2011
Bell Violations through Independent Bases Games
(
Citations: 1
)
Oded Regev
Published in 2011.
On Ideal Lattices and Learning with Errors over Rings
(
Citations: 11
)
Vadim Lyubashevsky
,
Chris Peikert
,
Oded Regev
Conference:
Theory and Application of Cryptographic Techniques - EUROCRYPT
, pp. 1-23, 2010
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
(
Citations: 3
)
Amit Chakrabarti
,
Oded Regev
Journal:
Computing Research Repository - CORR
, vol. abs/1009.3, 2010
Lattice Enumeration Using Extreme Pruning
(
Citations: 6
)
Nicolas Gama
,
Phong Q. Nguyen
,
Oded Regev
Conference:
Theory and Application of Cryptographic Techniques - EUROCRYPT
, pp. 257-278, 2010
Order by:
Citations
(2390 times by 1389 publications)
On the Hardness of Approximating the Network Coding Capacity
(
Citations: 7
)
Michael Langberg
,
Alexander Sprintson
Journal:
IEEE Transactions on Information Theory - TIT
, vol. 57, no. 2, pp. 1008-1014, 2011
Implementing Gentry's Fully-Homomorphic Encryption Scheme
(
Citations: 6
)
Craig Gentry
,
Shai Halevi
Conference:
Theory and Application of Cryptographic Techniques - EUROCRYPT
, pp. 129-148, 2011
A Stronger Model of Dynamic Programming Algorithms
(
Citations: 2
)
Joshua Buresh-Oppenheim
,
Sashka Davis
,
Russell Impagliazzo
Journal:
Algorithmica
, vol. 60, no. 4, pp. 938-968, 2011
Fully Simulatable Quantum-Secure Coin-Flipping and Applications
(
Citations: 3
)
Carolin Lunemann
,
Jesper Buus Nielsen
Published in 2011.
Cryptographic Protocols under Quantum Attacks
(
Citations: 1
)
Carolin Lunemann
Journal:
Computing Research Repository - CORR
, vol. abs/1102.0, 2011
Comments