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=7
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees
Marinus Veldhorst
Journal of Algorithms
7
, 1986, pp. 1-34
Evaluation of a MULTIFIT-based scheduling algorithm
D.K. Friesen
,
M.A. Langston
Journal of Algorithms
7
(1), 1986, March, pp. 35-59
A compact representation for permutation groups
Mark Jerrum
Journal of Algorithms
7
, 1986, pp. 60-78
A better than ``best possible'' algorithm to edge color multigraphs
Dorit S. Hochbaum
,
Takao Nishizeki
,
David B. Shmoys
Journal of Algorithms
7
, 1986, pp. 79-104
An efficient parallel algorithm for shifting the root of a depth first spanning tree
Prasoon Tiwari
Journal of Algorithms
7
, 1986, pp. 105-119
An algorithmic characterization of total digraphs
Miroslawa SkowroĊska
,
Maciej M. Syslo
,
Cristina Zamfirescu
Journal of Algorithms
7
, 1986, pp. 120-133
On the complexity of circulations
Esther M. Arkin
,
Christos H. Papadimitriou
Journal of Algorithms
7
, 1986, pp. 134-145
An algorithm for early unlocking of entities in database transactions
O. Wolfson
Journal of Algorithms
7
(1), 1986, March, pp. 146-156
A new upper bound for Shellsort
R. Sedgewick
Journal of Algorithms
7
(2), 1986, June, pp. 159-173
Planar 3DM is
NP
-complete
M.E. Dyer
,
A.M. Frieze
Journal of Algorithms
7
(2), 1986, June, pp. 174-184
Depth-size trade-offs for parallel prefix computation
M. Snir
Journal of Algorithms
7
(2), 1986, June, pp. 185-201
Searching and storing similar lists
R. Cole
Journal of Algorithms
7
(2), 1986, June, pp. 202-220
Polygon triangulation: efficiency and minimality
T. Asano
,
T. Asano
,
R.Y. Pinter
Journal of Algorithms
7
(2), 1986, June, pp. 221-231
Single bend wiring
R. Raghavan
,
J. Cohoon
,
S. Sahni
Journal of Algorithms
7
(2), 1986, June, pp. 232-257
An optimal algorithm for finding minimal enclosing triangles
J. O'Rourke
,
A. Aggarwal
,
S. Maddila
,
M. Baldwin
Journal of Algorithms
7
(2), 1986, June, pp. 258-269
Conway's parallel sorting algorithm
M.L. Warshauer
Journal of Algorithms
7
(2), 1986, June, pp. 270-276
Bipartite graph matching for points on a line or a circle
M. Werman
,
S. Peleg
,
R. Melter
,
T.Y. Kong
Journal of Algorithms
7
(2), 1986, June, pp. 277-284
Computing the convex hull of line intersections
M.J. Atallah
Journal of Algorithms
7
(2), 1986, June, pp. 285-288
The
NP
-completeness column: An ongoing guide
David S. Johnson
Journal of Algorithms
7
(2), 1986, June, pp. 289-305
Graph minors. II. Algorithmic aspects of tree-width
N. Robertson
,
P.D. Seymour
Journal of Algorithms
7
(3), 1986, September, pp. 309-322
An algorithmic proof of a generalization of the Birkhoff-Von Neumann theorem
J.L. Lewandowski
,
C.L. Liu
,
J.W.S. Liu
Journal of Algorithms
7
(3), 1986, September, pp. 323-330
An algorithm for constructing m-ary de Bruijn sequences
T. Etzion
Journal of Algorithms
7
(3), 1986, September, pp. 331-340
Optimal expected-time algorithms for merging
Mai Thanh
,
V.S. Alagar
,
T.D. Bui
Journal of Algorithms
7
(3), 1986, September, pp. 341-357
An O(nlogn) randomizing algorithm for the weighted Euclidean 1-center problem
N. Megiddo
,
E. Zemel
Journal of Algorithms
7
(3), 1986, September, pp. 358-368
Fast computation of the modality of polygons
A. Aggarwal
,
R.C. Melville
Journal of Algorithms
7
(3), 1986, September, pp. 369-381
Seiten 1
2
>