From post

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.

 

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

On Fast Algorithms for Two Servers., и . J. Algorithms, 12 (4): 607-614 (1991)On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure., и . J. Algorithms, 12 (3): 490-515 (1991)Parallel Construction of Trees with Optimal Weighted Path Length., и . SPAA, стр. 71-80. ACM, (1991)Faster Algorithms for k-Medians in Trees., , , , и . MFCS, том 2747 из Lecture Notes in Computer Science, стр. 218-227. Springer, (2003)Self-stabilizing Space Optimal Synchronization Algorithms on Trees., , и . SIROCCO, том 4056 из Lecture Notes in Computer Science, стр. 334-348. Springer, (2006)Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition., и . STACS, том 577 из Lecture Notes in Computer Science, стр. 121-132. Springer, (1992)Maximum Matching for Anonymous Trees with Constant Space per Process., , и . OPODIS, том 46 из LIPIcs, стр. 16:1-16:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees., , , и . Parallel Process. Lett., 28 (1): 1850002:1-1850002:15 (2018)Linear Time Distributed Swap Edge Algorithms., , , и . CIAC, том 7878 из Lecture Notes in Computer Science, стр. 122-133. Springer, (2013)New applications of failure functions., и . J. ACM, 34 (3): 616-625 (1987)