Author

Lena Volk

View on Semantic Scholar

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Jul 2026

Randomization Helps in Online Graph Exploration: Breaking the Deterministic Lower Bound on Cycles

This work focuses on cycles, a simple graph class which nevertheless captures a key difficulty of online exploration, and develops a randomized algorithm for online exploration of cycles, giving the first provable advantage of randomization in online graph exploration.

Júlia Baligács, Jan Hkazla, Lena Volk · 0 citations