The Least Weight Subsequence Problem (Extended Abstract) - Daniel S. Hirschberg; Lawrence L. Larmore (FOCS, 1985)

Efficient Optimal Pagination of Scrolls. - Lawrence L. Larmore; Daniel S. Hirschberg (Commun. ACM, 1985)

Average Case Analysis of Marking Algorithms. - Daniel S. Hirschberg; Lawrence L. Larmore (SIAM J. Comput., 1986)

The Set LCS Problem. - Daniel S. Hirschberg; Lawrence L. Larmore (Algorithmica, 1987)

Packing Items from a Triangular Distribution. - Kadri Krause; Lawrence L. Larmore; Dennis J. Volper (Inf. Process. Lett., 1987)

New applications of failure functions. - Daniel S. Hirschberg; Lawrence L. Larmore (J. ACM, 1987)

A Subquadratic Algorithm for Constructing Approximately Optimal Binary Search Trees. - Lawrence L. Larmore (J. Algorithms, 1987)

The Least Weight Subsequence Problem. - Daniel S. Hirschberg; Lawrence L. Larmore (SIAM J. Comput., 1987)

Height Restricted Optimal Binary Trees. - Lawrence L. Larmore (SIAM J. Comput., 1987)

Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities. - James H. Hester; Daniel S. Hirschberg; Lawrence L. Larmore (J. Algorithms, 1988)

Constructing Trees in Parallel. - Mikhail J. Atallah; S. Rao Kosaraju; Lawrence L. Larmore; Gary L. Miller; Shang-Hua Teng (SPAA, 1989)

The Set-Set LCS Problem. - Daniel S. Hirschberg; Lawrence L. Larmore (Algorithmica, 1989)

Minimum Delay Codes. - Lawrence L. Larmore (SIAM J. Comput., 1989)

Length-Limited Coding. - Lawrence L. Larmore; Daniel S. Hirschberg (SODA, 1990)

An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching. - Lawrence L. Larmore (Inf. Process. Lett., 1990)

Efficient Parallel Algorithms for String Editing and Related Problems. - Alberto Apostolico; Mikhail J. Atallah; Lawrence L. Larmore; Scott McFaddin (SIAM J. Comput., 1990)

A Fast Algorithm for Optimal Length-Limited Huffman Codes - Lawrence L. Larmore; Daniel S. Hirschberg (J. ACM, 1990)

The Server Problem and On-Line Games. - Marek Chrobak; Lawrence L. Larmore (On-Line Algorithms, 1991)

Parallel Construction of Trees with Optimal Weighted Path Length. - Lawrence L. Larmore; Teresa M. Przytycka (SPAA, 1991)

A Note on the Server Problem and a Benevolent Adversary. - Marek Chrobak; Lawrence L. Larmore (Inf. Process. Lett., 1991)

On Fast Algorithms for Two Servers. - Marek Chrobak; Lawrence L. Larmore (J. Algorithms, 1991)

On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. - Lawrence L. Larmore; Baruch Schieber (J. Algorithms, 1991)

An Optimal On-Line Algorithm for k-Servers on Trees. - Marek Chrobak; Lawrence L. Larmore (SIAM J. Comput., 1991)

A New Approach to the Server Problem. - Marek Chrobak; Lawrence L. Larmore (SIAM J. Discret. Math., 1991)

Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition. - Lawrence L. Larmore; Wojciech Rytter (STACS, 1992)

The Traveler's Problem. - Daniel S. Hirschberg; Lawrence L. Larmore (J. Algorithms, 1992)

Layout placement for sliced architecture. - Lawrence L. Larmore; Daniel D. Gajski; Allen C.-H. Wu (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1992)

Harmonic is 3-Competitive for Two Servers. - Marek Chrobak; Lawrence L. Larmore (Theor. Comput. Sci., 1992)

Parallel Construction of Optimal Alphabetic Trees. - Lawrence L. Larmore; Teresa M. Przytycka; Wojciech Rytter (SPAA, 1993)

