Volume 35,
Number 1,
January 1988
Volume 35,
Number 2,
April 1988
- Avikam Baltsan, Micha Sharir:
On the shortest paths between two convex polyhedra.
267-287
Electronic Edition (ACM DL) BibTeX
- Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer:
Consensus in the presence of partial synchrony.
288-323
Electronic Edition (ACM DL) BibTeX
- Robert McNaughton, Paliath Narendran, Friedrich Otto:
Church-Rosser Thue systems and formal languages.
324-344
Electronic Edition (ACM DL) BibTeX
- Jeffrey D. Ullman, Allen Van Gelder:
Efficient tests for top-down termination of logical rules.
345-373
Electronic Edition BibTeX
- Zvi Galil, Éva Tardos:
An O(n²(m + n log n)log n) min-cost flow algorithm.
374-386
Electronic Edition (ACM DL) BibTeX
- Galen H. Sasaki, Bruce Hajek:
The time complexity of maximum matching by simulated annealing.
387-403
Electronic Edition (ACM DL) BibTeX
- Ravi S. Sandhu:
The schematic protection model: its definition and analysis for acyclic attenuating schemes.
404-432
Electronic Edition BibTeX
- A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto:
Optimal directory placement on disk storage devices.
433-446
Electronic Edition BibTeX
- Helmut Alt:
Comparing the combinational complexities of arithmetic functions.
447-460
Electronic Edition (ACM DL) BibTeX
- Ingo Wegener:
On the complexity of branching programs and decision trees for clique functions.
461-471
Electronic Edition (ACM DL) BibTeX
Volume 35,
Number 3,
July 1988
- Natarajan Shankar:
A mechanical proof of the Church-Rosser theorem.
475-522
Electronic Edition (ACM DL) BibTeX
- Merrick L. Furst, Jonathan L. Gross, Lyle A. McGeoch:
Finding a maximum-genus graph imbedding.
523-534
Electronic Edition (ACM DL) BibTeX
- Wen-Lian Hsu:
The coloring and maximum independent set problems on planar perfect graphs.
535-563
Electronic Edition (ACM DL) BibTeX
- Wansoo T. Rhee, Michel Talagrand:
Some distributions that allow perfect packing.
564-578
Electronic Edition (ACM DL) BibTeX
- Jonathan Goodman, Albert G. Greenberg, Neal Madras, Peter March:
Stability of binary exponential backoff.
579-602
Electronic Edition (ACM DL) BibTeX
- Lenwood S. Heath, Arnold L. Rosenberg, Bruce T. Smith:
The physical mapping problem for parallel architectures.
603-634
Electronic Edition (ACM DL) BibTeX
- S. Rao Kosaraju, Mikhail J. Atallah:
Optimal simulations between mesh-connected arrays of processors.
635-650
Electronic Edition (ACM DL) BibTeX
- Faith E. Fich, Martin Tompa:
The parallel complexity of exponentiating polynomials over finite fields.
651-667
Electronic Edition (ACM DL) BibTeX
- Hans Daduna:
Busy periods for subnetworks in stochastic networks: mean value analysis.
668-674
Electronic Edition (ACM DL) BibTeX
- Jan Robin Rohlicek, Alan S. Willsky:
The reduction of perturbed Markov generators: an algorithm exposing the role of transient states.
675-696
Electronic Edition (ACM DL) BibTeX
- Jik H. Chang, Oscar H. Ibarra, Anastasios Vergis:
On the power of one-way communication.
697-726
Electronic Edition (ACM DL) BibTeX
- Michael R. Fellows, Michael A. Langston:
Nonconstructive tools for proving polynomial-time decidability.
727-739
Electronic Edition BibTeX
- Friedhelm Meyer auf der Heide:
Fast algorithms for N-dimensional restrictions of hard problems.
740-747
Electronic Edition (ACM DL) BibTeX
- Arnold Schönhage:
A nonlinear lower bound for random-access machines under logarithmic cost.
748-754
Electronic Edition (ACM DL) BibTeX
Volume 35,
Number 4,
October 1988
- Vasek Chvátal, Endre Szemerédi:
Many Hard Examples for Resolution.
759-768
Electronic Edition (ACM DL) BibTeX
- Michael D. Grigoriadis, B. Kalantari:
A new class of heuristic algorithms for weighted perfect matching.
769-776
Electronic Edition (ACM DL) BibTeX
- Richard Cole, Alan Siegel:
Optimal VLSI circuits for sorting.
777-809
Electronic Edition (ACM DL) BibTeX
- Teofilo F. Gonzalez, Sing-Ling Lee:
A linear time algorithm for optimal routing around a rectangle.
810-831
Electronic Edition (ACM DL) BibTeX
- Shivendra S. Panwar, Donald F. Towsley, Jack K. Wolf:
Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service.
832-844
Electronic Edition (ACM DL) BibTeX
- Hagit Attiya, Marc Snir, Manfred K. Warmuth:
Computing on an anonymous ring.
845-875
Electronic Edition BibTeX
- Anna R. Karlin, Eli Upfal:
Parallel hashing: an efficient implementation of shared memory.
876-892
Electronic Edition (ACM DL) BibTeX
- Lyle Ramshaw:
Eliminating go to's while preserving program structure.
893-920
Electronic Edition (ACM DL) BibTeX
- Andrew V. Goldberg, Robert Endre Tarjan:
A new approach to the maximum-flow problem.
921-940
Electronic Edition BibTeX
- David A. Mix Barrington, Denis Thérien:
Finite monoids and the fine structure of NC1.
941-952
Electronic Edition (ACM DL) BibTeX
- Daniel Leivant, Tim Fernando:
Meager and replete failures of relative completeness.
953-964
Electronic Edition (ACM DL) BibTeX
- Leonard Pitt, Leslie G. Valiant:
Computational limitations on learning from examples.
965-984
Electronic Edition (ACM DL) BibTeX
- Joel I. Seiferas, Paul M. B. Vitányi:
Counting is easy.
985-1000
Electronic Edition (ACM DL) BibTeX
- Bruce Jay Collings, G. Barry Hembree:
Addendum to ``Initializing Generalized Feedback Shift Register Pseudorandom Number Generators''.
1001 BibTeX
Copyright © Thu Aug 7 21:05:00 2008
by Michael Ley (ley@uni-trier.de)
