Demo Data from EDBT 2026 / reviewers in the wild / expert
Ajay Nerurkar
dblp:63/869
· DBLP profile ↗
6ranked-venue papers
0as first author
0since 2021 · last 2000
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 6Databases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
3 papers |
Computational complexity · 100% | |
| Network and information security
2 papers |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography |
0.0 | 2 | 1998 | An Improved Worst-Case to Average-Case Connection for Lattice Problems · FOCS 1997 Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions · CCC 1998 |
Computational complexity
circuit complexity |
0.0 | 1 | 1999 | Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time · STOC 1999 |
Computational complexity › structural complexity
hierarchy theorems |
0.0 | 1 | 1999 | Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time · STOC 1999 |
Computational complexity
randomized computation |
0.0 | 1 | 1999 | Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time · STOC 1999 |
Computational complexity
lattice problems |
0.0 | 1 | 1998 | Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions · CCC 1998 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
lattice problems |
0.0 | 1 | 1997 | An Improved Worst-Case to Average-Case Connection for Lattice Problems · FOCS 1997 |
Computational complexity
average-case complexity |
0.0 | 1 | 1997 | An Improved Worst-Case to Average-Case Connection for Lattice Problems · FOCS 1997 |
Computational complexity › average-case complexity
worst-case to average-case reduction |
0.0 | 1 | 1997 | An Improved Worst-Case to Average-Case Connection for Lattice Problems · FOCS 1997 |
Computational complexity › computational hardness
hardness assumptions |
0.0 | 1 | 1999 | Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time · STOC 1999 |
Methods — techniques the papers use, named apart from their topics
worst-case to average-case reduction · 0.0hierarchy theorems · 0.0hardness assumptions · 0.0randomized reductions · 0.0randomized reduction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | A note on the non-NP-hardness of approximate lattice problems under general Cook reductions
Jin-Yi Cai, Ajay Nerurkar |
Inf. Process. Lett. | 2 |
| 1999 | On Routing in Circulant Graphs
Jin-Yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor E. Shparlinski |
COCOON | 4 |
| 1999 | Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial TimeabstractWe prove tight hierarchy theorems for bounded error probabilistic quasi-polynomial time classes, under se"-era1 hardness assumptions.We show that if either (1) the Permanent does not have a subexponential time BP algorithm, or (2) some function in EXPTIME does not have subexponential size circuits, then for every lSa Jin-Yi Cai, Ajay Nerurkar |
STOC | 2 |
| 1999 | Approximating the SVP to within a Factor (1+1/dimxi) Is NP-Hard under Randomized Reductions
Jin-Yi Cai, Ajay Nerurkar |
J. Comput. Syst. Sci. | 2 |
| 1998 | Approximating the SVP to within a Factor is NP-Hard under Randomized ReductionsabstractRecently M. Ajtai showed that to approximate the shortest lattice vector in the l/sub 2/-norm within a factor (1+2(-dim/sup k/)), for a sufficiently large constant k, is NP-hard under randomized reductions. We improve this result to show that to approximate a shortest lattice vector within a factor (1+dim/sup -/spl epsiv//), for any /spl epsiv/>0, is NP-hard under randomized reductions. Our proof also works for arbitrary l/sub p/-norms, 1/spl les/p Jin-Yi Cai, Ajay Nerurkar |
CCC | 2 |
| 1997 | An Improved Worst-Case to Average-Case Connection for Lattice ProblemsabstractWe improve a connection of the worst-case complexity and the average-case complexity of some well-known lattice problems. This fascinating connection was first discovered by Ajtai (1995). We improve the exponent of this connection from 8 to 3.5+/spl epsiv/. Jin-Yi Cai, Ajay Nerurkar |
FOCS | 2 |