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=Algorithmica AND Volume=17
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An algorithm reminiscent of Euclidean-
gcd
for computing a function related to pinwheel scheduling
T.H. Romer
,
L.E. Rosier
Algorithmica
17
(1), 1997, pp. 1-10
Optimal parallel verification of minimum spanning trees in logarithmic time
B. Dixon
,
R.E. Tarjan
Algorithmica
17
(1), 1997, pp. 11-18
``The big sweep'': On the power of the wavefront approach to Voronoi diagrams
F. Dehne
,
R. Klein
Algorithmica
17
(1), 1997, pp. 19-32
Efficient construction of a bounded-degree spanner with low weight
S. Arya
,
M. Smid
Algorithmica
17
(1), 1997, pp. 33-54
Fast integer merging on the EREW PRAM
T. Hagerup
,
M. Kutyƚowski
Algorithmica
17
(1), 1997, pp. 55-66
Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
J. Bang-Jensen
,
M. El Haddad
,
Y. Manoussakis
,
T.M. Przytycka
Algorithmica
17
(1), 1997, pp. 67-87
Minimizing channel density with movable terminals
R.I. Greenberg
,
J.-D. Shih
Algorithmica
17
, 1997, pp. 89-99
Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
F. Granot
,
J. Skorin-Kapov
,
A. Tamir
Algorithmica
17
, 1997, pp. 100-110
Evaluating signs of determinants using single-precision arithmetic
F. Avnaim
,
J.-D. Boissonnat
,
O. Devillers
,
F.P. Preparata
,
M. Yvinec
Algorithmica
17
, 1997, pp. 111-132
Algorithms for the boundary selection problem
J.N. Bhuyan
,
J.S. Deogun
,
V.V. Raghavan
Algorithmica
17
, 1997, pp. 133-161
A linear-time algorithm for the generation of trees
L. Alonso
,
J.L. Rémy
,
R. Schott
Algorithmica
17
, 1997, pp. 162-182
Maintaining dynamic sequences under equality tests in polylogarithmic time
K. Mehlhorn
,
R. Sundar
,
C. Uhrig
Algorithmica
17
, 1997, pp. 183-198
Three-dimensional graph drawing
R.F. Cohen
,
P. Eades
,
Tao Lin
,
F. Ruskey
Algorithmica
17
, 1997, pp. 199-208
Finding and counting given length cycles
N. Alon
,
R. Yuster
,
U. Zwick
Algorithmica
17
, 1997, pp. 209-223
Randomized multipacket routing and sorting on meshes
M. Kaufmann
,
J.F. Sibeyn
Algorithmica
17
, 1997, pp. 224-244
Decomposing the boundary of a nonconvex polyhedron
B. Chazelle
,
L. Palios
Algorithmica
17
, 1997, pp. 245-265
Efficient parallel recognition of some circular arc graphs, II
L. Chen
Algorithmica
17
, 1997, pp. 266-280
Proximity problems for points on a rectilinear plane with rectangular obstacles
S. Guha
,
I. Suzuki
Algorithmica
17
, 1997, pp. 281-307
The complexity of almost-optimal simultaneous coordination
R.A. Bazzi
,
G. Neiger
Algorithmica
17
, 1997, pp. 308-321
Randomized quickhull
R. Wenger
Algorithmica
17
, 1997, pp. 322-329
Complexities of efficient solutions of rectilinear polygon cover problems
P. Berman
,
B. DasGupta
Algorithmica
17
, 1997, pp. 331-356
Construction of
C
-space roadmaps from local sensory data. What should the sensors look for?
E. Rimon
Algorithmica
17
, 1997, pp. 357-379
On counting pairs of intersecting segments and off-line triangle range searching
M. Pellegrini
Algorithmica
17
, 1997, pp. 380-398
Efficient parallel algorithms for computing all pair shortest paths in directed graphs
Yijie Han
,
V.Y. Pan
,
J.H. Reif
Algorithmica
17
, 1997, pp. 399-415
An
O(n^3)
recognition algorithm for bithreshold graphs
S. de Agostino
,
R. Petreschi
,
A. Sterbini
Algorithmica
17
, 1997, pp. 416-425
Seiten 1
2
>