( en | de | ru )

 

Disambiguation of "Larmore, Lawrence L."

Author of the publication

copydeleteadd this publication to your clipboard
A Communication-Efficient Self-stabilizing Algorithm for Breadth-First Search Trees.

, , and . OPODIS, volume 8878 of Lecture Notes in Computer Science, page 293-306. Springer, (2014)

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.

Lawrence Oshinowo

Lawrence Phillips

Lawrence Lowe

Lawrence Mutwol

Christian Lawrence

 

Other publications of authors with the same name

Maximum Matching for Anonymous Trees with Constant Space per Process., , and . OPODIS, volume 46 of LIPIcs, page 16:1-16:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees., , , and . Parallel Process. Lett., 28 (1): 1850002:1-1850002:15 (2018)Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes., , and . Parallel Process. Lett., 14 (1): 99-105 (2004)An O(n)-time self-stabilizing leader election algorithm., , and . J. Parallel Distributed Comput., 71 (11): 1532-1544 (2011)The Set LCS Problem., and . Algorithmica, (1987)On Fast Algorithms for Two Servers., and . J. Algorithms, 12 (4): 607-614 (1991)On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure., and . J. Algorithms, 12 (3): 490-515 (1991)An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems., and . Inf. Process. Lett., 52 (1): 31-34 (1994)Packing Items from a Triangular Distribution., , and . Inf. Process. Lett., 25 (6): 351-362 (1987)Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition., and . STACS, volume 577 of Lecture Notes in Computer Science, page 121-132. Springer, (1992)