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

Kozma, László

  1. Smooth heaps and a dual view of self-adjusting data structures
    2018/02/15 by Kozma, László, Saranurak, Thatchaphol · 2 citations
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
  2. Hamiltonicity below Dirac's condition
    2019/01/01 by Bart M. P. Jansen, Kozma, L., Jansen, Bart M. P. +3 · 2 citations
    Computer Science · #Advanced Graph Theory Research #Algorithms and Data Compression #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Interconnection Networks and Systems
  3. Online sorting and online TSP: randomized, stochastic, and high-dimensional
    2024/06/27 by Abrahamsen, Mikkel, Bercea, Ioana O., Beretta, Lorenzo +2 · 5 citations
    #Computational Geometry (cs.CG) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  4. Finding and counting permutations via CSPs
    2019/08/13 by Berendsohn, Benjamin Aram, Kozma, László, Marx, Dániel · 3 citations
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
  5. Theoretical Analysis of Byte-Pair Encoding
    2024/11/13 by Kozma, László, Voderholzer, Johannes · 6 citations
    #Computation and Language (cs.CL) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
  6. Selection from heaps, row-sorted matrices and X+Y using soft heaps
    2018/02/20 by Kaplan, Haim, Kozma, László, Zamir, Or +1 · 1 citation
    #68W05 #Data Structures and Algorithms (cs.DS) #E.1 #F.2.2 #FOS: Computer and information sciences
  7. A time- and space-optimal algorithm for the many-visits TSP
    2018/04/17 by Berger, André, Kozma, László, Mnich, Matthias +5 · 1 citation
    Computer Science · Engineering · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems #Vehicle Routing Optimization Methods
  8. Fast approximation of search trees on trees with centroid trees
    2022/09/16 by Berendsohn, Benjamin Aram, Golinsky, Ishay, Kaplan, Haim +1 · 1 citation
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
  9. Analysis of Smooth Heaps and Slim Heaps
    2021/07/10 by Maria Hartmann, László Kozma, Hartmann, Maria +5 · 1 citation
    Computer Science · #Algorithms and Data Compression #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and Algorithms
  10. Faster and simpler algorithms for finding large patterns in permutations
    2019/02/23 by László Kozma, Kozma, László · 1 citation
    Computer Science · Engineering · #Algorithms and Data Compression #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #graph theory and CDMA systems #semigroups and automata theory