Author of the publication

The Performance of Linear Time Suffix Sorting Algorithms.

, , and . DCC, page 358-367. IEEE Computer Society, (2005)

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

Comment on ``Efficient Huffman Decoding'' and ``An Efficient Finite-State Machine Implementation of Huffman Decoders''., and . Inf. Process. Lett., 68 (1): 1-2 (1998)Do Clarity Scores for Queries Correlate with User Performance?, and . ADC, volume 27 of CRPIT, page 85-91. Australian Computer Society, (2004)Compression and Coding Algorithms, and . The international series in engineering and computer science Kluwer, (2002)Using anchor text for homepage and topic distillation search tasks., , , and . J. Assoc. Inf. Sci. Technol., 63 (6): 1235-1255 (2012)Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays, , , , and . CoRR, (2013)A taxonomy of suffix array construction algorithms., , and . ACM Comput. Surv., 39 (2): 4 (2007)Why Batch and User Evaluations Do Not Give the Same Results., and . SIGIR, page 225-231. ACM, (2001)A Fast and Space - Economical Algorithm for Length - Limited Coding., , and . ISAAC, volume 1004 of Lecture Notes in Computer Science, page 12-21. Springer, (1995)Including summaries in system evaluation., , , , and . SIGIR, page 508-515. ACM, (2009)Investigating the Effectiveness of Clickthrough Data for Document Reordering., , and . ECIR, volume 4956 of Lecture Notes in Computer Science, page 591-595. Springer, (2008)