Author of the publication

An Optimal Algorithm to Find Champions of Tournament Graphs.

, , , and . SPIRE, volume 11811 of Lecture Notes in Computer Science, page 267-273. Springer, (2019)

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

Distribution-Aware Compressed Full-Text Indexes, , and . Algorithmica, 67 (4): 529-546 (2013)Space-efficient substring occurrence estimation, and . Algorithmica, (2015 (to appear))Bit-Optimal Lempel-Ziv compression, , and . CoRR, (2008)Bicriteria data compression., , , and . CoRR, (2013)On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices., and . CPM, volume 5029 of Lecture Notes in Computer Science, page 166-177. Springer, (2008)Techniques for Inverted Index Compression., and . CoRR, (2019)Space-efficient substring occurrence estimation., and . PODS, page 95-106. ACM, (2011)Dynamic Elias-Fano Representation., and . CPM, volume 78 of LIPIcs, page 30:1-30:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Compressed Cache-Oblivious String B-tree., and . ESA, volume 8125 of Lecture Notes in Computer Science, page 469-480. Springer, (2013)An Optimal Algorithm to Find Champions of Tournament Graphs., , , and . SPIRE, volume 11811 of Lecture Notes in Computer Science, page 267-273. Springer, (2019)