Volume 41,
Number 1,
January 1994
Volume 41,
Number 2,
March 1994
- Moshe Dubiner, Zvi Galil, Edith Magen:
Faster Tree Pattern Matching.
205-213
Electronic Edition BibTeX
- Samir Khuller, Uzi Vishkin:
Biconnectivity Approximations and Graph Carvings.
214-235
Electronic Edition (ACM DL) BibTeX
- Leo Bachmair, Nachum Dershowitz:
Equational Inference, Canonical Proofs, and Proof Orderings.
236-276
Electronic Edition (ACM DL) BibTeX
- Karl R. Abrahamson, Andrew Adler, Lisa Higham, David G. Kirkpatrick:
Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings.
277-310
Electronic Edition (ACM DL) BibTeX
- Ambuj K. Singh, James H. Anderson, Mohamed G. Gouda:
The Elusive Atomic Register.
311-339
Electronic Edition (ACM DL) BibTeX
- Ronald Fagin, Joseph Y. Halpern:
Reasoning About Knowledge and Probability.
340-367
Electronic Edition (ACM DL) BibTeX
,
Corrigendum: JACM 45(1): 214 (1998)
- A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
An Analysis of ML Typability.
368-398
Electronic Edition (ACM DL) BibTeX
- Michel Cosnard, El Mostafa Daoudi:
Optimal Algorithms for Parallel Givens Factorization on a Coarse-Grained PRAM.
399-421
Electronic Edition (ACM DL) BibTeX
- Noga Alon, Nimrod Megiddo:
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time.
422-434
Electronic Edition (ACM DL) BibTeX
Volume 41,
Number 3,
May 1994
Volume 41,
Number 4,
July 1994
- Wray L. Buntine, Hans-Jürgen Bürckert:
On Solving Equations and Disequations.
591-629
Electronic Edition (ACM DL) BibTeX
- Avrim Blum, Ming Li, John Tromp, Mihalis Yannakakis:
Linear Approximation of Shortest Superstrings.
630-647
Electronic Edition (ACM DL) BibTeX
- Adrian E. Conway, Eugene Pinsky, Srinivasan Tridandapani:
Efficient Decomposition Methods for the Analysis of Multi-Facility Blocking Models.
648-675
Electronic Edition (ACM DL) BibTeX
- John C. S. Lui, Richard R. Muntz:
Computing Bounds on Steady State Availability of Repairable Computer Systems.
676-707
Electronic Edition (ACM DL) BibTeX
- Timothy C. Bell, Ian H. Witten:
The Relationship between Greedy Parsing and Symbolwise Text Compression.
708-724
Electronic Edition (ACM DL) BibTeX
- Hagit Attiya, Nancy A. Lynch, Nir Shavit:
Are Wait-Free Algorithms Fast?
725-763
Electronic Edition (ACM DL) BibTeX
- John H. Reif, Micha Sharir:
Motion Planning in the Presence of Moving Obstacles.
764-790
Electronic Edition (ACM DL) BibTeX
- Shaodi Gao, Michael Kaufmann:
Channel Routing of Multiterminal Nets.
791-818
Electronic Edition (ACM DL) BibTeX
Volume 41,
Number 5,
September 1994
- Peter K. Rathmann, Marianne Winslett, Mark S. Manasse:
Circumscription with Homomorphisms: Solving the Equality and Counterexample Problems.
819-873
Electronic Edition (ACM DL) BibTeX
- Christopher J. Glass, Lionel M. Ni:
The Turn Model for Adaptive Routing.
874-902
Electronic Edition (ACM DL) BibTeX
- Yves Dallery, Zhen Liu, Donald F. Towsley:
Equivalence, Reversibility, Symmetry and Concavity Properties in Fork-Join Queueing Networks with Blocking.
903-942
Electronic Edition (ACM DL) BibTeX
- James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan:
Fully Persistent Lists with Catenation.
943-959
Electronic Edition (ACM DL) BibTeX
- Carsten Lund, Mihalis Yannakakis:
On the Hardness of Approximating Minimization Problems.
960-981
Electronic Edition BibTeX
- James A. Storer, John H. Reif:
Shortest Paths in the Plane with Polygonal Obstacles.
982-1012
Electronic Edition (ACM DL) BibTeX
- John H. Reif, James A. Storer:
A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions.
1013-1019
Electronic Edition (ACM DL) BibTeX
- James Aspnes, Maurice Herlihy, Nir Shavit:
Counting Networks.
1020-1048
Electronic Edition (ACM DL) BibTeX
Volume 41,
Number 6,
November 1994
- Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju:
Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations.
1049-1088
Electronic Edition (ACM DL) BibTeX
- Tal Rabin:
Robust Sharing of Secrets When the Dealer is Honest or Cheating.
1089-1109
Electronic Edition (ACM DL) BibTeX
- Keith W. Ross, Danny H. K. Tsang, Jie Wang:
Monte Carlo Summation and Integration Applied to Multiclass Queuing Networks.
1110-1135
Electronic Edition (ACM DL) BibTeX
- Richard M. Karp:
Probabilistic Recurrence Relations.
1136-1150
Electronic Edition (ACM DL) BibTeX
- Jeffrey F. Naughton, Raghu Ramakrishnan:
How to Forget the Past Without Repeating It.
1151-1177
Electronic Edition BibTeX
- Colin Bell, Anil Nerode, Raymond T. Ng, V. S. Subrahmanian:
Mixed Integer Programming Methods for Computing Nonmonotonic Deductive Databases.
1178-1215
Electronic Edition BibTeX
- Kenneth A. Ross:
Modular Stratification and Magic Sets for Datalog Programs with Negation.
1216-1266
Electronic Edition BibTeX
- Yehuda Afek, Hagit Attiya, Alan Fekete, Michael J. Fischer, Nancy A. Lynch, Yishay Mansour, Da-Wei Wang, Lenore D. Zuck:
Reliable Communication Over Unreliable Channels.
1267-1297
Electronic Edition (ACM DL) BibTeX
- Michael J. Kearns, Ming Li, Leslie G. Valiant:
Learning Boolean Formulas.
1298-1328
Electronic Edition (ACM DL) BibTeX
- Rajeev Motwani:
Average-Case Analysis of Algorithms for Matchings and Related Problems.
1329-1356
Electronic Edition (ACM DL) BibTeX
Copyright © Sun May 17 00:05:52 2009
by Michael Ley (ley@uni-trier.de)
