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=1984
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Symmetric complementation
J.H. Reif
Journal of the ACM
31
(2), 1984, pp. 401-421
Space-time trade-offs for banded matrix problems
J.E. Savage
Journal of the ACM
31
(2), 1984, pp. 422-437
A mechanical proof of the unsolvability of the halting problem
R.S. Boyer
,
J.S. Moore
Journal of the ACM
31
(3), 1984, pp. 441-458
Solving
NP
-hard problems on graphs that are almost trees and an application to facility location problems
Y. Gurevich
,
L. Stockmeyer
,
U. Vishkin
Journal of the ACM
31
(3), 1984, pp. 459-473
An end-to-end approach to the resequencing problem
F. Baccelli
,
E. Gelenbe
,
B. Plateau
Journal of the ACM
31
(3), 1984, pp. 474-485
Synthesis of a class of deadlock-free Petri nets
A. Datta
,
S. Ghosh
Journal of the ACM
31
(3), 1984, pp. 486-506
Efficient schemes for parallel communication
E. Upfal
Journal of the ACM
31
(3), 1984, pp. 507-517
The format model: A theory of database organization
R. Hull
,
C.K. Yap
Journal of the ACM
31
(3), 1984, pp. 518-537
Storing a sparse table with
O(1)
worst case access time
M.L. Fredman
,
J. Komlós
,
E. Szemerédi
Journal of the ACM
31
(3), 1984, pp. 538-544
On the optimal solution of large linear systems
J.F. Traub
,
H. Woźniakowski
Journal of the ACM
31
(3), 1984, pp. 545-559
A theory of communicating sequential processes
S.D. Brookes
,
C.A.R. Hoare
,
A.W. Roscoe
Journal of the ACM
31
(3), 1984, pp. 560-599
A formal method for the abstract specification of software
J. McLean
Journal of the ACM
31
(3), 1984, pp. 600-627
Analysis of interleaved storage via a constant-service queuing system with Markov-chain-driven input
M. Hofri
Journal of the ACM
31
(3), 1984, pp. 628-648
Graph problems on a mesh-connected processor array
M.J. Atallah
,
S.R. Kosaraju
Journal of the ACM
31
(3), 1984, pp. 649-667
A polynomial linear search algorithm for the
n
-dimensional knapsack problem
F. Meyer auf der Heide
Journal of the ACM
31
(3), 1984, pp. 668-676
Depth-first search and Kuratowski subgraphs
S.G. Williamson
Journal of the ACM
31
(4), 1984, pp. 681-693
Configuration of VLSI arrays in the presence of defects
J.W. Greene
,
A. El Gamal
Journal of the ACM
31
(4), 1984, pp. 694-717
A proof procedure for data dependencies
C. Beeri
,
M.Y. Vardi
Journal of the ACM
31
(4), 1984, pp. 718-741
Updates of relational views
S.S. Cosmadakis
,
C.H. Papadimitriou
Journal of the ACM
31
(4), 1984, pp. 742-760
Incomplete information in relational databases
T. Imieliński
,
W., Jr. Lipski
Journal of the ACM
31
(4), 1984, pp. 761-791
Optimal asynchronous Newton method for the solution of nonlinear equations
A. Bojańczyk
Journal of the ACM
31
(4), 1984, pp. 792-803
Bounds for the positive eigenvectors of nonnegative matrices and for their approximations by decomposition
P.-J. Courtois
,
P. Semal
Journal of the ACM
31
(4), 1984, pp. 804-825
Optimum head separation in a disk system with two read/write heads
A.R. Calderbank
,
E.G., Jr. Coffman
,
L. Flatto
Journal of the ACM
31
(4), 1984, pp. 826-838
Numerical computation of sojourn-time distributions in queuing networks
B. Melamed
,
M. Yadin
Journal of the ACM
31
(4), 1984, pp. 839-854
Probabilistic models of database locking: Solutions, computational algorithms, and asymptotics
D. Mitra
,
P.J. Weinberger
Journal of the ACM
31
(4), 1984, pp. 855-878
Seiten
<
1
2
3
>