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=28
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A unification algorithm for associative-commutative functions
M.E. Stickel
Journal of the ACM
28
(3), 1981, pp. 423-434
An equivalence between relational database dependencies and a fragment of propositional logic
Y. Sagiv
,
C. Delobel
,
D.S., Jr. Parker
,
R. Fagin
Journal of the ACM
28
(3), 1981, pp. 435-453
Optimal time minimal space selection algorithms
D. Dobkin
,
J.I. Munro
Journal of the ACM
28
(3), 1981, pp. 454-461
On
J
-maximal and
J
-minimal flow-shop schedules
F.Y. Chin
,
L.-L. Tsai
Journal of the ACM
28
(3), 1981, pp. 462-476
On optimal scheduling algorithms for time-shared systems
L. Kleinrock
,
A. Nilsson
Journal of the ACM
28
(3), 1981, pp. 477-486
Connected component labeling using quadtrees
H. Samet
Journal of the ACM
28
(3), 1981, pp. 487-501
Probabilistic aspects of Boolean switching functions via a new transform
S.K. Kumar
,
M.A. Breuer
Journal of the ACM
28
(3), 1981, pp. 502-520
The area-time complexity of binary multiplication
R.P. Brent
,
H.T. Kung
Journal of the ACM
28
(3), 1981, pp. 521-534
The complexity of the equivalence problem for simple programs
E.M. Gurari
,
O.H. Ibarra
Journal of the ACM
28
(3), 1981, pp. 535-560
The complexity of the finite containment problem for Petri nets
E.W. Mayr
,
A.R. Meyer
Journal of the ACM
28
(3), 1981, pp. 561-576
A unified approach to path problems
R.E. Tarjan
Journal of the ACM
28
(3), 1981, pp. 577-593
Fast algorithms for solving path problems
R.E. Tarjan
Journal of the ACM
28
(3), 1981, pp. 594-614
On matrices with connections
W. Bibel
Journal of the ACM
28
(4), 1981, pp. 633-645
Deleting repeated goals in the problem reduction format
D.W. Loveland
,
C.R. Reddy
Journal of the ACM
28
(4), 1981, pp. 646-661
Algorithmic analysis of a multiprogramming-multiprocessor computer system
G. Latouche
Journal of the ACM
28
(4), 1981, pp. 662-679
On the complexity of testing implications of functional and join dependencies
D. Maier
,
Y. Sagiv
,
M. Yannakakis
Journal of the ACM
28
(4), 1981, pp. 680-695
A lower bound on the complexity of orthogonal range queries
M.L. Fredman
Journal of the ACM
28
(4), 1981, pp. 696-705
A morphic representation of complements of recursively enumerable sets
A. Ehrenfeucht
,
G. Rozenberg
,
K. Ruohonen
Journal of the ACM
28
(4), 1981, pp. 706-714
A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars
M. Jazayeri
Journal of the ACM
28
(4), 1981, pp. 715-720
Algorithms for scheduling tasks on unrelated processors
E. Davis
,
J.M. Jaffe
Journal of the ACM
28
(4), 1981, pp. 721-736
Dynamic programming as graph searching: An algebraic approach
S. Gnesi
,
U. Montanari
,
A. Martelli
Journal of the ACM
28
(4), 1981, pp. 737-751
An algorithm for
K
best solutions of the resource allocation problem
N. Katoh
,
T. Ibaraki
,
H. Mine
Journal of the ACM
28
(4), 1981, pp. 752-764
On the complexity of integer programming
C.H. Papadimitriou
Journal of the ACM
28
(4), 1981, pp. 765-768
Deciding linear inequalities by computing loop residues
R. Shostak
Journal of the ACM
28
(4), 1981, pp. 769-779
A lower bound to finding convex hulls
A.C.-C. Yao
Journal of the ACM
28
(4), 1981, pp. 780-787
Seiten
<
1
2