| 2009 |
|---|
| 88 | EE | 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) |
| 87 | EE | 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) |
| 86 | EE | 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) |
| 2008 |
|---|
| 85 | EE | Wolfgang W. Bein,
Lawrence L. Larmore,
Rüdiger Reischuk:
Knowledge States: A Tool for Randomized Online Algorithms.
HICSS 2008: 476 |
| 84 | EE | Doina Bein,
Ajoy Kumar Datta,
Lawrence L. Larmore:
Self-stabilizing algorithms for sorting and heapification.
IPDPS 2008: 1-12 |
| 83 | EE | Ajoy Kumar Datta,
Lawrence L. Larmore,
Priyanka Vemula:
Self-Stabilizing Leader Election in Optimal Space.
SSS 2008: 109-123 |
| 82 | EE | Doina Bein,
Ajoy Kumar Datta,
Chitwan K. Gupta,
Lawrence L. Larmore:
Local Synchronization on Oriented Rings.
SSS 2008: 141-155 |
| 81 | EE | 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) |
| 80 | EE | 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) |
| 2007 |
|---|
| 79 | EE | Wolfgang W. Bein,
Lawrence L. Larmore,
John Noga:
Equitable Revisited.
ESA 2007: 419-426 |
| 78 | EE | 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 |
| 77 | EE | Wolfgang W. Bein,
Lawrence L. Larmore,
Rüdiger Reischuk:
Knowledge State Algorithms: Randomization with Limited Information
CoRR abs/cs/0701142: (2007) |
| 76 | EE | 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) |
| 2006 |
|---|
| 75 | EE | Doina Bein,
Ajoy Kumar Datta,
Lawrence L. Larmore:
On Self-stabilizing Search Trees.
DISC 2006: 76-89 |
| 74 | EE | Doina Bein,
Ajoy Kumar Datta,
Lawrence L. Larmore:
Self-stabilizing Space Optimal Synchronization Algorithms on Trees.
SIROCCO 2006: 334-348 |
| 73 | EE | 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 |
| 72 | EE | Lawrence L. Larmore,
James A. Oravec:
T-Theory Applications to Online Algorithms for the Server Problem
CoRR abs/cs/0611088: (2006) |
| 2005 |
|---|
| 71 | EE | T. C. Hu,
Lawrence L. Larmore,
J. David Morgenthaler:
Optimal Integer Alphabetic Trees in Linear Time.
ESA 2005: 226-237 |
| 70 | EE | 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 |
| 69 | EE | Wolfgang W. Bein,
Kazuo Iwama,
Lawrence L. Larmore,
John Noga:
The Delayed k-Server Problem.
FCT 2005: 281-292 |
| 68 | EE | Wolfgang W. Bein,
Lawrence L. Larmore,
John Noga:
A Better Algorithm for Uniform Metrical Task Systems with Few States.
ISPAN 2005: 94-99 |
| 67 | EE | 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) |
| 2004 |
|---|
| 66 | EE | Wolfgang W. Bein,
Lawrence L. Larmore,
Rüdiger Reischuk:
Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems.
ISPAN 2004: 307-312 |
| 65 | EE | Wolfgang W. Bein,
Leah Epstein,
Lawrence L. Larmore,
John Noga:
Optimally Competitive List Batching.
SWAT 2004: 77-89 |
| 64 | EE | 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) |
| 63 | EE | 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) |
| 2003 |
|---|
| 62 | EE | Robert Benkoczi,
Binay K. Bhattacharya,
Marek Chrobak,
Lawrence L. Larmore,
Wojciech Rytter:
Faster Algorithms for k-Medians in Trees.
MFCS 2003: 218-227 |
| 61 | EE | 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) |
| 2002 |
|---|
| 60 | EE | Wolfgang W. Bein,
Lawrence L. Larmore,
Charles Shields Jr.,
Ivan Hal Sudborough:
Fixed Layer Embeddings of Binary Trees.
ISPAN 2002: 281- |
| 59 | EE | Wolfgang W. Bein,
Lawrence L. Larmore,
Shahram Latifi,
Ivan Hal Sudborough:
Block Sorting is Hard.
ISPAN 2002: 349-354 |
| 58 | EE | Wolfgang W. Bein,
Peter Brucker,
Lawrence L. Larmore,
James K. Park:
Fast Algorithms with Algebraic Monge Properties.
MFCS 2002: 104-117 |
| 57 | EE | 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) |
| 56 | EE | 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) |
| 55 | | Wolfgang W. Bein,
Marek Chrobak,
Lawrence L. Larmore:
The 3-server problem in the plane.
Theor. Comput. Sci. 289(1): 335-354 (2002) |
| 2001 |
|---|
| 54 | EE | Marek Chrobak,
Lawrence L. Larmore,
Wojciech Rytter:
The k-Median Problem for Directed Trees.
MFCS 2001: 260-271 |
| 2000 |
|---|
| 53 | EE | Wolfgang W. Bein,
Lawrence L. Larmore,
Charles Shields Jr.,
Ivan Hal Sudborough:
Three-Dimensional Embedding of Binary Trees.
ISPAN 2000: 140-147 |
| 52 | | Yair Bartal,
Marek Chrobak,
Lawrence L. Larmore:
A Randomized Algorithm for Two Servers on the Line.
Inf. Comput. 158(1): 53-69 (2000) |
| 51 | EE | Wolfgang W. Bein,
Lawrence L. Larmore:
Trackless online algorithms for the server problem.
Inf. Process. Lett. 74(1-2): 73-79 (2000) |
| 50 | EE | 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) |
| 1999 |
|---|
| 49 | EE | Wolfgang W. Bein,
Marek Chrobak,
Lawrence L. Larmore:
The 3-Server Problem in the Plane.
ESA 1999: 301-312 |
| 1998 |
|---|
| 48 | EE | Yair Bartal,
Marek Chrobak,
Lawrence L. Larmore:
A Randomized Algorithm for Two Servers on the Line (Extended Abstract).
ESA 1998: 247-258 |
| 47 | EE | 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 |
| 46 | | Lawrence L. Larmore,
Teresa M. Przytycka:
The Optimal Alphabetic Tree Problem Revisited.
J. Algorithms 28(1): 1-20 (1998) |
| 45 | EE | 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) |
| 1997 |
|---|
| 44 | | 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 |
| 43 | EE | 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) |
| 42 | | Marek Chrobak,
Lawrence L. Larmore,
Nick Reingold,
Jeffery Westbrook:
Page Migration Algorithms Using Work Functions.
J. Algorithms 24(1): 124-157 (1997) |
| 41 | EE | Marek Karpinski,
Lawrence L. Larmore,
Wojciech Rytter:
Correctness of Constructing Optimal Alphabetic Trees Revisited.
Theor. Comput. Sci. 180(1-2): 309-324 (1997) |
| 1996 |
|---|
| 40 | | Marek Chrobak,
Lawrence L. Larmore:
Metrical Task Systems, the Server Problem and the Work Function Algorithm.
Online Algorithms 1996: 74-96 |
| 39 | | Marek Karpinski,
Lawrence L. Larmore,
Wojciech Rytter:
Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees.
SODA 1996: 36-41 |
| 38 | | 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) |
| 1995 |
|---|
| 37 | | Lawrence L. Larmore,
Teresa M. Przytycka:
Constructing Huffman Trees in Parallel.
SIAM J. Comput. 24(6): 1163-1169 (1995) |
| 1994 |
|---|
| 36 | | Teresa M. Przytycka,
Lawrence L. Larmore:
The Optimal Alphabetic Tree Problem Revisited.
ICALP 1994: 251-262 |
| 35 | | Lawrence L. Larmore,
Wojciech Rytter:
An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems.
Inf. Process. Lett. 52(1): 31-34 (1994) |
| 34 | | Marek Chrobak,
Lawrence L. Larmore:
Generosity Helps or an 11-Competitive Algorithm for Three Servers.
J. Algorithms 16(2): 234-263 (1994) |
| 33 | | Lawrence L. Larmore,
Teresa M. Przytycka:
A Fast Algorithm for Optimum Height-Limited Alphabetic Binary Trees.
SIAM J. Comput. 23(6): 1283-1312 (1994) |
| 1993 |
|---|
| 32 | | Marek Chrobak,
Lawrence L. Larmore,
Nick Reingold,
Jeffery Westbrook:
Page Migration Algorithms Using Work Functions.
ISAAC 1993: 406-415 |
| 31 | EE | Lawrence L. Larmore,
Teresa M. Przytycka,
Wojciech Rytter:
Parallel Construction of Optimal Alphabetic Trees.
SPAA 1993: 214-223 |
| 1992 |
|---|
| 30 | EE | Marek Chrobak,
Lawrence L. Larmore:
Generosity Helps, or an 11-Competitive Algorithm for Three Servers.
SODA 1992: 196-202 |
| 29 | | Lawrence L. Larmore,
Wojciech Rytter:
Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition.
STACS 1992: 121-132 |
| 28 | EE | 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) |
| 27 | | Daniel S. Hirschberg,
Lawrence L. Larmore:
The Traveler's Problem.
J. Algorithms 13(1): 148-160 (1992) |
| 26 | | Marek Chrobak,
Lawrence L. Larmore:
Harmonic is 3-Competitive for Two Servers.
Theor. Comput. Sci. 98(2): 339-346 (1992) |
| 1991 |
|---|
| 25 | EE | Lawrence L. Larmore,
Teresa M. Przytycka:
Parallel Construction of Trees with Optimal Weighted Path Length.
SPAA 1991: 71-80 |
| 24 | | Marek Chrobak,
Lawrence L. Larmore:
A Note on the Server Problem and a Benevolent Adversary.
Inf. Process. Lett. 38(4): 173-175 (1991) |
| 23 | | 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) |
| 22 | | Marek Chrobak,
Lawrence L. Larmore:
On Fast Algorithms for Two Servers.
J. Algorithms 12(4): 607-614 (1991) |
| 21 | | Marek Chrobak,
Lawrence L. Larmore:
An Optimal On-Line Algorithm for k-Servers on Trees.
SIAM J. Comput. 20(1): 144-148 (1991) |
| 20 | | Marek Chrobak,
Lawrence L. Larmore:
A New Approach to the Server Problem.
SIAM J. Discrete Math. 4(3): 323-328 (1991) |
| 1990 |
|---|
| 19 | | Marek Chrobak,
Lawrence L. Larmore:
On Fast Algorithms for Two Servers.
MFCS 1990: 202-208 |
| 18 | | Lawrence L. Larmore,
Daniel S. Hirschberg:
Length-Limited Coding.
SODA 1990: 310-318 |
| 17 | | Lawrence L. Larmore,
Baruch Schieber:
On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure.
SODA 1990: 503-512 |
| 16 | | Lawrence L. Larmore:
An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching.
Inf. Process. Lett. 36(3): 147-151 (1990) |
| 15 | EE | Lawrence L. Larmore,
Daniel S. Hirschberg:
A Fast Algorithm for Optimal Length-Limited Huffman Codes
J. ACM 37(3): 464-473 (1990) |
| 14 | | 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) |
| 1989 |
|---|
| 13 | EE | Mikhail J. Atallah,
S. Rao Kosaraju,
Lawrence L. Larmore,
Gary L. Miller,
Shang-Hua Teng:
Constructing Trees in Parallel.
SPAA 1989: 421-431 |
| 12 | | Daniel S. Hirschberg,
Lawrence L. Larmore:
The Set-Set LCS Problem.
Algorithmica 4(4): 503-510 (1989) |
| 11 | | Lawrence L. Larmore:
Minimum Delay Codes.
SIAM J. Comput. 18(1): 82-94 (1989) |
| 1988 |
|---|
| 10 | | 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 |
|---|
| 9 | | Daniel S. Hirschberg,
Lawrence L. Larmore:
The Set LCS Problem.
Algorithmica 2: 91-95 (1987) |
| 8 | | Kadri Krause,
Lawrence L. Larmore,
Dennis J. Volper:
Packing Items from a Triangular Distribution.
Inf. Process. Lett. 25(6): 351-362 (1987) |
| 7 | EE | Daniel S. Hirschberg,
Lawrence L. Larmore:
New applications of failure functions.
J. ACM 34(3): 616-625 (1987) |
| 6 | | Lawrence L. Larmore:
A Subquadratic Algorithm for Constructing Approximately Optimal Binary Search Trees.
J. Algorithms 8(4): 579-591 (1987) |
| 5 | | Daniel S. Hirschberg,
Lawrence L. Larmore:
The Least Weight Subsequence Problem.
SIAM J. Comput. 16(4): 628-638 (1987) |
| 4 | | Lawrence L. Larmore:
Height Restricted Optimal Binary Trees.
SIAM J. Comput. 16(6): 1115-1123 (1987) |
| 1986 |
|---|
| 3 | | Daniel S. Hirschberg,
Lawrence L. Larmore:
Average Case Analysis of Marking Algorithms.
SIAM J. Comput. 15(4): 1069-1074 (1986) |
| 1985 |
|---|
| 2 | | Daniel S. Hirschberg,
Lawrence L. Larmore:
The Least Weight Subsequence Problem (Extended Abstract)
FOCS 1985: 137-143 |
| 1 | | Lawrence L. Larmore,
Daniel S. Hirschberg:
Efficient Optimal Pagination of Scrolls.
Commun. ACM 28(8): 854-856 (1985) |