An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems. - Lawrence L. Larmore; Wojciech Rytter (Inf. Process. Lett., 1994)

Generosity Helps or an 11-Competitive Algorithm for Three Servers. - Marek Chrobak; Lawrence L. Larmore (J. Algorithms, 1994)

A Fast Algorithm for Optimum Height-Limited Alphabetic Binary Trees. - Lawrence L. Larmore; Teresa M. Przytycka (SIAM J. Comput., 1994)

Constructing Huffman Trees in Parallel. - Lawrence L. Larmore; Teresa M. Przytycka (SIAM J. Comput., 1995)

Metrical Task Systems, the Server Problem and the Work Function Algorithm. - Marek Chrobak; Lawrence L. Larmore (Online Algorithms, 1996)

Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees. - Marek Karpinski; Lawrence L. Larmore; Wojciech Rytter (SODA, 1996)

A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees. - Lawrence L. Larmore; Teresa M. Przytycka (J. Parallel Distributed Comput., 1996)

A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem. - Marek Chrobak; Lawrence L. Larmore; Carsten Lund; Nick Reingold (Inf. Process. Lett., 1997)

Page Migration Algorithms Using Work Functions. - Marek Chrobak; Lawrence L. Larmore; Nick Reingold; Jeffery R. Westbrook (J. Algorithms, 1997)

Correctness of Constructing Optimal Alphabetic Trees Revisited. - Marek Karpinski; Lawrence L. Larmore; Wojciech Rytter (Theor. Comput. Sci., 1997)

A Randomized Algorithm for Two Servers on the Line (Extended Abstract). - Yair Bartal; Marek Chrobak; Lawrence L. Larmore (ESA, 1998)

The Optimal Alphabetic Tree Problem Revisited. - Lawrence L. Larmore; Teresa M. Przytycka (J. Algorithms, 1998)

Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages. - Lawrence L. Larmore; Wojciech Rytter (Theor. Comput. Sci., 1998)

Three-Dimensional Embedding of Binary Trees. - Wolfgang W. Bein; Lawrence L. Larmore; Charles O. Shields Jr.; Ivan Hal Sudborough (ISPAN, 2000)

A Randomized Algorithm for Two Servers on the Line. - Yair Bartal; Marek Chrobak; Lawrence L. Larmore (Inf. Comput., 2000)

Limited bookmark randomized online algorithms for the paging problem. - Wolfgang W. Bein; Rudolf Fleischer; Lawrence L. Larmore (Inf. Process. Lett., 2000)

Trackless online algorithms for the server problem. - Wolfgang W. Bein; Lawrence L. Larmore (Inf. Process. Lett., 2000)

The k-Median Problem for Directed Trees. - Marek Chrobak; Lawrence L. Larmore; Wojciech Rytter (MFCS, 2001)

Fixed Layer Embeddings of Binary Trees. - Wolfgang W. Bein; Lawrence L. Larmore; Charles O. Shields Jr.; Ivan Hal Sudborough (ISPAN, 2002)

Fast Algorithms with Algebraic Monge Properties. - Wolfgang W. Bein; Peter Brucker; Lawrence L. Larmore; James K. Park (MFCS, 2002)

Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. - Phillip G. Bradford; Mordecai J. Golin; Lawrence L. Larmore; Wojciech Rytter (J. Algorithms, 2002)

On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. - Piotr Berman; Marek Karpinski; Lawrence L. Larmore; Wojciech Plandowski; Wojciech Rytter (J. Comput. Syst. Sci., 2002)

The 3-server problem in the plane. - Wolfgang W. Bein; Marek Chrobak; Lawrence L. Larmore (Theor. Comput. Sci., 2002)

Faster Algorithms for k-Medians in Trees. - Robert Benkoczi; Binay K. Bhattacharya; Marek Chrobak; Lawrence L. Larmore; Wojciech Rytter (MFCS, 2003)

Block Sorting is Hard. - Wolfgang W. Bein; Lawrence L. Larmore; Shahram Latifi; Ivan Hal Sudborough (Int. J. Found. Comput. Sci., 2003)

