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=1983
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Search algorithms under different kinds of heuristics - a comparative study
A. Bagchi
,
A. Mahanti
Journal of the ACM
30
(1), 1983, pp. 1-21
Bidirectional heuristic search again
D. de Champeaux
Journal of the ACM
30
(1), 1983, pp. 22-32
A note on ``a note on multiple error detection in ASCII numeric data communication''
D.V. Sarwate
Journal of the ACM
30
(1), 1983, pp. 33-35
Locking expressions for increased database concurrency
A. Klug
Journal of the ACM
30
(1), 1983, pp. 36-54
Locking primitives in a database system
H.F. Korth
Journal of the ACM
30
(1), 1983, pp. 55-79
Implicit data structures for the dictionary problem
G.N. Frederickson
Journal of the ACM
30
(1), 1983, pp. 80-94
A supernormal-form theorem for context-free grammars
H.A. Maurer
,
A. Salomaa
,
D. Wood
Journal of the ACM
30
(1), 1983, pp. 95-102
Solving linear algebraic equations on an MIMD computer
R.E. Lord
,
J.S. Kowalik
,
S.P. Kumar
Journal of the ACM
30
(1), 1983, pp. 103-117
Formulations and algorithms for the capacitated minimal directed tree problem
B. Gavish
Journal of the ACM
30
(1), 1983, pp. 118-132
Polynomial-time aggregation of integer programming problems
R. Kannan
Journal of the ACM
30
(1), 1983, pp. 133-145
The time for a round trip in a cycle of exponential queues
R. Schassberger
,
H. Daduna
Journal of the ACM
30
(1), 1983, pp. 146-150
The expressiveness of simple and second-order type structures
S. Fortune
,
D. Leivant
,
M. O'Donnell
Journal of the ACM
30
(1), 1983, pp. 151-185
Vector execution of flow graphs
H.R. Strong
Journal of the ACM
30
(1), 1983, pp. 186-196
Formal justification of a proof system for communicating sequential processes
K.R. Apt
Journal of the ACM
30
(1), 1983, pp. 197-216
Probabilistic algorithms for deciding equivalence of straigth-line programs
O.H. Ibarra
,
S. Moran
Journal of the ACM
30
(1), 1983, pp. 217-228
Analysis of the search performance of coalesced hashing
J.S. Vitter
Journal of the ACM
30
(2), 1983, pp. 231-258
The complexity of LALR(k) testing
S. Sippu
,
E. Soisalon-Soininen
,
E. Ukkonen
Journal of the ACM
30
(2), 1983, pp. 259-270
Computable error bounds for aggregated Markov chains
G.W. Stewart
Journal of the ACM
30
(2), 1983, pp. 271-285
A characterization of product-form queuing networks
K.M. Chandy
,
A.J. Martin
Journal of the ACM
30
(2), 1983, pp. 286-299
Decentralized simulation of resource managers
J.M. Jaffe
Journal of the ACM
30
(2), 1983, pp. 300-322
On communicating finite-state machines
D. Brand
,
P. Zafiropulo
Journal of the ACM
30
(2), 1983, pp. 323-342
Abstract implementations and their correctness proofs
C.F. Nourani
Journal of the ACM
30
(2), 1983, pp. 343-359
Optimal search on some game trees
M. Tarsi
Journal of the ACM
30
(3), 1983, pp. 389-396
Three-dimensional VLSI: A case study
A.L. Rosenberg
Journal of the ACM
30
(3), 1983, pp. 397-416
Smallest-last ordering and clustering and graph coloring algorithms
D.W. Matula
,
L.L. Beck
Journal of the ACM
30
(3), 1983, pp. 417-427
Seiten 1
2
>