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=8
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dynamic orthogonal segment intersection search
H. Imai
,
T. Asano
Journal of Algorithms
8
(1), 1987, March, pp. 1-18
Shape from probing
R. Cole
,
C.K. Yap
Journal of Algorithms
8
(1), 1987, March, pp. 19-38
Efficient parallel algorithms for edge coloring problems
H.J. Karloff
,
D.B. Shmoys
Journal of Algorithms
8
(1), 1987, March, pp. 39-52
A lower bound for probabilistic distributed algorithms
J.K. Pachl
Journal of Algorithms
8
(1), 1987, March, pp. 53-65
Convex hulls of piecewise-smooth Jordan curves
A.A. Schäffer
,
C.J. van Wyk
Journal of Algorithms
8
(1), 1987, March, pp. 66-94
Searching in 2-dimensional partial orders
G. Steiner
Journal of Algorithms
8
(1), 1987, March, pp. 95-105
O(N^{2.5})
time algorithms for the subgraph homeomorphism problem on trees
Moon-Jung Chung
Journal of Algorithms
8
(1), 1987, March, pp. 106-112
An improved block-interchange algorithm
J.L. Mohammed
,
C.S. Subi
Journal of Algorithms
8
(1), 1987, March, pp. 113-121
The 1-Steiner tree problem
G. Georgakopoulos
,
C.H. Papadimitriou
Journal of Algorithms
8
(1), 1987, March, pp. 122-130
A noninductive GL (n, Z) algorithm that constructs integral linear relations for n Z-linearly dependent real numbers
H.R.P. Ferguson
Journal of Algorithms
8
(1), 1987, March, pp. 131-145
Optimal multiway split trees
S.-H.S. Huang
Journal of Algorithms
8
(1), 1987, March, pp. 146-156
An optimal algorithm for geometrical congruence
M.D. Atkinson
Journal of Algorithms
8
(2), 1987, June, pp. 159-172
Computing pi (X): an analytic method
J.C. Lagarias
,
A.M. Odlyzko
Journal of Algorithms
8
(2), 1987, June, pp. 173-191
An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers
D. Leven
,
M. Sharir
Journal of Algorithms
8
(2), 1987, June, pp. 192-215
Linear-time computation of optimal subgraphs of decomposable graphs
M.W. Bern
,
E.L. Lawler
,
A.L. Wong
Journal of Algorithms
8
(2), 1987, June, pp. 216-235
Linear probing: the probable largest search time grows logarithmically with the number of records
B. Pittel
Journal of Algorithms
8
(2), 1987, June, pp. 236-249
Multiple optima in local search
V. Rodl
,
C. Tovey
Journal of Algorithms
8
(2), 1987, June, pp. 250-259
Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
T. Lengauer
Journal of Algorithms
8
(2), 1987, June, pp. 260-284
The
NP
-completeness column: An ongoing guide
David S. Johnson
Journal of Algorithms
8
(2), 1987, June, pp. 285-303
Fast approximation algorithms for a nonconvex covering problem
D.S. Hochbaum
,
W. Maass
Journal of Algorithms
8
(3), 1987, September, pp. 305-323
Computational complexities of Diophantine equations with parameters
S.P. Tung
Journal of Algorithms
8
(3), 1987, September, pp. 324-336
Better expanders and superconcentrators
N. Alon
,
Z. Galil
,
V.D. Milman
Journal of Algorithms
8
(3), 1987, September, pp. 337-347
Space searching for intersecting objects
D.P. Dobkin
,
H. Edelsbrunner
Journal of Algorithms
8
(3), 1987, September, pp. 348-361
Finding critical sets
D.W. Loveland
Journal of Algorithms
8
(3), 1987, September, pp. 362-371
On the routability of a convex grid
T.-H. Lai
,
A. Sprague
Journal of Algorithms
8
(3), 1987, September, pp. 372-384
Seiten 1
2
>