Author:
Loui Michael C.,Luginbuhl David R.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference25 articles.
1. A. Aggarwal, B. Alpern, A. K. Chandra, and M. Snir (1987), A model for hierarchical memory,Proc. 19th Ann. ACM Symp. on Theory of Computing, pp. 305?314.
2. B. Alpern, L. Carter, and E. Feig (1990), Uniform memory hierarchies,Proc. 31st Ann. Symp. on Foundations of Computer Science, pp. 600?608.
3. S. A. Cook and R. A. Reckhow (1973), Time bounded random access machines,J. Comput. System Sci., vol. 7, pp. 354?375.
4. Z. Galil (1976), Two fast simulations which imply some fast string matching and palindrome-recognition algorithms,Inform. Process. Lett., vol. 4, no. 4, pp. 85?87.
5. D. Y. Grigor'ev (1979), Time complexity of multidimensional Turing machines,Zap. naucn. sem., vol. 88, pp. 47?55.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献