Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Ajtai, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generating hard instances of lattice problems
M. Ajtai
Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pennsylvania, May 22-24, 1996)
, 1996, pp. 99-108
Recursive construction for 3-regular expanders
M. Ajtai
Combinatorica
14
(2), 1994, pp. 379-416
The complexity of the pigeonhole principle
M. Ajtai
Combinatorica
14
(2), 1994, pp. 417-433
Recursive construction for 3-regular expanders
M. Ajtai
Combinatorica
14
(4), 1994, pp. 379-416
The complexity of the pigeonhole principle
M. Ajtai
Combinatorica
14
(4), 1994, pp. 417-433
Fault tolerant graphs, perfect hash functions and disjoint paths
M. Ajtai
,
N. Alon
,
J. Bruck
,
R. Cypher
,
C.T. Ho
,
M. Naor
,
E. Szemerédi
Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'92 (Pittsburgh, PA, October 24-27, 1992)
, 1992, pp. 693-702
Datalog vs.~first-order logic
M. Ajtai
,
Y. Gurevich
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 142-147
Sorting in average time
o(\log n)
M. Ajtai
,
D. Karabeg
,
J. Komlós
,
E. Szemerédi
SIAM Journal on Discrete Mathematics
2
, 1989, pp. 285-292
Reachability is harder for directed than for undirected finite graphs
M. Ajtai
,
R. Fagin
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 358-367
The complexity of the pigeonhole principle
M. Ajtai
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 346-355
A lower bound for finding predecessors in Yao's cell probe model
M. Ajtai
Combinatorica
8
, 1988, pp. 235-247
Almost sorting in one round
M. Ajtai
,
J. Komlós
,
W.L. Steiger
,
E. Szemerédi
Technical Report (DCS-TR-212), 1987, March
Deterministic simulation in LOGSPACE
M. Ajtai
,
J. Komlós
,
E. Szemerédi
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 132-140
Approximate counting with uniform constant depth circuits
M. Ajtai
Technical Report (RJ 5896), 1987, October
Recursive construction for 3-regular expanders
M. Ajtai
Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, FOCS'87 (Los Angeles, CA, October 12-14, 1987)
, 1987, pp. 295-304
Two lower bounds for branching programs
M. Ajtai
,
L. Babai
,
P. Hajnal
,
J. Komlós
,
P. Pudlak
,
V. Rodl
,
E. Szemerédi
,
G. Turan
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 30-38
Deterministic selection in
O(\log\log n)
parallel time
M. Ajtai
,
J. Komlós
,
W.L. Steiger
,
E. Szemerédi
Technical Report (DCS-TR-174), 1986, February
Deterministic selection in
O(\log\log N)
parallel time
M. Ajtai
,
J. Komlós
,
W.L. Steiger
,
E. Szemerédi
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 188-195
Deterministic simulation of probabilistic constant depth circuits
M. Ajtai
,
A. Wigderson
Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, FOCS'85 (Portland, OR, October 21-23, 1985)
, 1985, pp. 11-19
First-order definability on finite structures
M. Ajtai
Technical Report (RJ 4705), 1985, May
A lower bound for finding predecessors in Yao's cell probe model
M. Ajtai
Technical Report (RJ 4867), 1985, October
A theorem on probabilistic constant depth computations
M. Ajtai
,
M. Ben-Or
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC'84 (Washington, DC, April 30 - May 2, 1984)
, 1984, pp. 471-474
Hash functions for priority queues
M. Ajtai
,
M. Fredman
,
J. Komlós
Information and Control
63
(3), 1984, pp. 217-225
On optimal matchings
M. Ajtai
,
J. Komlós
,
G. Tusnády
Combinatorica
4
, 1984, pp. 259-264
Hash functions for priority queues
M. Ajtai
,
M. Fredman
,
J. Komlós
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 299-303
Seiten 1
2
>