Sorting and selection with imprecise comparisons
- Miklós Ajtai
- Vitaly Feldman
- et al.
- 2015
- ACM Transactions on Algorithms
Paper
Publications
46 results for Miklós Ajtai
Lower bounds for RAMs and quantifier elimination
- Miklós Ajtai
- 2013
- STOC 2013
Conference paperDeterminism versus nondeterminism with arithmetic tests and computation
- Miklós Ajtai
- 2012
- STOC 2012
Conference paperSecure computation with information leaking to an adversary
- Miklós Ajtai
- 2011
- STOC 2011
Conference paperOblivious RAMs without cryptogrpahic assumptions
- Miklós Ajtai
- 2010
- STOC 2010
Conference paperRepresenting hard lattices with O(n log n) bits
- Miklós Ajtai
- 2005
- CIC 2005
Conference paperA non-linear time lower bound for boolean branching programs
- Miklós Ajtai
- 2005
- Theory of Computing
PaperA conjecture about polynomial time computable lattice-lattice functions
- Miklós Ajtai
- 2004
- STOC 2004
Conference paperThe worst-case behavior of Schnorr's algorithm approximating the shortest nonzero vector in a lattice
- Miklós Ajtai
- 2003
- STOC 2003
Conference paperRandom lattices and a conjectured 0 - 1 law about their polynomial time computable properties
- Miklós Ajtai
- 2002
- FOCS 2002
Conference paper