Author of the publication

An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems.

, and . Inf. Process. Lett., 52 (1): 31-34 (1994)

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

Polynomial-Time Approximation Algorithms for Weighted LCS Problem., , , , and . CPM, volume 6661 of Lecture Notes in Computer Science, page 455-466. Springer, (2011)Syntactic View of Sigma-Tau Generation of Permutations., and . LATA, volume 11417 of Lecture Notes in Computer Science, page 447-459. Springer, (2019)A Linear-Time Algorithm for Seeds Computation., , , , and . ACM Trans. Algorithms, 16 (2): 27:1-27:23 (2020)Broadcasting algorithms in radio networks with unknown topology., and . J. Algorithms, 60 (2): 115-143 (2006)Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property., , , and . J. Algorithms, 42 (2): 277-303 (2002)The Strong Stability Problem for Stochastic Automata.. Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys., (1973)Linear-Time Prime Decomposition Of Regular Prefix Codes., , , and . Int. J. Found. Comput. Sci., 14 (6): 1019-1032 (2003)On maximal suffixes, constant-space linear-time versions of KMP algorithm.. Theor. Comput. Sci., 299 (1-3): 763-774 (2003)On the PVM/MPI Computations of Dynamic Programming Recurrences., , , and . PVM/MPI, volume 1332 of Lecture Notes in Computer Science, page 305-312. Springer, (1997)Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees., , and . SODA, page 36-41. ACM/SIAM, (1996)