default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLawrence L. Larmore
Person information
- affiliation: University of Nevada Las Vegas, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j75]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: 113804 (2023)- [j74]Wolfgang Bein, Lawrence L. Larmore:
Breaking the 2-competitiveness barrier for two servers in a tree. Theor. Comput. Sci. 977: 114152 (2023) - 2020
- [j73]Ajoy K. Datta, Paolo Ferragina, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe:
Linear time distributed swap edge algorithms. Inf. Process. Lett. 161: 105979 (2020) - [j72]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: 79-95 (2020) - [j71]Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa:
Self-stabilizing token distribution on trees with constant space. J. Parallel Distributed Comput. 146: 201-211 (2020) - [j70]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: 617-631 (2020)
2010 – 2019
- 2019
- [j69]Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore:
A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem. Theor. Comput. Sci. 753: 35-63 (2019) - [j68]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): 1359-1373 (2019) - [c77]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: 99-104 - [i7]Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore:
Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree. CoRR abs/1907.07944 (2019) - [i6]Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa, Yuichi Sudo:
A Self-Stabilizing Minimal k-Grouping Algorithm. CoRR abs/1907.10803 (2019) - 2018
- [j67]Ajoy K. Datta, Lawrence L. Larmore:
Self-Stabilizing Leader Election in Dynamic Networks. Theory Comput. Syst. 62(5): 977-1047 (2018) - [j66]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): 1850002:1-1850002:15 (2018) - [c76]Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, Lawrence L. Larmore:
Loosely-Stabilizing Leader Election with Polylogarithmic Convergence Time. OPODIS 2018: 30:1-30:16 - [c75]Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa:
Self-Stabilizing Token Distribution with Constant-Space for Trees. OPODIS 2018: 31:1-31:16 - [c74]Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa:
Constant-Space Self-stabilizing Token Distribution in Trees. SIROCCO 2018: 25-29 - 2017
- [j65]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): 1750002:1-1750002:18 (2017) - [j64]Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore:
Self-stabilizing silent disjunction in an anonymous network. Theor. Comput. Sci. 665: 51-72 (2017) - [c73]Ajoy K. Datta, Lawrence L. Larmore, Toshimitsu Masuzawa, Yuichi Sudo:
A Self-Stabilizing Minimal k-Grouping Algorithm. ICDCN 2017: 3 - [c72]Karine Altisen, Ajoy K. Datta, Stéphane Devismes, Anaïs Durand, Lawrence L. Larmore:
Leader Election in Asymmetric Labeled Unidirectional Rings. IPDPS 2017: 182-191 - [c71]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: 303-307 - 2016
- [j63]Ajoy Kumar Datta, Stéphane Devismes, Karel Heurtefeux, Lawrence L. Larmore, Yvan Rivierre:
Competitive self-stabilizing k-clustering. Theor. Comput. Sci. 626: 110-133 (2016) - [c70]Yuichi Sudo, Toshimitsu Masuzawa, Ajoy Kumar Datta, Lawrence L. Larmore:
The Same Speed Timer in Population Protocols. ICDCS 2016: 252-261 - [c69]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: 1-6 - 2015
- [j62]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. 81-82: 11-23 (2015) - [j61]Lucas Bang, Wolfgang W. Bein, Lawrence L. Larmore:
R-LINE: A better randomized 2-server algorithm on the line. Theor. Comput. Sci. 605: 106-118 (2015) - [c68]Fabienne Carrier, Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
Self-Stabilizing ℓ-Exclusion Revisited. ICDCN 2015: 3:1-3:10 - [c67]Ajoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa:
Constant Space Self-Stabilizing Center Finding in Anonymous Tree Networks. ICDCN 2015: 38:1-38:10 - [c66]Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit:
Enabling Ring Exploration with Myopic Oblivious Robots. IPDPS Workshops 2015: 490-499 - [c65]Ajoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa:
Maximum Matching for Anonymous Trees with Constant Space per Process. OPODIS 2015: 16:1-16:16 - 2014
- [c64]Ajoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa:
A Communication-Efficient Self-stabilizing Algorithm for Breadth-First Search Trees. OPODIS 2014: 293-306 - 2013
- [j60]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): 116-136 (2013) - [j59]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre:
Self-stabilizing labeling and ranking in ordered trees. Theor. Comput. Sci. 512: 49-66 (2013) - [c63]Ajoy Kumar Datta, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe:
Linear Time Distributed Swap Edge Algorithms. CIAC 2013: 122-133 - [c62]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
Self-stabilizing Silent Disjunction in an Anonymous Network. ICDCN 2013: 148-160 - [c61]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Sébastien Tixeuil:
Fast Leader (Full) Recovery Despite Dynamic Faults. ICDCN 2013: 428-433 - [c60]Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit:
Ring Exploration by Oblivious Agents with Local Vision. ICDCS 2013: 347-356 - [c59]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, Sébastien Tixeuil:
Fast Leader (Full) Recovery Despite Dynamic Faults. IPDPS Workshops 2013: 716-725 - [c58]Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit:
Ring Exploration with Oblivious Myopic Robots. ASCoMS@SAFECOMP 2013 - [c57]Fabienne Carrier, Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre:
Self-stabilizing (f, g)-Alliances with Safe Convergence. SSS 2013: 61-73 - [c56]Ajoy Kumar Datta, Lawrence L. Larmore:
Leader Election and Centers and Medians in Tree Networks. SSS 2013: 113-132 - [c55]Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit:
Ring Exploration by Oblivious Robots with Vision Limited to 2 or 3. SSS 2013: 363-366 - 2012
- [j58]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): 1273-1299 (2012) - [c54]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre:
Competitive Self-Stabilizing k-Clustering. ICDCS 2012: 476-485 - [c53]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
Brief Announcement: Self-stabilizing Silent Disjunction in an Anonymous Network. SSS 2012: 46-48 - [c52]Lucas Bang, Wolfgang W. Bein, Lawrence L. Larmore:
R-LINE: A Better Randomized 2-Server Algorithm on the Line. WAOA 2012: 120-130 - [i5]Ajoy Kumar Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit:
Ring Exploration with Oblivious Myopic Robots. CoRR abs/1205.5003 (2012) - 2011
- [j57]Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk:
Knowledge State Algorithms. Algorithmica 60(3): 653-678 (2011) - [j56]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): 657-677 (2011) - [j55]Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula:
An O(n)-time self-stabilizing leader election algorithm. J. Parallel Distributed Comput. 71(11): 1532-1544 (2011) - [j54]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): 563-572 (2011) - [j53]Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula:
Self-stabilizing leader election in optimal space under an arbitrary scheduler. Theor. Comput. Sci. 412(40): 5541-5561 (2011) - [j52]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): 1191-1216 (2011) - [c51]Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre, Ajoy Kumar Datta, Lawrence L. Larmore:
Self-Stabilizing Small k-Dominating Sets. ICNC 2011: 30-39 - [c50]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes:
Sorting on Skip Chains. ICNC 2011: 193-199 - [c49]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, François Kawala, Maria Potop-Butucaru:
Multi-resource Allocation with Unknown Participants. ICNC 2011: 200-206 - [c48]Eddy Caron, Benjamin Depardon, Ajoy Kumar Datta, Lawrence L. Larmore:
On-Line Optimization of Publish/Subscribe Overlays. IPDPS Workshops 2011: 1919-1929 - [c47]Alain Bui, Simon Clavière, Ajoy Kumar Datta, Lawrence L. Larmore, Devan Sohier:
Self-stabilizing Hierarchical Construction of Bounded Size Clusters. SIROCCO 2011: 54-65 - [c46]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre:
Self-stabilizing Labeling and Ranking in Ordered Trees. SSS 2011: 148-162 - [c45]Ajoy Kumar Datta, Anne-Marie Kermarrec, Lawrence L. Larmore, Erwan Le Merrer:
Brief Announcement: A Stable and Robust Membership Protocol. SSS 2011: 441-442 - [c44]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
Brief Announcement: Sorting on Skip Chains. SSS 2011: 443-444 - 2010
- [j51]Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula:
A Self-Stabilizing O(k)-Time k-Clustering Algorithm. Comput. J. 53(3): 342-350 (2010) - [j50]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): 1159-1173 (2010) - [c43]Ajoy Kumar Datta, Lawrence L. Larmore, Hema Piniganti:
Self-stabilizing Leader Election in Dynamic Networks. SSS 2010: 35-49
2000 – 2009
- 2009
- [j49]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): 167-183 (2009) - [j48]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): 17:1-17:22 (2009) - [j47]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): 711-717 (2009) - [j46]Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga:
Optimally competitive list batching. Theor. Comput. Sci. 410(38-40): 3631-3639 (2009) - [c42]Eddy Caron, Ajoy Kumar Datta, Benjamin Depardon, Lawrence L. Larmore:
A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric. Euro-Par 2009: 602-614 - [c41]Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore:
Self-Stabilizing k-out-of-l exclusion on tree networks. IPDPS 2009: 1-8 - [c40]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore:
A Self-Stabilizing O(n)-Round k-Clustering Algorithm. SRDS 2009: 147-155 - [i4]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 abs/0904.1002 (2009) - 2008
- [j45]Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore:
Synchronization Algorithms on Oriented Chains. Sci. Ann. Comput. Sci. 18: 13-34 (2008) - [j44]Christian Boulinier, Ajoy Kumar Datta, Lawrence L. Larmore, Franck Petit:
Space efficient and time optimal distributed BFS tree construction. Inf. Process. Lett. 108(5): 273-278 (2008) - [c39]Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk:
Knowledge States: A Tool for Randomized Online Algorithms. HICSS 2008: 476 - [c38]Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore:
Self-stabilizing algorithms for sorting and heapification. IPDPS 2008: 1-12 - [c37]Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula:
Self-Stabilizing Leader Election in Optimal Space. SSS 2008: 109-123 - [c36]Doina Bein, Ajoy Kumar Datta, Chitwan K. Gupta, Lawrence L. Larmore:
Local Synchronization on Oriented Rings. SSS 2008: 141-155 - [i3]Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore:
Self-stabilizing K-out-of-L exclusion on tree network. CoRR abs/0812.1093 (2008) - 2007
- [j43]Wolfgang W. Bein, Lawrence L. Larmore, John Noga:
Uniform metrical task systems with a limited number of states. Inf. Process. Lett. 104(4): 123-128 (2007) - [c35]Wolfgang W. Bein, Lawrence L. Larmore, John Noga:
Equitable Revisited. ESA 2007: 419-426 - [c34]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: 246-259 - [i2]Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk:
Knowledge State Algorithms: Randomization with Limited Information. CoRR abs/cs/0701142 (2007) - 2006
- [c33]Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore:
Self-stabilizing Space Optimal Synchronization Algorithms on Trees. SIROCCO 2006: 334-348 - [c32]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: 31-40 - [c31]Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore:
On Self-stabilizing Search Trees. DISC 2006: 76-89 - [i1]Lawrence L. Larmore, James A. Oravec:
T-Theory Applications to Online Algorithms for the Server Problem. CoRR abs/cs/0611088 (2006) - 2005
- [j42]Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park:
The algebraic Monge property and path problems. Discret. Appl. Math. 145(3): 455-464 (2005) - [c30]T. C. Hu, Lawrence L. Larmore, J. David Morgenthaler:
Optimal Integer Alphabetic Trees in Linear Time. ESA 2005: 226-237 - [c29]Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough:
A Faster and Simpler 2-Approximation Algorithm for Block Sorting. FCT 2005: 115-124 - [c28]Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga:
The Delayed k-Server Problem. FCT 2005: 281-292 - [c27]Wolfgang W. Bein, Lawrence L. Larmore, John Noga:
A Better Algorithm for Uniform Metrical Task Systems with Few States. ISPAN 2005: 94-99 - 2004
- [j41]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): 111-130 (2004) - [j40]Marek Karpinski, Lawrence L. Larmore, Yakov Nekrich:
Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes. Parallel Process. Lett. 14(1): 99-105 (2004) - [c26]Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk:
Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. ISPAN 2004: 307-312 - [c25]Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga:
Optimally Competitive List Batching. SWAT 2004: 77-89 - 2003
- [j39]Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough:
Block Sorting is Hard. Int. J. Found. Comput. Sci. 14(3): 425-437 (2003) - [c24]Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter:
Faster Algorithms for k-Medians in Trees. MFCS 2003: 218-227 - [e2]Lawrence L. Larmore, Michel X. Goemans:
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA. ACM 2003, ISBN 1-58113-674-9 [contents] - 2002
- [j38]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): 277-303 (2002) - [j37]Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter:
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. J. Comput. Syst. Sci. 65(2): 332-350 (2002) - [j36]Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore:
The 3-server problem in the plane. Theor. Comput. Sci. 289(1): 335-354 (2002) - [c23]Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough:
Fixed Layer Embeddings of Binary Trees. ISPAN 2002: 281- - [c22]Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough:
Block Sorting is Hard. ISPAN 2002: 349-354 - [c21]Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park:
Fast Algorithms with Algebraic Monge Properties. MFCS 2002: 104-117 - 2001
- [c20]Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter:
The k-Median Problem for Directed Trees. MFCS 2001: 260-271 - 2000
- [j35]Yair Bartal, Marek Chrobak, Lawrence L. Larmore:
A Randomized Algorithm for Two Servers on the Line. Inf. Comput. 158(1): 53-69 (2000) - [j34]Wolfgang W. Bein, Lawrence L. Larmore:
Trackless online algorithms for the server problem. Inf. Process. Lett. 74(1-2): 73-79 (2000) - [j33]Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore:
Limited bookmark randomized online algorithms for the paging problem. Inf. Process. Lett. 76(4-6): 155-162 (2000) - [c19]Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough:
Three-Dimensional Embedding of Binary Trees. ISPAN 2000: 140-147
1990 – 1999
- 1999
- [c18]Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore:
The 3-Server Problem in the Plane. ESA 1999: 301-312 - [e1]Jeffrey Scott Vitter, Lawrence L. Larmore, Frank Thomson Leighton:
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, USA. ACM 1999, ISBN 1-58113-067-8 [contents] - 1998
- [j32]Lawrence L. Larmore, Teresa M. Przytycka:
The Optimal Alphabetic Tree Problem Revisited. J. Algorithms 28(1): 1-20 (1998) - [j31]Lawrence L. Larmore, Wojciech Rytter:
Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages. Theor. Comput. Sci. 197(1-2): 189-201 (1998) - [c17]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. ESA 1998: 43-54 - [c16]Yair Bartal, Marek Chrobak, Lawrence L. Larmore:
A Randomized Algorithm for Two Servers on the Line (Extended Abstract). ESA 1998: 247-258 - 1997
- [j30]Marek Chrobak, Lawrence L. Larmore, Carsten Lund, Nick Reingold:
A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem. Inf. Process. Lett. 63(2): 79-83 (1997) - [j29]Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery R. Westbrook:
Page Migration Algorithms Using Work Functions. J. Algorithms 24(1): 124-157 (1997) - [j28]Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter:
Correctness of Constructing Optimal Alphabetic Trees Revisited. Theor. Comput. Sci. 180(1-2): 309-324 (1997) - [c15]Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter:
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. CPM 1997: 40-51 - 1996
- [j27]Lawrence L. Larmore, Teresa M. Przytycka:
A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees. J. Parallel Distributed Comput. 35(1): 49-56 (1996) - [c14]Marek Chrobak, Lawrence L. Larmore:
Metrical Task Systems, the Server Problem and the Work Function Algorithm. Online Algorithms 1996: 74-96 - [c13]Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter:
Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees. SODA 1996: 36-41 - 1995
- [j26]Lawrence L. Larmore, Teresa M. Przytycka:
Constructing Huffman Trees in Parallel. SIAM J. Comput. 24(6): 1163-1169 (1995) - 1994
- [j25]Lawrence L. Larmore, Wojciech Rytter:
An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems. Inf. Process. Lett. 52(1): 31-34 (1994) - [j24]Marek Chrobak, Lawrence L. Larmore:
Generosity Helps or an 11-Competitive Algorithm for Three Servers. J. Algorithms 16(2): 234-263 (1994) - [j23]Lawrence L. Larmore, Teresa M. Przytycka:
A Fast Algorithm for Optimum Height-Limited Alphabetic Binary Trees. SIAM J. Comput. 23(6): 1283-1312 (1994) - [c12]Teresa M. Przytycka, Lawrence L. Larmore:
The Optimal Alphabetic Tree Problem Revisited. ICALP 1994: 251-262 - 1993
- [c11]Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery R. Westbrook:
Page Migration Algorithms Using Work Functions. ISAAC 1993: 406-415 - [c10]Lawrence L. Larmore, Teresa M. Przytycka, Wojciech Rytter:
Parallel Construction of Optimal Alphabetic Trees. SPAA 1993: 214-223 - 1992
- [j22]Daniel S. Hirschberg, Lawrence L. Larmore:
The Traveler's Problem. J. Algorithms 13(1): 148-160 (1992) - [j21]Lawrence L. Larmore, Daniel D. Gajski, Allen C.-H. Wu:
Layout placement for sliced architecture. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 11(1): 102-114 (1992) - [j20]Marek Chrobak, Lawrence L. Larmore:
Harmonic is 3-Competitive for Two Servers. Theor. Comput. Sci. 98(2): 339-346 (1992) - [c9]Marek Chrobak, Lawrence L. Larmore:
Generosity Helps, or an 11-Competitive Algorithm for Three Servers. SODA 1992: 196-202 - [c8]Lawrence L. Larmore, Wojciech Rytter:
Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition. STACS 1992: 121-132 - 1991
- [j19]Marek Chrobak, Lawrence L. Larmore:
A Note on the Server Problem and a Benevolent Adversary. Inf. Process. Lett. 38(4): 173-175 (1991) - [j18]Lawrence L. Larmore, Baruch Schieber:
On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. J. Algorithms 12(3): 490-515 (1991) - [j17]Marek Chrobak, Lawrence L. Larmore:
On Fast Algorithms for Two Servers. J. Algorithms 12(4): 607-614 (1991) - [j16]Marek Chrobak, Lawrence L. Larmore:
An Optimal On-Line Algorithm for k-Servers on Trees. SIAM J. Comput. 20(1): 144-148 (1991) - [j15]Marek Chrobak, Lawrence L. Larmore:
A New Approach to the Server Problem. SIAM J. Discret. Math. 4(3): 323-328 (1991) - [c7]Marek Chrobak, Lawrence L. Larmore:
The Server Problem and On-Line Games. On-Line Algorithms 1991: 11-64 - [c6]Lawrence L. Larmore, Teresa M. Przytycka:
Parallel Construction of Trees with Optimal Weighted Path Length. SPAA 1991: 71-80 - 1990
- [j14]Lawrence L. Larmore:
An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching. Inf. Process. Lett. 36(3): 147-151 (1990) - [j13]Lawrence L. Larmore, Daniel S. Hirschberg:
A Fast Algorithm for Optimal Length-Limited Huffman Codes. J. ACM 37(3): 464-473 (1990) - [j12]Alberto Apostolico, Mikhail J. Atallah, Lawrence L. Larmore, Scott McFaddin:
Efficient Parallel Algorithms for String Editing and Related Problems. SIAM J. Comput. 19(5): 968-988 (1990) - [c5]Marek Chrobak, Lawrence L. Larmore:
On Fast Algorithms for Two Servers. MFCS 1990: 202-208 - [c4]Lawrence L. Larmore, Daniel S. Hirschberg:
Length-Limited Coding. SODA 1990: 310-318 - [c3]Lawrence L. Larmore, Baruch Schieber:
On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. SODA 1990: 503-512
1980 – 1989
- 1989
- [j11]Daniel S. Hirschberg, Lawrence L. Larmore:
The Set-Set LCS Problem. Algorithmica 4(4): 503-510 (1989) - [j10]Lawrence L. Larmore:
Minimum Delay Codes. SIAM J. Comput. 18(1): 82-94 (1989) - [c2]Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng:
Constructing Trees in Parallel. SPAA 1989: 421-431 - 1988
- [j9]James H. Hester, Daniel S. Hirschberg, Lawrence L. Larmore:
Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities. J. Algorithms 9(2): 245-253 (1988) - 1987
- [j8]Daniel S. Hirschberg, Lawrence L. Larmore:
The Set LCS Problem. Algorithmica 2: 91-95 (1987) - [j7]Kadri Krause, Lawrence L. Larmore, Dennis J. Volper:
Packing Items from a Triangular Distribution. Inf. Process. Lett. 25(6): 351-362 (1987) - [j6]Daniel S. Hirschberg, Lawrence L. Larmore:
New applications of failure functions. J. ACM 34(3): 616-625 (1987) - [j5]Lawrence L. Larmore:
A Subquadratic Algorithm for Constructing Approximately Optimal Binary Search Trees. J. Algorithms 8(4): 579-591 (1987) - [j4]Daniel S. Hirschberg, Lawrence L. Larmore:
The Least Weight Subsequence Problem. SIAM J. Comput. 16(4): 628-638 (1987) - [j3]Lawrence L. Larmore:
Height Restricted Optimal Binary Trees. SIAM J. Comput. 16(6): 1115-1123 (1987) - 1986
- [j2]Daniel S. Hirschberg, Lawrence L. Larmore:
Average Case Analysis of Marking Algorithms. SIAM J. Comput. 15(4): 1069-1074 (1986) - 1985
- [j1]Lawrence L. Larmore, Daniel S. Hirschberg:
Efficient Optimal Pagination of Scrolls. Commun. ACM 28(8): 854-856 (1985) - [c1]Daniel S. Hirschberg, Lawrence L. Larmore:
The Least Weight Subsequence Problem (Extended Abstract). FOCS 1985: 137-143
Coauthor Index
Wolfgang W. Bein
aka: Wolfgang Bein
aka: Wolfgang Bein
Ajoy K. Datta
aka: Ajoy Kumar Datta
aka: Ajoy Kumar Datta
[j75] [j73] [j72] [j71] [j70] [j69] [j68] [c77] [i7] [i6] [j67] [j66] [c76] [c75] [c74] [j65] [j64] [c73] [c72] [c71] [j63] [c70] [c69] [j62] [c68] [c67] [c66] [c65] [c64] [j60] [j59] [c63] [c62] [c61] [c60] [c59] [c58] [c57] [c56] [c55] [j58] [c54] [c53] [i5] [j56] [j55] [j53] [j52] [c51] [c50] [c49] [c48] [c47] [c46] [c45] [c44] [j51] [j50] [c43] [c42] [c41] [c40] [j45] [j44] [c38] [c37] [c36] [i3] [c33] [c31]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
