The following pages link to Lawrence L. Larmore (Q264578):
Displayed 50 items.
- Competitive self-stabilizing \(k\)-clustering (Q264580) (← links)
- A better lower bound on the competitive ratio of the randomized 2-server problem (Q287141) (← links)
- Self-stabilizing labeling and ranking in ordered trees (Q391998) (← links)
- Self-stabilizing silent disjunction in an anonymous network (Q507596) (← links)
- Knowledge state algorithms (Q548658) (← links)
- A randomized algorithm for two servers in cross polytope spaces (Q627107) (← links)
- An \(O(n)\)-time self-stabilizing leader election algorithm (Q645826) (← links)
- A self-stabilizing \(k\)-clustering algorithm for weighted graphs (Q666253) (← links)
- Self-stabilizing leader election in optimal space under an arbitrary scheduler (Q719296) (← links)
- Self-stabilizing leader election in dynamic networks (Q722199) (← links)
- Linear time distributed swap edge algorithms (Q783711) (← links)
- Optimally competitive list batching (Q837154) (← links)
- R-LINE: a better randomized 2-server algorithm on the line (Q888438) (← links)
- An optimal algorithm with unknown time complexity for convex matrix searching (Q917275) (← links)
- Space efficient and time optimal distributed BFS tree construction (Q975469) (← links)
- A quadratic time 2-approximation algorithm for block sorting (Q1006043) (← links)
- (Q1101214) (redirect page) (← links)
- The set LCS problem (Q1101215) (← links)
- Packing items from a triangular distribution (Q1107981) (← links)
- Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages (Q1128670) (← links)
- A note on the server problem and a benevolent adversary (Q1178219) (← links)
- HARMONIC is 3-competitive for two servers (Q1193886) (← links)
- Real n-plane bundles over an (n+1)-complex (Q1224806) (← links)
- Enumerating immersions and embeddings of projective spaces (Q1240926) (← links)
- Enumerating normal bundles of immersions and embeddings of projective spaces (Q1249367) (← links)
- An optimal sublinear time parallel algorithm for some dynamic programming problems (Q1336746) (← links)
- Correctness of constructing optimal alphabetic trees revisited (Q1390875) (← links)
- Trackless online algorithms for the server problem (Q1607049) (← links)
- Limited bookmark randomized online algorithms for the paging problem (Q1607066) (← links)
- A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem (Q1625600) (← links)
- Constant-space self-stabilizing token distribution in trees (Q1713880) (← links)
- The algebraic Monge property and path problems (Q1765525) (← links)
- The set-set LCS problem (Q1825675) (← links)
- The 3-server problem in the plane. (Q1853532) (← links)
- A randomized algorithm for two servers on the line. (Q1854341) (← links)
- On the complexity of pattern matching for highly compressed two-dimensional texts. (Q1872708) (← links)
- A parallel algorithm for optimum height-limited alphabetic binary trees (Q1923383) (← links)
- Group extensions and twisted cohomology theories (Q2265231) (← links)
- Loosely-stabilizing leader election with polylogarithmic convergence time (Q2285158) (← links)
- Uniform metrical task systems with a limited number of states (Q2380010) (← links)
- The first obstruction to embedding a 1-complex in a 2-manifold (Q2542046) (← links)
- Twisted cohomology and enumeration of vector bundles (Q2543942) (← links)
- Twisted cohomology theories and the single obstruction to lifting (Q2552719) (← links)
- A universal countable first-countable Hausdorff space (Q2553815) (← links)
- Mappings into loop spaces and central group extensions (Q2558060) (← links)
- Analysis of a memory-efficient self-stabilizing BFS spanning tree construction (Q2697434) (← links)
- R–LINE: A Better Randomized 2-Server Algorithm on the Line (Q2848919) (← links)
- The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity (Q2930293) (← links)
- SELF-STABILIZING k-out-of-ℓ EXCLUSION IN TREE NETWORKS (Q2997926) (← links)
- (Q3138908) (← links)