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=22
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Regularity and related problems for deterministic pushdown automata
L.G. Valiant
Journal of the ACM
22
, 1975, pp. 1-10
An algorithm for finding a minimal equivalent graph of a digraph
H.T. Hsu
Journal of the ACM
22
, 1975, pp. 11-16
A formal construction of term classes
C.T. Yu
Journal of the ACM
22
, 1975, pp. 17-37
On computing the exact determinant of matrices with polynomial entries
E. Horowitz
,
S. Sahni
Journal of the ACM
22
, 1975, pp. 38-50
High order search methods for finding roots
C.A. Micchelli
,
W.L. Miranker
Journal of the ACM
22
, 1975, pp. 51-60
A metalgorithm for adaptive quadrature
J.R. Rice
Journal of the ACM
22
, 1975, pp. 61-82
An analysis of drum storage units
S.H. Fuller
,
F. Baskett
Journal of the ACM
22
, 1975, pp. 83-105
Exact, approximate, and guaranteed accuracy algorithms for the flow-shop problem
n|2|F|\bar F
Walter H. Kohler
,
Kenneth Steiglitz
Journal of the ACM
22
, 1975, pp. 106-114
Approximate algorithms for the 0/1 knapsack problem
S. Sahni
Journal of the ACM
22
, 1975, pp. 115-124
The change-making problem
J.W. Wright
Journal of the ACM
22
, 1975, pp. 125-128
Proving theorems about LISP functions
R.S. Boyer
,
J.S. Moore
Journal of the ACM
22
, 1975, pp. 129-144
Derivation of a path-connectivity matrix for tagged flowcharts
L. Yelowitz
Journal of the ACM
22
, 1975, pp. 145-154
On the structure of polynomial time reducibility
Richard E. Ladner
Journal of the ACM
22
(1), 1975, January, pp. 155-171
An extension of the string-to-string correction problem
R. Lowrance
,
R.A. Wagner
Journal of the ACM
22
, 1975, pp. 177-183
The linear complexity of computation
J. Morgenstern
Journal of the ACM
22
, 1975, pp. 184-194
Bounds to complexities of networks for sorting and for switching
D.E. Muller
,
F.P. Preparata
Journal of the ACM
22
(2), 1975, April, pp. 195-201
Efficient generation of optimal prefix code: Equiprobable words using unequal cost letters
Y. Perl
,
M.R. Garey
,
S. Even
Journal of the ACM
22
, 1975, pp. 202-214
Efficiency of a good but not linear set union algorithm
R.E. Tarjan
Journal of the ACM
22
, 1975, pp. 215-225
A simple planarity criterion
B. Knauer
Journal of the ACM
22
, 1975, pp. 226-230
A generalized multi-entrance time-sharing priority queue
J.M. Babad
Journal of the ACM
22
, 1975, pp. 231-247
Open, closed, and mixed networks of queues with different classes of customers
F. Baskett
,
K.M. Chandy
,
R.R. Muntz
,
F.G. Palacios
Journal of the ACM
22
, 1975, pp. 248-260
On approximate computer system models
E. Gelenbe
Journal of the ACM
22
, 1975, pp. 261-269
A processor in series with demand-interrupting devices -- a stochastic model
M. Hofri
,
M. Yadin
Journal of the ACM
22
, 1975, pp. 270-290
Multivariate polynomial factorization
David R. Musser
Journal of the ACM
22
(2), 1975, April, pp. 291-308
Inference and paraphrase by computer
R.C. Schank
,
N.M. Goldman
,
C.J. Rieger III
,
C.K. Riesbeck
Journal of the ACM
22
, 1975, pp. 309-328
Seiten 1
2
>