Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Larmore, Lawrence"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Self-stabilizing labeling and ranking in ordered trees
Ajoy K. Datta
,
Stéphane Devismes
,
Lawrence L. Larmore
,
Yvan Rivierre
Theoretical Computer Science
512
, 2013, pp. 49-66
Linear time distributed swap edge algorithms
Ajoy K. Datta
,
Lawrence L. Larmore
,
Linda Pagli
,
Giuseppe Prencipe
Lecture Notes in Computer Science
7878
, 2013, pp. 122-133
A randomized algorithm for two servers in cross polytope spaces
Wolfgang Bein
,
Kazuo Iwama
,
Jun Kawahara
,
Lawrence L. Larmore
,
James A. Oravec
Theoretical Computer Science
412
(7), 2011, pp. 563-572
Knowledge state algorithms
Wolfgang Bein
,
Lawrence L. Larmore
,
John Noga
,
Rüdiger Reischuk
Algorithmica
60
(3), 2011, pp. 653-678
Self-stabilizing
k
-out-of-
\ell
exclusion in tree networks
Ajoy K. Datta
,
Stéphane Devismes
,
Florian Horn
,
Lawrence L. Larmore
International Journal of Foundations of Computer Science
22
(3), 2011, pp. 657-677
An
^{O(n)}
-time self-stabilizing leader election algorithm
Ajoy K. Datta
,
Lawrence L. Larmore
,
Priyanka Vemula
Journal Parallel Distributed Computing
71
(11), 2011, pp. 1532-1544
Self-stabilizing leader election in optimal space under an arbitrary scheduler
Ajoy K. Datta
,
Lawrence L. Larmore
,
Priyanka Vemula
Theoretical Computer Science
412
(40), 2011, pp. 5541-5561
A self-stabilizing
k
-clustering algorithm for weighted graphs
Eddy Caron
,
Ajoy K. Datta
,
Benjamin Depardon
,
Lawrence L. Larmore
Journal Parallel Distributed Computing
70
(11), 2010, pp. 1159-1173
Optimally competitive list batching
Wolfgang Bein
,
Leah Epstein
,
Lawrence L. Larmore
,
John Noga
Theoretical Computer Science
410
(38-40), 2009, pp. 3631-3639
A quadratic time 2-approximation algorithm for block sorting
Wolfgang W. Bein
,
Lawrence L. Larmore
,
Linda Morales
,
I. Hal Sudborough
Theoretical Computer Science
410
(8-10), 2009, pp. 711-717
Knowledge states for the caching problem in shared memory multiprocessor systems
Wolfgang Bein
,
Lawrence L. Larmore
,
Rüdiger Reischuk
International Journal of Foundations of Computer Science
20
(1), 2009, pp. 167-183
Space efficient and time optimal distributed BFS tree construction
Christian Boulinier
,
Ajoy K. Datta
,
Lawrence L. Larmore
,
Franck Petit
Information Processing Letters
108
(5), 2008, pp. 273-278
Uniform metrical task systems with a limited number of states
Wolfgang Bein
,
Lawrence L. Larmore
,
John Noga
Information Processing Letters
104
(4), 2007, pp. 123-128
Equitable revisited
Wolfgang Bein
,
Lawrence L. Larmore
,
John Noga
Lecture Notes in Computer Science
4698
, 2007, pp. 419-426
Optimal integer alphabetic trees in linear time
T.C. Hu
,
Lawrence L. Larmore
,
J. David Morgenthaler
Lecture Notes in Computer Science
3669
, 2005, pp. 226-237
Optimally competitive list batching
Wolfgang W. Bein
,
Leah Epstein
,
Lawrence L. Larmore
,
John Noga
Lecture Notes in Computer Science
3111
, 2004, pp. 77-89
Work-efficient algorithms for the construction of length-limited Huffman codes
Marek Karpinski
,
Lawrence Larmore
,
Yakov Nekrich
Parallel Processing Letters
14
(1), 2004, pp. 99-105
Block sorting is hard
Wolfgang W. Bein
,
Lawrence L. Larmore
,
Shahram Latifi
,
I. Hal Sudborough
International Journal of Foundations of Computer Science
14
(3), 2003, pp. 425-437
Faster algorithms for
k
-medians in trees
Robert Benkoczi
,
Binay Bhattacharya
,
Marek Chrobak
,
Lawrence L. Larmore
,
Wojciech Rytter
Lecture Notes in Computer Science
2747
, 2003, pp. 218-227
Fast algorithms with algebraic Monge properties
Wolfgang W. Bein
,
Peter Brucker
,
Lawrence L. Larmore
,
James K. Park
Lecture Notes in Computer Science
2420
, 2002, pp. 104-117
The 3-server problem in the plane
Wolfgang W. Bein
,
Marek Chrobak
,
Lawrence L. Larmore
Theoretical Computer Science
289
(1), 2002, pp. 335-354
On the complexity of pattern matching for highly compressed two-dimensional texts
Piotr Berman
,
Marek Karpinski
,
Lawrence L. Larmore
,
Wojciech Plandowski
,
Wojciech Rytter
Journal of Computer and System Sciences
65
(2), 2002, pp. 332-350
Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
Phil Bradford
,
Mordecai J. Golin
,
Lawrence L. Larmore
,
Wojciech Rytter
Journal of Algorithms
42
(2), 2002, pp. 277-303
The
k
-median problem for directed trees
Marek Chrobak
,
Lawrence L. Larmore
,
Wojciech Rytter
Lecture Notes in Computer Science
2136
, 2001, pp. 260-271
A randomized algorithm for two servers on the line
Yair Bartal
,
Marek Chrobak
,
Lawrence L. Larmore
Information and Computation
158
(1), 2000, pp. 53-69
Seiten 1
2
3
>