The following pages link to Lawrence L. Larmore (Q264578):
Displayed 50 items.
- (Q3138930) (← links)
- An Optimal On-Line Algorithm for <i>K</i> Servers on Trees (Q3204037) (← links)
- (Q3361888) (← links)
- A fast algorithm for optimal length-limited Huffman codes (Q3477965) (← links)
- Efficient Parallel Algorithms for String Editing and Related Problems (Q3495649) (← links)
- On Self-stabilizing Search Trees (Q3524295) (← links)
- Equitable Revisited (Q3527231) (← links)
- The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity (Q3583432) (← links)
- Self-stabilizing Space Optimal Synchronization Algorithms on Trees (Q3613662) (← links)
- KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS (Q3620620) (← links)
- Average Case Analysis of Marking Algorithms (Q3756521) (← links)
- Construction of optimal binary split trees in the presence of bounded access probabilities (Q3777470) (← links)
- A subquadratic algorithm for constructing approximately optimal binary search trees (Q3795240) (← links)
- The Least Weight Subsequence Problem (Q3796786) (← links)
- Height Restricted Optimal Binary Trees (Q3801088) (← links)
- Minimum Delay Codes (Q3829074) (← links)
- (Q3868477) (← links)
- On the fundamental group of a space of sections. (Q3914087) (← links)
- A New Approach to the Server Problem (Q3977290) (← links)
- On fast algorithms for two servers (Q3988823) (← links)
- The Traveler's Problem (Q3990621) (← links)
- (Q4010306) (← links)
- Isotopy Groups (Q4164546) (← links)
- The Optimal Alphabetic Tree Problem Revisited (Q4216143) (← links)
- (Q4252022) (← links)
- Generosity Helps or an 11-Competitive Algorithm for Three Servers (Q4285911) (← links)
- A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees (Q4327425) (← links)
- Page Migration Algorithms Using Work Functions (Q4349701) (← links)
- Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property (Q4538082) (← links)
- Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge (Q4598937) (← links)
- (Q4621130) (← links)
- The Optimal Alphabetic Tree problem revisited (Q4632431) (← links)
- (Q4708562) (← links)
- (Q4763407) (← links)
- (Q4776623) (← links)
- (Q4779149) (← links)
- Constructing Huffman Trees in Parallel (Q4862791) (← links)
- (Q4875166) (← links)
- Linear Time Distributed Swap Edge Algorithms (Q4924643) (← links)
- Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees (Q5087837) (← links)
- (Q5091108) (← links)
- (Q5091109) (← links)
- Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition (Q5096776) (← links)
- The Cohomology of (Λ<sup>2</sup><i>X</i>, Δ<i>X</i>) (Q5180103) (← links)
- (Q5182302) (← links)
- On-line dynamic programming with applications to the prediction of RNA secondary structure (Q5202525) (← links)
- Algorithm Theory - SWAT 2004 (Q5315404) (← links)
- Maximum Matching for Anonymous Trees with Constant Space per Process (Q5363807) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431308) (← links)
- A Randomized Algorithm for Two Servers in Cross Polytope Spaces (Q5443387) (← links)