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=6
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The expected length of the longest probe sequence for bucket searching when the distribution is not uniform
L. Devroye
Journal of Algorithms
6
(1), 1985, pp. 1-9
NP
-completeness for minimizing maximum edge length in grid embeddings
Z. Miller
,
J.B. Orlin
Journal of Algorithms
6
(1), 1985, March, pp. 10-16
Finding the convex hull facet by facet
G. Swart
Journal of Algorithms
6
(1), 1985, March, pp. 17-48
A new proof for the first-fit decreasing bin-packing algorithm
B.S. Baker
Journal of Algorithms
6
(1), 1985, March, pp. 49-70
On the complexity of some algorithms of matrix multiplication
V.B. Alekseyev
Journal of Algorithms
6
(1), 1985, pp. 71-85
Searching ordered structures
N. Linial
,
M. Saks
Journal of Algorithms
6
(1), 1985, pp. 86-103
A ``retraction'' method for planning the motion of a disc
C. O'DĂșnlaing
,
C.K. Yap
Journal of Algorithms
6
(1), 1985, March, pp. 104-111
An algorithmic proof of Tutte's f-factor theorem
R.P. Anstee
Journal of Algorithms
6
(1), 1985, pp. 112-131
Finding approximate patterns in strings
E. Ukkonen
Journal of Algorithms
6
(1), 1985, March, pp. 132-137
Two levels are as good as any
M. Tamminen
Journal of Algorithms
6
(1), 1985, pp. 138-144
Dynamic Huffman coding
D.E. Knuth
Journal of Algorithms
6
(2), 1985, June, pp. 163-180
An analysis of optimum caching
D.E. Knuth
Journal of Algorithms
6
(2), 1985, June, pp. 181-199
Pyramid computer solutions of the closest pair problem
Q.F. Stout
Journal of Algorithms
6
(2), 1985, June, pp. 200-212
Computing the extreme distances between two convex polygons
H. Edelsbrunner
Journal of Algorithms
6
(2), 1985, pp. 213-224
Binary tree Gray codes
A. Proskurowski
,
F. Ruskey
Journal of Algorithms
6
(2), 1985, June, pp. 225-238
Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs
F. Gavril
,
J. Schönheim
Journal of Algorithms
6
(2), 1985, pp. 239-252
On optimal arrangements of keys with double hashing
A.C. Yao
Journal of Algorithms
6
(2), 1985, pp. 253-264
An optimal algorithm for finding all the jumps of a monotone step-function
Refael Hassin
,
Nimrod Megiddo
Journal of Algorithms
6
, 1985, pp. 265-274
A theoretical analysis of backtracking in the graph coloring problem
E.A. Bender
,
H.S. Wilf
Journal of Algorithms
6
(2), 1985, pp. 275-282
Problems
Leo J. Guibas
Journal of Algorithms
6
, 1985, pp. 283-290
Domination in permutation graphs
M. Farber
,
J.M. Keil
Journal of Algorithms
6
(3), 1985, pp. 309-321
Hash table reorganization
T.G. Szymanski
Journal of Algorithms
6
(3), 1985, pp. 322-335
The analysis of a fringe heuristic for binary search trees
P.V. Poblete
,
J.I. Munro
Journal of Algorithms
6
(3), 1985, pp. 336-350
The complexity of the generalized cyclic towers of Hanoi problem
M.C. Er
Journal of Algorithms
6
(3), 1985, pp. 351-358
Finding the smallest triangels containing a given convex polygon
V. Klee
,
M.C. Laskowski
Journal of Algorithms
6
(3), 1985, pp. 359-375
Seiten 1
2
>