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=1985
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
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
An algorithmic proof of Tutte's f-factor theorem
R.P. Anstee
Journal of Algorithms
6
(1), 1985, pp. 112-131
Two levels are as good as any
M. Tamminen
Journal of Algorithms
6
(1), 1985, pp. 138-144
Computing the extreme distances between two convex polygons
H. Edelsbrunner
Journal of Algorithms
6
(2), 1985, pp. 213-224
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
On the complexity of calculating factorials
P.B. Borwein
Journal of Algorithms
6
(3), 1985, pp. 376-380
A linear algorithm for determining the separation of convex polyhedra
D.P. Dobkin
,
D.G. Kirkpatrick
Journal of Algorithms
6
(3), 1985, pp. 381-392
Lower bounds for combinatorial problems on graphs
H. Nakayama
,
T. Nishizeki
,
N. Saito
Journal of Algorithms
6
(3), 1985, pp. 393-399
A theorem on the expected complexity of Dijkstra's shortest path algorithm
K. Noshita
Journal of Algorithms
6
(3), 1985, pp. 400-408
Scheduling transmissions in a network
A. Itai
,
M. Rodeh
Journal of Algorithms
6
(3), 1985, pp. 409-429
Partitioning with two lines in the plane
N. Megiddo
Journal of Algorithms
6
(4), 1985, pp. 430-433
Efficient uses of the past
D.P. Dobkin
,
J.I. Munro
Journal of Algorithms
6
(4), 1985, pp. 455-465
Repeated random insertion into a priority queue
B. Bollobás
,
I. Simon
Journal of Algorithms
6
(4), 1985, pp. 466-477
Polynomial-time algorithms for finding elements of prime order and Sylow subgroups
W.M. Kantor
Journal of Algorithms
6
(4), 1985, pp. 478-514
Seiten 1
2
>