Efficient parallel algorithms for string editing and related problems A Apostolico, MJ Atallah, LL Larmore, S McFaddin SIAM Journal on Computing 19 (5), 968-988, 1990 | 213 | 1990 |

An Optimal On-Line Algorithm for *K* Servers on TreesM Chrobak, LL Larmore SIAM Journal on Computing 20 (1), 144-148, 1991 | 186 | 1991 |

A fast algorithm for optimal length-limited Huffman codes LL Larmore, DS Hirschberg Journal of the ACM (JACM) 37 (3), 464-473, 1990 | 166 | 1990 |

The Server Problem and On-Line Games. M Chrobak, LL Larmore On-line algorithms 7, 11-64, 1991 | 120 | 1991 |

Absorbance spectra of aligned Ag nanorod arrays prepared by oblique angle deposition YP Zhao, SB Chaney, ZY Zhang Journal of Applied Physics 100 (6), 063527, 2006 | 108 | 2006 |

The least weight subsequence problem DS Hirschberg, LL Larmore SIAM Journal on Computing 16 (4), 628-638, 1987 | 100 | 1987 |

On-line dynamic programming with applications to the prediction of RNA secondary structure LL Larmore, B Schieber Journal of Algorithms 12 (3), 490-515, 1991 | 89 | 1991 |

Generosity helps or an 11-competitive algorithm for three servers M Chrobak, LL Larmore Journal of Algorithms 16 (2), 234-263, 1994 | 73 | 1994 |

Constructing trees in parallel MJ Atallah, SR Kosaraju, LL Larmore, GL Miller, SH Teng Proceedings of the first annual ACM symposium on Parallel algorithms and …, 1989 | 73 | 1989 |

Page migration algorithms using work functions M Chrobak, LL Larmore, N Reingold, J Westbrook Journal of Algorithms 24 (1), 124-157, 1997 | 61 | 1997 |

A Self-Stabilizing *O*(*k*)-Time *k*-Clustering AlgorithmAK Datta, LL Larmore, P Vemula The Computer Journal 53 (3), 342-350, 2010 | 49 | 2010 |

Self-stabilizing leader election in optimal space AK Datta, LL Larmore, P Vemula Symposium on Self-Stabilizing Systems, 109-123, 2008 | 49 | 2008 |

Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property P Bradford, MJ Golin, LL Larmore, W Rytter Journal of Algorithms 42 (2), 277-303, 2002 | 47* | 2002 |

Height restricted optimal binary trees LL Larmore SIAM Journal on Computing 16 (6), 1115-1123, 1987 | 47 | 1987 |

A self-stabilizing o (n)-round k-clustering algorithm AK Datta, S Devismes, LL Larmore 2009 28th IEEE International Symposium on Reliable Distributed Systems, 147-155, 2009 | 45 | 2009 |

Self-stabilizing leader election in optimal space under an arbitrary scheduler AK Datta, LL Larmore, P Vemula Theoretical Computer Science 412 (40), 5541-5561, 2011 | 43 | 2011 |

A self-stabilizing k-clustering algorithm for weighted graphs E Caron, AK Datta, B Depardon, LL Larmore Journal of Parallel and Distributed Computing 70 (11), 1159-1173, 2010 | 43 | 2010 |

A better lower bound on the competitive ratio of the randomized 2-server problem M Chrobak, LL Larmore, C Lund, N Reingold Information Processing Letters 63 (2), 79-83, 1997 | 38 | 1997 |

Constructing Huffman trees in parallel LL Larmore, TM Przytycka SIAM Journal on Computing 24 (6), 1163-1169, 1995 | 37 | 1995 |

A fast algorithm for optimum height-limited alphabetic binary trees LL Larmore, TM Przytycka SIAM Journal on Computing 23 (6), 1283-1312, 1994 | 36 | 1994 |