Follow
Lawrence L. Larmore
Lawrence L. Larmore
Professor of Computer Science, University of Nevada Las Vegas
Verified email at unlv.edu - Homepage
Title
Cited by
Cited by
Year
An Optimal On-Line Algorithm for K Servers on Trees
M Chrobak, LL Larmore
SIAM Journal on Computing 20 (1), 144-148, 1991
2201991
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
2181990
A fast algorithm for optimal length-limited Huffman codes
LL Larmore, DS Hirschberg
Journal of the ACM (JACM) 37 (3), 464-473, 1990
1921990
The Server Problem and On-Line Games.
M Chrobak, LL Larmore
On-line algorithms 7, 11-64, 1991
1411991
The least weight subsequence problem
DS Hirschberg, LL Larmore
SIAM Journal on Computing 16 (4), 628-638, 1987
1101987
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
971991
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
831989
Generosity helps or an 11-competitive algorithm for three servers
M Chrobak, LL Larmore
Journal of Algorithms 16 (2), 234-263, 1994
821994
Page migration algorithms using work functions
M Chrobak, LL Larmore, N Reingold, J Westbrook
Journal of Algorithms 24 (1), 124-157, 1997
771997
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
562011
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
AK Datta, LL Larmore, P Vemula
The Computer Journal 53 (3), 342-350, 2010
562010
Self-stabilizing leader election in optimal space
AK Datta, LL Larmore, P Vemula
Stabilization, Safety, and Security of Distributed Systems: 10th …, 2008
532008
Height restricted optimal binary trees
LL Larmore
SIAM Journal on Computing 16 (6), 1115-1123, 1987
511987
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
482009
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
462010
An o (n)-time self-stabilizing leader election algorithm
AK Datta, LL Larmore, P Vemula
Journal of Parallel and Distributed Computing 71 (11), 1532-1544, 2011
452011
Self-stabilizing leader election in dynamic networks
AK Datta, LL Larmore, H Piniganti
Stabilization, Safety, and Security of Distributed Systems: 12th …, 2010
412010
Constructing Huffman trees in parallel
LL Larmore, TM Przytycka
SIAM Journal on Computing 24 (6), 1163-1169, 1995
411995
A fast algorithm for optimum height-limited alphabetic binary trees
LL Larmore, TM Przytycka
SIAM Journal on Computing 23 (6), 1283-1312, 1994
411994
Self-stabilizing small k-dominating sets
AK Datta, LL Larmore, S Devismes, K Heurtefeux, Y Rivierre
International Journal of Networking and Computing 3 (1), 116-136, 2013
402013
The system can't perform the operation now. Try again later.
Articles 1–20