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 Volume=38
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A random polynomial time algorithm for approximating the volume of convex bodies
M. Dyer
,
A. Frieze
,
R. Kannan
Journal of the ACM
38
(1), 1991, January, pp. 1-17
The weighted region problem: Finding shortest paths through a weighted planar subdivision
J.S.B. Mitchell
,
C.H. Papadimitriou
Journal of the ACM
38
(1), 1991, January, pp. 18-73
A fast planar partition algorithm, II
K. Mulmuley
Journal of the ACM
38
(1), 1991, January, pp. 74-103
Optimal sample cost residues for differential database batch query problems
D.E. Willard
Journal of the ACM
38
(1), 1991, January, pp. 104-119
Evaluation of queries in independent database schemes
Y. Sagiv
Journal of the ACM
38
(1), 1991, January, pp. 120-161
Planar graph decomposition and all pairs shortest paths
G.N. Frederickson
Journal of the ACM
38
(1), 1991, January, pp. 162-204
Extended Horn sets in propositional logic
V. Chandru
,
J.N. Hooker
Journal of the ACM
38
(1), 1991, January, pp. 205-221
Upper and lower bounds on switching energy in VLSI
G. Kissin
Journal of the ACM
38
(1), 1991, January, pp. 222-254
Modularity of cycles and paths in graphs
E.M. Arkin
,
C.H. Papadimitriou
,
M. Yannakakis
Journal of the ACM
38
(2), 1991, April, pp. 255-274
Maintenance of geometric extrema
D. Dobkin
,
S. Suri
Journal of the ACM
38
(2), 1991, April, pp. 275-298
A methodology for hardware verification based on logic simulation
R.E. Bryant
Journal of the ACM
38
(2), 1991, April, pp. 299-328
Towards an algebraic theory of recursion
Y. Ioannidis
,
E. Wong
Journal of the ACM
38
(2), 1991, April, pp. 329-381
A model-theoretic analysis of knowledge
R. Fagin
,
J.Y. Halpern
,
M.Y. Vardi
Journal of the ACM
38
(2), 1991, April, pp. 382-428
On stability and performance of parallel processing systems
N. Bambos
,
J. Walrand
Journal of the ACM
38
(2), 1991, April, pp. 429-452
A lower bound for integer greatest common divisor computations
Y. Mansour
,
B. Schieber
,
P. Tiwari
Journal of the ACM
38
(2), 1991, April, pp. 453-471
Space-bounded probabilistic game automata
A. Condon
Journal of the ACM
38
(2), 1991, April, pp. 472-494
Efficient simulation of finite automata by neural nets
N. Alon
,
A.K. Dewdney
,
T.J. Ott
Journal of the ACM
38
(2), 1991, April, pp. 495-514
An optimal parallel algorithm for the visibility of a simple polygon from a point
M.J. Atallah
,
D.Z. Chen
,
H. Wagener
Journal of the ACM
38
(3), 1991, July, pp. 516-533
Abstraction in query processing
T. Imielinski
Journal of the ACM
38
(3), 1991, July, pp. 534-558
Proving refutational completeness of theorem-proving strategies: The transfinite semantic tree method
J. Hsiang
,
M. Rusinowitch
Journal of the ACM
38
(3), 1991, July, pp. 559-587
Autoepistemic logic
W. Marek
,
M. Truszczynski
Journal of the ACM
38
(3), 1991, July, pp. 588-619
The well-founded semantics for general logic programs
A. van Gelder
,
K.A. Ross
,
J.S. Schlipf
Journal of the ACM
38
(3), 1991, July, pp. 620-650
Two-way string-matching
M. Crochemore
,
D. Perrin
Journal of the ACM
38
(3), 1991, July, pp. 651-675
Optimal load balancing and scheduling in a distributed computer system
K.W. Ross
,
D.D. Yao
Journal of the ACM
38
(3), 1991, July, pp. 676-690
Proofs that yield nothing but their validity or all languages in
NP
have zero-knowledge proof systems
O. Goldreich
,
S. Micali
,
A. Wigderson
Journal of the ACM
38
(3), 1991, July, pp. 691-729
Seiten 1
2
>