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=19
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
\delta
-semigroups of automata
A.C. Fleck
,
S.T. Hedetniemi
,
R.H. Oehmke
Journal of the ACM
19
, 1972, pp. 3-10
Linear and context-free graph grammars
T. Pavlidis
Journal of the ACM
19
, 1972, pp. 11-22
Analysis of graphs by ordering of nodes
C.P. Earnest
,
K.G. Balke
,
J. Anderson
Journal of the ACM
19
, 1972, pp. 23-42
A new search algorithm for finding the simple cycles of a finite directed graph
Herbert Weinblatt
Journal of the ACM
19
, 1972, pp. 43-56
Memory requirements in a multiprocessing environment
T.E. Chen
,
D.L. Epley
Journal of the ACM
19
, 1972, pp. 57-69
Analysis of two time-sharing queueing models
Harry C., Jr. Heacock
,
Paul W., Jr. Purdom
Journal of the ACM
19
, 1972, pp. 70-91
Service in a loop system
Alan G. Konheim
,
Bernd Meister
Journal of the ACM
19
, 1972, pp. 92-108
Fuzzy logic and the resolution principle
Richard Lee
Journal of the ACM
19
(1), 1972, January, pp. 109-119
Automatic theorem proving with built-in theories including equality, partial ordering, and sets
James R. Slagle
Journal of the ACM
19
, 1972, pp. 120-135
Addressless units for carrying out loop-free computations
Andrzej Blikle
Journal of the ACM
19
, 1972, pp. 136-157
Computational complexity and the existence of complexity gaps
A. Borodin
Journal of the ACM
19
(1), 1972, January, pp. 158-174
The operator gap
Robert Constable
Journal of the ACM
19
(1), 1972, January, pp. 175-183
Theoretical efficiency of the Edmonds-Karp algorithm for computing maximal flows
Norman Zadeh
Journal of the ACM
19
, 1972, pp. 184-192
Multitape AFA
Sheila Greibach
,
Seymour Ginsburg
Journal of the ACM
19
, 1972, pp. 193-221
A note on bracketed grammars
Eugene S. Santos
Journal of the ACM
19
, 1972, pp. 222-224
Weak and mixed strategy precedence parsing
A.V. Aho
,
P.J. Denning
,
J.D. Ullman
Journal of the ACM
19
, 1972, pp. 225-243
Corrections to Bierstone's algorithm for generating cliques
Gordon D. Mulligan
,
D.G. Corneil
Journal of the ACM
19
, 1972, pp. 244-247
Theoretical improvements in algorithmic efficiency for network flow problems
Jack Edmonds
,
Richard M. Karp
Journal of the ACM
19
(2), 1972, April, pp. 248-264
On the maximization of a pseudo-Boolean function
Peter L. Hammer
,
Uri N. Peled
Journal of the ACM
19
, 1972, pp. 265-282
One-pass complexity of digital picture properties
Stanley M. Selkow
Journal of the ACM
19
, 1972, pp. 283-295
Recursive properties of abstract complexity classes
L.H. Landweber
,
E.L. Robertson
Journal of the ACM
19
(2), 1972, April, pp. 296-308
Addressable data graphs
Arnold L. Rosenberg
Journal of the ACM
19
, 1972, pp. 309-340
Sorting using networks of queues and stacks
Robert Tarjan
Journal of the ACM
19
, 1972, pp. 341-346
Statistical studies of theoremhood in classical propositional and first order predicate calculus
S.C. van Westrhenen
Journal of the ACM
19
, 1972, pp. 347-365
A unifying view of some linear Herbrand procedures
D.W. Loveland
Journal of the ACM
19
, 1972, pp. 366-384
Seiten 1
2
3
>