The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

János Komlós: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael L. Fredman, János Komlós, Endre Szemerédi
    Storing a Sparse Table with 0(1) Worst Case Access Time. [Citation Graph (10, 0)][DBLP]
    J. ACM, 1984, v:31, n:3, pp:538-544 [Journal]
  2. Michael L. Fredman, János Komlós, Endre Szemerédi
    Storing a Sparse Table with O(1) Worst Case Access Time [Citation Graph (2, 0)][DBLP]
    FOCS, 1982, pp:165-169 [Conf]
  3. Miklós Ajtai, Michael L. Fredman, János Komlós
    Hash Functions for Priority Queues [Citation Graph (1, 0)][DBLP]
    FOCS, 1983, pp:299-303 [Conf]
  4. János Komlós, Ali Shokoufandeh, Miklós Simonovits, Endre Szemerédi
    The Regularity Lemma and Its Applications in Graph Theory. [Citation Graph (0, 0)][DBLP]
    Theoretical Aspects of Computer Science, 2000, pp:84-112 [Conf]
  5. Miklós Ajtai, János Komlós, Endre Szemerédi
    Halvers and Expanders [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:686-692 [Conf]
  6. János Komlós
    Linear Verification for Spanning Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:201-206 [Conf]
  7. János Komlós, Ramamohan Paturi
    Effect of Connectivity in Associative Memory Models (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:138-147 [Conf]
  8. János Komlós, Yuan Ma, Endre Szemerédi
    Matching Nuts and Bolts in O(n log n) Time (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:232-241 [Conf]
  9. Miklós Ajtai, László Babai, Péter Hajnal, János Komlós, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi, György Turán
    Two lower bounds for branching programs [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:30-38 [Conf]
  10. Miklós Ajtai, János Komlós, Endre Szemerédi
    An O(n log n) Sorting Network [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:1-9 [Conf]
  11. Miklós Ajtai, János Komlós, Endre Szemerédi
    Deterministic Simulation in LOGSPACE [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:132-140 [Conf]
  12. Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi
    Deterministic Selection in O(log log N) Parallel Time [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:188-195 [Conf]
  13. Miklós Ajtai, Paul Erdös, János Komlós, Endre Szemerédi
    On Turáns theorem for sparse graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:4, pp:313-317 [Journal]
  14. Miklós Ajtai, János Komlós, Endre Szemerédi
    The longest path in a random graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:1, pp:1-12 [Journal]
  15. Miklós Ajtai, János Komlós, Endre Szemerédi
    Largest random component of a k-cube. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:1, pp:1-7 [Journal]
  16. Miklós Ajtai, János Komlós, Endre Szemerédi
    Sorting in c log n parallel sets. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:1, pp:1-19 [Journal]
  17. Miklós Ajtai, János Komlós, Gábor E. Tusnády
    On optimal matchings. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:259-264 [Journal]
  18. Zoltán Füredi, János Komlós
    The eigenvalues of random symmetric matrices. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:3, pp:233-241 [Journal]
  19. János Komlós
    Tiling Turán Theorems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:2, pp:203-218 [Journal]
  20. János Komlós
    Linear verification for spanning trees. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:1, pp:57-65 [Journal]
  21. János Komlós
    Covering Odd Cycles. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:3, pp:393-400 [Journal]
  22. János Komlós, Gábor N. Sárközy, Endre Szemerédi
    Blow-Up Lemma. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:1, pp:109-123 [Journal]
  23. Jeff Kahn, János Komlós
    Singularity Probabilities For Random Matrices Over Finite Fields. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2001, v:10, n:2, pp:- [Journal]
  24. János Komlós, Endre Szemerédi
    Topological cliques in graphs 2. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:79-90 [Journal]
  25. János Komlós, Endre Szemerédi
    Topological Cliques in Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:247-256 [Journal]
  26. János Komlós, Gábor N. Sárközy, Endre Szemerédi
    Spanning Trees In Dense Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2001, v:10, n:5, pp:- [Journal]
  27. János Komlós, Gábor N. Sárközy, Endre Szemerédi
    proof of a Packing Conjecture of Bollobás. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1995, v:4, n:, pp:241-255 [Journal]
  28. János Komlós, János Pach, Gerhard J. Woeginger
    Almost Tight Bounds for epsilon-Nets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:163-173 [Journal]
  29. János Komlós, Endre Szemerédi
    Limit distribution for the existence of Hamiltonian cycles in a random graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:1032-1038 [Journal]
  30. János Komlós, Gábor N. Sárközy, Endre Szemerédi
    Proof of the Alon-Yuster conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:255-269 [Journal]
  31. Miklós Ajtai, Michael L. Fredman, János Komlós
    Hash Functions for Priority Queues [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:63, n:3, pp:217-225 [Journal]
  32. Miklós Ajtai, János Komlós, Endre Szemerédi
    There is no Fast Single Hashing Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:6, pp:270-273 [Journal]
  33. Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi
    Optimal Parallel Selection has Complexity O(Log Log n). [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:38, n:1, pp:125-133 [Journal]
  34. János Komlós, Ramamohan Paturi
    Effect of Connectivity in an Associative Memory Model. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:47, n:2, pp:350-373 [Journal]
  35. Miklós Ajtai, János Komlós, Janos Pintz, Joel Spencer, Endre Szemerédi
    Extremal Uncrowded Hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:32, n:3, pp:321-335 [Journal]
  36. Miklós Ajtai, János Komlós, Endre Szemerédi
    A Note on Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1980, v:29, n:3, pp:354-360 [Journal]
  37. János Komlós, Ramamohan Paturi
    Convergence results in an associative memory model. [Citation Graph (0, 0)][DBLP]
    Neural Networks, 1988, v:1, n:3, pp:239-250 [Journal]
  38. János Komlós, Gábor N. Sárközy, Endre Szemerédi
    An algorithmic version of the blow-up lemma. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:12, n:3, pp:297-312 [Journal]
  39. János Komlós, Gábor N. Sárközy, Endre Szemerédi
    On the square of a Hamiltonian cycle in dense graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:193-211 [Journal]
  40. Miklós Ajtai, D. Karabeg, János Komlós, Endre Szemerédi
    Sorting in Average Time o(log) n. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:285-292 [Journal]
  41. János Komlós, Yuan Ma, Endre Szemerédi
    Matching Nuts and Bolts in O(n log n) Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:3, pp:347-372 [Journal]
  42. János Komlós, Albert G. Greenberg
    An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:2, pp:302-0 [Journal]
  43. János Komlós, Albert G. Greenberg
    Correction to 'An Asymptotically Nonadaptive Algorithm for Conflict Resolution in Multiple-Access Channels'. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:6, pp:841- [Journal]
  44. János Komlós, Endre Szemerédi
    Limit distribution for the existence of hamiltonian cycles in a random graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:1, pp:55-63 [Journal]
  45. Rita Csákány, János Komlós
    The smallest Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:193-199 [Journal]
  46. János Komlós, W. O. J. Moser
    Almost all trees have tribe number 2 or 3. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:143, n:1-3, pp:281-285 [Journal]

Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002