L. Larmore

发表

On-Line Optimization of Publish/Subscribe Overlays

Ajoy Kumar Datta, Lawrence L. Larmore, Eddy Caron, 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

The d-edge shortest-path problem for a Monge graph

L. Larmore, W. Bein, James K. Park, 1992 .

Enumerating immersions and embeddings of projective spaces.

L. Larmore, R. Rigdon, 1976 .

Page Migration Algorithms Using Work Functions (extended Abstract)

M. Chrobak, N. Reingold, L. Larmore, 1993 .

Faster Algorithms for k-Medians in Trees (Extended Abstract)

M. Chrobak, W. Rytter, B. Bhattacharya, 2003 .

The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity

Lawrence L. Larmore, Wolfgang W. Bein, Mordecai J. Golin, 2009, SODA '06.

Optimal Preex-free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property Proposed Running Head: Preex Codes for Unequal Letter Costs

W. Rytter, L. Larmore, M. Golin, 2022 .

Linear Time Distributed Swap Edge Algorithms

Lawrence L. Larmore, Ajoy K. Datta, Linda Pagli, 2020, CIAC.

Metrical Task Systems, the Server Problem and the Work Function Algorithm

Marek Chrobak, Lawrence L. Larmore, M. Chrobak, 1996, Online Algorithms.

Generosity helps, or an 11–competitive algorithm for three servers

Marek Chrobak, Lawrence L. Larmore, M. Chrobak, 1992, SODA '92.

A New Approach to the Server Problem

Marek Chrobak, Lawrence L. Larmore, M. Chrobak, 1991, SIAM J. Discret. Math..

R-LINE: A better randomized 2-server algorithm on the line

Lawrence L. Larmore, Wolfgang W. Bein, Lucas Bang, 2012, Theor. Comput. Sci..

T-Theory Applications to Online Algorithms for the Server Problem pdf

Lawrence L. Larmore, James A. Oravec, L. Larmore, 2006, ArXiv.

Self-stabilizing algorithms for sorting and heapification

Ajoy Kumar Datta, Doina Bein, Lawrence L. Larmore, 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

A fast algorithm for optimal length-limited Huffman codes

Lawrence L. Larmore, Daniel S. Hirschberg, L. Larmore, 1990, JACM.

Page Migration Algorithms Using Work Functions

Marek Chrobak, Lawrence L. Larmore, Jeffery R. Westbrook, 1993, J. Algorithms.

Length-limited coding

Lawrence L. Larmore, Daniel S. Hirschberg, L. Larmore, 1990, SODA '90.

Efficient Parallel Algorithms for String Editing and Related Problems

Mikhail J. Atallah, Lawrence L. Larmore, Alberto Apostolico, 1990, SIAM J. Comput..

Notice : This Material may be protected by Copyright Law ( T , itle 17 U . S . C . ) A Subquadratic algorithm for constructing approximately optimal binary search trees

L. Larmore, 2014 .

(note) Correctness of Constructing Optimal Alphabetic Trees Revisited

W. Rytter, M. Karpinski, L. Larmore, 2011 .

Subtree weight ratios for optimal binary search trees

D. S. Hirschberg, L. Larmore, D. Hirschberg, 1986 .

Metrical Service Systems: Deterministic Strategies

Lawrence L. Larmore, L. Larmore, 1993 .

Faster Algorithms for k-Medians in Trees

Wojciech Rytter, Marek Chrobak, Lawrence L. Larmore, 2003, MFCS.

Real $n$-plane bundles over an $(n+1)$-complex

L. Larmore, 1975 .

A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem

Stéphane Devismes, Lawrence L. Larmore, Ajoy K. Datta, 2019, Theor. Comput. Sci..

An Optimal On-Line Algorithm for k-Servers on Trees

Marek Chrobak, Lawrence L. Larmore, M. Chrobak, 1991, SIAM J. Comput..

Self-Stabilizing ℓ-Exclusion Revisited

Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, 2015, ICDCN.

Isotopy classification of spheres in a manifold

L. Larmore, 1979 .

Enumerating normal bundles of immersions and embeddings of projective spaces.

L. Larmore, R. Rigdon, 1977 .

Obstructions to embedding and isotopy in the metastable range

L. Larmore, 1973 .

Group extensions and twisted cohomology theories

L. Larmore, E. Thomas, 1973 .

Enumeration of Liftings in the Non-Principal Case

L. Larmore, 1974 .

The Server Problem and On-Line Games

Marek Chrobak, Lawrence L. Larmore, M. Chrobak, 1991, On-Line Algorithms.

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Michel X. Goemans, Lawrence L. Larmore, M. Goemans, 2003, STOC 2003.

On Self-stabilizing Search Trees

Ajoy Kumar Datta, Doina Bein, Lawrence L. Larmore, 2006, DISC.

Self-Stabilizing Small k-Dominating Sets

Ajoy Kumar Datta, Lawrence L. Larmore, Karel Heurtefeux, 2011, 2011 Second International Conference on Networking and Computing.

Self-Stabilizing Leader Election in Dynamic Networks

