János Komlós

Emily Sergel

Gábor E. Tusnády

Electron. J. Comb., 2020

2017

The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

2012

Testing Goodness of Fit of Random Graph Models.

[BibT_eX]

[DOI]

Algorithms, 2012

2001

Proof of the Alon-Yuster conjecture.

[BibT_eX]

[DOI]

Discret. Math., 2001

Spanning Trees In Dense Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2001

Singularity Probabilities For Random Matrices Over Finite Fields.

[BibT_eX]

[DOI]

Jeff Kahn

Comb. Probab. Comput., 2001

2000

Tiling Turán Theorems.

[BibT_eX]

[DOI]

Comb., 2000

The Regularity Lemma and Its Applications in Graph Theory.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computer Science, 2000

1999

The smallest Ramsey numbers.

[BibT_eX]

[DOI]

Rita Csákány

Discret. Math., 1999

1998

Matching Nuts and Bolts in O(n log n) Time.

[BibT_eX]

[DOI]

Yuan Ma

SIAM J. Discret. Math., 1998

An algorithmic version of the blow-up lemma.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

On the Pósa-Seymour conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

1997

Blow-Up Lemma.

[BibT_eX]

[DOI]

Comb., 1997

Covering Odd Cycles.

[BibT_eX]

[DOI]

Comb., 1997

1996

On the square of a Hamiltonian cycle in dense graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

Topological cliques in graphs 2.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

Matching Nuts and Bolts in O(n log n) Time (Extended Abstract).

[BibT_eX]

[DOI]

Yuan Ma

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995

Almost all trees have tribe number 2 or 3.

[BibT_eX]

[DOI]

William O. J. Moser

Discret. Math., 1995

proof of a Packing Conjecture of Bollobás.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1995

1994

Topological Cliques in Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1994

1993

Effect of Connectivity in an Associative Memory Model.

[BibT_eX]

[DOI]

Ramamohan Paturi

J. Comput. Syst. Sci., 1993

1992

Almost Tight Bounds for epsilon-Nets.

[BibT_eX]

[DOI]

János Pach

Gerhard J. Woeginger

Discret. Comput. Geom., 1992

Halvers and Expanders

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1989

Sorting in Average Time o(log) n.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1989

Optimal Parallel Selection has Complexity O(Log Log n).

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1989

Almost Sorting in one Round.

[BibT_eX]

Adv. Comput. Res., 1989

1988

Convergence results in an associative memory model.

[BibT_eX]

[DOI]

Ramamohan Paturi

Neural Networks, 1988

Effect of Connectivity in Associative Memory Models (Preliminary Version)

[BibT_eX]

[DOI]

Ramamohan Paturi

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987

Deterministic Simulation in LOGSPACE

[BibT_eX]

[DOI]

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986

Deterministic Selection in O(log log N) Parallel Time

[BibT_eX]

[DOI]

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Two lower bounds for branching programs

[BibT_eX]

[DOI]

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985

Correction to 'An Asymptotically Nonadaptive Algorithm for Conflict Resolution in Multiple-Access Channels'.

[BibT_eX]

[DOI]

Albert G. Greenberg

IEEE Trans. Inf. Theory, 1985

An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels.

[BibT_eX]

[DOI]

Albert G. Greenberg

IEEE Trans. Inf. Theory, 1985

Probabilistic partitioning algorithms for the rectilinear steiner problem.

[BibT_eX]

[DOI]

M. T. Shing

Networks, 1985

Linear verification for spanning trees.

[BibT_eX]

[DOI]

Comb., 1985

1984

Hash Functions for Priority Queues

[BibT_eX]

[DOI]

Michael L. Fredman

Inf. Control., December, 1984

On the distribution of cycle lengths in graphs.

[BibT_eX]

[DOI]

András Gyárfás

J. Graph Theory, 1984

Storing a Sparse Table with 0(1) Worst Case Access Time.

[BibT_eX]

[DOI]

Michael L. Fredman

J. ACM, 1984

On optimal matchings.

[BibT_eX]

[DOI]

Gábor E. Tusnády

Comb., 1984

1983

Limit distribution for the existence of hamiltonian cycles in a random graph.

[BibT_eX]

[DOI]

Discret. Math., 1983

Sorting in c log n parallel sets.

[BibT_eX]

[DOI]

Comb., 1983

An O(n log n) Sorting Network

[BibT_eX]

[DOI]

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1982

Extremal Uncrowded Hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1982

Largest random component of a k-cube.

[BibT_eX]

[DOI]

Comb., 1982

Storing a Sparse Table with O(1) Worst Case Access Time

[BibT_eX]

[DOI]

Michael L. Fredman

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981

A Dense Infinite Sidon Sequence.

[BibT_eX]

[DOI]

Eur. J. Comb., 1981

The eigenvalues of random symmetric matrices.

[BibT_eX]

[DOI]

Zoltán Füredi

Comb., 1981

The longest path in a random graph.

[BibT_eX]

[DOI]

Comb., 1981

On Turáns theorem for sparse graphs.

[BibT_eX]

[DOI]

Comb., 1981

1980

A Note on Ramsey Numbers.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1980

1978

There is no Fast Single Hashing Algorithm.

[BibT_eX]

[DOI]