Embedding A Complete Binary Tree Into A Three-Dimensional Grid. - Wolfgang W. Bein; Lawrence L. Larmore; Charles O. Shields Jr.; Ivan Hal Sudborough (J. Interconnect. Networks, 2004)

Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes. - Marek Karpinski; Lawrence L. Larmore; Yakov Nekrich (Parallel Process. Lett., 2004)

Optimal Integer Alphabetic Trees in Linear Time. - T. C. Hu; Lawrence L. Larmore; J. David Morgenthaler (ESA, 2005)

The Delayed k-Server Problem. - Wolfgang W. Bein; Kazuo Iwama; Lawrence L. Larmore; John Noga (FCT, 2005)

A Faster and Simpler 2-Approximation Algorithm for Block Sorting. - Wolfgang W. Bein; Lawrence L. Larmore; Linda Morales; Ivan Hal Sudborough (FCT, 2005)

A Better Algorithm for Uniform Metrical Task Systems with Few States. - Wolfgang W. Bein; Lawrence L. Larmore; John Noga (ISPAN, 2005)

The algebraic Monge property and path problems. - Wolfgang W. Bein; Peter Brucker; Lawrence L. Larmore; James K. Park (Discret. Appl. Math., 2005)

Self-stabilizing Space Optimal Synchronization Algorithms on Trees. - Doina Bein; Ajoy Kumar Datta; Lawrence L. Larmore (SIROCCO, 2006)

On Self-stabilizing Search Trees. - Doina Bein; Ajoy Kumar Datta; Lawrence L. Larmore (DISC, 2006)

T-Theory Applications to Online Algorithms for the Server Problem - Lawrence L. Larmore; James A. Oravec (CoRR, 2006)

Equitable Revisited. - Wolfgang W. Bein; Lawrence L. Larmore; John Noga (ESA, 2007)

Knowledge State Algorithms: Randomization with Limited Information - Wolfgang W. Bein; Lawrence L. Larmore; Rüdiger Reischuk (CoRR, 2007)

Uniform metrical task systems with a limited number of states. - Wolfgang W. Bein; Lawrence L. Larmore; John Noga (Inf. Process. Lett., 2007)

Knowledge States: A Tool for Randomized Online Algorithms. - Wolfgang W. Bein; Lawrence L. Larmore; Rüdiger Reischuk (HICSS, 2008)

Self-stabilizing algorithms for sorting and heapification. - Doina Bein; Ajoy Kumar Datta; Lawrence L. Larmore (IPDPS, 2008)

Local Synchronization on Oriented Rings. - Doina Bein; Ajoy Kumar Datta; Chitwan K. Gupta; Lawrence L. Larmore (SSS, 2008)

Self-Stabilizing Leader Election in Optimal Space. - Ajoy Kumar Datta; Lawrence L. Larmore; Priyanka Vemula (SSS, 2008)

Self-stabilizing K-out-of-L exclusion on tree network - Ajoy Kumar Datta; Stéphane Devismes; Florian Horn 001; Lawrence L. Larmore (CoRR, 2008)

Synchronization Algorithms on Oriented Chains. - Doina Bein; Ajoy Kumar Datta; Lawrence L. Larmore (Sci. Ann. Comput. Sci., 2008)

Space efficient and time optimal distributed BFS tree construction. - Christian Boulinier; Ajoy Kumar Datta; Lawrence L. Larmore; Franck Petit (Inf. Process. Lett., 2008)

A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric. - Eddy Caron; Ajoy Kumar Datta; Benjamin Depardon; Lawrence L. Larmore (Euro-Par, 2009)

Self-Stabilizing k-out-of-l exclusion on tree networks. - Ajoy Kumar Datta; Stéphane Devismes; Florian Horn 001; Lawrence L. Larmore (IPDPS, 2009)

A Self-Stabilizing O(n)-Round k-Clustering Algorithm. - Ajoy Kumar Datta; Stéphane Devismes; Lawrence L. Larmore (SRDS, 2009)