Ajoy Kumar Datta, Lawrence L. Larmore, Hema Piniganti, 2010, Theory of Computing Systems.

The 3-server problem in the plane

Marek Chrobak, Lawrence L. Larmore, Wolfgang W. Bein, 1999, Theor. Comput. Sci..

Knowledge State Algorithms

Rüdiger Reischuk, Lawrence L. Larmore, Wolfgang W. Bein, 2011, Algorithmica.

Equitable Revisited

Lawrence L. Larmore, Wolfgang W. Bein, John Noga, 2007, ESA.

Trackless online algorithms for the server problem

Lawrence L. Larmore, Wolfgang W. Bein, L. Larmore, 2000, Inf. Process. Lett..

Self-stabilizing Space Optimal Synchronization Algorithms on Trees

Ajoy Kumar Datta, Doina Bein, Lawrence L. Larmore, 2006, SIROCCO.

An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching

Lawrence L. Larmore, L. Larmore, 1990, Inf. Process. Lett..

On-line dynamic programming with applications to the prediction of RNA secondary structure

Baruch Schieber, Lawrence L. Larmore, B. Schieber, 1991, SODA '90.

The least weight subsequence problem

Lawrence L. Larmore, Daniel S. Hirschberg, L. Larmore, 1987, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

Mappings into loop spaces and central group extensions

L. Larmore, E. Thomas, 1972 .

The algebraic Monge property and path problems

Lawrence L. Larmore, Peter Brucker, Wolfgang W. Bein, 2005, Discret. Appl. Math..

The k-Median Problem for Directed Trees

Wojciech Rytter, Marek Chrobak, Lawrence L. Larmore, 2001, MFCS.

The k-Median Problem for Directed Trees Extended Abstract

Wojciech Rytter, Marek Chrobak, Lawrence L. Larmore, 2001 .

Optimal Pre x-Free Codes for Unequal Letter Costs and Dynamic Programming with the Monge Property

Wojciech Rytter, Lawrence L. Larmore, Mordecai J. Golin, 1998 .

A Self-Stabilizing Minimal k-Grouping Algorithm

Toshimitsu Masuzawa, Lawrence L. Larmore, Yuichi Sudo, 2017, ICDCN.

Constant Space Self-Stabilizing Center Finding in Anonymous Tree Networks

Ajoy Kumar Datta, Toshimitsu Masuzawa, Lawrence L. Larmore, 2015, ICDCN.

A Communication-Efficient Self-stabilizing Algorithm for Breadth-First Search Trees

Ajoy Kumar Datta, Toshimitsu Masuzawa, Lawrence L. Larmore, 2014, OPODIS.

Self-stabilizing silent disjunction in an anonymous network

Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, 2013, Theor. Comput. Sci..

Fast Leader (Full) Recovery Despite Dynamic Faults

Ajoy Kumar Datta, Sébastien Tixeuil, Stéphane Devismes, 2013, 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum.

Competitive Self-Stabilizing k-Clustering

Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, 2012, 2012 IEEE 32nd International Conference on Distributed Computing Systems.

Sorting on Skip Chains

Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, 2011, 2011 Second International Conference on Networking and Computing.

An O(n)-time self-stabilizing leader election algorithm

Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula, 2011, J. Parallel Distributed Comput..

Self-stabilizing labeling and ranking in ordered trees

Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, 2011, Theor. Comput. Sci..

Self-stabilizing leader election in optimal space under an arbitrary scheduler

Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula, 2011, Theor. Comput. Sci..

Self-stabilizing Hierarchical Construction of Bounded Size Clusters

Ajoy Kumar Datta, Alain Bui, Lawrence L. Larmore, 2011, SIROCCO.

A self-stabilizing k-clustering algorithm for weighted graphs

Ajoy Kumar Datta, Lawrence L. Larmore, Eddy Caron, 2010, J. Parallel Distributed Comput..

A Self-Stabilizing O(k)-Time k-Clustering Algorithm

Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula, 2010, Comput. J..

A Self-Stabilizing O(n)-Round k-Clustering Algorithm

Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, 2009, 2009 28th IEEE International Symposium on Reliable Distributed Systems.

A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric

E. Caron, B. Depardon, A. Datta, 2009, Euro-Par.

Self-Stabilizing k-out-of-ℓ exclusion on tree networks

Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, 2008, 2009 IEEE International Symposium on Parallel & Distributed Processing.

Self-Stabilizing Leader Election in Optimal Space

Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula, 2008, SSS.

Local Synchronization on Oriented Rings

Ajoy Kumar Datta, Doina Bein, Lawrence L. Larmore, 2008, SSS.

A Self-Stabilizing K-Clustering Algorithm Using an Arbitrary Metric ( Revised Version )

Ajoy Kumar Datta, Lawrence L. Larmore, Eddy Caron, 2008 .

A Self-Stabilizing K-clustering algorithm using an arbitrary metric

B. Depardon, L. Larmore, E. Caron, 2008 .

Three-dimensional embedding of binary trees

Lawrence L. Larmore, Ivan Hal Sudborough, Wolfgang W. Bein, 2000, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN 2000.