Lawrence L. Larmore

161 papers A* 9A 13B 21C 14Misc 8Journal 82Unranked 14

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	Analysis of a memory-efficient self-stabilizing BFS spanning tree construction. Theor. Comput. Sci. Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore
2023	J	`jnl`	Breaking the 2-competitiveness barrier for two servers in a tree. Theor. Comput. Sci. Wolfgang Bein, Lawrence L. Larmore
2020	J	`jnl`	Election in unidirectional rings with homonyms. J. Parallel Distributed Comput. Karine Altisen, Ajoy K. Datta, Stéphane Devismes, Anaïs Durand, Lawrence L. Larmore
2020	J	`jnl`	Linear time distributed swap edge algorithms. Inf. Process. Lett. Ajoy K. Datta, Paolo Ferragina, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe
2020	J	`jnl`	Loosely-stabilizing leader election with polylogarithmic convergence time. Theor. Comput. Sci. Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, Lawrence L. Larmore
2020	J	`jnl`	Self-stabilizing token distribution on trees with constant space. J. Parallel Distributed Comput. Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
2019	J	`jnl`	A Self-Stabilizing Minimal k-Grouping Algorithm. CoRR Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa, Yuichi Sudo
2019	J	`jnl`	A silent self-stabilizing algorithm for the generalized minimal Theor. Comput. Sci. Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore
2019	J	`jnl`	Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree. CoRR Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore
2019	C	`conf`	Brief Announcement: Analysis of a Memory-Efficient Self-stabilizing BFS Spanning Tree Construction. SSS Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore
2019	J	`jnl`	Loosely-Stabilizing Leader Election for Arbitrary Graphs in Population Protocol Model. IEEE Trans. Parallel Distributed Syst. Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, Lawrence L. Larmore
2018	J	`jnl`	Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees. Parallel Process. Lett. Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
2018	B	`conf`	Constant-Space Self-stabilizing Token Distribution in Trees. SIROCCO Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
2018	B	`conf`	Loosely-Stabilizing Leader Election with Polylogarithmic Convergence Time. OPODIS Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, Lawrence L. Larmore
2018	J	`jnl`	Self-Stabilizing Leader Election in Dynamic Networks. Theory Comput. Syst. Ajoy K. Datta, Lawrence L. Larmore
2018	B	`conf`	Self-Stabilizing Token Distribution with Constant-Space for Trees. OPODIS Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
2017	Misc	`conf`	A Self-Stabilizing Minimal k-Grouping Algorithm. ICDCN Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa, Yuichi Sudo
2017	C	`conf`	Brief Announcement: Reduced Space Self-stabilizing Center Finding Algorithms in Chains and Trees. SSS Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
2017	A	`conf`	Leader Election in Asymmetric Labeled Unidirectional Rings. IPDPS Karine Altisen, Ajoy K. Datta, Stéphane Devismes, Anaïs Durand, Lawrence L. Larmore
2017	J	`jnl`	Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge. Parallel Process. Lett. Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore, Vincent Villain
2017	J	`jnl`	Self-stabilizing silent disjunction in an anonymous network. Theor. Comput. Sci. Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore
2016	J	`jnl`	Competitive self-stabilizing k-clustering. Theor. Comput. Sci. Ajoy Kumar Datta, Stéphane Devismes, Karel Heurtefeux, Lawrence L. Larmore, Yvan Rivierre
2016	C	`conf`	Leader Election in Rings with Bounded Multiplicity (Short Paper). SSS Karine Altisen, Ajoy Kumar Datta, Stéphane Devismes, Anaïs Durand, Lawrence L. Larmore
2016	A	`conf`	The Same Speed Timer in Population Protocols. ICDCS Yuichi Sudo, Toshimitsu Masuzawa, Ajoy Kumar Datta, Lawrence L. Larmore
2015	Misc	`conf`	Constant Space Self-Stabilizing Center Finding in Anonymous Tree Networks. ICDCN Ajoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
2015	—	`conf`	Enabling Ring Exploration with Myopic Oblivious Robots. IPDPS Workshops Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
2015	B	`conf`	Maximum Matching for Anonymous Trees with Constant Space per Process. OPODIS Ajoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
2015	J	`jnl`	R-LINE: A better randomized 2-server algorithm on the line. Theor. Comput. Sci. Lucas Bang, Wolfgang W. Bein, Lawrence L. Larmore
2015	Misc	`conf`	Self-Stabilizing ℓ-Exclusion Revisited. ICDCN Fabienne Carrier, Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore
2015	J	`jnl`	Self-stabilizing (f, g)-alliances with safe convergence. J. Parallel Distributed Comput. Fabienne Carrier, Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre
2014	B	`conf`	A Communication-Efficient Self-stabilizing Algorithm for Breadth-First Search Trees. OPODIS Ajoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa
2013	Misc	`conf`	Fast Leader (Full) Recovery Despite Dynamic Faults. ICDCN Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Sébastien Tixeuil
2013	—	`conf`	Fast Leader (Full) Recovery Despite Dynamic Faults. IPDPS Workshops Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, Sébastien Tixeuil
2013	C	`conf`	Leader Election and Centers and Medians in Tree Networks. SSS Ajoy Kumar Datta, Lawrence L. Larmore
2013	C	`conf`	Linear Time Distributed Swap Edge Algorithms. CIAC Ajoy Kumar Datta, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe
2013	A	`conf`	Ring Exploration by Oblivious Agents with Local Vision. ICDCS Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
2013	C	`conf`	Ring Exploration by Oblivious Robots with Vision Limited to 2 or 3. SSS Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
2013	—	`conf`	Ring Exploration with Oblivious Myopic Robots. ASCoMS@SAFECOMP Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
2013	J	`jnl`	Self-Stabilizing Small k-Dominating Sets. Int. J. Netw. Comput. Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre
2013	C	`conf`	Self-stabilizing (f, g)-Alliances with Safe Convergence. SSS Fabienne Carrier, Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre
2013	Misc	`conf`	Self-stabilizing Silent Disjunction in an Anonymous Network. ICDCN Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore
2013	J	`jnl`	Self-stabilizing labeling and ranking in ordered trees. Theor. Comput. Sci. Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre
2012	J	`jnl`	Algorithme autostabilisant construisant un petit ensemble k-dominant. Tech. Sci. Informatiques Ajoy Kumar Datta, Stéphane Devismes, Karel Heurtefeux, Lawrence L. Larmore, Yvan Rivierre
2012	C	`conf`	Brief Announcement: Self-stabilizing Silent Disjunction in an Anonymous Network. SSS Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore
2012	A	`conf`	Competitive Self-Stabilizing k-Clustering. ICDCS Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre
2012	B	`conf`	R-LINE: A Better Randomized 2-Server Algorithm on the Line. WAOA Lucas Bang, Wolfgang W. Bein, Lawrence L. Larmore
2012	J	`jnl`	Ring Exploration with Oblivious Myopic Robots CoRR Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
2011	J	`jnl`	A randomized algorithm for two servers in cross polytope spaces. Theor. Comput. Sci. Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec
2011	J	`jnl`	An O(n)-time self-stabilizing leader election algorithm. J. Parallel Distributed Comput. Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula
2011	C	`conf`	Brief Announcement: A Stable and Robust Membership Protocol. SSS Ajoy Kumar Datta, Anne-Marie Kermarrec, Lawrence L. Larmore, Erwan Le Merrer
2011	C	`conf`	Brief Announcement: Sorting on Skip Chains. SSS Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore
2011	J	`jnl`	Knowledge State Algorithms. Algorithmica Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk
2011	Misc	`conf`	Multi-resource Allocation with Unknown Participants. ICNC Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, François Kawala, Maria Potop-Butucaru
2011	—	`conf`	On-Line Optimization of Publish/Subscribe Overlays. IPDPS Workshops Eddy Caron, Benjamin Depardon, Ajoy Kumar Datta, Lawrence L. Larmore
2011	Misc	`conf`	Self-Stabilizing Small k-Dominating Sets. ICNC Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre, Ajoy Kumar Datta, Lawrence L. Larmore
2011	J	`jnl`	Self-Stabilizing k-out-of-ℓ Exclusion in Tree Networks. Int. J. Found. Comput. Sci. Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore
2011	B	`conf`	Self-stabilizing Hierarchical Construction of Bounded Size Clusters. SIROCCO Alain Bui, Simon Clavière, Ajoy Kumar Datta, Lawrence L. Larmore, Devan Sohier
2011	C	`conf`	Self-stabilizing Labeling and Ranking in Ordered Trees. SSS Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre
2011	J	`jnl`	Self-stabilizing leader election in optimal space under an arbitrary scheduler. Theor. Comput. Sci. Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula
2011	Misc	`conf`	Sorting on Skip Chains. ICNC Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes
2011	J	`jnl`	Un algorithme autostabilisant pour le problème du K-partitionnement sur graphe pondéré. Tech. Sci. Informatiques Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore
2010	J	`jnl`	A Self-Stabilizing Comput. J. Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula
2010	J	`jnl`	A self-stabilizing k-clustering algorithm for weighted graphs. J. Parallel Distributed Comput. Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore
2010	C	`conf`	Self-stabilizing Leader Election in Dynamic Networks. SSS Ajoy Kumar Datta, Lawrence L. Larmore, Hema Piniganti
2009	J	`jnl`	A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs CoRR Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
2009	B	`conf`	A Self-Stabilizing O(n)-Round k-Clustering Algorithm. SRDS Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore
2009	—	`conf`	A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric. Euro-Par Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore
2009	J	`jnl`	A quadratic time 2-approximation algorithm for block sorting. Theor. Comput. Sci. Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough
2009	J	`jnl`	Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. Int. J. Found. Comput. Sci. Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
2009	J	`jnl`	Optimally competitive list batching. Theor. Comput. Sci. Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
2009	A	`conf`	Self-Stabilizing k-out-of- IPDPS Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore
2009	J	`jnl`	The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity. ACM Trans. Algorithms Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang
2008	—	`conf`	Knowledge States: A Tool for Randomized Online Algorithms. HICSS Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
2008	C	`conf`	Local Synchronization on Oriented Rings. SSS Doina Bein, Ajoy Kumar Datta, Chitwan K. Gupta, Lawrence L. Larmore
2008	C	`conf`	Self-Stabilizing Leader Election in Optimal Space. SSS Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula
2008	J	`jnl`	Self-stabilizing K-out-of-L exclusion on tree network CoRR Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore
2008	A	`conf`	Self-stabilizing algorithms for sorting and heapification. IPDPS Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore
2008	J	`jnl`	Space efficient and time optimal distributed BFS tree construction. Inf. Process. Lett. Christian Boulinier, Ajoy Kumar Datta, Lawrence L. Larmore, Franck Petit
2008	J	`jnl`	Synchronization Algorithms on Oriented Chains. Sci. Ann. Comput. Sci. Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore
2007	B	`conf`	A Randomized Algorithm for Two Servers in Cross Polytope Spaces. WAOA Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec
2007	A	`conf`	Equitable Revisited. ESA Wolfgang W. Bein, Lawrence L. Larmore, John Noga
2007	J	`jnl`	Knowledge State Algorithms: Randomization with Limited Information CoRR Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
2007	J	`jnl`	Uniform metrical task systems with a limited number of states. Inf. Process. Lett. Wolfgang W. Bein, Lawrence L. Larmore, John Noga
2006	A	`conf`	On Self-stabilizing Search Trees. DISC Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore
2006	B	`conf`	Self-stabilizing Space Optimal Synchronization Algorithms on Trees. SIROCCO Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore
2006	J	`jnl`	T-Theory Applications to Online Algorithms for the Server Problem CoRR Lawrence L. Larmore, James A. Oravec
2006	A*	`conf`	The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity. SODA Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang
2005	—	`conf`	A Better Algorithm for Uniform Metrical Task Systems with Few States. ISPAN Wolfgang W. Bein, Lawrence L. Larmore, John Noga
2005	B	`conf`	A Faster and Simpler 2-Approximation Algorithm for Block Sorting. FCT Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough
2005	A	`conf`	Optimal Integer Alphabetic Trees in Linear Time. ESA T. C. Hu, Lawrence L. Larmore, J. David Morgenthaler
2005	B	`conf`	The Delayed FCT Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga
2005	J	`jnl`	The algebraic Monge property and path problems. Discret. Appl. Math. Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
2004	J	`jnl`	Embedding A Complete Binary Tree Into A Three-Dimensional Grid. J. Interconnect. Networks Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough
2004	—	`conf`	Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. ISPAN Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
2004	—	`conf`	Optimally Competitive List Batching. SWAT Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
2004	J	`jnl`	Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes. Parallel Process. Lett. Marek Karpinski, Lawrence L. Larmore, Yakov Nekrich
2003	J	`jnl`	Block Sorting is Hard. Int. J. Found. Comput. Sci. Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough
2003	B	`conf`	Faster Algorithms for MFCS Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
2003	A*	`ed.`	Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA STOC Lawrence L. Larmore, Michel X. Goemans
2002	—	`conf`	Block Sorting is Hard. ISPAN Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough
2002	B	`conf`	Fast Algorithms with Algebraic Monge Properties. MFCS Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
2002	—	`conf`	Fixed Layer Embeddings of Binary Trees. ISPAN Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough
2002	J	`jnl`	On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. J. Comput. Syst. Sci. Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
2002	J	`jnl`	Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. J. Algorithms Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter
2002	J	`jnl`	The 3-server problem in the plane. Theor. Comput. Sci. Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore
2001	B	`conf`	The k-Median Problem for Directed Trees. MFCS Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
2000	J	`jnl`	A Randomized Algorithm for Two Servers on the Line. Inf. Comput. Yair Bartal, Marek Chrobak, Lawrence L. Larmore
2000	J	`jnl`	Limited bookmark randomized online algorithms for the paging problem. Inf. Process. Lett. Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore
2000	—	`conf`	Three-Dimensional Embedding of Binary Trees. ISPAN Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough
2000	J	`jnl`	Trackless online algorithms for the server problem. Inf. Process. Lett. Wolfgang W. Bein, Lawrence L. Larmore
1999	A*	`ed.`	Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, USA STOC Jeffrey Scott Vitter, Lawrence L. Larmore, Frank Thomson Leighton
1999	A	`conf`	The 3-Server Problem in the Plane. ESA Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore
1998	A	`conf`	A Randomized Algorithm for Two Servers on the Line (Extended Abstract). ESA Yair Bartal, Marek Chrobak, Lawrence L. Larmore
1998	J	`jnl`	Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages. Theor. Comput. Sci. Lawrence L. Larmore, Wojciech Rytter
1998	A	`conf`	Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. ESA Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter
1998	J	`jnl`	The Optimal Alphabetic Tree Problem Revisited. J. Algorithms Lawrence L. Larmore, Teresa M. Przytycka
1997	J	`jnl`	A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem. Inf. Process. Lett. Marek Chrobak, Lawrence L. Larmore, Carsten Lund, Nick Reingold
1997	J	`jnl`	Correctness of Constructing Optimal Alphabetic Trees Revisited. Theor. Comput. Sci. Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter
1997	B	`conf`	On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. CPM Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
1997	J	`jnl`	Page Migration Algorithms Using Work Functions. J. Algorithms Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery R. Westbrook
1996	J	`jnl`	A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees. J. Parallel Distributed Comput. Lawrence L. Larmore, Teresa M. Przytycka
1996	—	`conf`	Metrical Task Systems, the Server Problem and the Work Function Algorithm. Online Algorithms Marek Chrobak, Lawrence L. Larmore
1996	A*	`conf`	Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees. SODA Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter
1995	J	`jnl`	Constructing Huffman Trees in Parallel. SIAM J. Comput. Lawrence L. Larmore, Teresa M. Przytycka
1994	J	`jnl`	A Fast Algorithm for Optimum Height-Limited Alphabetic Binary Trees. SIAM J. Comput. Lawrence L. Larmore, Teresa M. Przytycka
1994	J	`jnl`	An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems. Inf. Process. Lett. Lawrence L. Larmore, Wojciech Rytter
1994	J	`jnl`	Generosity Helps or an 11-Competitive Algorithm for Three Servers. J. Algorithms Marek Chrobak, Lawrence L. Larmore
1994	A*	`conf`	The Optimal Alphabetic Tree Problem Revisited. ICALP Teresa M. Przytycka, Lawrence L. Larmore
1993	B	`conf`	Page Migration Algorithms Using Work Functions. ISAAC Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery R. Westbrook
1993	B	`conf`	Parallel Construction of Optimal Alphabetic Trees. SPAA Lawrence L. Larmore, Teresa M. Przytycka, Wojciech Rytter
1992	A	`conf`	Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition. STACS Lawrence L. Larmore, Wojciech Rytter
1992	A*	`conf`	Generosity Helps, or an 11-Competitive Algorithm for Three Servers. SODA Marek Chrobak, Lawrence L. Larmore
1992	J	`jnl`	Harmonic is 3-Competitive for Two Servers. Theor. Comput. Sci. Marek Chrobak, Lawrence L. Larmore
1992	J	`jnl`	Layout placement for sliced architecture. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Lawrence L. Larmore, Daniel D. Gajski, Allen C.-H. Wu
1992	J	`jnl`	The Traveler's Problem. J. Algorithms Daniel S. Hirschberg, Lawrence L. Larmore
1991	J	`jnl`	A New Approach to the Server Problem. SIAM J. Discret. Math. Marek Chrobak, Lawrence L. Larmore
1991	J	`jnl`	A Note on the Server Problem and a Benevolent Adversary. Inf. Process. Lett. Marek Chrobak, Lawrence L. Larmore
1991	J	`jnl`	An Optimal On-Line Algorithm for k-Servers on Trees. SIAM J. Comput. Marek Chrobak, Lawrence L. Larmore
1991	J	`jnl`	On Fast Algorithms for Two Servers. J. Algorithms Marek Chrobak, Lawrence L. Larmore
1991	J	`jnl`	On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. J. Algorithms Lawrence L. Larmore, Baruch Schieber
1991	B	`conf`	Parallel Construction of Trees with Optimal Weighted Path Length. SPAA Lawrence L. Larmore, Teresa M. Przytycka
1991	—	`conf`	The Server Problem and On-Line Games. On-Line Algorithms Marek Chrobak, Lawrence L. Larmore
1990	J	`jnl`	A Fast Algorithm for Optimal Length-Limited Huffman Codes J. ACM Lawrence L. Larmore, Daniel S. Hirschberg
1990	J	`jnl`	An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching. Inf. Process. Lett. Lawrence L. Larmore
1990	J	`jnl`	Efficient Parallel Algorithms for String Editing and Related Problems. SIAM J. Comput. Alberto Apostolico, Mikhail J. Atallah, Lawrence L. Larmore, Scott McFaddin
1990	A*	`conf`	Length-Limited Coding. SODA Lawrence L. Larmore, Daniel S. Hirschberg
1990	B	`conf`	On Fast Algorithms for Two Servers. MFCS Marek Chrobak, Lawrence L. Larmore
1990	A*	`conf`	On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. SODA Lawrence L. Larmore, Baruch Schieber
1989	B	`conf`	Constructing Trees in Parallel. SPAA Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng
1989	J	`jnl`	Minimum Delay Codes. SIAM J. Comput. Lawrence L. Larmore
1989	J	`jnl`	The Set-Set LCS Problem. Algorithmica Daniel S. Hirschberg, Lawrence L. Larmore
1988	J	`jnl`	Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities. J. Algorithms James H. Hester, Daniel S. Hirschberg, Lawrence L. Larmore
1987	J	`jnl`	A Subquadratic Algorithm for Constructing Approximately Optimal Binary Search Trees. J. Algorithms Lawrence L. Larmore
1987	J	`jnl`	Height Restricted Optimal Binary Trees. SIAM J. Comput. Lawrence L. Larmore
1987	J	`jnl`	New applications of failure functions. J. ACM Daniel S. Hirschberg, Lawrence L. Larmore
1987	J	`jnl`	Packing Items from a Triangular Distribution. Inf. Process. Lett. Kadri Krause, Lawrence L. Larmore, Dennis J. Volper
1987	J	`jnl`	The Least Weight Subsequence Problem. SIAM J. Comput. Daniel S. Hirschberg, Lawrence L. Larmore
1987	J	`jnl`	The Set LCS Problem. Algorithmica Daniel S. Hirschberg, Lawrence L. Larmore
1986	J	`jnl`	Average Case Analysis of Marking Algorithms. SIAM J. Comput. Daniel S. Hirschberg, Lawrence L. Larmore
1985	J	`jnl`	Efficient Optimal Pagination of Scrolls. Commun. ACM Lawrence L. Larmore, Daniel S. Hirschberg
1985	A*	`conf`	The Least Weight Subsequence Problem (Extended Abstract) FOCS Daniel S. Hirschberg, Lawrence L. Larmore