Lawrence L. Larmore

Publication Activity (10 Years)

Years Active: 1985-2023
Publications (10 Years): 30

Top Venues

Theor. Comput. Sci.

SSS

ICDCN

OPODIS

Publications

Wolfgang Bein, Lawrence L. Larmore
Breaking the 2-competitiveness barrier for two servers in a tree. Theor. Comput. Sci. 977 (2023)
Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore
Analysis of a memory-efficient self-stabilizing BFS spanning tree construction. Theor. Comput. Sci. 955 (2023)
Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
Self-stabilizing token distribution on trees with constant space. J. Parallel Distributed Comput. 146 (2020)
Karine Altisen, Ajoy K. Datta, Stéphane Devismes, Anaïs Durand, Lawrence L. Larmore
Election in unidirectional rings with homonyms. J. Parallel Distributed Comput. 146 (2020)
Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, Lawrence L. Larmore
Loosely-stabilizing leader election with polylogarithmic convergence time. Theor. Comput. Sci. 806 (2020)
Ajoy K. Datta, Paolo Ferragina, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe
Linear time distributed swap edge algorithms. Inf. Process. Lett. 161 (2020)
Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore
-dominating set problem. Theor. Comput. Sci. 753 (2019)
Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, Lawrence L. Larmore
Loosely-Stabilizing Leader Election for Arbitrary Graphs in Population Protocol Model. IEEE Trans. Parallel Distributed Syst. 30 (6) (2019)
Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore
Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree. CoRR (2019)
Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore
Brief Announcement: Analysis of a Memory-Efficient Self-stabilizing BFS Spanning Tree Construction. SSS (2019)
Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa, Yuichi Sudo
A Self-Stabilizing Minimal k-Grouping Algorithm. CoRR (2019)
Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
Constant-Space Self-stabilizing Token Distribution in Trees. SIROCCO (2018)
Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees. Parallel Process. Lett. 28 (1) (2018)
Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
Self-Stabilizing Token Distribution with Constant-Space for Trees. OPODIS (2018)
Ajoy K. Datta, Lawrence L. Larmore
Self-Stabilizing Leader Election in Dynamic Networks. Theory Comput. Syst. 62 (5) (2018)
Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, Lawrence L. Larmore
Loosely-Stabilizing Leader Election with Polylogarithmic Convergence Time. OPODIS (2018)
Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore, Vincent Villain
Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge. Parallel Process. Lett. 27 (2) (2017)
Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore
Self-stabilizing silent disjunction in an anonymous network. Theor. Comput. Sci. 665 (2017)
Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
Brief Announcement: Reduced Space Self-stabilizing Center Finding Algorithms in Chains and Trees. SSS (2017)
Karine Altisen, Ajoy K. Datta, Stéphane Devismes, Anaïs Durand, Lawrence L. Larmore
Leader Election in Asymmetric Labeled Unidirectional Rings. IPDPS (2017)
Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa, Yuichi Sudo
A Self-Stabilizing Minimal k-Grouping Algorithm. ICDCN (2017)
Yuichi Sudo, Toshimitsu Masuzawa, Ajoy Kumar Datta, Lawrence L. Larmore
The Same Speed Timer in Population Protocols. ICDCS (2016)
Ajoy Kumar Datta, Stéphane Devismes, Karel Heurtefeux, Lawrence L. Larmore, Yvan Rivierre
Competitive self-stabilizing k-clustering. Theor. Comput. Sci. 626 (2016)
Karine Altisen, Ajoy Kumar Datta, Stéphane Devismes, Anaïs Durand, Lawrence L. Larmore
Leader Election in Rings with Bounded Multiplicity (Short Paper). SSS (2016)
Ajoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
Maximum Matching for Anonymous Trees with Constant Space per Process. OPODIS (2015)
Ajoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
Constant Space Self-Stabilizing Center Finding in Anonymous Tree Networks. ICDCN (2015)
Fabienne Carrier, Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre
Self-stabilizing (f, g)-alliances with safe convergence. J. Parallel Distributed Comput. (2015)
Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
Enabling Ring Exploration with Myopic Oblivious Robots. IPDPS Workshops (2015)
Lucas Bang, Wolfgang W. Bein, Lawrence L. Larmore
R-LINE: A better randomized 2-server algorithm on the line. Theor. Comput. Sci. 605 (2015)
Fabienne Carrier, Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore
Self-Stabilizing ℓ-Exclusion Revisited. ICDCN (2015)
Ajoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
A Communication-Efficient Self-stabilizing Algorithm for Breadth-First Search Trees. OPODIS (2014)
Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, Sébastien Tixeuil
Fast Leader (Full) Recovery Despite Dynamic Faults. IPDPS Workshops (2013)
Ajoy Kumar Datta, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe
Linear Time Distributed Swap Edge Algorithms. CIAC (2013)
Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre
Self-stabilizing labeling and ranking in ordered trees. Theor. Comput. Sci. 512 (2013)
Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
Ring Exploration by Oblivious Robots with Vision Limited to 2 or 3. SSS (2013)
Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre
Self-Stabilizing Small k-Dominating Sets. Int. J. Netw. Comput. 3 (1) (2013)
Fabienne Carrier, Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre
Self-stabilizing (f, g)-Alliances with Safe Convergence. SSS (2013)
Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
Ring Exploration by Oblivious Agents with Local Vision. ICDCS (2013)
Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore
Self-stabilizing Silent Disjunction in an Anonymous Network. ICDCN (2013)
Ajoy Kumar Datta, Lawrence L. Larmore
Leader Election and Centers and Medians in Tree Networks. SSS (2013)
Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
Ring Exploration with Oblivious Myopic Robots. ASCoMS@SAFECOMP (2013)
Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Sébastien Tixeuil
Fast Leader (Full) Recovery Despite Dynamic Faults. ICDCN (2013)
Ajoy Kumar Datta, Stéphane Devismes, Karel Heurtefeux, Lawrence L. Larmore, Yvan Rivierre
Algorithme autostabilisant construisant un petit ensemble k-dominant. Tech. Sci. Informatiques 31 (8-10) (2012)
Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore
Brief Announcement: Self-stabilizing Silent Disjunction in an Anonymous Network. SSS (2012)
Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre
Competitive Self-Stabilizing k-Clustering. ICDCS (2012)
Lucas Bang, Wolfgang W. Bein, Lawrence L. Larmore
R-LINE: A Better Randomized 2-Server Algorithm on the Line. WAOA (2012)
Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
Ring Exploration with Oblivious Myopic Robots CoRR (2012)
Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk
Knowledge State Algorithms. Algorithmica 60 (3) (2011)
Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes
Sorting on Skip Chains. ICNC (2011)
Ajoy Kumar Datta, Anne-Marie Kermarrec, Lawrence L. Larmore, Erwan Le Merrer
Brief Announcement: A Stable and Robust Membership Protocol. SSS (2011)
Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, François Kawala, Maria Potop-Butucaru
Multi-resource Allocation with Unknown Participants. ICNC (2011)
Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore
Un algorithme autostabilisant pour le problème du K-partitionnement sur graphe pondéré. Tech. Sci. Informatiques 30 (10) (2011)
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula
An O(n)-time self-stabilizing leader election algorithm. J. Parallel Distributed Comput. 71 (11) (2011)
Alain Bui, Simon Clavière, Ajoy Kumar Datta, Lawrence L. Larmore, Devan Sohier
Self-stabilizing Hierarchical Construction of Bounded Size Clusters. SIROCCO (2011)
Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore
Brief Announcement: Sorting on Skip Chains. SSS (2011)
Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore
Self-Stabilizing k-out-of-ℓ Exclusion in Tree Networks. Int. J. Found. Comput. Sci. 22 (3) (2011)
Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre, Ajoy Kumar Datta, Lawrence L. Larmore
Self-Stabilizing Small k-Dominating Sets. ICNC (2011)
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec
A randomized algorithm for two servers in cross polytope spaces. Theor. Comput. Sci. 412 (7) (2011)
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula
Self-stabilizing leader election in optimal space under an arbitrary scheduler. Theor. Comput. Sci. 412 (40) (2011)
Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre
Self-stabilizing Labeling and Ranking in Ordered Trees. SSS (2011)
Eddy Caron, Benjamin Depardon, Ajoy Kumar Datta, Lawrence L. Larmore
On-Line Optimization of Publish/Subscribe Overlays. IPDPS Workshops (2011)
Ajoy Kumar Datta, Lawrence L. Larmore, Hema Piniganti
Self-stabilizing Leader Election in Dynamic Networks. SSS (2010)
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula
-Clustering Algorithm. Comput. J. 53 (3) (2010)
Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore
A self-stabilizing k-clustering algorithm for weighted graphs. J. Parallel Distributed Comput. 70 (11) (2010)
Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore
A Self-Stabilizing O(n)-Round k-Clustering Algorithm. SRDS (2009)
Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs CoRR (2009)
Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough
A quadratic time 2-approximation algorithm for block sorting. Theor. Comput. Sci. 410 (8-10) (2009)
Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. Int. J. Found. Comput. Sci. 20 (1) (2009)
Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore
exclusion on tree networks. IPDPS (2009)
Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity. ACM Trans. Algorithms 6 (1) (2009)
Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
Optimally competitive list batching. Theor. Comput. Sci. 410 (38-40) (2009)
Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore
A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric. Euro-Par (2009)
Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore
Self-stabilizing algorithms for sorting and heapification. IPDPS (2008)
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula
Self-Stabilizing Leader Election in Optimal Space. SSS (2008)
Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore
Synchronization Algorithms on Oriented Chains. Sci. Ann. Comput. Sci. 18 (2008)
Doina Bein, Ajoy Kumar Datta, Chitwan K. Gupta, Lawrence L. Larmore
Local Synchronization on Oriented Rings. SSS (2008)
Christian Boulinier, Ajoy Kumar Datta, Lawrence L. Larmore, Franck Petit
Space efficient and time optimal distributed BFS tree construction. Inf. Process. Lett. 108 (5) (2008)
Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
Knowledge States: A Tool for Randomized Online Algorithms. HICSS (2008)
Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore
Self-stabilizing K-out-of-L exclusion on tree network CoRR (2008)
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec
A Randomized Algorithm for Two Servers in Cross Polytope Spaces. WAOA (2007)
Wolfgang W. Bein, Lawrence L. Larmore, John Noga
Uniform metrical task systems with a limited number of states. Inf. Process. Lett. 104 (4) (2007)
Wolfgang W. Bein, Lawrence L. Larmore, John Noga
Equitable Revisited. ESA (2007)
Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
Knowledge State Algorithms: Randomization with Limited Information CoRR (2007)
Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore
Self-stabilizing Space Optimal Synchronization Algorithms on Trees. SIROCCO (2006)
Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore
On Self-stabilizing Search Trees. DISC (2006)
Lawrence L. Larmore, James A. Oravec
T-Theory Applications to Online Algorithms for the Server Problem CoRR (2006)
Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang
The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity. SODA (2006)
T. C. Hu, Lawrence L. Larmore, J. David Morgenthaler
Optimal Integer Alphabetic Trees in Linear Time. ESA (2005)
Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
The algebraic Monge property and path problems. Discret. Appl. Math. 145 (3) (2005)
Wolfgang W. Bein, Lawrence L. Larmore, John Noga
A Better Algorithm for Uniform Metrical Task Systems with Few States. ISPAN (2005)
Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough
A Faster and Simpler 2-Approximation Algorithm for Block Sorting. FCT (2005)
Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga
-Server Problem. FCT (2005)
Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough
Embedding A Complete Binary Tree Into A Three-Dimensional Grid. J. Interconnect. Networks 5 (2) (2004)
Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
Optimally Competitive List Batching. SWAT (2004)
Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. ISPAN (2004)
Marek Karpinski, Lawrence L. Larmore, Yakov Nekrich
Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes. Parallel Process. Lett. 14 (1) (2004)
Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
-Medians in Trees. MFCS (2003)
Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough
Block Sorting is Hard. Int. J. Found. Comput. Sci. 14 (3) (2003)
Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. J. Algorithms 42 (2) (2002)
Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough
Fixed Layer Embeddings of Binary Trees. ISPAN (2002)

Lawrence L. Larmore.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Lawrence L. Larmore