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="Alonso, Laurent"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Analysis of Boyer and Moore's
mjrty
algorithm
Laurent Alonso
,
Edward M. Reingold
Information Processing Letters
113
(13), 2013, pp. 495-497
The worst-case chip problem
Laurent Alonso
,
Philippe Chassaing
,
Edward M. Reingold
,
René Schott
Information Processing Letters
89
(6), 2004, pp. 303-308
On the tree inclusion problem
Laurent Alonso
,
René Schott
Acta Informatica
37
(9), 2001, pp. 653-670
The average-case complexity of determining the majority
Laurent Alonso
,
Edward M. Reingold
,
René Schott
SIAM Journal on Computing
26
(1), 1997, pp. 1-14
A parallel algorithm for the generation of a permutation and applications
Laurent Alonso
,
René Schott
Theoretical Computer Science
159
(1), 1996, pp. 15-28
Multidimensional divide-and-conquer maximin recurrences
Laurent Alonso
,
Edward M. Reingold
,
René Schott
SIAM Journal on Discrete Mathematics
8
(3), 1995, pp. 428-447
Uniform generation of a Motzkin word
Laurent Alonso
Theoretical Computer Science
134
(2), 1994, pp. 529-536
Determining the majority
Laurent Alonso
,
Edward M. Reingold
,
René Schott
Information Processing Letters
47
(5), 1993, pp. 253-255
On the tree inclusion problem
Laurent Alonso
,
René Schott
Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science 1993. MFCS'93(Gdańsk, Poland, August/September 1993)
LNCS 711
, 1993, pp. 211-221