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=31
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Deciding combinations of theories
R.E. Shostak
Journal of the ACM
31
(1), 1984, pp. 1-12
Bounding fan-out in logical networks
H.J. Hoover
,
M.M. Klawe
,
N.J. Pippenger
Journal of the ACM
31
(1), 1984, pp. 13-18
Some Hamilton paths and a minimal change algorithm
P. Eades
,
M. Hickey
,
R.C. Read
Journal of the ACM
31
(1), 1984, pp. 19-29
On the structure of Armstrong relations for functional dependencies
C. Beeri
,
M. Dowd
,
R. Fagin
,
R. Statman
Journal of the ACM
31
(1), 1984, pp. 30-46
On compiling queries in recursive first-order databases
L.J. Henschen
,
S.A. Naqvi
Journal of the ACM
31
(1), 1984, pp. 47-85
Optimal flow control of an M/M/m queue
A.A. Lazar
Journal of the ACM
31
(1), 1984, pp. 86-98
A fast algorithm for the two-variable integer programming problem
S.D. Feit
Journal of the ACM
31
(1), 1984, pp. 99-113
Linear programming in linear time when the dimension is fixed
N. Megiddo
Journal of the ACM
31
(1), 1984, pp. 114-127
The product form for sojourn time distributions in cyclic exponential queues
O.J. Boxma
,
F.P. Kelly
,
A.G. Konheim
Journal of the ACM
31
(1), 1984, pp. 128-133
Priority queues with feedback
B. Simon
Journal of the ACM
31
(1), 1984, pp. 134-149
Information transfer in distributed computing with applications to VLSI
J. JáJá
,
V.K. Prasanna Kumar
Journal of the ACM
31
(1), 1984, pp. 150-162
Random trees and the analysis of branch and bound procedures
D.R. Smith
Journal of the ACM
31
(1), 1984, pp. 163-188
Complexity results for permuting data and other computations on parallel processors
A. Gottlieb
,
C.P. Kruskal
Journal of the ACM
31
(2), 1984, pp. 193-209
Finitely specifiable implicational dependency families
R. Hull
Journal of the ACM
31
(2), 1984, pp. 210-226
Serializability by locking
M. Yannakakis
Journal of the ACM
31
(2), 1984, pp. 227-244
Worst-case analysis of set union algorithms
R.E. Tarjan
,
J. van Leeuwen
Journal of the ACM
31
(2), 1984, pp. 245-281
The
\omega
-sequence equivalence problem for DOL systems is decidable
K. Culik II
,
T. Harju
Journal of the ACM
31
(2), 1984, pp. 282-298
Terminating Turing machine computations and the complexity and/or decidability of correspondence problems, grammars, and program schemes
H.B. Hunt III
Journal of the ACM
31
(2), 1984, pp. 299-318
Beyond floating point
C.W. Clenshaw
,
F.W.J. Olver
Journal of the ACM
31
(2), 1984, pp. 319-328
Lower bounds and fast algorithms for sequence acceleration
G.M. Trojan
Journal of the ACM
31
(2), 1984, pp. 329-335
The three-machine no-wait flow shop is
NP
-complete
H. Röck
Journal of the ACM
31
(2), 1984, pp. 336-345
Asymptotic expansions and integral representations of moments of queue lengths in closed Markovian networks
J. McKenna
,
D. Mitra
Journal of the ACM
31
(2), 1984, pp. 346-360
Some combinatorial game problems require
\Omega(n^k)
time
A. Adachi
,
S. Iwata
Journal of the ACM
31
(2), 1984, pp. 361-376
The VLSI complexity of selected graph problems
J. Jájá
Journal of the ACM
31
(2), 1984, pp. 377-391
On the complexity of unique solutions
C.H. Papadimitriou
Journal of the ACM
31
(2), 1984, pp. 392-400
Seiten 1
2
3
>