Journal of the ACM Bibliography
Friedhelm Meyer auf der
Heide. Lower bounds for solving linear Diophantine equations on
random access machines. Journal of the ACM, 32(4):929-937,
October 1985.
[BibTeX entry]
Selected papers that cite this one
- Nader H. Bshouty. On the
complexity of functions for random access machines. Journal of
the ACM, 40(2):211-223, April 1993.
- Felipe Cucker and Michael Shub. Generalized Knapsack
problems and fixed degree separation. Theoretical Computer
Science, 161(1-2):301-306, 15 July 1996. Note.
- Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, and
Roman Smolensky. A lower bound for
randomized algebraic decision trees. In Proceedings of the
Twenty-Eighth Annual ACM Symposium on the Theory of Computing,
pages 612-619, Philadelphia, Pennsylvania, 22-24 May 1996.
- Friedhelm Meyer auf der Heide. Lower time bounds for solving linear
diophantine equations on several parallel computational models.
Information and Control, 67(1-3):195-211,
October/November/December 1985.
- M. Leoncini. On the parallel
complexity of Gaussian elimination with pivoting. Journal of
Computer and System Sciences, 53(3):380-394, December 1996.
Shortcuts: