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=4
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Primitives for the manipulation of three-dimensional subdivisions
David P. Dobkin
,
Michael J. Laszlo
Algorithmica
4
(1), 1989, pp. 3-32
Discrete simulation of
NC
machining
Robert L. (Scot) Drysdale III
,
Robert B. Jerard
,
Barry Schaudt
,
Ken Hauck
Algorithmica
4
(1), 1989, pp. 33-60
A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency
Masato Edahiro
,
Katsuhiko Tanaka
,
Takashi Hoshino
,
Takao Asano
Algorithmica
4
(1), 1989, pp. 61-76
A linear-time algorithm for linear
L_1
approximation of points
Hiroshi Imai
,
Kenji Kato
,
Peter Yamamoto
Algorithmica
4
(1), 1989, pp. 77-96
Constrained Delaunay triangulations
L. Paul Chew
Algorithmica
4
(1), 1989, pp. 97-108
On the geodesic Voronoi diagram of point sites in a simple polygon
Boris Aronov
Algorithmica
4
(1), 1989, pp. 109-140
An optimal visibility graph algorithm for triangulated simple polygons
John Hershberger
Algorithmica
4
(1), 1989, pp. 141-155
Generation of configuration space obstacles: The case of moving algebraic curves
Chanderjit L. Bajaj
,
Myung-Soo Kim
Algorithmica
4
, 1989, pp. 157-172
On the efficiency of maximum-flow algorithms on networks with small integer capacities
David Fernández-Baca
,
Charles U. Martel
Algorithmica
4
, 1989, pp. 173-189
Fast heuristic algorithms for rectilinear Steiner trees
Dana Richards
Algorithmica
4
, 1989, pp. 191-207
A new algorithm for scheduling periodic, real-time tasks
Josph Y.-T. Leung
Algorithmica
4
, 1989, pp. 209-219
An efficient algorithm for maxdominance, with applications
Mikhail J. Atallah
,
S. Rao Kosaraju
Algorithmica
4
, 1989, pp. 221-236
On the algebraic formulation of certain geometry statements and mechanical geometry theorem proving
Shang-Ching Chou
,
Jin-Gen Yang
Algorithmica
4
, 1989, pp. 237-262
Floorplan design of VLSI circuits
D.F. Wong
,
C.L. Liu
Algorithmica
4
, 1989, pp. 263-291
On selecting the
k
largest with median tests
Andrew Chi-Chih Yao
Algorithmica
4
, 1989, pp. 293-300
Computational complexity of optimum multiuser detection
Sergio Verdú
Algorithmica
4
, 1989, pp. 303-312
A full sensing window random-access algorithm for messages with strict delay constraints
M. Paterakis
,
L. Georgiadis
,
P. Papantoni-Kazakos
Algorithmica
4
, 1989, pp. 313-328
A correction algorithm for token-passing sequences in mobile communication networks
Yaron I. Gold
,
Shlomo Moran
Algorithmica
4
, 1989, pp. 329-341
Maximal selection in tandem networks with symmetric hearing range
Jeffrey M. Jaffe
,
Zvi Rosberg
Algorithmica
4
, 1989, pp. 343-364
Scheduling multihop CDMA networks in the presence of secondary conflicts
M.J. Post
,
A.S. Kershenbaum
,
P.E. Sarachik
Algorithmica
4
, 1989, pp. 365-393
Optimizing responses to broadcast messages in radio networks
Jonathan L. Wang
,
John A. Silvester
Algorithmica
4
, 1989, pp. 395-416
Distributed deadlock resolution in store-and-forward networks
Jeffrey M. Jaffe
,
Moshe Sidi
Algorithmica
4
, 1989, pp. 417-436
Efficient elections in chordal ring networks
Hagit Attiya
,
Jan van Leeuwen
,
Nicola Santoro
,
Shmuel Zaks
Algorithmica
4
, 1989, pp. 437-446
Lower bounds for maximal and convex layers problems
Sanjiv Kapoor
,
Prakash Ramanan
Algorithmica
4
, 1989, pp. 447-459
An algorithm for geometric minimum spanning trees requiring nearly linear expected time
Kenneth L. Clarkson
Algorithmica
4
, 1989, pp. 461-469
Seiten 1
2
>