A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs - Wolfgang W. Bein; Leah Epstein; Lawrence L. Larmore; John Noga (CoRR, 2009)

Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. - Wolfgang W. Bein; Lawrence L. Larmore; Rüdiger Reischuk (Int. J. Found. Comput. Sci., 2009)

The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity. - Wolfgang W. Bein; Mordecai J. Golin; Lawrence L. Larmore; Yan Zhang 021 (ACM Trans. Algorithms, 2009)

Optimally competitive list batching. - Wolfgang W. Bein; Leah Epstein; Lawrence L. Larmore; John Noga (Theor. Comput. Sci., 2009)

A quadratic time 2-approximation algorithm for block sorting. - Wolfgang W. Bein; Lawrence L. Larmore; Linda Morales; Ivan Hal Sudborough (Theor. Comput. Sci., 2009)

Self-stabilizing Leader Election in Dynamic Networks. - Ajoy Kumar Datta; Lawrence L. Larmore; Hema Piniganti (SSS, 2010)

A Self-Stabilizing O(k)-Time k-Clustering Algorithm. - Ajoy Kumar Datta; Lawrence L. Larmore; Priyanka Vemula (Comput. J., 2010)

A self-stabilizing k-clustering algorithm for weighted graphs. - Eddy Caron; Ajoy Kumar Datta; Benjamin Depardon; Lawrence L. Larmore (J. Parallel Distributed Comput., 2010)

Sorting on Skip Chains. - Ajoy Kumar Datta; Lawrence L. Larmore; Stéphane Devismes (ICNC, 2011)

Multi-resource Allocation with Unknown Participants. - Ajoy Kumar Datta; Lawrence L. Larmore; Stéphane Devismes; François Kawala; Maria Potop-Butucaru (ICNC, 2011)

On-Line Optimization of Publish/Subscribe Overlays. - Eddy Caron; Benjamin Depardon; Ajoy Kumar Datta; Lawrence L. Larmore (IPDPS Workshops, 2011)

Self-stabilizing Hierarchical Construction of Bounded Size Clusters. - Alain Bui; Simon Clavière; Ajoy Kumar Datta; Lawrence L. Larmore; Devan Sohier (SIROCCO, 2011)

Brief Announcement: Sorting on Skip Chains. - Ajoy Kumar Datta; Stéphane Devismes; Lawrence L. Larmore (SSS, 2011)

Brief Announcement: A Stable and Robust Membership Protocol. - Ajoy Kumar Datta; Anne-Marie Kermarrec; Lawrence L. Larmore; Erwan Le Merrer (SSS, 2011)

Knowledge State Algorithms. - Wolfgang W. Bein; Lawrence L. Larmore; John Noga; Rüdiger Reischuk (Algorithmica, 2011)

Self-Stabilizing k-out-of-ℓ Exclusion in Tree Networks. - Ajoy Kumar Datta; Stéphane Devismes; Florian Horn 001; Lawrence L. Larmore (Int. J. Found. Comput. Sci., 2011)

An O(n)-time self-stabilizing leader election algorithm. - Ajoy Kumar Datta; Lawrence L. Larmore; Priyanka Vemula (J. Parallel Distributed Comput., 2011)

A randomized algorithm for two servers in cross polytope spaces. - Wolfgang W. Bein; Kazuo Iwama; Jun Kawahara; Lawrence L. Larmore; James A. Oravec (Theor. Comput. Sci., 2011)

Self-stabilizing leader election in optimal space under an arbitrary scheduler. - Ajoy Kumar Datta; Lawrence L. Larmore; Priyanka Vemula (Theor. Comput. Sci., 2011)

Un algorithme autostabilisant pour le problème du K-partitionnement sur graphe pondéré. - Eddy Caron; Ajoy Kumar Datta; Benjamin Depardon; Lawrence L. Larmore (Tech. Sci. Informatiques, 2011)

