Journal of the ACM Bibliography

Selected papers that cite this one

• Amihood Amir and Gary Benson. Two-dimensional periodicity in rectangular arrays. SIAM Journal on Computing, 27(1):90-106, February 1998.

• Richard J. Anderson, Ernst W. Mayr, and Manfred K. Warmuth. Parallel approximation algorithms for bin packing. Information and Computation, 82(3):262-277, September 1989.

• Mikhail J. Atallah, Richard Cole, and Michael T. Goodrich. Cascading divide-and-conquer: A technique for designing parallel algorithms. SIAM Journal on Computing, 18(3):499-532, June 1989.

• Mikhail J. Atallah, Danny Z. Chen, and Hubert Wagener. An optimal parallel algorithm for the visibility of a simple polygon from a point. Journal of the ACM, 38(3):516-533, July 1991.

• E. Bampis, M. El Haddad, Y. Manoussakis, and M. Santha. A parallel reduction of Hamiltonian cycle to Hamiltonian path in tournaments. Journal of Algorithms, 19(3):432-440, November 1995.

• J. Bang-Jensen, M. El Haddad, Y. Manoussakis, and T. M. Przytycka. Parallel algorithms for the Hamiltonian cyle and Hamiltonian path problems in semicomplete bipartite digraphs. Algorithmica, 17(1):67-87, January 1997.

• Armin Bäumker, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science, 203(2):175-203, 28 August 1998.

• Omer Berkman, Costas S. Iliopoulos, and Kunsoo Park. The subtree max gap problem with application to parallel string covering. Information and Computation, 123(1):127-137, 15 November 1995.

• A. Borodin, S. Cook, and N. Pippenger. Parallel computation for well-endowed rings and space-bounded probabilistic machines. Information and Control, 58(1-3):113-136, July/August/September 1983.

• Nader H. Bshouty and Richard Cleve. Interpolating arithmetic read-once formulas in parallel. SIAM Journal on Computing, 27(2):401-413, March 1998.

• Danny Z. Chen. Optimally computing the shortest weakly visible subedge of a simple polygon. Journal of Algorithms, 20(3):459-478, May 1996.

• Lin Chen. Optimal circular arc representations: Properties, recognition, and construction. Journal of Computer and System Sciences, 56(3):320-331, April 1998.

• Andrew Chin and W. F. McColl. Virtual shared memory: Algorithms and complexity. Information and Computation, 113(2):199-219, September 1994.

• Gwen Clarke and David T. Barnard. An LR substring parser applied in a parallel environment. Journal of Parallel and Distributed Computing, 35(1):2-17, 25 May 1996.

• B. Codenotti and M. Leoncini. Matrix inversion in RNC. Journal of Complexity, 7(3):282-295, September 1991.

• Anne Condon, Richard Ladner, Jordan Lampe, and Rakesh Sinha. Complexity of sub-bus mesh computations. SIAM Journal on Computing, 25(3):520-539, June 1996.

• Peter Damaschke. An optimal parallel algorithm for digital curve segmentation. Theoretical Computer Science, 178(1-2):225-236, 30 May 1997.

• Martin Dietzfelbinger, Miros{\l}aw Kuty{\l}owski, and Rüdiger Reischuk. Feasible time-optimal algorithms for Boolean functions on exclusive-write parallel random-access machines. SIAM Journal on Computing, 25(6):1196-1230, December 1996.

• Ömer E\v{g}ecio\v{g}lu, E. Gallopoulos, and Çetin K. Koç Fast computation of divided differences and parallel Hermite interpolation. Journal of Complexity, 5(4):417-437, December 1989.

• David Eppstein. Parallel recognition of series-parallel graphs. Information and Computation, 98(1):41-55, May 1992.

• Z. Galil and R. Giancarlo. Data structures and algorithms for approximate string matching. Journal of Complexity, 4(1):33-72, March 1988.

• Raffaele Giancarlo and Roberto Grossi. Multi-dimensional pattern matching with dimensional wildcards: Data structures and optimal on-line search algorithms. Journal of Algorithms, 24(2):223-265, August 1997.

• Jeremy Gibbons. Computing downwards accumulations on trees quickly. Theoretical Computer Science, 169(1):67-80, 30 November 1996.

• Jeremy Gibbons, Wentong Cai, and David B. Skillicorn. Efficient parallel algorithms for tree accumulations. Science of Computer Programming, 23(1):1-18, October 1994.

• Phillip B. Gibbons, Yossi Matias, and Vijaya Ramachandran. Efficient low-contention parallel algorithms. Journal of Computer and System Sciences, 53(3):417-442, December 1996.

• Joseph Gil and Yossi Matias. An effective load balancing policy for geometric-decaying algorithms. Journal of Parallel and Distributed Computing, 36(2):185-188, 1 August 1996.

• Michael T. Goodrich. Planar separators and parallel polygon triangulation. Journal of Computer and System Sciences, 51(3):374-389, December 1995.

• Sergei Gorlatch. Extracting and implementing list homomorphisms in parallel program development. Science of Computer Programming, 33(1):1-27, January 1999.

• Shay Halperin and Uri Zwick. An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM. Journal of Computer and System Sciences, 53(3):395-416, December 1996.

• Tsan-sheng Hsu and Vijaya Ramachandran. Efficient massively parallel implementation of some combinatorial algorithms. Theoretical Computer Science, 162(2):297-322, 20 August 1996.

• K. Iwama, C. Iwamoto, and T. Ohsawa. A fast parallel algorithm for k-connectivity. Information Processing Letters, 61(5):265-269, 14 March 1997.

• Andreas Jakoby, Rüdiger Reischuk, and Christian Shindelhauer. Circuit complexity: from the worst case to the average case. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 58-67, Montréal, Québec, Canada, 23-25 May 1994.

• Ming-Yang Kao. Planar strong connectivity helps in parallel depth-first search. SIAM Journal on Computing, 24(1):46-62, February 1995.

• Zvi M. Kedem, Gad M. Landau, and Krishna V. Palem. Parallel suffix-prefix-matching algorithm and applications. SIAM Journal on Computing, 25(5):998-1023, October 1996.

• Gloria Kissin. Upper and lower bounds on switching energy in VLSI. Journal of the ACM, 38(1):222-254, January 1991.

• Philip N. Klein. Efficient parallel algorithms for chordal graphs. SIAM Journal on Computing, 25(4):797-827, August 1996.

• Jacob Kornerup. Mapping a functional notation for parallel programs onto hypercubes. Information Processing Letters, 53(3):153-158, 10 February 1995.

• Sanguthevar Rajasekaran and John H. Reif. Optimal and sublogarithmic time randomized parallel sorting algorithms. SIAM Journal on Computing, 18(3):594-607, June 1989.

• Prakash Ramanan. An efficient parallel algorithm for the matrix-chain-product problem. SIAM Journal on Computing, 25(4):874-893, August 1996.

• John H. Reif and Stephen R. Tate. On dynamic algorithms for algebraic problems. Journal of Algorithms, 22(2):347-371, February 1997.

• Shang-Hua Teng. Functional inversion and communication complexity. Journal of Cryptology, 7(3):153-170, Summer 1994.

• Jerry L. Trahan, Vijaya Ramachandran, and Michael C. Loui. Parallel random access machines with both multiplication and shifts. Information and Computation, 110(1):96-118, April 1994.

Shortcuts: