SODA 2023 accepted papers: siam.org/Portals/0/Conf… Word cloud of paper titles shows that graph and approximation algorithms are going strong. Many interesting papers!

Happy to have my first Tweet be an announcement that our paper on using data structures for compressing encrypted data was just accepted at EUROCRYPT'23, joint with Mark Simkin @CntrlBit and Nils Fleischhacker eprint.iacr.org/2022/1413

A two-year post-doc position in algorithms and/or theory of machine learning is available under my supervision at Aarhus University. Exact topics depend on the applicant. Application deadline April 1st. Start June 1st or later. Please share: international.au.dk/about/profile/…

The strongest unconditional lower bound to date for any graph problem! New arxiv preprint: arxiv.org/abs/2304.08745

Congratulations to Michael Bender on becoming an EATCS Fellow! This is a much deserved honor! 🥳🎉eatcs.org/index.php/comp…

Accepted at FOCS'23 🥳 arXiv: arxiv.org/abs/2308.03635 We show how to answer suffix array queries in O(δ log ((n log σ)/(δ log n))) space. This matches the information-theoretic lower bound (for all n, σ, and δ) and collapses the hierarchy of compressed structures to a point!

Great interview with Gonzalo Navarro, the superstar of string processing!

Check out the latest episode of the Roman Cheplyaka | the bioinformatics chat podcast, where we sat down with Roman Cheplyaka, to talk about the δ-SA data structure (arxiv.org/abs/2308.03635; to appear at FOCS 2023) and more generally, compressed data structures! bioinformatics.chat/delta-SA

We are hiring multiple TT Ass. and Asso. Professors at our Department! I (and the call) particularly would love to see applicants in theory of machine learning as well as algorithms, data structures and theoretical computer science in general! Come join! international.au.dk/about/profile/…

A PhD position in string algorithms is available in my group at Stony Brook University (New York, USA). Start date: Fall 2024. Application deadline: Jan 15, 2024. Please reach out early by email, if you are interested. cs.stonybrook.edu/admissions/Gra…

The STOC/TheoryFest 2024 call for workshops has been posted. The deadline for proposals is Feb 16! The conference will be held in Vancouver, June 24-28. acm-stoc.org/stoc2024/callf… #STOC2024 #Theoryfest2024

Trying again - two post docs in learning theory under my supervision at Aarhus University are available deadline April 25th. Please share. au.dk/om/stillinger/…

I am very happy to share that I received an NSF CAREER award! Thank you for the support, NSF!

Postdoc positions available in our research groups (and many other groups) — apply by August 18, 2024! hiit.fi/ict-community-…

I started making videos from a lecture series on data structure lower bounds that I gave at the Swiss Winter School on Theoretical Computer Science 2020. This is the first video in the series: youtu.be/opzJB8Ey0hk

Excited to share our new(ish) paper on arXiv! 🚀 In this paper, we show that the famous bidirectional Dijkstra's algorithm is optimal on every single possible input for the shortest st-path problem. To appear at SOSA 2025. arxiv.org/abs/2410.14638

A great way to end the semester 🙂 Thank you to Stony Brook University Dept. of Computer Science for this award!

Congratulations to Tomasz Kociumaka for winning the prestigious 2025 Presburger Award! An incredibly well-deserved recognition of his brilliant contributions to theoretical computer science! 👏🎖️ #PresburgerAward #TCS mimuw.edu.pl/~kociumaka/ eatcs.org/index.php/pres…