Juris Hartmanis
- Blum, M. A machine independent theory of the complexity of recursive functions. J. ACM 14 (1967), 322--336. Google Scholar
Digital Library
- Brooks, F. P. Jr. The Mythical Man-Month: Essays on Software Engineering. Addison-Wesley, Reading, Mass., 1975. Google ScholarDigital Library
- Hartmanis, J. and Lin, H., Eds. Computing the Future: A Broader Agenda for Computer Science and Engineering. National Academy Press, Washington, D.C., 1992.Google Scholar
- Hartmanis, J. Some observations about the nature of computer science. In Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, Vol. 761. Springer-Verlag, 1993, 1--12. Google ScholarDigital Library
- Hartmanis, J. and Stearns, R. E. On the computational complexity of algorithms. Trans. Amer. Math. Soc., 177 (1965), 285--306.Google ScholarCross Ref
- Li, M. and Vitanyi, P.M.B. An Introduction to Kohnogorov Complexity and Its Applications. Springer-Verlag, Heidelberg, Germany, 1993. Google ScholarDigital Library
- Lewis, P. M., Stearns, R. E., and Hartmanis, J. Memory bounds for the recognition for context-free and context-sensitive languages. In Proceedings of IEEE Sixth Annual Symposium on Switching Circuit Theory and Logical Design. (1965), pp. 191--202.Google ScholarDigital Library
- McCullach, W. S. A historical introduction to the postulational foundations of experimental epistemology. In Cross-Cultural Understanding: Epistemology in Anthropology. F.C.S. Northrop, and H. H. Livingston, Eds., Harper and Row, New York, 1964.Google Scholar
- McCarthy, J. Mathematical logic and artificial intelligence. In The Artifical Intelligence Debate. S. R. Graubard, Ed., MIT Press, Cambridge, Mass., 1988. Google ScholarDigital Library
- Savitch, W. J. Relationship between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci., 4 (1970), 177--192.Google ScholarDigital Library
- Shamir, A. IP = PSPACE. J. ACM 39 (1992), 869--877. Google ScholarDigital Library
- Shannon, C. The mathematical theory communication. Bell System Tech. J. 27 (1948), 379--656.Google ScholarCross Ref
- Stearns, R. E., Hartmanis, J., and Lewis, P. M. Hierarchies of memory limited computations. In Proceedings of IEEE Sixth Annual Symposium on Switching Circuit Theory and Logical Design. (1965), pp. 179--190.Google ScholarDigital Library
- Turing, A. M. On computable numbers with an application to the Entscheidungaproblem. In Proceedings of the London Mathematical Society, series 2, 42 (1936), 230--265.Google Scholar
- Yamada, H. Real-time computation and recursive functions not real-time computable, IEEE Trans. Elec. Comput. 11, 6 (1962), 753--760.Google Scholar
- Younger, D. H. Recognition and parsing of context-free languages in time n :~. Information and Control 10, 2 (1967), 189--208.Google ScholarCross Ref
Recommendations
The Turing-850 Project: Developing a Personal Computer in the Early 1980s in Mexico
In response to the increasing popularity in the late 1970s of affordable, general-purpose, microprocessor-based personal computers in the US, several countries attempted to create indigenous personal computer industries. The Turing-850, a general-...
Alternatives to lecture: experience peer instruction and pedagogical code reviews
SIGCSE '14: Proceedings of the 45th ACM technical symposium on Computer science educationThis session will demonstrate best practices for introducing peer instruction and pedagogical code reviews into the computer science classroom. Presenters play the role of instructors on the first day of class. Audience members play the role of students ...
Turing machines with two-level memory: New computational models for analyzing the input/output complexity
AbstractThe input/output complexity, which is the complexity of data exchange between the main memory and the external memory, has been elaborately studied by a lot of former researchers. However, the existing works failed to consider the input/output ...
Comments