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=1986
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Special relations in automated deduction
Z. Manna
,
R. Waldinger
Journal of the ACM
33
(1), 1986, pp. 1-59
Routing through a rectangle
K. Mehlhorn
,
F.P. Preparata
Journal of the ACM
33
(1), 1986, pp. 60-85
An application of number theory to the organization of raster-graphics memory
B. Chor
,
C.E. Leiserson
,
R.L. Rivest
,
J.B. Shearer
Journal of the ACM
33
(1), 1986, pp. 86-104
Notions of dependency satisfaction
M.H. Graham
,
A.O. Mendelzon
,
M.Y. Vardi
Journal of the ACM
33
(1), 1986, pp. 105-129
A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius
B. Lubachevsky
,
D. Mitra
Journal of the ACM
33
(1), 1986, pp. 130-150
``Sometimes'' and ``not never'' revisited: On branching versus linear time temporal logic
E.A. Emerson
,
J.Y. Halpern
Journal of the ACM
33
(1), 1986, pp. 151-178
Bound hierarchies for multiple-class queuing networks
D.L. Eager
,
K.C. Sevcik
Journal of the ACM
33
(1), 1986, pp. 179-206
A matrix-algebraic solution to two
K_m
servers in a loop
A. van de Liefvoort
,
L. Lipsky
Journal of the ACM
33
(1), 1986, pp. 207-223
Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness
D. Harel
Journal of the ACM
33
(1), 1986, pp. 224-248
Equality-based binary resolution
V.J. Digricoli
,
M.C. Harrison
Journal of the ACM
33
(2), 1986, pp. 253-289
Partitioning a polygonal region into trapezoids
Ta. Asano
,
Te. Asano
,
H. Imai
Journal of the ACM
33
(2), 1986, pp. 290-312
The mutual exclusion problem: Part I - A theory of interprocess communication
L. Lamport
Journal of the ACM
33
(2), 1986, pp. 313-326
The mutual exclusion problem: Part II - Statement and solutions
L. Lamport
Journal of the ACM
33
(2), 1986, pp. 327-348
A sound and sometimes complete query evaluation algorithm for relational databases with null values
R. Reiter
Journal of the ACM
33
(2), 1986, pp. 349-370
Partial match retrieval of multidimensional data
P. Flajolet
,
C. Puech
Journal of the ACM
33
(2), 1986, pp. 371-407
Tuple sequences and lexicographic indexes
S. Abiteboul
,
S. Ginsburg
Journal of the ACM
33
(3), 1986, pp. 409-422
Elimination of intersection anomalies from database schemes
C. Beeri
,
M. Kifer
Journal of the ACM
33
(3), 1986, pp. 423-450
Security problems on inference controls for SUM, MAX, and MIN queries
F. Chin
Journal of the ACM
33
(3), 1986, pp. 451-464
Sort sets in the relational model
S. Ginsburg
,
R. Hull
Journal of the ACM
33
(3), 1986, pp. 465-488
A note on the heigth of binary search trees
L. Devroye
Journal of the ACM
33
(3), 1986, pp. 489-498
Reaching approximate agreement in the presence of faults
D. Dolev
,
N.A. Lynch
,
S.S. Pinter
,
E.W. Stark
,
W.E. Weihl
Journal of the ACM
33
(3), 1986, pp. 499-516
Predicting fill for sparse orthogonal factorization
T.F. Coleman
,
A. Edenbrandt
,
J.R. Gilbert
Journal of the ACM
33
(3), 1986, pp. 517-532
A unified approach to approximation algorithms for bottleneck problems
D.S. Hochbaum
,
D.B. Shmoys
Journal of the ACM
33
(3), 1986, pp. 533-550
Improved methods for storing and updating information in the out-of-kilter algorithm
S. Singh
Journal of the ACM
33
(3), 1986, pp. 551-567
Asymptotic expansions for closed Markovian networks with state-dependent service rates
D. Mitra
,
J. McKenna
Journal of the ACM
33
(3), 1986, pp. 568-592
Seiten 1
2
>