The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lawrence L. Larmore: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
    On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. [Citation Graph (0, 0)][DBLP]
    CPM, 1997, pp:40-51 [Conf]
  2. Marek Chrobak, Lawrence L. Larmore
    Metrical Task Systems, the Server Problem and the Work Function Algorithm. [Citation Graph (0, 0)][DBLP]
    Online Algorithms, 1996, pp:74-96 [Conf]
  3. Yair Bartal, Marek Chrobak, Lawrence L. Larmore
    A Randomized Algorithm for Two Servers on the Line (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:247-258 [Conf]
  4. Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore
    The 3-Server Problem in the Plane. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:301-312 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:43-54 [Conf]
  6. T. C. Hu, Lawrence L. Larmore, J. David Morgenthaler
    Optimal Integer Alphabetic Trees in Linear Time. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:226-237 [Conf]
  7. Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga
    The Delayed k-Server Problem. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:281-292 [Conf]
  8. Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough
    A Faster and Simpler 2-Approximation Algorithm for Block Sorting. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:115-124 [Conf]
  9. Daniel S. Hirschberg, Lawrence L. Larmore
    The Least Weight Subsequence Problem (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:137-143 [Conf]
  10. Teresa M. Przytycka, Lawrence L. Larmore
    The Optimal Alphabetic Tree Problem Revisited. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:251-262 [Conf]
  11. Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook
    Page Migration Algorithms Using Work Functions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:406-415 [Conf]
  12. Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough
    Block Sorting is Hard. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2002, pp:349-354 [Conf]
  13. Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
    Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2004, pp:307-312 [Conf]
  14. Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough
    Three-Dimensional Embedding of Binary Trees. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2000, pp:140-147 [Conf]
  15. Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough
    Fixed Layer Embeddings of Binary Trees. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2002, pp:281-0 [Conf]
  16. Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
    Fast Algorithms with Algebraic Monge Properties. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:104-117 [Conf]
  17. Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
    Faster Algorithms for k-Medians in Trees. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:218-227 [Conf]
  18. Marek Chrobak, Lawrence L. Larmore
    On Fast Algorithms for Two Servers. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:202-208 [Conf]
  19. Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
    The k-Median Problem for Directed Trees. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:260-271 [Conf]
  20. Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore
    Self-stabilizing Space Optimal Synchronization Algorithms on Trees. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:334-348 [Conf]
  21. Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang
    The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:31-40 [Conf]
  22. Marek Chrobak, Lawrence L. Larmore
    Generosity Helps, or an 11-Competitive Algorithm for Three Servers. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:196-202 [Conf]
  23. Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter
    Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:36-41 [Conf]
  24. Lawrence L. Larmore, Daniel S. Hirschberg
    Length-Limited Coding. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:310-318 [Conf]
  25. Lawrence L. Larmore, Baruch Schieber
    On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:503-512 [Conf]
  26. Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng
    Constructing Trees in Parallel. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:421-431 [Conf]
  27. Lawrence L. Larmore, Teresa M. Przytycka
    Parallel Construction of Trees with Optimal Weighted Path Length. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:71-80 [Conf]
  28. Lawrence L. Larmore, Teresa M. Przytycka, Wojciech Rytter
    Parallel Construction of Optimal Alphabetic Trees. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:214-223 [Conf]
  29. Lawrence L. Larmore, Wojciech Rytter
    Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:121-132 [Conf]
  30. Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
    Optimally Competitive List Batching. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:77-89 [Conf]
  31. Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore
    On Self-stabilizing Search Trees. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:76-89 [Conf]
  32. Daniel S. Hirschberg, Lawrence L. Larmore
    The Set LCS Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:91-95 [Journal]
  33. Daniel S. Hirschberg, Lawrence L. Larmore
    The Set-Set LCS Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:4, pp:503-510 [Journal]
  34. Lawrence L. Larmore, Daniel S. Hirschberg
    Efficient Optimal Pagination of Scrolls. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1985, v:28, n:8, pp:854-856 [Journal]
  35. Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
    The algebraic Monge property and path problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:3, pp:455-464 [Journal]
  36. Yair Bartal, Marek Chrobak, Lawrence L. Larmore
    A Randomized Algorithm for Two Servers on the Line. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:158, n:1, pp:53-69 [Journal]
  37. Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough
    Block Sorting is Hard. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:3, pp:425-437 [Journal]
  38. Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore
    Limited bookmark randomized online algorithms for the paging problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:4-6, pp:155-162 [Journal]
  39. Wolfgang W. Bein, Lawrence L. Larmore
    Trackless online algorithms for the server problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:73-79 [Journal]
  40. Marek Chrobak, Lawrence L. Larmore
    A Note on the Server Problem and a Benevolent Adversary. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:4, pp:173-175 [Journal]
  41. Marek Chrobak, Lawrence L. Larmore, Carsten Lund, Nick Reingold
    A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:2, pp:79-83 [Journal]
  42. Kadri Krause, Lawrence L. Larmore, Dennis J. Volper
    Packing Items from a Triangular Distribution. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:6, pp:351-362 [Journal]
  43. Lawrence L. Larmore
    An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:3, pp:147-151 [Journal]
  44. Lawrence L. Larmore, Wojciech Rytter
    An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:1, pp:31-34 [Journal]
  45. Daniel S. Hirschberg, Lawrence L. Larmore
    New applications of failure functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1987, v:34, n:3, pp:616-625 [Journal]
  46. Lawrence L. Larmore, Daniel S. Hirschberg
    A Fast Algorithm for Optimal Length-Limited Huffman Codes [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:464-473 [Journal]
  47. 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. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:2, pp:277-303 [Journal]
  48. Marek Chrobak, Lawrence L. Larmore
    On Fast Algorithms for Two Servers. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:4, pp:607-614 [Journal]
  49. Marek Chrobak, Lawrence L. Larmore
    Generosity Helps or an 11-Competitive Algorithm for Three Servers. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:16, n:2, pp:234-263 [Journal]
  50. Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook
    Page Migration Algorithms Using Work Functions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:1, pp:124-157 [Journal]
  51. Daniel S. Hirschberg, Lawrence L. Larmore
    The Traveler's Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:1, pp:148-160 [Journal]
  52. James H. Hester, Daniel S. Hirschberg, Lawrence L. Larmore
    Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:2, pp:245-253 [Journal]
  53. Lawrence L. Larmore
    A Subquadratic Algorithm for Constructing Approximately Optimal Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:4, pp:579-591 [Journal]
  54. Lawrence L. Larmore, Teresa M. Przytycka
    The Optimal Alphabetic Tree Problem Revisited. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:1, pp:1-20 [Journal]
  55. Lawrence L. Larmore, Baruch Schieber
    On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:3, pp:490-515 [Journal]
  56. Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
    On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:2, pp:332-350 [Journal]
  57. Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough
    Embedding A Complete Binary Tree Into A Three-Dimensional Grid. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2004, v:5, n:2, pp:111-130 [Journal]
  58. Lawrence L. Larmore, Teresa M. Przytycka
    A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:35, n:1, pp:49-56 [Journal]
  59. Marek Karpinski, Lawrence L. Larmore, Yakov Nekrich
    Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2004, v:14, n:1, pp:99-105 [Journal]
  60. Alberto Apostolico, Mikhail J. Atallah, Lawrence L. Larmore, Scott McFaddin
    Efficient Parallel Algorithms for String Editing and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:5, pp:968-988 [Journal]
  61. Marek Chrobak, Lawrence L. Larmore
    An Optimal On-Line Algorithm for k-Servers on Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:1, pp:144-148 [Journal]
  62. Daniel S. Hirschberg, Lawrence L. Larmore
    The Least Weight Subsequence Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:4, pp:628-638 [Journal]
  63. Daniel S. Hirschberg, Lawrence L. Larmore
    Average Case Analysis of Marking Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:4, pp:1069-1074 [Journal]
  64. Lawrence L. Larmore
    Height Restricted Optimal Binary Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:6, pp:1115-1123 [Journal]
  65. Lawrence L. Larmore
    Minimum Delay Codes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:1, pp:82-94 [Journal]
  66. Lawrence L. Larmore, Teresa M. Przytycka
    A Fast Algorithm for Optimum Height-Limited Alphabetic Binary Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:6, pp:1283-1312 [Journal]
  67. Lawrence L. Larmore, Teresa M. Przytycka
    Constructing Huffman Trees in Parallel. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:6, pp:1163-1169 [Journal]
  68. Marek Chrobak, Lawrence L. Larmore
    A New Approach to the Server Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:3, pp:323-328 [Journal]
  69. Lawrence L. Larmore, Daniel D. Gajski, Allen C.-H. Wu
    Layout placement for sliced architecture. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1992, v:11, n:1, pp:102-114 [Journal]
  70. Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore
    The 3-server problem in the plane. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:335-354 [Journal]
  71. Marek Chrobak, Lawrence L. Larmore
    Harmonic is 3-Competitive for Two Servers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:98, n:2, pp:339-346 [Journal]
  72. Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter
    Correctness of Constructing Optimal Alphabetic Trees Revisited. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:180, n:1-2, pp:309-324 [Journal]
  73. Lawrence L. Larmore, Wojciech Rytter
    Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:197, n:1-2, pp:189-201 [Journal]
  74. Wolfgang W. Bein, Lawrence L. Larmore, John Noga
    Equitable Revisited. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:419-426 [Conf]
  75. Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk
    Knowledge State Algorithms: Randomization with Limited Information [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  76. Lawrence L. Larmore, James A. Oravec
    T-Theory Applications to Online Algorithms for the Server Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  77. Wolfgang W. Bein, Lawrence L. Larmore, John Noga
    Uniform metrical task systems with a limited number of states. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:4, pp:123-128 [Journal]

  78. A Self-stabilizing K-Clustering Algorithm Using an Arbitrary Metric. [Citation Graph (, )][DBLP]


  79. Knowledge States: A Tool for Randomized Online Algorithms. [Citation Graph (, )][DBLP]


  80. Self-stabilizing algorithms for sorting and heapification. [Citation Graph (, )][DBLP]


  81. Self-Stabilizing k-out-of-l exclusion on tree networks. [Citation Graph (, )][DBLP]


  82. A Better Algorithm for Uniform Metrical Task Systems with Few States. [Citation Graph (, )][DBLP]


  83. Self-Stabilizing Leader Election in Optimal Space. [Citation Graph (, )][DBLP]


  84. Local Synchronization on Oriented Rings. [Citation Graph (, )][DBLP]


  85. Self-stabilizing Leader Election in Dynamic Networks. [Citation Graph (, )][DBLP]


  86. A Randomized Algorithm for Two Servers in Cross Polytope Spaces. [Citation Graph (, )][DBLP]


  87. A Self-Stabilizing O(k)-Time k-Clustering Algorithm. [Citation Graph (, )][DBLP]


  88. Self-stabilizing K-out-of-L exclusion on tree network [Citation Graph (, )][DBLP]


  89. A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs [Citation Graph (, )][DBLP]


Search in 0.041secs, Finished in 0.044secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002