( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort.

, и . J. ACM, 26 (1): 58-64 (1979)

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.

Lutz Galiläer

Daria Igorivna Zvirgzde

François Galilée

Sopiko Zviadadze

Zvi Sofer

 

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

Real-Time Streaming String-Matching., и . CPM, том 6661 из Lecture Notes in Computer Science, стр. 162-172. Springer, (2011)Old and New in Stringology.. CPM, том 6129 из Lecture Notes in Computer Science, стр. 26. Springer, (2010)Parallel Algorithmic Techniques for Combinatorial Computation., и . ICALP, том 372 из Lecture Notes in Computer Science, стр. 304-318. Springer, (1989)An Improved Algorithm for Approximate String Matching., и . ICALP, том 372 из Lecture Notes in Computer Science, стр. 394-404. Springer, (1989)Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model., , и . CRYPTO, том 293 из Lecture Notes in Computer Science, стр. 135-155. Springer, (1987)A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort., и . J. ACM, 26 (1): 58-64 (1979)Faster Tree Pattern Matching., , и . J. ACM, 41 (2): 205-213 (1994)A Constant-Time Optimal Parallel String-Matching Algorithm.. J. ACM, 42 (4): 908-918 (1995)Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version), и . STOC, стр. 177-188. ACM, (1981)Data Structures and Algorithms for Disjoint Set Union Problems., и . ACM Comput. Surv., 23 (3): 319-344 (1991)