Brief Announcement: Self-stabilizing Silent Disjunction in an Anonymous Network. - Ajoy Kumar Datta; Stéphane Devismes; Lawrence L. Larmore (SSS, 2012)

Algorithme autostabilisant construisant un petit ensemble k-dominant. - Ajoy Kumar Datta; Stéphane Devismes; Karel Heurtefeux; Lawrence L. Larmore; Yvan Rivierre (Tech. Sci. Informatiques, 2012)

Linear Time Distributed Swap Edge Algorithms. - Ajoy Kumar Datta; Lawrence L. Larmore; Linda Pagli; Giuseppe Prencipe (CIAC, 2013)

Fast Leader (Full) Recovery Despite Dynamic Faults. - Ajoy Kumar Datta; Stéphane Devismes; Lawrence L. Larmore; Sébastien Tixeuil (ICDCN, 2013)

Ring Exploration by Oblivious Agents with Local Vision. - Ajoy Kumar Datta; Anissa Lamani; Lawrence L. Larmore; Franck Petit (ICDCS, 2013)

Ring Exploration with Oblivious Myopic Robots. - Ajoy Kumar Datta; Anissa Lamani; Lawrence L. Larmore; Franck Petit (ASCoMS@SAFECOMP, 2013)

Leader Election and Centers and Medians in Tree Networks. - Ajoy Kumar Datta; Lawrence L. Larmore (SSS, 2013)

Ring Exploration by Oblivious Robots with Vision Limited to 2 or 3. - Ajoy Kumar Datta; Anissa Lamani; Lawrence L. Larmore; Franck Petit (SSS, 2013)

Self-Stabilizing Small k-Dominating Sets. - Ajoy Kumar Datta; Lawrence L. Larmore; Stéphane Devismes; Karel Heurtefeux; Yvan Rivierre (Int. J. Netw. Comput., 2013)

Self-stabilizing labeling and ranking in ordered trees. - Ajoy Kumar Datta; Stéphane Devismes; Lawrence L. Larmore; Yvan Rivierre (Theor. Comput. Sci., 2013)

A Communication-Efficient Self-stabilizing Algorithm for Breadth-First Search Trees. - Ajoy Kumar Datta; Lawrence L. Larmore; Toshimitsu Masuzawa (OPODIS, 2014)

Self-Stabilizing ℓ-Exclusion Revisited. - Fabienne Carrier; Ajoy Kumar Datta; Stéphane Devismes; Lawrence L. Larmore (ICDCN, 2015)

Constant Space Self-Stabilizing Center Finding in Anonymous Tree Networks. - Ajoy Kumar Datta; Lawrence L. Larmore; Toshimitsu Masuzawa (ICDCN, 2015)

Enabling Ring Exploration with Myopic Oblivious Robots. - Ajoy Kumar Datta; Anissa Lamani; Lawrence L. Larmore; Franck Petit (IPDPS Workshops, 2015)

Maximum Matching for Anonymous Trees with Constant Space per Process. - Ajoy Kumar Datta; Lawrence L. Larmore; Toshimitsu Masuzawa (OPODIS, 2015)

Self-stabilizing (f, g)-alliances with safe convergence. - Fabienne Carrier; Ajoy Kumar Datta; Stéphane Devismes; Lawrence L. Larmore; Yvan Rivierre (J. Parallel Distributed Comput., 2015)

R-LINE: A better randomized 2-server algorithm on the line. - Lucas Bang; Wolfgang W. Bein; Lawrence L. Larmore (Theor. Comput. Sci., 2015)

The Same Speed Timer in Population Protocols. - Yuichi Sudo; Toshimitsu Masuzawa; Ajoy Kumar Datta; Lawrence L. Larmore (ICDCS, 2016)

Leader Election in Rings with Bounded Multiplicity (Short Paper). - Karine Altisen; Ajoy Kumar Datta; Stéphane Devismes; Anaïs Durand; Lawrence L. Larmore (SSS, 2016)

