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=1995
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of logic-based abduction
Thomas Eiter
,
Georg Gottlob
Journal of the ACM
42
(1), 1995, pp. 3-42
Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra
Bernhard Nebel
,
Hans-Jürgen Bürckert
Journal of the ACM
42
(1), 1995, pp. 43-66
A decomposition of multidimensional point sets with applications to
k
-nearest-neighbors and
n
-body potential fields
Paul B. Callahan
,
S. Rao Kosaraju
Journal of the ACM
42
(1), 1995, pp. 67-90
Planar-adaptive routing: Low-cost adaptive networks for multiprocessors
Andrew A. Chien
,
Jae H. Kim
Journal of the ACM
42
(1), 1995, pp. 91-123
Sharing memory robustly in message-passing systems
Hagit Attiya
,
Amotz Bar-Noy
,
Danny Dolev
Journal of the ACM
42
(1), 1995, pp. 124-142
Dynamic fault-tolerant clock synchronization
Danny Dolev
,
Joseph Y. Halpern
,
Barbara Simons
,
Ray Strong
Journal of the ACM
42
(1), 1995, pp. 143-185
Constructing 1-writer multireader multivalued atomic variables from regular variables
S. Haldar
,
K. Vidyasankar
Journal of the ACM
42
(1), 1995, pp. 186-203
Bounds on the speedup and efficiency of partial synchronization in parallel processing systems
C.S. Chang
,
R. Nelson
Journal of the ACM
42
(1), 1995, pp. 204-231
Bisimulation can't be traced
Bard Bloom
,
Sorin Istrail
,
Albert R. Meyer
Journal of the ACM
42
(1), 1995, pp. 232-268
Designing programs that check their work
Manuel Blum
,
Sampath Kannan
Journal of the ACM
42
(1), 1995, pp. 269-291
Provably correct theories of action
Fangzhen Lin
,
Yoav Shoham
Journal of the ACM
42
(2), 1995, pp. 293-320
A randomized linear-time algorithm to find minimum spanning trees
David R. Karger
,
Philip N. Klein
,
Robert E. Tarjan
Journal of the ACM
42
(2), 1995, pp. 321-328
Decomposition of magic rewriting
Ke Wang
,
Weining Zhang
,
Siu-Cheung Chau
Journal of the ACM
42
(2), 1995, pp. 329-381
On the average communication complexity of asynchronous distributed algorithms
John N. Tsitsiklis
,
George D. Stamoulis
Journal of the ACM
42
(2), 1995, pp. 382-400
The isomorphism conjecture fails relative to a random oracle
Stuart A. Kurtz
,
Stephen R. Mahaney
,
James S. Royer
Journal of the ACM
42
(2), 1995, pp. 401-420
NP trees and Carnap's modal logic
Georg Gottlob
Journal of the ACM
42
(2), 1995, pp. 421-457
Three logics for branching bisimulation
Rocco de Nicola
,
Frits Vaandrager
Journal of the ACM
42
(2), 1995, pp. 458-487
Las Vegas algorithms for linear and integer programming when the dimension is small
Kenneth L. Clarkson
Journal of the ACM
42
(2), 1995, pp. 488-499
Nearly optimal algorithms and bounds for multilayer channel routing
Bonnie Berger
,
Martin Brady
,
Donna Brown
,
Tom Leighton
Journal of the ACM
42
(2), 1995, pp. 500-542
Calculating normalization constants of closed queuing networks by numerically inverting their generating functions
Gagan L. Choudhury
,
Kin K. Leung
,
Ward Whitt
Journal of the ACM
42
(5), 1995, pp. 935-970
On the
k
-server conjecture
Elias Koutsoupias
,
Christos H. Papadimitriou
Journal of the ACM
42
(5), 1995, pp. 971-983
A theory of using history for equational systems with applications
Rakesh M. Verma
Journal of the ACM
42
(5), 1995, pp. 984-1020
Online tracking of mobile users
Baruch Awerbuch
,
David Peleg
Journal of the ACM
42
(5), 1995, pp. 1021-1058
Recoverable sequence transmission protocols
Ewan D. Tempero
,
Richard E. Ladner
Journal of the ACM
42
(5), 1995, pp. 1059-1090
Eigenvalues and expansion of regular graphs
Nabil Kahale
Journal of the ACM
42
(5), 1995, pp. 1091-1106
Seiten 1
2
>