Selected papers that cite this one
- Z. Galil and R. Giancarlo. Data structures and algorithms for approximate string matching. Journal of Complexity, 4(1):33-72, March 1988.
- 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.
- F. Meyer auf der Heide, M. Storch, and R. Wanka. Optimal tradeoffs between size and slowdown for universal parallel networks. Theory of Computing Systems, 30(6):627-644, November/December 1997.