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 YEAR=1980
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the correctness of semantic-syntax-directed translations
R. Krishnaswamy
,
A.B. Pyster
Journal of the ACM
27
(2), 1980, pp. 338-355
Fast decision procedures based on congruence closure
G. Nelson
,
D.C. Oppen
Journal of the ACM
27
(2), 1980, pp. 356-364
A syntactic theory of message passing
S.A. Ward
,
R.H., Jr. Halstead
Journal of the ACM
27
(2), 1980, pp. 365-383
Lower bounds on information transfer in distributed computation
H. Abelson
Journal of the ACM
27
(2), 1980, pp. 384-392
GO is polynomial-space hard
D. Lichtenstein
,
M. Sipser
Journal of the ACM
27
(2), 1980, pp. 393-401
Reasoning about recursively defined data structures
D.C. Oppen
Journal of the ACM
27
(3), 1980, pp. 403-411
Codes: Unequal probabilities, unequal letter costs
D. Altenkamp
,
K. Mehlhorn
Journal of the ACM
27
(3), 1980, pp. 412-427
Information bounds are weak in the shortest distance problem
R.L. Graham
,
A.C. Yao
,
F.F. Yao
Journal of the ACM
27
(3), 1980, pp. 428-444
A polynomial solution to the undirected two paths problem
Y. Shiloach
Journal of the ACM
27
(3), 1980, pp. 445-456
Optimal selection of CPU speed, device capacities, and file assignments
K.S. Trivedi
,
R.A. Wagner
,
T.M. Sigmon
Journal of the ACM
27
(3), 1980, pp. 457-473
A new approach to the analysis of linear probing schemes
H. Mendelson
,
U. Yechiali
Journal of the ACM
27
(3), 1980, pp. 474-483
Complex properties of grammars
F.G. Abramson
,
Y. Breitbart
,
F.D. Lewis
Journal of the ACM
27
(3), 1980, pp. 484-498
Fixed point languages, equality languages, and representation of recursively enumerable languages
J. Engelfriet
,
G. Rozenberg
Journal of the ACM
27
(3), 1980, pp. 499-518
Sharing a processor among many job classes
G. Fayolle
,
I. Mitrani
,
R. Iasnogorodski
Journal of the ACM
27
(3), 1980, pp. 519-532
Flowshop scheduling with limited temporary storage
C.H. Papadimitriou
,
P.C. Kanellakis
Journal of the ACM
27
(3), 1980, pp. 533-549
Scheduling independent tasks with due times on a uniform processor system
S. Sahni
,
Y. Cho
Journal of the ACM
27
(3), 1980, pp. 550-563
Augmenting parsers to support incrementality
C. Ghezzi
,
D. Mandrioli
Journal of the ACM
27
(3), 1980, pp. 564-579
Constructing call-by-value continuation semantics
R. Sethi
,
A. Tang
Journal of the ACM
27
(3), 1980, pp. 580-597
A note on fuzzy deduction
A.R. Aronson
,
B.E. Jacobs
,
J. Minker
Journal of the ACM
27
(4), 1980, pp. 599-603
Two-dimensional Voronoi diagrams in the
L_p
-metric
D.T. Lee
Journal of the ACM
27
(4), 1980, pp. 604-618
An algorithm to enumerate all cutsets of a graph in linear time per cutset
S. Tsukiyama
,
H. Ariyoshi
,
I. Shirakawa
,
H. Ozaki
Journal of the ACM
27
(4), 1980, pp. 619-632
Equivalences among relational expressions with the union and difference operators
Y. Sagiv
,
M. Yannakakis
Journal of the ACM
27
(4), 1980, pp. 633-655
The sequence equivalence problem is decidable for OS systems
A. Ehrenfeucht
,
G. Rozenberg
Journal of the ACM
27
(4), 1980, pp. 656-663
Minimum covers in the relational database model
D. Maier
Journal of the ACM
27
(4), 1980, pp. 664-674
Superdeterministic PDAs: A subcase with a decidable inclusion problem
S.A. Greibach
,
E.P. Friedman
Journal of the ACM
27
(4), 1980, pp. 675-700
Seiten
<
1
2
3
>