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
[1]
Hilfe
Suche: Journal=J. ACM AND Volume=29
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the decidability of grammar problems
H.B. Hunt III
Journal of the ACM
29
(2), 1982, pp. 429-447
Determination of the conditional response for quantum allocation algorithms
T. Brown
Journal of the ACM
29
(2), 1982, pp. 448-460
Maximum processing rates of memory bound systems
R.M. Bryant
Journal of the ACM
29
(2), 1982, pp. 461-477
A finite-source queue with different customers
H. Kameda
Journal of the ACM
29
(2), 1982, pp. 478-491
Dynamic scaling and growth behavior of queuing network normalization constants
S.S. Lam
Journal of the ACM
29
(2), 1982, pp. 492-513
The performance of job classes with distinct policy functions
M. Ruschitzka
Journal of the ACM
29
(2), 1982, pp. 514-526
An approach to program behavior modeling and optimal memory control
P. Tzelnic
,
I. Gertner
Journal of the ACM
29
(2), 1982, pp. 527-554
Axiomatic definitions of programming languages: A theoretical assessment
A.R. Meyer
,
J.Y. Halpern
Journal of the ACM
29
(2), 1982, pp. 555-576
The pattern-of-calls expansion is the canonical fixpoint for recursive definitions
M.A. Arbib
,
E.G. Manes
Journal of the ACM
29
(2), 1982, pp. 577-602
The compilation of regular expressions into integrated circuits
R.W. Floyd
,
J.D. Ullman
Journal of the ACM
29
(3), 1982, pp. 603-622
Linear-time computability of combinatorial problems on series-parallel graphs
K. Takamizawa
,
T. Nishizeki
,
N. Saito
Journal of the ACM
29
(3), 1982, pp. 623-641
Parallel permutation and sorting algorithms and a new generalized connection network
D. Nassimi
,
S. Sahni
Journal of the ACM
29
(3), 1982, pp. 642-667
Testing satisfaction of functional dependencies
P. Honeyman
Journal of the ACM
29
(3), 1982, pp. 668-677
Properties of functional-dependency families
S. Ginsburg
,
S.M. Zaiddan
Journal of the ACM
29
(3), 1982, pp. 678-698
Equivalence of relational algebra and relational calculus query languages having aggregate functions
A. Klug
Journal of the ACM
29
(3), 1982, pp. 699-717
A theory of safe locking policies in database systems
M. Yannakakis
Journal of the ACM
29
(3), 1982, pp. 718-740
Inference of reversible languages
D. Angluin
Journal of the ACM
29
(3), 1982, pp. 741-765
An almost-linear algorithm for two-processor scheduling
H.N. Gabow
Journal of the ACM
29
(3), 1982, pp. 766-780
Critical path scheduling with resource and processor constraints
E.L. Lloyd
Journal of the ACM
29
(3), 1982, pp. 781-811
Preemptive scheduling with release times, deadlines, and due times
C. Martel
Journal of the ACM
29
(3), 1982, pp. 812-829
A note on product-form solution for queuing networks with Poisson arrivals and general service-time distributions with finite means
C.L. Samelson
,
W.G. Bulgren
Journal of the ACM
29
(3), 1982, pp. 830-840
Contributions to the theory of logic programming
K.R. Apt
,
M.H. van Emden
Journal of the ACM
29
(3), 1982, pp. 841-862
Two-way counter machines and Diophantine equations
E.M. Gurari
,
O.H. Ibarra
Journal of the ACM
29
(3), 1982, pp. 863-873
Some exact complexity results for straight-line computations over semirings
M. Jerrum
,
M. Snir
Journal of the ACM
29
(3), 1982, pp. 874-897
On parallel computation for the knapsack problem
A.C.-C. Yao
Journal of the ACM
29
(3), 1982, pp. 898-903
Seiten
<
1
2
3
>