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=2
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Searching and sorting real numbers
G. Ehrlich
Journal of Algorithms
2
(1), 1981, March, pp. 1-12
On vectorial addition chains
J. Olivos
Journal of Algorithms
2
(1), 1981, March, pp. 13-21
The complexity of identifying redundant and essential elements
S. Moran
,
Y. Perl
Journal of Algorithms
2
(1), 1981, March, pp. 22-30
An algorithm to determine when certain sets have 0-density
D.A. Klarner
Journal of Algorithms
2
(1), 1981, March, pp. 31-43
Exhaustive checking of sparse algebras
I.R. Hentzel
,
L. Hogben
Journal of Algorithms
2
(1), 1981, March, pp. 44-49
A new memoryless algorithm for de Bruijn sequences
A. Ralston
Journal of Algorithms
2
(1), 1981, March, pp. 50-62
Segments, rectangles, contours
W., Jr. Lipski
,
F.P. Preparata
Journal of Algorithms
2
(1), 1981, March, pp. 63-76
The spanning bound as a measure of range query complexity
M.L. Fredman
Journal of Algorithms
2
(1), 1981, March, pp. 77-87
Finding the maximum, merging, and sorting in a parallel computation model
Yossi Shiloach
,
Uzi Vishkin
Journal of Algorithms
2
(1), 1981, March, pp. 88-102
Problems
Leo J. Guibas
Journal of Algorithms
2
, 1981, pp. 103-104
Fast canonization of circular strings
Y. Shiloach
Journal of Algorithms
2
(2), 1981, June, pp. 107-121
An
O(n)
algorithm to find a near-optimum partition of a convex polygon
T.C. Hu
,
M.T. Shing
Journal of Algorithms
2
(2), 1981, June, pp. 122-138
A time/space tradeoff for in-place array permutation
R. Melville
Journal of Algorithms
2
(2), 1981, June, pp. 139-143
The bit-complexity of arithmetic algorithms
V. Pan
Journal of Algorithms
2
(2), 1981, June, pp. 144-163
A space-efficient on-line method of computing quantile estimates
Judea Pearl
Journal of Algorithms
2
(2), 1981, June, pp. 164-177
Stacks in a two-level store
W.H. Burge
Journal of Algorithms
2
(2), 1981, June, pp. 178-185
A linear algorithm for computing the visibility polygon from a point
H. El Gindy
,
D. Avis
Journal of Algorithms
2
(2), 1981, June, pp. 186-197
A linear-time approximation algorithm for the weighted vertex cover problem
R. Bar-Yehuda
,
S. Even
Journal of Algorithms
2
(2), 1981, June, pp. 198-203
The uniform selection of free trees
H.S. Wilf
Journal of Algorithms
2
(2), 1981, June, pp. 204-207
Problems
Leo J. Guibas
Journal of Algorithms
2
, 1981, pp. 208-210
A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
W., Jr. Lipski
,
C.H. Papadimitriou
Journal of Algorithms
2
(3), 1981, September, pp. 211-226
Generating coset representatives for permutation groups
Lloyd Allison
Journal of Algorithms
2
(3), 1981, September, pp. 227-244
Dynamization of order decomposable set problems
M.H. Overmars
Journal of Algorithms
2
(3), 1981, September, pp. 245-260
On systems of bilinear forms whose minimal division-free algorithms are all bilinear
E. Feig
Journal of Algorithms
2
(3), 1981, September, pp. 261-281
The measure problem for rectangular ranges in d-space
J. van Leeuwen
,
D. Wood
Journal of Algorithms
2
(3), 1981, September, pp. 282-300
Seiten 1
2
>