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=9
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Polynomial-time versions of Sylow's theorem
W.M. Kantor
,
D.E. Taylor
Journal of Algorithms
9
(1), 1988, March, pp. 1-17
An
O(n^2)
shortest path algorithm for a non-rotating convex body
J. Hershberger
,
L.J. Guibas
Journal of Algorithms
9
(1), 1988, March, pp. 18-46
A more efficient algorithm for lattice basis reduction
C.P. Schnorr
Journal of Algorithms
9
(1), 1988, March, pp. 47-62
Almost all
k
-colorable graphs are easy to color
J.S. Turner
Journal of Algorithms
9
(1), 1988, March, pp. 63-82
A fast parallel algorithm to color a graph with
\Delta
colors
M. Karchmer
,
J. Naor
Journal of Algorithms
9
(1), 1988, March, pp. 83-91
Binary tree algebraic computation and parallel algorithms for simple graphs
Xin He
,
Y. Yesha
Journal of Algorithms
9
(1), 1988, March, pp. 92-113
A mixed-integer linear programming problem which is efficiently solvable
C.E. Leiserson
,
J.B. Saxe
Journal of Algorithms
9
(1), 1988, March, pp. 114-128
A new proof of the Garsia-Wachs algorithm
J.H. Kingston
Journal of Algorithms
9
(1), 1988, March, pp. 129-136
An algorithm for polynomial multiplication that does not depend on the ring constants
M. Kaminski
Journal of Algorithms
9
(1), 1988, March, pp. 137-147
Improved algorithms for discs and balls using power diagrams
F. Aurenhammer
Journal of Algorithms
9
(2), 1988, June, pp. 151-161
Adjacent interchange generation of combinations
F. Ruskey
Journal of Algorithms
9
(2), 1988, June, pp. 162-180
An algorithm for finding hamilton cycles in random directed graphs
A.M. Frieze
Journal of Algorithms
9
(2), 1988, June, pp. 181-204
Fast parallel strong orientation of mixed graphs and related augmentation problems
D. Soroker
Journal of Algorithms
9
(2), 1988, June, pp. 205-223
Some results on V-ary asymmetric tries
W. Szpankowski
Journal of Algorithms
9
(2), 1988, June, pp. 224-244
Construction of optimal binary split trees in the presence of bounded access probabilities
J.H. Hester
,
D.S. Hirschberg
,
L.L. Larmore
Journal of Algorithms
9
(2), 1988, June, pp. 245-253
Efficient data structures for range searching on a grid
M.H. Overmars
Journal of Algorithms
9
(2), 1988, June, pp. 254-275
Fast parallel algorithms for finding Hamiltonian paths and cycles in a tournament
D. Soroker
Journal of Algorithms
9
(2), 1988, June, pp. 276-286
On a special case of uniform processor scheduling
M. Kunde
,
M.A. Langston
,
Jin-Ming Liu
Journal of Algorithms
9
(2), 1988, June, pp. 287-296
Finding a minimum feedback arc set in reducible flow graphs
Vijaya Ramachandran
Journal of Algorithms
9
, 1988, pp. 299-313
Stability in circular arc graphs
Martin Charles Golumbic
,
Peter L. Hammer
Journal of Algorithms
9
, 1988, pp. 314-320
A tighter upper bound on the worst case behavior of Conway's parallel sorting algorithm
Alejandro A. Schäffer
Journal of Algorithms
9
, 1988, pp. 321-342
Solution to a linear diophantine equation for nonnegative integers
Harold Greenberg
Journal of Algorithms
9
, 1988, pp. 343-353
Addition requirements for matrix and transposed matrix products
Michael Kaminski
,
David G. Kirkpatrick
,
Nader H. Bshouty
Journal of Algorithms
9
, 1988, pp. 354-364
Probabilistic computation of integer polynomial GCDs
A. Schönhage
Journal of Algorithms
9
, 1988, pp. 365-371
On rectangular visibility
Mark H. Overmars
,
Derick Wood
Journal of Algorithms
9
, 1988, pp. 372-390
Seiten 1
2
>