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. ACM AND Volume=23
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Errata
R.A. Cody
,
E.G., Jr. Coffman
Journal of the ACM
23
, 1976, pp. 572
Bounds on the complexity of the longest common subsequence problem
A.V. Aho
,
D.S. Hirschberg
,
J.D. Ullman
Journal of the ACM
23
(1), 1976, January, pp. 1-12
Bounds for the string editing problem
C.K. Wong
,
A.K. Chandra
Journal of the ACM
23
, 1976, pp. 13-16
On the complete covering problem for LR (k) grammars
M.D. Mickunas
Journal of the ACM
23
, 1976, pp. 17-30
An algorithm for subgraph isomorphism
J.R. Ullmann
Journal of the ACM
23
, 1976, pp. 31-42
The complexity of near-optimal graph coloring
M.R. Garey
,
D.S. Johnson
Journal of the ACM
23
, 1976, pp. 43-49
A shortest path algorihm for edge-sparse graphs
Robert A. Wagner
Journal of the ACM
23
(1), 1976, January, pp. 50-57
A Gaussian elimination algorithm for the enumeration of cut sets in a graph
Alberto Martelli
Journal of the ACM
23
(1), 1976, January, pp. 58-73
Note on Hopcroft and Tarjan's planarity algorithm
Narsingh Deo
Journal of the ACM
23
(1), 1976, January, pp. 74-75
Precision weighting -- an effective automatic indexing method
C.T. Yu
,
G. Salton
Journal of the ACM
23
, 1976, pp. 76-88
Numerical inversion of Laplace transforms using a Fourier series approximation
K.S. Crump
Journal of the ACM
23
, 1976, pp. 89-96
Adaptive allocation of central processing unit quanta
D. Potier
,
E. Gelenbe
,
J. Lenfant
Journal of the ACM
23
, 1976, pp. 97-102
Record allocation for minimizing expected retrieval costs on drum-like storage devices
R.A. Cody
,
E.G., Jr. Coffman
Journal of the ACM
23
, 1976, pp. 103-115
Algorithms for scheduling independent tasks
Sartaj Sahni
Journal of the ACM
23
(1), 1976, January, pp. 116-127
The independence of miss ratio on page size
R. Fagin
,
M.C. Easton
Journal of the ACM
23
, 1976, pp. 128-146
A polynomial-time algorithm for the knapsack problem with two variables
D.S. Hirschberg
,
C.K. Wong
Journal of the ACM
23
, 1976, pp. 147-154
A code for the transportation problem of linear programming
B. Harris
Journal of the ACM
23
, 1976, pp. 155-157
Global data flow analysis and iterative algorithms
J.B. Kam
,
J.D. Ullman
Journal of the ACM
23
, 1976, pp. 158-171
A fast and usually linear algorithm for global flow analysis
Susan L. Graham
,
Mark Wegman
Journal of the ACM
23
(1), 1976, January, pp. 172-202
A completeness theorem for straight-line programs with structured variables
C.M. Hoffmann
,
L.H. Landweber
Journal of the ACM
23
, 1976, pp. 203-220
An efficient implementation of Edmonds' algorithm for maximum matching on graphs
Harold N. Gabow
Journal of the ACM
23
(2), 1976, April, pp. 221-234
Efficiency of computation of Cayley tables of 2-groups
R.G. Larson
Journal of the ACM
23
, 1976, pp. 235-241
Fast multiple-precision evaluation of elementary functions
R.P. Brent
Journal of the ACM
23
, 1976, pp. 242-251
New algorithms and lower bounds for the parallel evaluation of certain rational expressions and recurrences
H.T. Kung
Journal of the ACM
23
(2), 1976, April, pp. 252-261
A space-economical suffix tree construction algorithm
Edward M. McCreight
Journal of the ACM
23
(2), 1976, April, pp. 262-272
Seiten 1
2
3
>