Author of the publication

Less Space: Indexing for Queries with Wildcards.

, , , and . ISAAC, volume 8283 of Lecture Notes in Computer Science, page 89-99. Springer, (2013)

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

The Parallel Complexity of Arithmetic Computation.. FCT, volume 56 of Lecture Notes in Computer Science, page 466-475. Springer, (1977)The Nearest Neighbor Problem on Bounded Domains., , and . ICALP, volume 194 of Lecture Notes in Computer Science, page 318-327. Springer, (1985)Time and Space Bounds for Selection Problems., and . ICALP, volume 62 of Lecture Notes in Computer Science, page 192-204. Springer, (1978)The Binomial Transform and its Application to the Analysis of Skip Lists., , and . ESA, volume 979 of Lecture Notes in Computer Science, page 554-569. Springer, (1995)An Implicit Binomial Queue with Constant Insertion Time., , and . SWAT, volume 318 of Lecture Notes in Computer Science, page 1-13. Springer, (1988)Robot Localization without Depth Perception., , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 249-259. Springer, (2002)Space Efficient Suffix Trees., , and . FSTTCS, volume 1530 of Lecture Notes in Computer Science, page 186-196. Springer, (1998)Fast Sorting In-Place Sorting with O(n) Data., and . FSTTCS, volume 560 of Lecture Notes in Computer Science, page 266-277. Springer, (1991)Fast Construction of Wavelet Trees., , and . SPIRE, volume 8799 of Lecture Notes in Computer Science, page 101-110. Springer, (2014)Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs., and . ESA, volume 112 of LIPIcs, page 63:1-63:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)