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=10
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An efficient algorithm for finding the CSG representation of a simple polygon
David Dobkin
,
Leonidas Guibas
,
John Hershberger
,
Jack Snoeyink
Algorithmica
10
(1), 1993, pp. 1-23
Optimal algorithms for dissemination of information in some interconnection networks
Juraj Hromkovic̑
,
Claus-Dieter Jeschke
,
Burkhard Monien
Algorithmica
10
(1), 1993, pp. 24-40
Planning a time-minimal motion among moving obstacles
Kikuo Fujimura
,
Hanan Samet
Algorithmica
10
(1), 1993, pp. 41-63
Extracting maximal information about sets of minimum cuts
Dan Gusfield
,
Dalit Naor
Algorithmica
10
(1), 1993, pp. 64-89
An opportunistic global path planner
John F. Canny
,
Ming C. Lin
Algorithmica
10
, 1993, pp. 102-120
Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles
Jérôme Barraquand
,
Jean-Claude Latombe
Algorithmica
10
, 1993, pp. 121-155
Continuous alternation: The complexity of pursuit in continuous domains
John H. Reif
,
Stephen R. Tate
Algorithmica
10
, 1993, pp. 156-181
Shortest paths for line segments
Christian Icking
,
Günter Rote
,
Emo Welzl
,
Chee Yap
Algorithmica
10
, 1993, pp. 182-200
Orienting polygonal parts without sensors
Kenneth Y. Goldberg
Algorithmica
10
, 1993, pp. 201-225
Mechanical parts orienting: The case of a polyhedron on a table
Michael Erdmann
,
Matthew T. Mason
,
George, Jr. Vanȇc̑ek
Algorithmica
10
, 1993, pp. 226-247
Randomization for robot tasks: Using dynamic programming in the space of knowledge states
Michael Erdmann
Algorithmica
10
, 1993, pp. 248-291
Issues in computing contact forces for non-penetrating rigid bodies
David Baraff
Algorithmica
10
, 1993, pp. 292-352
Approximate string matching with suffix automata
Esko Ukkonen
,
Derick Wood
Algorithmica
10
, 1993, pp. 353-364
A long-step barrrier method for convex quadratic programming
K.M. Anstreicher
,
D. den Hertog
,
C. Roos
,
T. Terlaky
Algorithmica
10
, 1993, pp. 365-382
A lower bound on the period length of a distributed scheduler
Yossi Malka
,
Shlomo Moran
,
Shmuel Zaks
Algorithmica
10
, 1993, pp. 383-398
Geometric knapsack problems
Esther M. Arkin
,
Samir Khuller
,
Joseph S.B. Mitchell
Algorithmica
10
, 1993, pp. 399-427
Floorplanning by graph dualization: L-shaped modules
Yachyang Sun
,
Majid Sarrafzadeh
Algorithmica
10
, 1993, pp. 429-456
Numerical stability of a convex hull algorithm for simple polygons
J.W. Jaromczyk
,
G.W. Wasilkowski
Algorithmica
10
, 1993, pp. 457-472
Analytic variations on quadtrees
Philippe Flajolet
,
Gaston Gonnet
,
Claude Puech
,
J.M. Robson
Algorithmica
10
, 1993, pp. 473-500
On ``An improved algorithm for finding the median distributively''
S.L. Mantzaris
Algorithmica
10
, 1993, pp. 501-504