Miklós Ajtai Random Lattices and a Conjectured 0 - 1 Law about Their Polynomial Time Computable Properties. [Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:733-742 [Conf]
Miklós Ajtai Generating Hard Instances of Lattice Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP] STOC, 1996, pp:99-108 [Conf]
Miklós Ajtai The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions (Extended Abstract). [Citation Graph (0, 0)][DBLP] STOC, 1998, pp:10-19 [Conf]
Miklós Ajtai Determinism versus Non-Determinism for Linear Time RAMs (Extended Abstract). [Citation Graph (0, 0)][DBLP] STOC, 1999, pp:632-641 [Conf]
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]
Miklós Ajtai First-Order Definability on Finite Structures. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1989, v:45, n:3, pp:211-225 [Journal]
Miklós Ajtai A lower bound for finding predecessors in Yao's call probe model. [Citation Graph (0, 0)][DBLP] Combinatorica, 1988, v:8, n:3, pp:235-247 [Journal]
Miklós Ajtai A conjectured 0-1 law about the polynomial time computable properties of random lattices, I. [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:061, pp:- [Journal]
Miklós Ajtai The Independence of the modulo p Counting Principles [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:14, pp:- [Journal]
Miklós Ajtai Symmetric Systems of Linear Equations modulo p. [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:15, pp:- [Journal]
Miklós Ajtai Generating Hard Instances of Lattice Problems [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:7, pp:- [Journal]
Miklós Ajtai The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions. [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:47, pp:- [Journal]
Miklós Ajtai Determinism versus Non-Determinism for Linear Time RAMs with Memory Restrictions [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:77, pp:- [Journal]
Miklós Ajtai A Non-linear Time Lower Bound for Boolean Branching Programs [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:26, pp:- [Journal]
Miklós Ajtai Determinism versus Nondeterminism for Linear Time RAMs with Memory Restrictions. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2002, v:65, n:1, pp:2-37 [Journal]
Miklós Ajtai, Nimrod Megiddo A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimensions. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:6, pp:1171-1195 [Journal]
Miklós Ajtai Generalizations of the Compactness Theorem and Gödel's Completeness Theorem for Nonstandard Finite Structures. [Citation Graph (0, 0)][DBLP] TAMC, 2007, pp:13-33 [Conf]
Sorting and Selection with Imprecise Comparisons. [Citation Graph (, )][DBLP]
Oblivious RAMs without cryptogrpahic assumptions. [Citation Graph (, )][DBLP]
The First and Fourth Public-Key Cryptosystems with Worst-Case/Average-Case Equivalence.. [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.460secs
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