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: Journal=J. Algorithms AND Volume=12
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On-line dynamic programming with applications to the prediction of RNA secondary structure
Lawrence L. Larmore
,
Baruch Schieber
Journal of Algorithms
12
, 1991, pp. 490-515
How to play bowling in parallel on the grid
Jehoshua Bruck
,
Vwani P. Roychowdhury
Journal of Algorithms
12
, 1991, pp. 516-529
Self-organizing lists and independent references: A statistical synergy
Micha Hofri
,
Hadas Shachnai
Journal of Algorithms
12
, 1991, pp. 533-555
Gauss' algorithm revisited
Brigitte Vallée
Journal of Algorithms
12
, 1991, pp. 556-572
On parallel hashing and integer sorting
Yossi Matias
,
Uzi Vishkin
Journal of Algorithms
12
, 1991, pp. 573-606
On fast algorithms for two servers
Marek Chrobak
,
Lawrence L. Larmore
Journal of Algorithms
12
, 1991, pp. 607-614
Incremental algorithms for minimal length paths
Giorgio Ausiello
,
Giuseppe F. Italiano
,
Alberto Marchetti Spaccamela
,
Umberto Nanni
Journal of Algorithms
12
, 1991, pp. 615-638
A probabilistic algorithm for computing Hough transforms
James R. Bergen
,
Haim Shvaytser
Journal of Algorithms
12
, 1991, pp. 639-656
An algorithm for outerplanar graphs with parameter
Binghuan Zhu
,
Wayne Goddard
Journal of Algorithms
12
, 1991, pp. 657-662
Optimal quantization by matrix searching
Xiaolin Wu
Journal of Algorithms
12
, 1991, pp. 663-673
The greedy coloring is a bad probabilistic algorithm
Ludȇk Kuc̑era
Journal of Algorithms
12
, 1991, pp. 674-684
Competitive paging algorithms
Amos Fiat
,
Richard M. Karp
,
Michael Luby
,
Lyle A. McGeoch
,
Daniel D. Sleator
,
Neal E. Young
Journal of Algorithms
12
, 1991, pp. 685-699
Problems
Peter van Emde Boas
Journal of Algorithms
12
, 1991, pp. 700-703
Seiten
<
1
2