Generating hard instances of lattice problems
- Miklos Ajtai
- 1996
- STOC 1996
Publications
Date
Featured collections
Popular topics
46 results for Miklós Ajtai
Improved algorithms and analysis for secretary problems and generalizations
- Miklos Ajtai
- Nimrod Megiddo
- et al.
- 1995
- FOCS 1995
Fairness in scheduling
- Miklos Ajtai
- James Aspnes
- et al.
- 1995
- SODA 1995
A theory of competitive analysis for distributed algorithms
- Miklos Ajtai
- James Aspnes
- et al.
- 1994
- FOCS 1994
The independence of the modulo p counting principles
- Miklos Ajtai
- 1994
- STOC 1994
Fault tolerant graphs, perfect hash functions and disjoint paths
- Miklos Ajtai
- N. Alon
- et al.
- 1992
- FOCS 1992
Datalog vs. first-order logic
- Miklos Ajtai
- Yuri Gurevich
- 1989
- FOCS 1989
Complexity of the pigeonhole principle
- Miklos Ajtai
- 1987
- FOCS 1987
Reachability is harder for directed than for undirected finite graphs
- Miklos Ajtai
- Ronald Fagin
- 1987
- FOCS 1987
DETERMINISTIC SIMULATION OF PROBABILISTIC CONSTANT DEPTH CIRCUITS.
- Miklos Ajtai
- Avi Wigderson
- 1984
- FOCS 1984