A. K. Datta, L. L. Larmore, P. Vemula, A Self-Stabilizing Leader Election Algorithm in Optimal Space , Tenth International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Detroit, MI November 2008. |
A. K. Datta, L. L. Larmore, P. Vemula, A Self-Stabilizing O(k)-time k-Clustering Algorithm , Computer Journal. To appear. |
E. Caron, A. K. Datta, B. Depardon, L. L. Larmore, A Self-Stabilizing K-clustering algorithm using an arbitrary metric , Laboratoire de l'Informatique du Parallelisme, Ecole Normale Superieure de Lyon, Research Report RR2008-31. |
W. W. Bein, L. L. Larmore, L. Morales , and I. H. Sudborough, A Polynomial time 2-approximation for block sorting, Proceedings of the 15^{th} Annual Symposium on Fundamentals of Computation Theory, (FCT 2005), August 2005. LNCS 3623 Springer-Verlag (2005), pp. 115-124. |
W. W. Bein, K. Iwama, L. L. Larmore, and J. Noga, The Delayed k-paging problem, Proceedings of the 15^{th} Annual Symposium on Fundamentals of Computation Theory, (FCT 2005), August 2005. LNCS 3623 Springer-Verlag (2005), pp. 281-237. |
W. W. Bein, L. Epstein, L. L. Larmore, and J. Noga, Optimally competitive list batching, Proceedings of the 9^{th} Scandinavian on Workshop on Algorithm Theory, (SWAT 2004), July 2004. LNCS 3111 Springer-Verlag (2004), pp. 77-89. |
W. W. Bein , R. Fleischer, and L. L. Larmore, "Limited bookmark randomized on-Line algorithms for the paging problem," Information Processing Letters 76 (2000) pp. 155-162. |
W. W. Bein and L. L. Larmore, "Trackless on-line algorithms for the server problem," Information Processing Letters 74 (2000) pp. 73-79. |
W. W. Bein and L. L. Larmore, ``Limited bookmark randomized on-line algorithms for the paging problem,'' Information Processing Letters 76 (2000) pp. 155-162. |
Y. Bartal, M. Chrobak, and L. L. Larmore, , "A Randomized algorithm for two servers on the line," , Information and Computation 158 (1999) 53-69. |
W. W. Bein , M. Chrobak, and L. L. Larmore, "The 3-Server Problem in the Plane," Proceedings of the 7^{th} Annual European Symposium on Algorithms, Prague (1999), LNCS 1643 Springer-Verlag (1999), pp. 301-312. |
M. Chrobak and L. L. Larmore, "Page migration algorithms using work functions," Journal of Algorithms 24 (1997) pp. 124-157. Also in Proceedings of the 4^{th} Annual International Symposium on Algorithms and Computation, Hong Kong, (1993) pp. 406-415. |
M. Chrobak, L. L. Larmore, , C. Lund, and N. Reingold, "A Better lower bound on the competitive ratio of the randomized 2-server problem," Information Processing Letters 63 (1992) pp. 79-83. |
M. Chrobak and L. L. Larmore, "Generosity helps, or, an 11-competitive algorithm for three servers," Journal of Algorithms 16 (1994) pp. 234-263. Also in Proceedings ACM-SIAM Symposium on Discrete Algorithms (1992) Orlando, FL, pp. 196-202. |
M. Chrobak and L. L. Larmore, "HARMONIC is 3-competitive for two servers," Theoretical Computer Science A 98 (1992) pp. 339-346. |
M. Chrobak and L. L. Larmore, "An Optimal on line algorithm for k servers on trees," SIAM Journal of Computing 20 (1991) pp. 144-148. |
M. Chrobak and L. L. Larmore, "On Fast algorithms for two servers," Proceedings of Mathematical Foundations of Computer Science, Banska Bystrica, Slovakia (1990). Also in Journal of Algorithms 12 (1991) pp. 607-614. |
M. Chrobak and L. L. Larmore, "A New approach to the server problem," SIAM Journal of Discrete Mathematics 4 (1991) pp. 323-328. |
M. Chrobak and L. L. Larmore, "A Note on the server problem and a benevolent adversary," Information Processing Letters 38 (1991) pp. 173-175. |
M. Chrobak and L. L. Larmore, "The server problem and on-line games," DIMACS Series in Discrete Mathematics and Theoretical Computer Science 7 (1991) pp. 11-64. |
T. C. Hu , L. L. Larmore, and J. D. Morgenthaler , Optimal Integer Alphabetic Trees in Linear Time, Proceedings of the 13^{th} Annual European Symposium on Algorithms, Palma de Mallorca, Spain, October 3-6, 2005, LNCS 3669 Springer-Verlag (2005), pp. 226-237. |
M. Karpinski, L. L. Larmore , and Y. Nekrich, ``A Work-efficient algorithm for the construction of length-limited Huffman codes," Parallel Processing Letters 14 (2004) pp. 99-105. |
W. W. Bein , P. Brucker, L. L. Larmore, and J. K. Park, "Fast Algorithms with Algebraic Monge Properties" Abstract Proceedings of 27^{th} International Symposium on Mathematical Foundations of Computer Science Warszawa - Otwock (2002) LNCS 2420 Springer Verlag (2002), pp. 104-117. |
P. Bradford, M. Golin, L. L. Larmore and W. W. Rytter "Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property," Journal of Algorithms 42 (2002) pp. 277-303. |
L. L. Larmore and T. Przytycka "The Optimal alphabetic tree problem revisited" Journal of Algorithms 28 (1998) pp. 1-20. |
L. L. Larmore and W. W. Rytter "Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages" Theoretical Computer Science 197 (1998) pp. 189-201. |
M. Karpinski, L. L. Larmore , and W. W. Rytter, "Correctness of constructing optimal alphabetic trees revisited," Theoretical Computer Science A 98 (1997) pp. 309-324. |
L. L. Larmore and T. Przytycka "A Parallel algorithm for optimum height limited alphabetic binary trees" Journal of Parallel and Distributed Computing 35 (1996) pp. 49-56. |
L. L. Larmore and W. W. Rytter "An optimal sublinear time parallel algorithm for some dynamic programming problems" Information Processing Letters 52 (1994) pp. 31-34. |
L. L. Larmore and T. Przytycka "Constructing Huffman trees in parallel" SIAM Journal of Computing 24 (1994) pp. 1163-1169. |
L. L. Larmore and T. Przytycka "A Fast algorithm for optimum height limited alphabetic binary trees" SIAM Journal of Computing 23 (1993) pp. 1283-1312. |
D. S. Hirschberg and L. L. Larmore, "The Traveler's problem," Journal of Algorithms 13 (1992) pp. 148-160. |
B. Schieber and L. L. Larmore, "On-line dynamic programming with applications to the prediction of RNA secondary structure," Proceedings of the 1^{st} Annual ACM-SIAM Symposium on Discrete Algorithms , San Francisco, CA (January 1990) pp. 503-512. Also in Journal of Algorithms 12 (1991) pp. 490-515. |
L. L. Larmore, "An Optimal algorithm with unknown time complexity for convex matrix searching," Information Processing Letters 36 (1990) pp. 147-151, |
A. Apostolico, M. J. Atallah, L. L. Larmore, and H. S. McFaddin, "Efficient parallel algorithms for string editing and related problems," SIAM Journal of Computing 19 (1990) pp. 968-988. Also in Proceedings of the 26^{th} Annual Allerton Conference on Communications, Control, and Computing Monticello, Illinois (1988) pp. 253-263. |
L. L. Larmore, "The one-dimensional dynamic programming algorithm," This gives a linear time on-line version of the SMAWK algorithm. (Published only as a section of the publication with B. Schieber listed above.) pdf version |
D. S. Hirschberg and L. L. Larmore, "Length-limited coding," Proceedings of the 1^{st} Annual ACM-SIAM Symposium on Discrete Algorithms San Francisco (1990) pp. 310-318. |
L. L. Larmore and D. S. Hirschberg, A Fast algorithm for optimal length-limited Huffman codes," Journal of the ACM 37 (1990) pp. 464-473 |
D. S. Hirschberg and L. L. Larmore, "The Set-set LCS problem," Algorithmica 4 (1989) pp. 503-510. |
L. L. Larmore, "Minimum delay codes," SIAM Journal of Computing 18 (1989) pp. 503-510. |
M. J. Atallah, L. L. Larmore, G. L. Miller, and S-H. Teng "Contructing trees in parallel" Proceedings of the 1^{st} ACM Symposium on Parallel Algorithms and Architectures, Santa Fe, New Mexico. (1989) pp. 421-431. |
D. S. Hirschberg, J. H. Hester , and L. L. Larmore, "Construction of optimal binary split trees in the presence of bounded access probabilities," Journal of Algorithms 9 (1988) pp. 245-253. |
D. S. Hirschberg and L. L. Larmore, "The Set LCS problem," Algorithmica 2 (1987) pp. 91-95. |
D. S. Hirschberg and L. L. Larmore, "New applications of failure functions," Journal of the ACM 34 (1987) pp. 616-625. |
L. L. Larmore, "Height restricted optimal binary trees," SIAM Journal of Computing 16 (1987) pp. 1115-1123, Also as ICS TR-86-03, Department of Information and Computer Science, University of California Irvine, February 1986. |
L. L. Larmore, "A Subquadratic algorithm for constructing approximately optimal binary search trees," Journal of Algorithms 8 (1987) pp. 579-591, Also printed as ICS TR-86-03, Department of Information and Computer Science, University of California Irvine, February 1986. |
D. S. Hirschberg and L. L. Larmore, "The Least weight subsequence problem," Proceedings of the 26^{th} Annual Symposium on the Foundations of Computer Science, Portland (1985), pp. 137-143. Also in SIAM Journal on Computing 16 (1987) pp. 628-638. |
L. L. Larmore, D. S. Hirschberg and M. Molodowitch, Subtree weight ratios for optimal binary search trees. Tech. Rpt. 86-02, ICS Dept., UC Irvine (1986). |
L. L. Larmore and D. S. Hirschberg, "Efficient optimal pagination of scrolls," Communications of the ACM 28 (1985) pp. 854-856. [9-28-12: cited by 11] |
L. L. Larmore and D. S. Hirschberg, "Breaking a paragraph into lines in linear time," Proceedings of the 22^{nd} Annual Allerton Conference on Communication, Control, and Computing, Monticello Illinois, (1984) pp. 478-487. |
W. W. Bein, L. L. Larmore, C. O. Shields, and I. H. Sudborough, "Embedding a complete binary tree into a three-dimensional grid," Journal of Interconnection Networks, 5 (2004) pp. 111-130. |
W. W. Bein, L. L. Larmore, S. Latifi, and I. H. Sudborough, "Block sorting is hard," International Journal of Foundations of Computer Science, 14 (2003) pp. 425-437. |
P. Berman, M. Karpinski, L. L. Larmore , W. Plandowski, and W. W. Rytter, "On the Complexity of pattern matching for highly compressed two-dimensional texts," Journal of Computer and System Sciences 65 pp. 332-350. Also, Proceedings of the 8^{th} Annnual Symposium on Combinatorial Pattern Matching, (CPM'97), Aarhus, Denmark, June 30 - July 2, 1997, LNCS 1264 Edited by A. Apostolico and J. Hein, Springer-Verlag (1997), pp. 40--51 (1997). Also as TR-96-051, Institute of Computer Science and Information, Berkeley, (1996). |
L. L. Larmore , D. D. Gajski, and A. Wu, "Layout placement for sliced architecture," IEEE Transactions on Computer--Aided Design of Integrated Circuits 11 (1992) pp. 102-114, Also: ICS TR-89-36 Department of Information and Computer Science, University of California Irvine, February 1986. |
L. L. Larmore and D. S. Hirschberg, "Average case analysis of marking algorithms," SIAM Journal on Computing 15 (1986) pp. 1069-1074. |
K. Krause, L. L. Larmore and D. Volper, "Packing items from a triangular distribution," Information Processing Letters 25 (1987) pp. 351-361, Also as ICS TR-86-07, Department of Information and Computer Science, University of California Irvine, February 1986. |