vix.ing · top · new · best · stats · spec

János Komlós

  1. Deterministic simulation in LOGSPACE
    1987/01/01 by Miklós Ajtai, János Komlós, Endre Szemerédi · 8 citations
    Computer Science · Engineering · #Algorithms and Data Compression #semigroups and automata theory #graph theory and CDMA systems
  2. Storing a Sparse Table with 0 (1) Worst Case Access Time
    1984/06/26 by Michael L. Fredman, János Komlós, Endre Szemerédi · 5 citations
    Computer Science · #Advanced Database Systems and Queries #Data Mining Algorithms and Applications #Data Management and Algorithms #Citation #Computer science #Table (database) #Information retrieval #World Wide Web #Database
  3. An 0(n log n) sorting network
    1983/01/01 by Miklós Ajtai, János Komlós, Endre Szemerédi · 6 citations
    Computer Science · #Algorithms and Data Compression #Cellular Automata and Applications #Interconnection Networks and Systems
  4. A note on Ramsey numbers
    1980/11/01 by Miklós Ajtai, János Komlós, Endre Szemerédi · 3 citations
    Computer Science · Mathematics · #Advanced Topology and Set Theory #Biology #Combinatorics #Computability, Logic, AI Algorithms #Evolutionary biology #Function (biology) #Limits and Structures in Graph Theory #Mathematics #Ramsey theory #Ramsey's theorem
  5. Spanning Trees in Dense Graphs
    2001/09/01 by JÁNOS KOMLÓS, János Komlós, GÁBOR N. SÁRKÓZY +3 · 4 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
  6. On the Size of Separating Systems and Families of Perfect Hash Functions
    1984/03/01 by Michael L. Fredman, János Komlós · 2 citations
    Computer Science · Mathematics · #Graph Labeling and Dimension Problems #Optimization and Search Problems #Limits and Structures in Graph Theory #Mathematics #Perfect hash function #Hash function #Combinatorics #Discrete mathematics #Function (biology) #Algorithm #Computer science #Cryptography #Cryptographic hash function
  7. Proof of the Seymour conjecture for large graphs
    1998/03/01 by János Komlós, Gábor N. Sárközy, Endre Szemerédi · 3 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Graph theory and applications #Limits and Structures in Graph Theory
  8. Limit distribution for the existence of hamiltonian cycles in a random graph
    1983/01/01 by János Komlós, Endre Szemerédi · 2 citations
    Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #Graph theory and applications #Stochastic processes and statistical mechanics
  9. The Regularity Lemma and Its Applications in Graph Theory
    2002/01/01 by János Komlós, Ali Shokoufandeh, Miklós Simonovits +1 · 2 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Computer science #Graph #Graph theory #Graph theory and applications #Lemma (botany) #Limits and Structures in Graph Theory #Mathematics #Theoretical computer science
  10. An Algorithmic Version of the Blow-up Lemma
    1996/12/04 by János Komlós, Gabor N. Sarkozy, Komlós, János +4 · 1 citation
    Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Graph theory and applications #math.CO
  11. Storing a sparse table with O(1) worst case access time
    1982/11/01 by Michael L. Fredman, János Komlós, Endre Szemerédi · 1 citation
    Computer Science · #Data Management and Algorithms #Algorithms and Data Compression #Advanced Database Systems and Queries
  12. A Lower Bound for Heilbronn'S Problem
    1982/02/01 by János Komlós, J. Pintz, Endre Szemerédi · 1 citation
    Mathematics · #Meromorphic and Entire Functions #Point processes and geometric inequalities #Mathematics and Applications #Conjecture #Combinatorics #Unit (ring theory) #Mathematics #Upper and lower bounds #Mathematical analysis #Mathematics education
  13. The approximate Loebl-Komlós-Sós Conjecture
    2012/11/13 by Jan Hladký, János Komlós, Hladký, Jan +9 · 1 citation
    Mathematics · #05C05 (secondary) #05C35 (primary) #Analytic Number Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Mathematical Approximation and Integration #math.CO #msc:05C05 #msc:05C35