The following pages link to Miklós Ajtai (Q684397):
Displaying 30 items.
- (Q3972306) (← links)
- (Q4035300) (← links)
- (Q4036706) (← links)
- (Q4059020) (← links)
- (Q4079651) (← links)
- Fairness in Scheduling (Q4225867) (← links)
- (Q4228443) (← links)
- (Q4228444) (← links)
- (Q4228459) (← links)
- (Q4252732) (← links)
- (Q4284606) (← links)
- (Q4287354) (← links)
- (Q4526993) (← links)
- (Q4542515) (← links)
- (Q4542549) (← links)
- (Q4787194) (← links)
- (Q4850543) (← links)
- (Q4871074) (← links)
- (Q4886081) (← links)
- (Q4938616) (← links)
- A sieve algorithm for the shortest lattice vector problem (Q5176018) (← links)
- (Q5414564) (← links)
- Determinism versus nondeterminism with arithmetic tests and computation (Q5415479) (← links)
- Secure computation with information leaking to an adversary (Q5419142) (← links)
- Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures (Q5425417) (← links)
- (Q5465355) (← links)
- Lower bounds for RAMs and quantifier elimination (Q5495851) (← links)
- (Q5575665) (← links)
- (Q5674034) (← links)
- A Deterministic ${\operatorname{Poly}}(\log \log N)$-Time<i>N</i>-Processor Algorithm for Linear Programming in Fixed Dimension (Q5691289) (← links)