Competitive self-stabilizing k-clustering. - Ajoy Kumar Datta; Stéphane Devismes; Karel Heurtefeux; Lawrence L. Larmore; Yvan Rivierre (Theor. Comput. Sci., 2016)

A Self-Stabilizing Minimal k-Grouping Algorithm. - Ajoy K. Datta; Lawrence L. Larmore; Toshimitsu Masuzawa; Yuichi Sudo (ICDCN, 2017)

Leader Election in Asymmetric Labeled Unidirectional Rings. - Karine Altisen; Ajoy K. Datta; Stéphane Devismes; Anaïs Durand; Lawrence L. Larmore (IPDPS, 2017)

Brief Announcement: Reduced Space Self-stabilizing Center Finding Algorithms in Chains and Trees. - Yuichi Sudo; Ajoy K. Datta; Lawrence L. Larmore; Toshimitsu Masuzawa (SSS, 2017)

Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge. - Ajoy K. Datta; Stéphane Devismes; Lawrence L. Larmore; Vincent Villain (Parallel Process. Lett., 2017)

Self-stabilizing silent disjunction in an anonymous network. - Ajoy K. Datta; Stéphane Devismes; Lawrence L. Larmore (Theor. Comput. Sci., 2017)

Self-Stabilizing Token Distribution with Constant-Space for Trees. - Yuichi Sudo; Ajoy K. Datta; Lawrence L. Larmore; Toshimitsu Masuzawa (OPODIS, 2018)

Constant-Space Self-stabilizing Token Distribution in Trees. - Yuichi Sudo; Ajoy K. Datta; Lawrence L. Larmore; Toshimitsu Masuzawa (SIROCCO, 2018)

Self-Stabilizing Leader Election in Dynamic Networks. - Ajoy K. Datta; Lawrence L. Larmore (Theory Comput. Syst., 2018)

Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees. - Yuichi Sudo; Ajoy K. Datta; Lawrence L. Larmore; Toshimitsu Masuzawa (Parallel Process. Lett., 2018)

Brief Announcement: Analysis of a Memory-Efficient Self-stabilizing BFS Spanning Tree Construction. - Ajoy K. Datta; Stéphane Devismes; Colette Johnen; Lawrence L. Larmore (SSS, 2019)

Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree. - Ajoy K. Datta; Stéphane Devismes; Colette Johnen; Lawrence L. Larmore (CoRR, 2019)

A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem. - Ajoy K. Datta; Stéphane Devismes; Lawrence L. Larmore (Theor. Comput. Sci., 2019)

Loosely-Stabilizing Leader Election for Arbitrary Graphs in Population Protocol Model. - Yuichi Sudo; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa; Ajoy K. Datta; Lawrence L. Larmore (IEEE Trans. Parallel Distributed Syst., 2019)

Linear time distributed swap edge algorithms. - Ajoy K. Datta; Paolo Ferragina; Lawrence L. Larmore; Linda Pagli; Giuseppe Prencipe (Inf. Process. Lett., 2020)

Election in unidirectional rings with homonyms. - Karine Altisen; Ajoy K. Datta; Stéphane Devismes; Anaïs Durand; Lawrence L. Larmore (J. Parallel Distributed Comput., 2020)

Self-stabilizing token distribution on trees with constant space. - Yuichi Sudo; Ajoy K. Datta; Lawrence L. Larmore; Toshimitsu Masuzawa (J. Parallel Distributed Comput., 2020)

Loosely-stabilizing leader election with polylogarithmic convergence time. - Yuichi Sudo; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu Masuzawa; Ajoy K. Datta; Lawrence L. Larmore (Theor. Comput. Sci., 2020)

Analysis of a memory-efficient self-stabilizing BFS spanning tree construction. - Ajoy K. Datta; Stéphane Devismes; Colette Johnen; Lawrence L. Larmore (Theor. Comput. Sci., 2023)

Breaking the 2-competitiveness barrier for two servers in a tree. - Wolfgang Bein; Lawrence L. Larmore (Theor. Comput. Sci., 2023)