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=1985
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Three approaches to heuristic search in networks
A. Bagchi
,
A. Mahanti
Journal of the ACM
32
(1), 1985, pp. 1-27
AND/OR graph heuristic search methods
A. Mahanti
,
A. Bagchi
Journal of the ACM
32
(1), 1985, pp. 28-51
Synchronizing clocks in the presence of faults
L. Lamport
,
P.M. Melliar-Smith
Journal of the ACM
32
(1), 1985, pp. 52-78
Disaggregations in databases
S. Abiteboul
Journal of the ACM
32
(1), 1985, pp. 79-101
Memory-constrained task scheduling on a network of dual processors
K. Fuchs
,
D. Kafura
Journal of the ACM
32
(1), 1985, pp. 102-129
Approximation schemes for covering and packing problems in image processing and VLSI
D.S. Hochbaum
,
W. Maass
Journal of the ACM
32
(1), 1985, pp. 130-136
Algebraic laws for nondeterminism and concurrency
M. Hennessy
,
R. Milner
Journal of the ACM
32
(1), 1985, pp. 137-161
Aggregation with an error of
O(\epsilon^2)
H. Vantilborgh
Journal of the ACM
32
(1), 1985, pp. 162-190
Bounds on information exchange for Byzantine agreement
D. Dolev
,
R. Reischuk
Journal of the ACM
32
(1), 1985, pp. 191-204
Hard-core theorems for complexity classes
S. Even
,
A.L. Selman
,
Y. Yacobi
Journal of the ACM
32
(1), 1985, pp. 205-217
A tight bound for black and white pebbles on the pyramid
M.M. Klawe
Journal of the ACM
32
(1), 1985, pp. 218-228
Solving low-density subset sum problems
J.C. Lagarias
,
A.M. Odlyzko
Journal of the ACM
32
(1), 1985, pp. 229-246
Soundness and completeness of a synthesis algorithm based on example computations
M.A. Bauer
Journal of the ACM
32
(2), 1985, pp. 249-279
On the efficiency of subsumption algorithms
G. Gottlob
,
A. Leitsch
Journal of the ACM
32
(2), 1985, pp. 280-295
Feedback vertex sets and cyclically reducible graphs
C.-C. Wang
,
E.L. Lloyd
,
M.L. Soffa
Journal of the ACM
32
(2), 1985, pp. 296-313
Beyond two-phase locking
G.N. Buckley
,
A. Silberschatz
Journal of the ACM
32
(2), 1985, pp. 314-326
Algorithms for resolving conflicts in dynamic storage allocation
B.S. Baker
,
E.G., Jr. Coffman
,
D.E. Willard
Journal of the ACM
32
(2), 1985, pp. 327-343
Parallel algorithms for data compression
M.E. Gonzalez-Smith
,
J.A. Storer
Journal of the ACM
32
(2), 1985, pp. 344-373
Impossibility of distributed consensus with one faulty process
M.J. Fischer
,
N.A. Lynch
,
M.S. Paterson
Journal of the ACM
32
(2), 1985, pp. 374-382
The traveling salesman problem in graphs with 3-edge cutsets
G. Cornuéjols
,
D. Naddef
,
W. Pulleyblank
Journal of the ACM
32
(2), 1985, pp. 383-410
A fixpoint semantics for nondeterministic data flow
J. Staples
,
V.L. Nguyen
Journal of the ACM
32
(2), 1985, pp. 411-444
Optimal static load balancing in distributed computer systems
A.N. Tantawi
,
D. Towsley
Journal of the ACM
32
(2), 1985, pp. 445-465
Decidable problems for powerful programs
E.M. Gurari
Journal of the ACM
32
(2), 1985, pp. 466-483
A complexity theory based on Boolean algebra
S. Skyum
,
L.G. Valiant
Journal of the ACM
32
(2), 1985, pp. 484-502
Generalized best first search strategies and the optimality of A*
R. Dechter
,
J. Pearl
Journal of the ACM
32
(3), 1985, pp. 505-536
Seiten 1
2
>