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
[2]
Hilfe
Suche: Journal=J. ACM AND Volume=38
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Stability and stabilizability of discrete event dynamic systems
C.M. özveren
,
A.S. Willsky
,
P.J. Antsaklis
Journal of the ACM
38
(3), 1991, July, pp. 730-752
Complexity classes defined by counting quantifiers
J. Torán
Journal of the ACM
38
(3), 1991, July, pp. 753-774
Multiobjective
A^*
Bradley S. Stewart
,
Chelsea C. White III
Journal of the ACM
38
(4), 1991, October, pp. 775-814
Faster scaling algorithms for general graph-matching problems
Harold N. Gabow
,
Robert E. Tarjan
Journal of the ACM
38
(4), 1991, October, pp. 815-853
Independence-reducible database schemes
Edward P.F. Chan
,
Héctor J. Hernández
Journal of the ACM
38
(4), 1991, October, pp. 854-886
Floyd-Hoare logic in iteration theories
Stephen L. Bloom
,
Zoltán ésik
Journal of the ACM
38
(4), 1991, October, pp. 887-934
A propositional modal logic of time intervals
Joseph Y. Halpern
,
Yoav Shoham
Journal of the ACM
38
(4), 1991, October, pp. 935-962
Nonmonotonic default modal logics
Michael Tiomkin
,
Michael Kaminski
Journal of the ACM
38
(4), 1991, October, pp. 963-984
A parallel shortest augmenting path algorithm for the assignment problem
Egon Balas
,
Donald Miller
,
Joseph Pekny
,
Paolo Toth
Journal of the ACM
38
(4), 1991, October, pp. 985-1004
Structural conditions for perturbation analysis of queuing systems
Paul Glasserman
Journal of the ACM
38
(4), 1991, October, pp. 1005-1025
Simulating
(\log^c n)
-wise independence in
NC
Bonnie Berger
,
John Rompel
Journal of the ACM
38
(4), 1991, October, pp. 1026-1046
Seiten
<
1
2