Dominik Kempa
@dominik_kempa
Followers
587
Following
503
Media
2
Statuses
97
Assistant Professor at Stony Brook University. I work on algorithms and data structures for strings.
New York, USA
Joined August 2017
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.
eatcs.org
European Association for Theoretical Computer Science
0
6
25
RT @JakubTetek: Excited to share our new(ish) paper on arXiv! 🚀 In this paper, we show that the famous bidirectional Dijkstra's algorithm i….
0
4
0
RT @kasperglarsen: I started making videos from a lecture series on data structure lower bounds that I gave at the Swiss Winter School on T….
0
12
0
RT @JukkaSuomela: Postdoc positions available in our research groups (and many other groups) — apply by August 18, 2024!..
0
5
0
I am very happy to share that I received an NSF CAREER award! Thank you for the support, NSF!.
Congratulations to Stony Brook Computer Science Prof Dominik Kempa who has earned an NSF CAREER award that seeks to revolutionize data storage. @stonybrooku @CEASSBU @SUNY #NSFfunded Learn more here:
2
1
28
RT @kasperglarsen: Trying again - two post docs in learning theory under my supervision at Aarhus University are available deadline April 2….
au.dk
Ledig stilling ved Institut for Datalogi, Aarhus Universitet
0
20
0
RT @anupamg: The STOC/TheoryFest 2024 call for workshops has been posted. The deadline for proposals is Feb 16!. The conference will be hel….
0
4
0
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.
0
9
25
RT @kasperglarsen: We are hiring multiple TT Ass. and Asso. Professors at our Department! I (and the call) particularly would love to see a….
international.au.dk
Vacancy at Computer Science, Dept. of, Aarhus University
0
14
0
Check out the latest episode of the @bioinfochat podcast, where we sat down with Roman Cheplyaka, to talk about the δ-SA data structure ( to appear at FOCS 2023) and more generally, compressed data structures!
bioinformatics.chat
Today on the podcast we have Tomasz Kociumaka and Dominik Kempa, the authors of the preprint Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. The...
The best and most fun way to make sense of this result is of course to read the 117-page paper consisting mostly of mathematical proofs, but if you're in a hurry, you might have to settle for listening to the latest #bioinformatics chat podcast episode.
0
5
19
Great interview with Gonzalo Navarro, the superstar of string processing!.
Read the newest #PeopleofACM interview with Gonzalo Navarro, Professor @dccuchile. Navarro was named an #ACMFellow for theoretical and practical contributions to the fields of text searching and compact data structures. Read the full interview here:
1
4
22
Accepted at FOCS'23 🥳. arXiv: 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!.
4
24
138
Congratulations to Michael Bender on becoming an EATCS Fellow! This is a much deserved honor! 🥳🎉
eatcs.org
European Association for Theoretical Computer Science
Congrats to @sbucompsc prof Michael Bender on being named a 2023 Fellow by the European Association for Theoretical Computer Science! @stonybrooku @CEASSBU @eatcs_secretary
1
0
11
RT @kasperglarsen: The strongest unconditional lower bound to date for any graph problem!. New arxiv preprint: http….
0
22
0
RT @kasperglarsen: A two-year post-doc position in algorithms and/or theory of machine learning is available under my supervision at Aarhus….
international.au.dk
Vacancy at Computer Science, Dept. of, Aarhus University
0
8
0
RT @kasperglarsen: Happy to have my first Tweet be an announcement that our paper on using data structures for compressing encrypted data w….
eprint.iacr.org
We study the task of obliviously compressing a vector comprised of $n$ ciphertexts of size $\xi$ bits each, where at most $t$ of the corresponding plaintexts are non-zero. This problem commonly...
0
4
0
RT @RasmusPagh1: SODA 2023 accepted papers: Word cloud of paper titles shows that graph and approximation algorithm….
0
10
0