J
János Komlós
Researcher at University of California, San Diego
Publications - 33
Citations - 5127
János Komlós is an academic researcher from University of California, San Diego. The author has contributed to research in topics: Sorting & Random regular graph. The author has an hindex of 24, co-authored 33 publications receiving 4834 citations. Previous affiliations of János Komlós include Hungarian Academy of Sciences & McGill University.
Papers
More filters
Journal ArticleDOI
Storing a Sparse Table with 0(1) Worst Case Access Time
TL;DR: A data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time and is easy to implement.
Journal ArticleDOI
The eigenvalues of random symmetric matrices
Zoltán Füredi,János Komlós +1 more
TL;DR: It is shown that with probability 1-o(1)all eigenvalues belong to the above intervalI if μ=0, while in case μ>0 only the largest eigenvalueλ1 is outsideI, and λ1 asymptotically has a normal distribution with expectation (n−1)μ+v+(σ2/μ) and variance 2σ2 (bounded variance!).
Proceedings ArticleDOI
An 0(n log n) sorting network
TL;DR: A sorting network of size 0(n log n) and depth 0(log n) is described, and a derived procedure (&egr;-nearsort) are described below, and the sorting network will be centered around these elementary steps.
Journal ArticleDOI
Sorting in c log n parallel steps
TL;DR: A sorting network withcn logn comparisons where in thei-th step of the algorithm the contents of registersRj, andRk, wherej, k are absolute constants then change their contents or not according to the result of the comparison.
Journal ArticleDOI
Limit distribution for the existence of Hamiltonian cycles in a random graph
János Komlós,Endre Szemerédi +1 more
TL;DR: In this article, it was shown that if a graph G^n has n vertices and 12nlogn+12nogn+cn edges, then it is Hamiltonian with probability P"c tending to exp exp exp(-2c) as n->~.