János Komlós

According to our database1, János Komlós authored at least 56 papers between 1978 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result.
SIAM J. Discrete Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs.
SIAM J. Discrete Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs.
SIAM J. Discrete Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition.
SIAM J. Discrete Math., 2017

2012
Testing Goodness of Fit of Random Graph Models.
Algorithms, 2012

2006
Limit distribution for the existence of Hamiltonian cycles in a random graph.
Discrete Mathematics, 2006

2001
Proof of the Alon-Yuster conjecture.
Discrete Mathematics, 2001

Spanning Trees In Dense Graphs.
Combinatorics, Probability & Computing, 2001

Singularity Probabilities For Random Matrices Over Finite Fields.
Combinatorics, Probability & Computing, 2001

2000
Tiling Turán Theorems.
Combinatorica, 2000

The Regularity Lemma and Its Applications in Graph Theory.
Proceedings of the Theoretical Aspects of Computer Science, 2000

1999
The smallest Ramsey numbers.
Discrete Mathematics, 1999

1998
Matching Nuts and Bolts in O(n log n) Time.
SIAM J. Discrete Math., 1998

An algorithmic version of the blow-up lemma.
Random Struct. Algorithms, 1998

On the Pósa-Seymour conjecture.
Journal of Graph Theory, 1998

1997
Blow-Up Lemma.
Combinatorica, 1997

Covering Odd Cycles.
Combinatorica, 1997

1996
On the square of a Hamiltonian cycle in dense graphs.
Random Struct. Algorithms, 1996

Topological cliques in graphs 2.
Combinatorics, Probability & Computing, 1996

Matching Nuts and Bolts in O(n log n) Time (Extended Abstract).
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995
Almost all trees have tribe number 2 or 3.
Discrete Mathematics, 1995

proof of a Packing Conjecture of Bollobás.
Combinatorics, Probability & Computing, 1995

1994
Topological Cliques in Graphs.
Combinatorics, Probability & Computing, 1994

1993
Effect of Connectivity in an Associative Memory Model.
J. Comput. Syst. Sci., 1993

1992
Almost Tight Bounds for epsilon-Nets.
Discrete & Computational Geometry, 1992

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

1989
Sorting in Average Time o(log) n.
SIAM J. Discrete Math., 1989

Optimal Parallel Selection has Complexity O(Log Log n).
J. Comput. Syst. Sci., 1989

Almost Sorting in one Round.
Advances in Computing Research, 1989

1988
Convergence results in an associative memory model.
Neural Networks, 1988

Effect of Connectivity in Associative Memory Models (Preliminary Version)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987
Deterministic Simulation in LOGSPACE
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986
Deterministic Selection in O(log log N) Parallel Time
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Two lower bounds for branching programs
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'.
IEEE Trans. Information Theory, 1985

An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels.
IEEE Trans. Information Theory, 1985

Probabilistic partitioning algorithms for the rectilinear steiner problem.
Networks, 1985

Linear verification for spanning trees.
Combinatorica, 1985

1984
Hash Functions for Priority Queues
Information and Control, December, 1984

On the distribution of cycle lengths in graphs.
Journal of Graph Theory, 1984

Storing a Sparse Table with 0(1) Worst Case Access Time.
J. ACM, 1984

On optimal matchings.
Combinatorica, 1984

Linear Verification for Spanning Trees
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983
Limit distribution for the existence of hamiltonian cycles in a random graph.
Discrete Mathematics, 1983

Sorting in c log n parallel sets.
Combinatorica, 1983

An O(n log n) Sorting Network
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Hash Functions for Priority Queues
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982
Extremal Uncrowded Hypergraphs.
J. Comb. Theory, Ser. A, 1982

Largest random component of a k-cube.
Combinatorica, 1982

Storing a Sparse Table with O(1) Worst Case Access Time
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981
A Dense Infinite Sidon Sequence.
Eur. J. Comb., 1981

The eigenvalues of random symmetric matrices.
Combinatorica, 1981

The longest path in a random graph.
Combinatorica, 1981

On Turáns theorem for sparse graphs.
Combinatorica, 1981

1980
A Note on Ramsey Numbers.
J. Comb. Theory, Ser. A, 1980

1978
There is no Fast Single Hashing Algorithm.
Inf. Process. Lett., 1978


  Loading...