Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Lawrence L. Larmore
2010 – today
- 2013
[j59]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre: Self-Stabilizing Small k-Dominating Sets. IJNC 3(1): 116-136 (2013)- [c56]Ajoy Kumar Datta, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe: Linear Time Distributed Swap Edge Algorithms. CIAC 2013: 122-133
- [c55]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore: Self-stabilizing Silent Disjunction in an Anonymous Network. ICDCN 2013: 148-160
- [c54]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Sébastien Tixeuil: Fast Leader (Full) Recovery Despite Dynamic Faults. ICDCN 2013: 428-433
- 2012
- [j58]A. Datta, Stéphane Devismes, Karel Heurtefeux, Lawrence L. Larmore, Yvan Rivierre: Algorithme autostabilisant construisant un petit ensemble k-dominant. Technique et Science Informatiques 31(8-10): 1273-1299 (2012)
- [c53]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre: Competitive Self-Stabilizing k-Clustering. ICDCS 2012: 476-485
- [c52]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore: Brief Announcement: Self-stabilizing Silent Disjunction in an Anonymous Network. SSS 2012: 46-48
- [c51]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 Distrib. 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é. Technique et Science Informatiques 30(10): 1191-1216 (2011)
- [c50]Stéphane Devismes, Karel Heurtefeux, Yvan Rivierre, Ajoy Kumar Datta, Lawrence L. Larmore: Self-Stabilizing Small k-Dominating Sets. ICNC 2011: 30-39
- [c49]Ajoy Kumar Datta, Lawrence L. Larmore, Stéphane Devismes: Sorting on Skip Chains. ICNC 2011: 193-199
- [c48]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
- [c47]Eddy Caron, Benjamin Depardon, Ajoy Kumar Datta, Lawrence L. Larmore: On-Line Optimization of Publish/Subscribe Overlays. IPDPS Workshops 2011: 1919-1929
- [c46]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
- [c45]Ajoy Kumar Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre: Self-stabilizing Labeling and Ranking in Ordered Trees. SSS 2011: 148-162
- [c44]Ajoy Kumar Datta, Anne-Marie Kermarrec, Lawrence L. Larmore, Erwan Le Merrer: Brief Announcement: A Stable and Robust Membership Protocol. SSS 2011: 441-442
- [c43]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 Distrib. Comput. 70(11): 1159-1173 (2010)
- [c42]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 Transactions on Algorithms 6(1) (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)
- [c41]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
- [c40]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
- [c39]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. Comp. 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)
- [c38]Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk: Knowledge States: A Tool for Randomized Online Algorithms. HICSS 2008: 476
- [c37]Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore: Self-stabilizing algorithms for sorting and heapification. IPDPS 2008: 1-12
- [c36]Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Vemula: Self-Stabilizing Leader Election in Optimal Space. SSS 2008: 109-123
- [c35]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)
- [c34]
- [c33]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
- [c32]Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore: Self-stabilizing Space Optimal Synchronization Algorithms on Trees. SIROCCO 2006: 334-348
- [c31]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
- [c30]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. Discrete Applied Mathematics 145(3): 455-464 (2005)
- [c29]T. C. Hu, Lawrence L. Larmore, J. David Morgenthaler: Optimal Integer Alphabetic Trees in Linear Time. ESA 2005: 226-237
- [c28]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
- [c27]Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga: The Delayed k-Server Problem. FCT 2005: 281-292
- [c26]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 Shields Jr., Ivan Hal Sudborough: Embedding A Complete Binary Tree Into A Three-Dimensional Grid. Journal of Interconnection 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 Processing Letters 14(1): 99-105 (2004)
- [c25]Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk: Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. ISPAN 2004: 307-312
- [c24]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)
- [c23]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 (Eds.): 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
- 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)
- [c22]Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough: Fixed Layer Embeddings of Binary Trees. ISPAN 2002: 281-
- [c21]Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough: Block Sorting is Hard. ISPAN 2002: 349-354
- [c20]Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park: Fast Algorithms with Algebraic Monge Properties. MFCS 2002: 104-117
- 2001
- [c19]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)
- [c18]Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough: Three-Dimensional Embedding of Binary Trees. ISPAN 2000: 140-147
1990 – 1999
- 1999
- [c17]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 (Eds.): 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
- 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)
- [c16]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
- [c15]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 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)
- [c14]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 Distrib. Comput. 35(1): 49-56 (1996)
- [c13]Marek Chrobak, Lawrence L. Larmore: Metrical Task Systems, the Server Problem and the Work Function Algorithm. Online Algorithms 1996: 74-96
- [c12]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)
- [c11]Teresa M. Przytycka, Lawrence L. Larmore: The Optimal Alphabetic Tree Problem Revisited. ICALP 1994: 251-262
- 1993
- [c10]Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook: Page Migration Algorithms Using Work Functions. ISAAC 1993: 406-415
- [c9]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. on CAD of Integrated Circuits and Systems 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)
- [c8]Marek Chrobak, Lawrence L. Larmore: Generosity Helps, or an 11-Competitive Algorithm for Three Servers. SODA 1992: 196-202
- [c7]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. Discrete Math. 4(3): 323-328 (1991)
- [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]
- [c4]
- [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]
- [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]
- [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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-29 22:17 CEST by the dblp team