Hanna Komlós

Orcid: 0000-0001-5522-9193

According to our database1, Hanna Komlós authored at least 8 papers between 2022 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Bounding the Fragmentation of B-Trees Subject to Batched Insertions.
CoRR, March, 2026

2025
History-Independent Dynamic Partitioning: Operation-Order Privacy in Ordered Data Structures.
SIGMOD Rec., March, 2025

Online List Labeling: Breaking the \({\log^2 n}\) Barrier.
SIAM J. Comput., 2025

The Case for External Graph Sketching.
Proceedings of the 3rd Conference on Applied and Computational Discrete Algorithms, 2025

2024
Layered List Labeling.
Proc. ACM Manag. Data, 2024

Nearly Optimal List Labeling.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
Graph Ranking and the Cost of Sybil Defense.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Online List Labeling: Breaking the log<sup>2</sup>n Barrier.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022


  Loading...