László Kozma

Orcid: 0000-0002-3253-2373

Affiliations:
  • Freie Universität Berlin, Germany
  • Saarland University, Department of Computer Science
  • Helsinki University of Technology, Department of Information and Computer Science


According to our database1, László Kozma authored at least 40 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Non-adaptive Bellman-Ford: Yen's improvement is optimal.
CoRR, 2024

An Optimal Randomized Algorithm for Finding the Saddlepoint.
CoRR, 2024

2023
Scalable Data Structures (Dagstuhl Seminar 23211).
Dagstuhl Reports, 2023

Finding the saddlepoint faster than sorting.
CoRR, 2023

Optimization with pattern-avoiding input.
CoRR, 2023

Fast Approximation of Search Trees on Trees with Centroid Trees.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Fixed-point cycles and EFX allocations.
CoRR, 2022

Splay trees on trees.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Fixed-Point Cycles and Approximate EFX Allocations.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Group Testing with Geometric Ranges.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Finding and Counting Permutations via CSPs.
Algorithmica, 2021

Analysis of Smooth Heaps and Slim Heaps.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Time- and Space-optimal Algorithm for the Many-visits TSP.
ACM Trans. Algorithms, 2020

Smooth Heaps and a Dual View of Self-Adjusting Data Structures.
SIAM J. Comput., 2020

Geometric group testing.
CoRR, 2020

Exact Exponential Algorithms for Two Poset Problems.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019
Faster and simpler algorithms for finding large patterns in permutations.
CoRR, 2019

Hamiltonicity Below Dirac's Condition.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps.
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

2018
Review of Compact Data Structures - a practical approach by Gonzalo Navarro.
SIGACT News, 2018

Time- and space-optimal algorithms for the many-visits TSP.
CoRR, 2018

Pairing heaps: the forward variant.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Multi-Finger Binary Search Trees.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Maximum Scatter TSP in Doubling Metrics.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Binary search trees, rectangles and patterns.
PhD thesis, 2016

The landscape of bounds for binary search trees.
CoRR, 2016

Binary search trees and rectangulations.
CoRR, 2016

Hitting Set for Hypergraphs of Low VC-dimension.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
A PTAS for Euclidean Maximum Scatter TSP.
CoRR, 2015

A Global Geometric View of Splaying.
CoRR, 2015

Greedy Is an Almost Optimal Deque.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Pattern-Avoiding Access in Binary Search Trees.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Self-Adjusting Binary Search Trees: What Makes Them Tick?
Proceedings of the Algorithms - ESA 2015, 2015

2014
Review of the tower of Hanoi: myths and maths by Andreas M. Hinz, Sandi Klavžar, Urož Milutinović and Ciril Petr.
SIGACT News, 2014

Streaming Algorithms for Partitioning Integer Sequences.
CoRR, 2014

2013
Shattering, Graph Orientations, and Connectivity.
Electron. J. Comb., 2013

Privacy by Fake Data: A Geometric Approach.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Minimum Average Distance Triangulations.
Proceedings of the Algorithms - ESA 2012, 2012

2009
GaZIR: gaze-based zooming interface for image retrieval.
Proceedings of the 11th International Conference on Multimodal Interfaces, 2009


  Loading...