3 Publications

Mark all

[3]
2025 | Published | Conference Paper | IST-REx-ID: 20536 | OA
R. Safavi Hemami and M. P. Seybold, “B-Treaps revised: Write efficient randomized block search trees with high load,” in 19th International Symposium on Algorithms and Data Structures, Toronto, Canada, 2025, vol. 349.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2025 | Published | Conference Paper | IST-REx-ID: 20533 | OA
M. Henzinger and R. Safavi Hemami, “Securing dynamic data: A primer on differentially private data structures,” in 33rd Annual European Symposium on Algorithms, Warsaw, Poland, 2025, vol. 351.
[Published Version] View | Files available | DOI
 
[1]
2022 | Published | Conference Paper | IST-REx-ID: 12102 | OA
A. Ahmadi, K. Chatterjee, A. K. Goharshady, T. Meggendorfer, R. Safavi Hemami, and D. Zikelic, “Algorithms and hardness results for computing cores of Markov chains,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.
[Published Version] View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

Grants


3 Publications

Mark all

[3]
2025 | Published | Conference Paper | IST-REx-ID: 20536 | OA
R. Safavi Hemami and M. P. Seybold, “B-Treaps revised: Write efficient randomized block search trees with high load,” in 19th International Symposium on Algorithms and Data Structures, Toronto, Canada, 2025, vol. 349.
[Published Version] View | Files available | DOI | arXiv
 
[2]
2025 | Published | Conference Paper | IST-REx-ID: 20533 | OA
M. Henzinger and R. Safavi Hemami, “Securing dynamic data: A primer on differentially private data structures,” in 33rd Annual European Symposium on Algorithms, Warsaw, Poland, 2025, vol. 351.
[Published Version] View | Files available | DOI
 
[1]
2022 | Published | Conference Paper | IST-REx-ID: 12102 | OA
A. Ahmadi, K. Chatterjee, A. K. Goharshady, T. Meggendorfer, R. Safavi Hemami, and D. Zikelic, “Algorithms and hardness results for computing cores of Markov chains,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.
[Published Version] View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed