H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 41 Citations 16,739 93 World Ranking 4243 National Ranking 2135

Overview

What is he best known for?

The fields of study he is best known for:

  • Combinatorics
  • Algebra
  • Quantum mechanics

His scientific interests lie mostly in Lattice problem, Discrete mathematics, Learning with errors, Combinatorics and Lattice-based cryptography. His Lattice problem research entails a greater understanding of Lattice. His Discrete mathematics study combines topics in areas such as Ring, Ideal, Algebraic number and Pseudorandomness.

He has included themes like Modulus, Quantum algorithm, Algebraic number field and Theoretical computer science in his Learning with errors study. His Combinatorics research incorporates themes from Quantum computer and Quantum. His biological study spans a wide range of topics, including Algorithm and Qubit.

His most cited work include:

  • On lattices, learning with errors, random linear codes, and cryptography (1310 citations)
  • On lattices, learning with errors, random linear codes, and cryptography (856 citations)
  • On ideal lattices and learning with errors over rings (785 citations)

What are the main themes of his work throughout his whole career to date?

Oded Regev mainly focuses on Combinatorics, Discrete mathematics, Lattice problem, Quantum and Upper and lower bounds. His Combinatorics research is multidisciplinary, incorporating perspectives in Computational complexity theory, Lattice and Polynomial. His Discrete mathematics research integrates issues from Quantum entanglement, Rounding, Dimension and Quantum computer.

His Lattice problem study combines topics from a wide range of disciplines, such as Cryptosystem, Quantum algorithm and Learning with errors. His work carried out in the field of Quantum brings together such families of science as Function, Computation and Binary logarithm. His studies in Upper and lower bounds integrate themes in fields like Boolean function, Directed graph, Communication complexity, Asymptotically optimal algorithm and Hamming distance.

He most often published in these fields:

  • Combinatorics (56.62%)
  • Discrete mathematics (44.29%)
  • Lattice problem (15.98%)

What were the highlights of his more recent work (between 2014-2021)?

  • Combinatorics (56.62%)
  • Discrete mathematics (44.29%)
  • Upper and lower bounds (15.53%)

In recent papers he was focusing on the following fields of study:

His primary scientific interests are in Combinatorics, Discrete mathematics, Upper and lower bounds, Lattice and Function. Oded Regev works mostly in the field of Combinatorics, limiting it down to topics relating to Bounded function and, in certain cases, Spectral gap and Chernoff bound, as a part of the same area of interest. Oded Regev combines subjects such as Lattice problem and Quantum algorithm with his study of Discrete mathematics.

His Lattice problem research is multidisciplinary, incorporating elements of Reduction, Algebraic number, Quantum, Learning with errors and Algebraic number field. His work deals with themes such as Boolean function, Torus, Regular polygon, Counting problem and Distortion, which intersect with Upper and lower bounds. His study in Lattice is interdisciplinary in nature, drawing from both SIMPLE algorithm, Heat kernel, Mathematical analysis and Gaussian measure.

Between 2014 and 2021, his most popular works were:

  • Pseudorandomness of ring-LWE for any ring and modulus (77 citations)
  • Recovering Short Generators of Principal Ideals in Cyclotomic Rings (69 citations)
  • Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract (66 citations)

In his most recent research, the most cited papers focused on:

  • Combinatorics
  • Algebra
  • Quantum mechanics

His primary areas of study are Combinatorics, Discrete mathematics, Lattice, Quantum and Lattice problem. Oded Regev is involved in the study of Combinatorics that focuses on Binary logarithm in particular. Oded Regev interconnects Quantum entanglement and Dimension in the investigation of issues within Discrete mathematics.

His Lattice study incorporates themes from Algorithm, Gaussian measure, Heat kernel and Conjecture. His work on Quantum algorithm as part of general Quantum study is frequently linked to Random assignment, therefore connecting diverse disciplines of science. He usually deals with Lattice problem and limits it to topics linked to Algebraic number field and Analytic number theory, Principal ideal, Learning with errors and Modulus.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

On lattices, learning with errors, random linear codes, and cryptography

Oded Regev.
Journal of the ACM (2009)

3180 Citations

Worst-Case to Average-Case Reductions Based on Gaussian Measures

Daniele Micciancio;Oded Regev.
SIAM Journal on Computing (2007)

1011 Citations

On ideal lattices and learning with errors over rings

Vadim Lyubashevsky;Chris Peikert;Oded Regev.
theory and application of cryptographic techniques (2010)

898 Citations

Vertex cover might be hard to approximate to within 2-ε

Subhash Khot;Oded Regev.
Journal of Computer and System Sciences (2008)

784 Citations

Classical hardness of learning with errors

Zvika Brakerski;Adeline Langlois;Chris Peikert;Oded Regev.
symposium on the theory of computing (2013)

523 Citations

The Complexity of the Local Hamiltonian Problem

Julia Kempe;Alexei Kitaev;Oded Regev.
SIAM Journal on Computing (2006)

508 Citations

Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation

Dorit Aharonov;Wim van Dam;Julia Kempe;Zeph Landau.
SIAM Journal on Computing (2007)

432 Citations

Lattice-based cryptography

Oded Regev.
international cryptology conference (2006)

392 Citations

A Toolkit for Ring-LWE Cryptography

Vadim Lyubashevsky;Chris Peikert;Oded Regev.
theory and application of cryptographic techniques (2013)

364 Citations

New lattice-based cryptographic constructions

Oded Regev.
Journal of the ACM (2004)

337 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Oded Regev

Vinod Vaikuntanathan

Vinod Vaikuntanathan

MIT

Publications: 60

Chris Peikert

Chris Peikert

University of Michigan–Ann Arbor

Publications: 60

Subhash Khot

Subhash Khot

New York University

Publications: 47

Elchanan Mossel

Elchanan Mossel

MIT

Publications: 45

Venkatesan Guruswami

Venkatesan Guruswami

Carnegie Mellon University

Publications: 39

Craig Gentry

Craig Gentry

Algorand Foundation

Publications: 37

Zvika Brakerski

Zvika Brakerski

Weizmann Institute of Science

Publications: 37

Daniele Micciancio

Daniele Micciancio

University of California, San Diego

Publications: 34

Shai Halevi

Shai Halevi

Algorand Foundation

Publications: 34

Johannes Buchmann

Johannes Buchmann

TU Darmstadt

Publications: 33

Huaxiong Wang

Huaxiong Wang

Nanyang Technological University

Publications: 32

Ryan O'Donnell

Ryan O'Donnell

Carnegie Mellon University

Publications: 28

San Ling

San Ling

Nanyang Technological University

Publications: 26

Kristin E. Lauter

Kristin E. Lauter

Facebook (United States)

Publications: 25

Willy Susilo

Willy Susilo

University of Wollongong

Publications: 24

Something went wrong. Please try again later.