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="Koml{\'o}s, J{\'a}nos"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tiling Turán theorems
János Komlós
Combinatorica
20
(2), 2000, pp. 203-218
Matching nuts and bolts in
O(n \log n)
time
János Komlós
,
Yuan Ma
,
Endre Szemerédi
SIAM Journal on Discrete Mathematics
11
(3), 1998, pp. 347-372
On the Pósa-Seymour conjecture
János Komlós
,
Gábor N. Sárközy
,
Endre Szemerédi
Journal of Graph Theory
29
(3), 1998, pp. 167-176
Szemerédi's regularity lemma and its applications in graph theory
János Komlós
,
Miklós Simonovits
Technical Report (96-10), 1996
Effect of connectivity in an associative memory model
János Komlós
,
Ramamohan Paturi
Journal of Computer and System Sciences
47
(2), 1993, pp. 350-373
Halvers and expanders
Miklós Ajtai
,
János Komlós
,
Endre Szemerédi
Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'92 (Pittsburgh, PA, October 24-27, 1992)
, 1992, pp. 686-692
Optimal parallel selection has complexity
O(\log\log n)
Miklós Ajtai
,
János Komlós
,
W.L. Steiger
,
Endre Szemerédi
Journal of Computer and System Sciences
38
, 1989, pp. 125-133
Deterministic simulation in LOGSPACE
Miklós Ajtai
,
János Komlós
,
Endre Szemerédi
misc, 1987
The longest path in a random graph
Miklós Ajtai
,
János Komlós
,
Endre Szemerédi
Combinatorica
1
, 1981, pp. 1-12
A note on Ramsey numbers
Miklós Ajtai
,
János Komlós
,
Endre Szeméredi
Journal of Combinatorial Theory Series A
29
, 1980, pp. 354-360