Author of the publication

Succinct indexable dictionaries with applications to encoding k-ary trees and multisets.

, , and . SODA, page 233-242. ACM/SIAM, (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Compact Routing Schemes for Dynamic Ring Networks., , and . Theory Comput. Syst., 37 (5): 585-607 (2004)In-memory Representations of Databases via Succinct Data Structures: Tutorial Abstract.. PODS, page 323-324. ACM, (2018)Analysing Cache Effects in Distribution Sorting., and . ACM Journal of Experimental Algorithmics, (2000)Range Extremum Queries.. IWOCA, volume 7643 of Lecture Notes in Computer Science, page 280-287. Springer, (2012)Engineering the LOUDS Succinct Tree Representation., , and . WEA, volume 4007 of Lecture Notes in Computer Science, page 134-145. Springer, (2006)Succinct Representations of Binary Trees for Range Minimum Queries., , and . COCOON, volume 7434 of Lecture Notes in Computer Science, page 396-407. Springer, (2012)Succinct Representations of Permutations., , , and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 345-356. Springer, (2003)Priority Queues: Small, Monotone and Trans-dichotomous.. ESA, volume 1136 of Lecture Notes in Computer Science, page 121-137. Springer, (1996)Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries., , , , and . ACM Trans. Algorithms, 13 (2): 28:1-28:31 (2017)Efficient Update Strategies for Geometric Computing with Uncertainty., , , and . Theory Comput. Syst., 38 (4): 411-423 (2005)