From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Succinct data structures for representing equivalence classes.

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.

Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima.A. Farzan, J. Munro, и R. Raman. ICALP (1), том 7391 из Lecture Notes in Computer Science, стр. 327-338. Springer, (2012)Efficient visibility queries in simple polygons.P. Bose, A. Lubiw, и J. Munro. Comput. Geom., 23 (3): 313-335 (2002)Implicit B-trees: a new data structure for the dictionary problem.G. Franceschini, R. Grossi, J. Munro, и L. Pagli. J. Comput. Syst. Sci., 68 (4): 788-807 (2004)Fast construction of wavelet trees.J. Munro, Y. Nekrich, и J. Vitter. Theor. Comput. Sci., (2016)The binomial transform and the analysis of skip lists.P. Poblete, J. Munro, и T. Papadakis. Theor. Comput. Sci., 352 (1-3): 136-158 (2006)Selection and Sorting in the "Restore" Model.T. Chan, J. Munro, и V. Raman. SODA, стр. 995-1004. SIAM, (2014)Developing Implicit Data Structures.J. Munro. MFCS, том 233 из Lecture Notes in Computer Science, стр. 168-176. Springer, (1986)Ranked Document Selection.J. Munro, G. Navarro, R. Shah, и S. Thankachan. SWAT, том 8503 из Lecture Notes in Computer Science, стр. 344-356. Springer, (2014)Last-Come-First-Served Hashing.P. Poblete, и J. Munro. J. Algorithms, 10 (2): 228-248 (1989)Efficient Ordering of Hash Tables.G. Gonnet, и J. Munro. SIAM J. Comput., 8 (3): 463-478 (1979)