( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Engineering a Textbook Approach to Index Massive String Dictionaries.

, , и . SPIRE, том 14240 из Lecture Notes in Computer Science, стр. 203-217. Springer, (2023)

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.

Giorgio Cortellaro

Giorgio Stefanoni

Giorgio Pudelko

Giorgio Borea

Giorgio Gonnella

 

Другие публикации лиц с тем же именем

Repetition- and Linearity-Aware Rank/Select Dictionaries., , и . ISAAC, том 212 из LIPIcs, стр. 64:1-64:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Compressed String Dictionaries via Data-Aware Subtrie Compaction., , , и . SPIRE, том 13617 из Lecture Notes in Computer Science, стр. 233-249. Springer, (2022)Grafite: Taming Adversarial Queries with Optimal Range Filters., , и . Proc. ACM Manag. Data, 2 (1): 3:1-3:23 (февраля 2024)The PGM-index: a multicriteria, compressed and learned approach to data indexing., и . CoRR, (2019)Superseding traditional indexes by orchestrating learning and geometry., , и . CoRR, (2019)Learned Monotone Minimal Perfect Hashing., , , и . ESA, том 274 из LIPIcs, стр. 46:1-46:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Engineering a Textbook Approach to Index Massive String Dictionaries., , и . SPIRE, том 14240 из Lecture Notes in Computer Science, стр. 203-217. Springer, (2023)Compressing and Querying Integer Dictionaries Under Linearities and Repetitions., , и . IEEE Access, (2022)On the performance of learned data structures., , и . Theor. Comput. Sci., (2021)A Learned Approach to Design Compressed Rank/Select Data Structures., , и . ACM Trans. Algorithms, 18 (3): 24:1-24:28 (2022)