Author of the publication

Testing Stream Ciphers by Finding the Longest Substring of a Given Density.

, , and . ACISP, volume 5594 of Lecture Notes in Computer Science, page 122-133. Springer, (2009)

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

Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays, , , , and . CoRR, (2013)Why Batch and User Evaluations Do Not Give the Same Results., and . SIGIR, page 225-231. ACM, (2001)Pairwise Crowd Judgments: Preference, Absolute, and Ratio., , and . ADCS, page 3:1-3:8. ACM, (2018)Including summaries in system evaluation., , , , and . SIGIR, page 508-515. ACM, (2009)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)A taxonomy of suffix array construction algorithms., , and . ACM Comput. Surv., 39 (2): 4 (2007)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)Testing Stream Ciphers by Finding the Longest Substring of a Given Density., , and . ACISP, volume 5594 of Lecture Notes in Computer Science, page 122-133. Springer, (2009)Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory., , and . SPIRE, volume 4209 of Lecture Notes in Computer Science, page 122-133. Springer, (2006)