Skip to content

Lawrence L. Larmore

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

58

Venues

20

Active years

1985–2019

Best venue rank

A*

Where they publish

Papers

58 indexed papers, newest first.

YearVenueTitleAuthors
2019SSSBrief Announcement: Analysis of a Memory-Efficient Self-stabilizing BFS Spanning Tree Construction.Ajoy K. Datta, Stphane Devismes, Colette Johnen, Lawrence L. Larmore
2018OPODISSelf-Stabilizing Token Distribution with Constant-Space for Trees.Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
2018OPODISLoosely-Stabilizing Leader Election with Polylogarithmic Convergence Time.Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, Lawrence L. Larmore
2018SIROCCOConstant-Space Self-stabilizing Token Distribution in Trees.Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
2017ICDCNA Self-Stabilizing Minimal k-Grouping Algorithm.Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa, Yuichi Sudo
2017SSSBrief Announcement: Reduced Space Self-stabilizing Center Finding Algorithms in Chains and Trees.Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
2016ICDCSThe Same Speed Timer in Population Protocols.Yuichi Sudo, Toshimitsu Masuzawa, Ajoy Kumar Datta, Lawrence L. Larmore
2016SSSLeader Election in Rings with Bounded Multiplicity (Short Paper).Karine Altisen, Ajoy Kumar Datta, Stphane Devismes, Anas Durand, Lawrence L. Larmore
2015ICDCNSelf-Stabilizing ℓ-Exclusion Revisited.Fabienne Carrier, Ajoy Kumar Datta, Stphane Devismes, Lawrence L. Larmore
2015ICDCNConstant Space Self-Stabilizing Center Finding in Anonymous Tree Networks.Ajoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
2015OPODISMaximum Matching for Anonymous Trees with Constant Space per Process.Ajoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
2014OPODISA Communication-Efficient Self-stabilizing Algorithm for Breadth-First Search Trees.Ajoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
2013CIACLinear Time Distributed Swap Edge Algorithms.Ajoy Kumar Datta, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe
2013ICDCNSelf-stabilizing Silent Disjunction in an Anonymous Network.Ajoy Kumar Datta, Stphane Devismes, Lawrence L. Larmore
2013ICDCNFast Leader (Full) Recovery Despite Dynamic Faults.Ajoy Kumar Datta, Stphane Devismes, Lawrence L. Larmore, Sbastien Tixeuil
2013ICDCSRing Exploration by Oblivious Agents with Local Vision.Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
2013SAFECOMPRing Exploration with Oblivious Myopic Robots.Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
2013SSSSelf-stabilizing (f, g)-Alliances with Safe Convergence.Fabienne Carrier, Ajoy Kumar Datta, Stphane Devismes, Lawrence L. Larmore, Yvan Rivierre
2013SSSLeader Election and Centers and Medians in Tree Networks.Ajoy Kumar Datta, Lawrence L. Larmore
2013SSSRing Exploration by Oblivious Robots with Vision Limited to 2 or 3.Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
2012ICDCSCompetitive Self-Stabilizing k-Clustering.Ajoy Kumar Datta, Lawrence L. Larmore, Stphane Devismes, Karel Heurtefeux, Yvan Rivierre
2012SSSBrief Announcement: Self-stabilizing Silent Disjunction in an Anonymous Network.Ajoy Kumar Datta, Stphane Devismes, Lawrence L. Larmore
2012WAOAR-LINE: A Better Randomized 2-Server Algorithm on the Line.Lucas Bang, Wolfgang W. Bein, Lawrence L. Larmore
2011SIROCCOSelf-stabilizing Hierarchical Construction of Bounded Size Clusters.Alain Bui, Simon Clavire, Ajoy Kumar Datta, Lawrence L. Larmore, Devan Sohier
2011SSSBrief Announcement: Sorting on Skip Chains.Ajoy Kumar Datta, Stphane Devismes, Lawrence L. Larmore
2011SSSSelf-stabilizing Labeling and Ranking in Ordered Trees.Ajoy Kumar Datta, Stphane Devismes, Lawrence L. Larmore, Yvan Rivierre
2011SSSBrief Announcement: A Stable and Robust Membership Protocol.Ajoy Kumar Datta, Anne-Marie Kermarrec, Lawrence L. Larmore, Erwan Le Merrer
2010SSSSelf-stabilizing Leader Election in Dynamic Networks.Ajoy Kumar Datta, Lawrence L. Larmore, Hema Piniganti
2009EuroParA Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric.Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore
2009SRDSA Self-Stabilizing O(n)-Round k-Clustering Algorithm.Ajoy Kumar Datta, Stphane Devismes, Lawrence L. Larmore
2008SSSLocal Synchronization on Oriented Rings.Doina Bein, Ajoy Kumar Datta, Chitwan K. Gupta, Lawrence L. Larmore
2008SSSSelf-Stabilizing Leader Election in Optimal Space.Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula
2007ESAEquitable Revisited.Wolfgang W. Bein, Lawrence L. Larmore, John Noga
2007WAOAA Randomized Algorithm for Two Servers in Cross Polytope Spaces.Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec
2006SODAThe Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity.Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang
2006SIROCCOSelf-stabilizing Space Optimal Synchronization Algorithms on Trees.Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore
2005ESAOptimal Integer Alphabetic Trees in Linear Time.T. C. Hu, Lawrence L. Larmore, J. David Morgenthaler
2005FCTThe DelayedWolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga
2005FCTA Faster and Simpler 2-Approximation Algorithm for Block Sorting.Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough
2003MFCSFaster Algorithms forRobert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
2002MFCSFast Algorithms with Algebraic Monge Properties.Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
2001MFCSThe k-Median Problem for Directed Trees.Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
1999ESAThe 3-Server Problem in the Plane.Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore
1998ESAA Randomized Algorithm for Two Servers on the Line (Extended Abstract).Yair Bartal, Marek Chrobak, Lawrence L. Larmore
1998ESAOptimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property.Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter
1997CPMOn the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts.Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
1996SODASequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees.Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter
1994ICALPThe Optimal Alphabetic Tree Problem Revisited.Teresa M. Przytycka, Lawrence L. Larmore
1993ISAACPage Migration Algorithms Using Work Functions.Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery R. Westbrook
1993SPAAParallel Construction of Optimal Alphabetic Trees.Lawrence L. Larmore, Teresa M. Przytycka, Wojciech Rytter
1992SODAGenerosity Helps, or an 11-Competitive Algorithm for Three Servers.Marek Chrobak, Lawrence L. Larmore
1992STACSEfficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition.Lawrence L. Larmore, Wojciech Rytter
1991SPAAParallel Construction of Trees with Optimal Weighted Path Length.Lawrence L. Larmore, Teresa M. Przytycka
1990MFCSOn Fast Algorithms for Two Servers.Marek Chrobak, Lawrence L. Larmore
1990SODALength-Limited Coding.Lawrence L. Larmore, Daniel S. Hirschberg
1990SODAOn-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure.Lawrence L. Larmore, Baruch Schieber
1989SPAAConstructing Trees in Parallel.Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng
1985FOCSThe Least Weight Subsequence Problem (Extended Abstract)Daniel S. Hirschberg, Lawrence L. Larmore