Folgen
Lawrence L. Larmore
Lawrence L. Larmore
Professor of Computer Science, University of Nevada Las Vegas
Bestätigte E-Mail-Adresse bei unlv.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
An Optimal On-Line Algorithm for K Servers on Trees
M Chrobak, LL Larmore
SIAM Journal on Computing 20 (1), 144-148, 1991
2111991
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
2111990
A fast algorithm for optimal length-limited Huffman codes
LL Larmore, DS Hirschberg
Journal of the ACM (JACM) 37 (3), 464-473, 1990
1801990
The server problem and on-line games
M Chrobak, LL Larmore
DIMACS Series in Discrete Mathematics and Theoretical Computer Science 7, 11-64, 1992
1311992
The least weight subsequence problem
DS Hirschberg, LL Larmore
SIAM Journal on Computing 16 (4), 628-638, 1987
1071987
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
821989
Generosity helps or an 11-competitive algorithm for three servers
M Chrobak, LL Larmore
Journal of Algorithms 16 (2), 234-263, 1994
791994
Page migration algorithms using work functions
M Chrobak, LL Larmore, N Reingold, J Westbrook
Journal of Algorithms 24 (1), 124-157, 1997
671997
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
AK Datta, LL Larmore, P Vemula
The Computer Journal 53 (3), 342-350, 2010
532010
Self-stabilizing leader election in optimal space
AK Datta, LL Larmore, P Vemula
Symposium on Self-Stabilizing Systems, 109-123, 2008
532008
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
512011
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
51*2002
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
492009
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
472010
Height restricted optimal binary trees
LL Larmore
SIAM Journal on Computing 16 (6), 1115-1123, 1987
461987
Constructing Huffman trees in parallel
LL Larmore, TM Przytycka
SIAM Journal on Computing 24 (6), 1163-1169, 1995
421995
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
412013
A fast algorithm for optimum height-limited alphabetic binary trees
LL Larmore, TM Przytycka
SIAM Journal on Computing 23 (6), 1283-1312, 1994
391994
On fast algorithms for two servers
M Chrobak, LL Larmore
Journal of Algorithms 12 (4), 607-614, 1991
381991
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20