Volume 42,
Number 1,
January 1995
- Thomas Eiter, Georg Gottlob:
The Complexity of Logic-Based Abduction.
3-42
Electronic Edition BibTeX
- Bernhard Nebel, Hans-Jürgen Bürckert:
Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra.
43-66
Electronic Edition (ACM DL) BibTeX
- Paul B. Callahan, S. Rao Kosaraju:
A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields.
67-90
Electronic Edition (ACM DL) BibTeX
- Andrew A. Chien, Jae H. Kim:
Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors.
91-123
Electronic Edition (ACM DL) BibTeX
- Hagit Attiya, Amotz Bar-Noy, Danny Dolev:
Sharing Memory Robustly in Message-Passing Systems.
124-142
Electronic Edition (ACM DL) BibTeX
- Danny Dolev, Joseph Y. Halpern, Barbara Simons, H. Raymond Strong:
Dynamic Fault-Tolerant Clock Synchronization.
143-185
Electronic Edition (ACM DL) BibTeX
- Sibsankar Haldar, K. Vidyasankar:
Constructing 1-Writer Multireader Multivalued Atomic Variable from Regular Variables.
186-203
Electronic Edition (ACM DL) BibTeX
- C. S. Chang, R. Nelson:
Bounds on the Speedup and Efficiency of Partial Synchronization in Parallel Processing Systems.
204-231
Electronic Edition (ACM DL) BibTeX
- Bard Bloom, Sorin Istrail, Albert R. Meyer:
Bisimulation Can't be Traced.
232-268
Electronic Edition (ACM DL) BibTeX
- Manuel Blum, Sampath Kannan:
Designing Programs that Check Their Work.
269-291
Electronic Edition (ACM DL) BibTeX
Volume 42,
Number 2,
March 1995
- Fangzhen Lin, Yoav Shoham:
Provably Correct Theories of Action.
293-320
Electronic Edition (ACM DL) BibTeX
- David R. Karger, Philip N. Klein, Robert Endre Tarjan:
A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees.
321-328
Electronic Edition (ACM DL) BibTeX
- Ke Wang, Weining Zhang, Siu-Cheung Chau:
Decomposition of Magic Rewriting.
329-381
Electronic Edition BibTeX
- John N. Tsitsiklis, George D. Stamoulis:
On the Average Communication Complexity of Asynchronous Distributed Algorithms.
382-400
Electronic Edition (ACM DL) BibTeX
- Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
The Isomorphism Conjecture Fails Relative to a Random Oracle.
401-420
Electronic Edition (ACM DL) BibTeX
- Georg Gottlob:
NP Trees and Carnap's Modal Logic.
421-457
Electronic Edition (ACM DL) BibTeX
- Rocco De Nicola, Frits W. Vaandrager:
Three Logics for Branching Bisimulation.
458-487
Electronic Edition (ACM DL) BibTeX
- Kenneth L. Clarkson:
Las Vegas Algorithms for Linear and Integer Programming when the Dimension is Small.
488-499
Electronic Edition (ACM DL) BibTeX
- Bonnie Berger, Martin L. Brady, Donna J. Brown, Frank Thomson Leighton:
Nearly Optimal Algorithms and Bounds for Multilayer Channel Routing.
500-542
Electronic Edition (ACM DL) BibTeX
Volume 42,
Number 3,
May 1995
Volume 42,
Number 4,
July 1995
Volume 42,
Number 5,
September 1995
Volume 42,
Number 6,
November 1995
- Michel X. Goemans, David P. Williamson:
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming.
1115-1145
Electronic Edition (ACM DL) BibTeX
- Rusins Freivalds, Efim B. Kinber, Carl H. Smith:
On the Impact of Forgetting on Learning Machines.
1146-1168
Electronic Edition (ACM DL) BibTeX
- Joan Boyar, Gilles Brassard, René Peralta:
Subquadratic Zero-Knowledge.
1169-1193
Electronic Edition (ACM DL) BibTeX
- Jan A. Bergstra, J. V. Tucker:
Equational Specifications, Complete Term Rewriting Systems, and Computable and Semicomputable Algebras.
1194-1230
Electronic Edition (ACM DL) BibTeX
- Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld:
Computing With Faulty Shared Objects.
1231-1274
Electronic Edition (ACM DL) BibTeX
- Yoshihito Toyama, Jan Willem Klop, Hendrik Pieter Barendregt:
Termination for Direct Sums of Left-Linear Complete Term Rewriting Systems.
1275-1304
Electronic Edition (ACM DL) BibTeX
Copyright © Sun May 17 00:05:53 2009
by Michael Ley (ley@uni-trier.de)
