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 YEAR=1983
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The relative neighborhood graph, with an application to minimum spanning trees
K.J. Supowit
Journal of the ACM
30
(3), 1983, pp. 428-448
Efficiency of synchronous versus asynchronous distributed systems
E. Arjomandi
,
M.J. Fischer
,
N.A. Lynch
Journal of the ACM
30
(3), 1983, pp. 449-456
Instruction sets for evaluating arithmetic expressions
E.G., Jr. Coffman
,
R. Sethi
Journal of the ACM
30
(3), 1983, pp. 457-478
On the desirability of acyclic database schemes
C. Beeri
,
R. Fagin
,
D. Maier
,
M. Yannakakis
Journal of the ACM
30
(3), 1983, pp. 479-513
Degrees of acyclicity for hypergraphs and relational database schemes
R. Fagin
Journal of the ACM
30
(3), 1983, pp. 514-550
Parametric combinatorial computing and a problem of program module distribution
D. Gusfield
Journal of the ACM
30
(3), 1983, pp. 551-563
Robustness of queuing network formulas
R. Suri
Journal of the ACM
30
(3), 1983, pp. 564-594
Properties of a notation for combining functions
J.-C. Raoult
,
R. Sethi
Journal of the ACM
30
(3), 1983, pp. 595-611
Effective axiomatizations of Hoare logics
E.M., Jr. Clarke
,
S.M. German
,
J.Y. Halpern
Journal of the ACM
30
(3), 1983, pp. 612-636
The complexity of solving polynomial equations by quadrature
G. Gati
Journal of the ACM
30
(3), 1983, pp. 637-640
On the simplification and equivalence problems for straight-line programs
O.H. Ibarra
,
B.S. Leininger
Journal of the ACM
30
(3), 1983, pp. 641-656
Time-space trade-offs for some algebraic problems
J. Jájá
Journal of the ACM
30
(3), 1983, pp. 657-667
The weak Byzantine generals problem
L. Lamport
Journal of the ACM
30
(3), 1983, pp. 668-676
Refining nondeterminism in relativizations of complexity classes
M.-R. Xu
,
J.E. Doner
,
R.V. Book
Journal of the ACM
30
(3), 1983, pp. 677-685
Decision quality as a function of search depth on game trees
D.S. Nau
Journal of the ACM
30
(4), 1983, pp. 687-708
Cost trade-offs in graph embedding, with applications
J.-W. Hong
,
K. Mehlhorn
,
A.L. Rosenberg
Journal of the ACM
30
(4), 1983, pp. 709-728
Improving the performance guarantee for approximate graph coloring
A. Wigderson
Journal of the ACM
30
(4), 1983, pp. 729-735
Design of minimum-cost deadlock-free systems
T. Ibaraki
,
H.M. Abdel-Wahab
,
T. Kameda
Journal of the ACM
30
(4), 1983, pp. 736-751
Graph algorithms for functional dependency manipulation
G. Ausiello
,
A. d'Atri
,
D. Saccá
Journal of the ACM
30
(4), 1983, pp. 752-766
Syntactic characterization of tree database schemas
N. Goodman
,
O. Shmueli
Journal of the ACM
30
(4), 1983, pp. 767-786
Locking protocols: From exclusive to shared locks
Z.M. Kedem
,
A. Silberschatz
Journal of the ACM
30
(4), 1983, pp. 787-804
Analysis of uniform hashing
P.-Å. Larson
Journal of the ACM
30
(4), 1983, pp. 805-819
An iteration theorem for simple precedence languages
Y. Krevner
,
A. Yehudai
Journal of the ACM
30
(4), 1983, pp. 820-833
The proof of a folk theorem on queuing delay with applications to routing in networks
B. Hajek
Journal of the ACM
30
(4), 1983, pp. 834-851
Applying parallel computation algorithms in the design of serial algorithms
N. Megiddo
Journal of the ACM
30
(4), 1983, pp. 852-865
Seiten
<
1
2