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 YEAR=1989
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The towers of Hanoi rainbow problem: Coloring the rings
Steven Minsker
Journal of Algorithms
10
, 1989, pp. 1-19
Hash table collision resolution with direct chaining
Gary D. Knott
,
Pilar de la Torre
Journal of Algorithms
10
, 1989, pp. 20-34
Fast algorithms for edge-coloring planar graphs
Marek Chrobak
Journal of Algorithms
10
, 1989, pp. 35-51
Analysis of the space of search trees under the random insertion algorithm
Hosam M. Mahmoud
,
Boris Pittel
Journal of Algorithms
10
, 1989, pp. 52-75
Finding the edge connectivity of directed graphs
Yishay Mansour
,
Baruch Schieber
Journal of Algorithms
10
, 1989, pp. 76-85
On the computational complexity of continuous routing
Yukon Chang
,
Susanne Hambrusch
,
Janos Simon
Journal of Algorithms
10
, 1989, pp. 86-108
Finding feasible paths for a two-point body
Ellen B. Feinberg
,
Christos H. Papadimitriou
Journal of Algorithms
10
, 1989, pp. 109-119
Approximation algorithms for scheduling arithmetic expressions on pipelined machines
David Bernstein
,
Micheal Rodeh
,
Izidor Gertner
Journal of Algorithms
10
, 1989, pp. 120-139
Hypercube and shuffle-exchange algorithms for image component labeling
R. Cypher
,
J.L.C. Sanz
,
L. Snyder
Journal of Algorithms
10
, 1989, pp. 140-150
The probability of splitters in a list
Yahya Ould Hamidoune
,
David Roeder
,
Steven Janke
,
Todd Feil
,
Richard Koo
Journal of Algorithms
10
, 1989, pp. 151-154
Fast parallel and serial approximate string matching
Gad M. Landau
,
Uzi Vishkin
Journal of Algorithms
10
, 1989, pp. 157-169
Fast algorithms for direct enclosures and direct dominances
Ralf-Hartmut Güting
,
Otto Nurmi
,
Thomas Ottmann
Journal of Algorithms
10
, 1989, pp. 170-186
The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
Norishige Chiba
,
Takao Nishizeki
Journal of Algorithms
10
, 1989, pp. 187-211
On separable clusterings
H. Heusinger
,
H. Noltemeier
Journal of Algorithms
10
, 1989, pp. 212-227
Last-come-first-served hashing
Patricio V. Poblete
,
J. Ian Munro
Journal of Algorithms
10
, 1989, pp. 228-248
The parallel complexity of TSP heuristics
Gerard A.P. Kindervater
,
Jan Karel Lenstra
Journal of Algorithms
10
, 1989, pp. 249-270
Unranking and ranking spanning trees of a graph
Charles J. Colbourn
,
Robert P.J. Day
,
Louis D. Nel
Journal of Algorithms
10
, 1989, pp. 271-286
A simple parallel tree contraction algorithm
K. Abrahamson
,
N. Dadoun
,
D.G. Kirkpatrick
,
T. Przytycka
Journal of Algorithms
10
, 1989, pp. 287-302
On-line bin packing in linear time
Prakash Ramanan
,
Donna J. Brown
,
C.C. Lee
,
D.T. Lee
Journal of Algorithms
10
, 1989, pp. 305-326
Triangulating a polygon in parallel
Michael T. Goodrich
Journal of Algorithms
10
, 1989, pp. 327-351
Building heaps fast
C.J.H. McDiarmid
,
B.A. Reed
Journal of Algorithms
10
, 1989, pp. 352-365
The analysis of a simple in-place merging algorithm
Renzo Sprugnoli
Journal of Algorithms
10
, 1989, pp. 366-380
Solving parametric problems on trees
David Fernández-Baca
,
Giora Slutzki
Journal of Algorithms
10
, 1989, pp. 381-402
Addition chains using continued fractions
F. Bergeron
,
J. Berstel
,
S. Brlek
,
C. Duboc
Journal of Algorithms
10
, 1989, pp. 403-412
Reversing trains: A turn of the century sorting problem
Nancy Amato
,
Manuel Blum
,
Sandra Irani
,
Ronitt Rubinfeld
Journal of Algorithms
10
, 1989, pp. 413-428
Seiten 1
2
>