( en | de | ru )

 

Disambiguation of "Arroyuelo, Diego"

Author of the publication

copydeleteadd this publication to your clipboard
Worst-Case Optimal Graph Joins in Almost No Space.

, , , , , and . SIGMOD Conference, page 102-114. ACM, (2021)

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.

Alexander Diego

Jesús Diego Linares

Diego Tonolla

Diego Arenhoevel

Diego Kienle

 

Other publications of authors with the same name

A Practical Alphabet-Partitioning Rank/Select Data Structure., and . SPIRE, volume 11811 of Lecture Notes in Computer Science, page 452-466. Springer, (2019)Practical approaches to reduce the space requirement of lempel-ziv-based compressed text indices., and . ACM J. Exp. Algorithmics, (2010)Optimal Joins Using Compressed Quadtrees., , , and . ACM Trans. Database Syst., 47 (2): 8:1-8:53 (2022)A Hybrid Compressed Data Structure Supporting Rank and Select on Bit Sequences., and . SCCC, page 1-8. IEEE, (2020)Memory-Adaptive Dynamic Spatial Approximation Trees., , , and . SPIRE, volume 2857 of Lecture Notes in Computer Science, page 360-368. Springer, (2003)Hybrid compression of inverted lists for reordered document collections., , , and . Inf. Process. Manag., 54 (6): 1308-1324 (2018)Time- and Space-Efficient Regular Path Queries on Graphs., , , and . CoRR, (2021)Distributed text search using suffix arrays., , , , and . Parallel Comput., 40 (9): 471-495 (2014)Trie-Compressed Intersectable Sets., and . CoRR, (2022)Trie-Compressed Adaptive Set Intersection., and . CPM, volume 259 of LIPIcs, page 1:1-1:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)