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 YEAR=1991
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Parallel sorting on Cayley graphs
Daniel M. Gordon
Algorithmica
6
(4), 1991, pp. 554-564
Optimal algorithms for adjacent side routing
S. Alice Wu
,
Joseph Jájá
Algorithmica
6
(4), 1991, pp. 565-578
Refinements to nearest-neighbor searching in
k
-dimensional trees
Robert F. Sproull
Algorithmica
6
(4), 1991, pp. 579-589
A flexible way of counting large numbers approximately in small registers
J.B. Kruskal
,
A.G. Greenberg
Algorithmica
6
(4), 1991, pp. 590-596
Maximum queue size and hashing with lazy deletion
Claire M. Kenyon
,
Jeffrey Scott Vitter
Algorithmica
6
(4), 1991, pp. 597-619
Finding a minimal cover for binary images: An optimal parallel algorithm
Dipen Moitra
Algorithmica
6
, 1991, pp. 624-657
Computing convexity properties of images on a pyramid computer
Russ Miller
,
Quentin F. Stout
Algorithmica
6
, 1991, pp. 658-684
Parallel computation of disease transforms
Otfried Schwarzkopf
Algorithmica
6
, 1991, pp. 685-697
Processor-time optimal parallel algorithms for digitized images on mesh-connected processor arrays
Hussein M. Alnuweiri
,
V.K. Prasanna Kumar
Algorithmica
6
, 1991, pp. 698-733
Computational geometry algorithms for the systolic screen
F. Dehne
,
A.-L. Hassenklover
,
J.-R. Sack
,
N. Santoro
Algorithmica
6
, 1991, pp. 734-761
Topological numbering of features on a mesh
Mikhail J. Atallah
,
Susanne E. Hambrusch
,
Lynn E. TeWinkel
Algorithmica
6
, 1991, pp. 762-769
On partitioning rectilinear polygons into star-shaped polygons
Robin Liu
,
Simeon Ntafos
Algorithmica
6
, 1991, pp. 771-800
An efficient parallel algorithm for computing a large independent set in a planar graph
Marek Chrobak
,
Joseph Naor
Algorithmica
6
, 1991, pp. 801-815
A strongly competitive randomized paging algorithm
Lyle A. McGeoch
,
Daniel D. Sleater
Algorithmica
6
, 1991, pp. 816-825
Chain packing in graphs
Shigeru Masuyama
,
Toshihide Ibaraki
Algorithmica
6
, 1991, pp. 826-839
Divided
k-d
trees
Marc J. van Kreveld
,
Mark H. Overmars
Algorithmica
6
, 1991, pp. 840-858
Deterministic parallel list ranking
Richard J. Anderson
,
Gary L. Miller
Algorithmica
6
, 1991, pp. 859-868
Heuristics for rapidly four-coloring large planar graphs
Craig A. Morgenstern
,
Henry D. Shapiro
Algorithmica
6
, 1991, pp. 869-891
Seiten
<
1
2