Edit Profile (opens in new tab) Hartmanis, Juris Compute Distance To: Compute Author ID: hartmanis.juris Published as: Hartmanis, J.; Hartmanis, Juris External Links: MGP · Wikidata · dblp · GND · IdRef Awards: Turing Award (1993) Documents Indexed: 112 Publications since 1956, including 3 Books 2 Contributions as Editor · 1 Further Contribution Biographic References: 1 Publication Co-Authors: 29 Co-Authors with 54 Joint Publications 894 Co-Co-Authors all top 5 Co-Authors 55 single-authored 12 Stearns, Richard Edwin 8 Hemaspaandra, Lane A. 6 Chang, Richard 6 Ranjan, Desh 4 Hopcroft, John Edward H. 4 Rohatgi, Pankaj 3 Baker, Theodore P. 3 Cai, Jin-Yi 3 Lewis, Philip M. II 3 Sewelson, Vivian 3 Shank, Herbert S. 3 Yesha, Yaacov 2 Gundermann, Thomas 2 Hunt, Harry Bowen III 2 Immerman, Neil 2 Lewis, Forbes D. 2 Mahaney, Stephen R. 2 Simon, Janos 2 Wagner, Klaus W. 2 Wechsung, Gerd 1 Baum, Richard I. 1 Calude, Cristian S. 1 Chari, Suresh 1 Cheatham, Thomas E. jun. 1 Chor, Benny 1 Constable, Robert Lee 1 Davis, Wayne A. 1 Goldreich, Oded 1 Graham, Susan L. 1 Harrison, Michael A. 1 Håstad, Johan Torkel 1 Hsiao, David K. 1 Kadin, Jim 1 Li, Ming 1 Poppelbaum, W. J. 1 Rubinoff, Morris 1 Townley, Judy A. 1 Yovits, Marshall C. all top 5 Serials 11 Theoretical Computer Science 10 Bulletin of the European Association for Theoretical Computer Science (EATCS) 8 Information and Control 8 Journal of Computer and System Sciences 6 SIAM Journal on Computing 5 Journal of the Association for Computing Machinery 5 Mathematical Systems Theory 4 Kiberneticheskiĭ Sbornik. Novaya Seriya 4 IEEE Transactions on Electronic Computers 3 Information Processing Letters 2 Canadian Journal of Mathematics 2 Proceedings of the American Mathematical Society 1 Acta Informatica 1 American Mathematical Monthly 1 Annals of the History of Computing 1 Transactions of the American Mathematical Society 1 Mitteilungen der Mathematischen Gesellschaft in Hamburg 1 Journal of the ACM 1 Bulletin of the European Association for Theoretical Computer Science EATCS 1 CBMS-NSF Regional Conference Series in Applied Mathematics 1 Proceedings of Symposia in Applied Mathematics 1 Revue Française d’Automatique, Informatique, Recherche Opérationnelle. Série Rouge all top 5 Fields 83 Computer science (68-XX) 35 Mathematical logic and foundations (03-XX) 4 General and overarching topics; collections (00-XX) 2 History and biography (01-XX) 1 Group theory and generalizations (20-XX) 1 Information and communication theory, circuits (94-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 92 Publications have been cited 1,356 times in 1,009 Documents Cited by ▼ Year ▼ On the computational complexity of algorithms. Zbl 0131.15404Hartmanis, J.; Stearns, R. E. 169 1965 On isomorphisms and density of NP and other complete sets. Zbl 0356.68059Berman, L.; Hartmanis, J. 150 1977 Algebraic structure theory of sequential machines. Zbl 0154.41701Hartmanis, J.; Stearns, R. E. 96 1966 Hierarchies of memory limited computations. Zbl 0229.02033Stearns, R. E.; Hartmanis, J.; Lewis, P. M. II 72 1970 The Boolean hierarchy. I: Structural properties. Zbl 0676.68011Cai, Jin-yi; Gundermann, Thomas; Hartmanis, Juris; Hemachandra, Lane A.; Sewelson, Vivian; Wagner, Klaus; Wechsung, Gerd 57 1988 On non-determinacy in simple computing devices. Zbl 0229.68014Hartmanis, J. 44 1972 Sparse sets in NP-P: EXPTIME versus NEXPTIME. Zbl 0586.68042Hartmanis, J.; Immerman, N.; Sewelson, V. 43 1985 Complexity classes without machines: on complete languages for UP. Zbl 0655.68044Hartmanis, Juris; Hemachandra, Lane A. 39 1988 Memory bounds for recognition of context-free and context-sensitive languages. Zbl 0272.68054Lewis, P. M. II; Stearns, R. E.; Hartmanis, J. 38 1970 Context-free languages and Turing machine computations. Zbl 0189.29101Hartmanis, J. 37 1967 On overview of the theory of computational complexity. Zbl 0226.68024Hartmanis, J.; Hopcroft, J. E. 37 1971 The Boolean hierarchy. II: Applications. Zbl 0676.68012Cai, Jin-Yi; Gundermann, Thomas; Hartmanis, Juris; Hemachandra, Lane A.; Sewelson, Vivian; Wagner, Klaus; Wechsung, Gerd 32 1989 Computation times of NP sets of different densities. Zbl 0985.68515Hartmanis, J.; Yesha, Y. 31 1984 On sparse sets in NP-P. Zbl 0501.68014Hartmanis, Juris 22 1983 Computational complexity of one-tape Turing machine computations. Zbl 0162.31703Hartmanis, J. 22 1968 On the recognition of primes by automata. Zbl 0164.05201Hartmanis, J.; Shank, H. 22 1968 One-way functions and the nonisomorphism of NP-complete sets. Zbl 0718.03031Hartmanis, Juris; Hemachandra, Lane A. 20 1991 On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line. Zbl 0824.68054Cai, Jin-Yi; Hartmanis, Juris 19 1994 Space bounded computations: Review and new separation results. Zbl 0745.68051Ranjan, Desh; Chang, Richard; Hartmanis, Juris 19 1991 What makes some language theory problems undecidable. Zbl 0198.03001Hartmanis, J.; Hopcroft, J. E. 18 1970 On the succinctness of different representations of languages. Zbl 0453.68054Hartmanis, J. 17 1980 Regularity preserving modifications of regular expressions. Zbl 0112.11307Stearns, R. E.; Hartmanis, J. 17 1963 On Goedel speed-up and succinctness of language representations. Zbl 0526.68034Hartmanis, J. 16 1983 Languages simultaneously complete for one-way and two-way log-tape automata. Zbl 0471.68059Hartmanis, J.; Mahaney, S. 15 1981 On the lattice of topologies. Zbl 0087.37403Hartmanis, Juris 15 1958 Feasible computations and provable complexity properties. Zbl 0383.68043Hartmanis, Juris 15 1978 On log-tape isomorphisms of complete sets. Zbl 0387.68035Hartmanis, J. 15 1978 Tape-reversal bounded Turing machine computations. Zbl 0259.68020Hartmanis, J. 14 1968 The random oracle hypothesis is false. Zbl 0813.68100Chang, Richard; Chor, Benny; Goldreich, Oded; Hartmanis, Juris; Håstad, Johan; Ranjan, Desh; Rohatgi, Pankaj 12 1994 On tape bounds for single letter alphabet language processing. Zbl 0351.68014Hartmanis, J.; Berman, L. 11 1977 Lattice theory of generalized partitions. Zbl 0089.37002Hartmanis, Juris 10 1959 Computational complexity of random access stored program machines. Zbl 0222.68020Hartmanis, J. 10 1971 On the weight of computations. Zbl 0825.68389Hartmanis, Juris 8 1995 The LBA problem and its importance in the theory of computing. Zbl 0352.68100Hartmanis, J.; Hunt, H. B. 8 1973 Robust machines accept easy sets. Zbl 0701.68028Hartmanis, Juris; Hemachandra, Lane A. 8 1990 Sets of numbers defined by finite automata. Zbl 0149.01002Hartmanis, J.; Stearns, R. E. 8 1967 Classifications of computations by time and memory requirements. Zbl 0203.16401Hartmanis, J.; Lewis, P. M. II; Stearns, R. E. 8 1965 On sparse oracles separating feasible complexity classes. Zbl 0658.68055Hartmanis, Juris; Hemachandra, Lane 6 1988 The LBA problem and its importance in the theory of computing. Zbl 0301.68056Hartmanis, J.; Hunt, H. B. III 6 1974 On polynomial time isomorphisms of complete sets. Zbl 0359.68051Berman, L.; Hartmanis, J. 6 1977 On isomorphisms and density of NP and other complete sets. Zbl 0365.68045Hartmanis, J.; Berman, L. 6 1976 Loop-free structure of sequential machines. Zbl 0099.34503Hartmanis, J. 6 1962 New developments in structural complexity theory. Zbl 0699.68065Hartmanis, J. 6 1990 Two embedding theorems for finite lattices. Zbl 0074.36002Hartmanis, Juris 5 1956 Independence results about context-free languages and lower bounds. Zbl 0586.68029Hartmanis, Juris 5 1985 On simple Goedel numerings and translations. Zbl 0272.68046Hartmanis, J.; Baker, T. P. 5 1975 On the structure of feasible computations. Zbl 0341.68031Hartmanis, J.; Simon, J. 5 1975 Symbolic analysis of a decomposition of information processing machines. Zbl 0209.31101Hartmanis, J. 5 1960 The structural complexity column - Some observations about relativization of space bounded computations. Zbl 0667.68062Hartmanis, Juris; Chang, R.; Kadin, J.; Mitchell, S. 5 1988 A note on natural complete sets and Goedel numberings. Zbl 0483.03026Hartmanis, J. 4 1982 Complexity of formal translations and speed-up results. Zbl 0257.68036Constable, R. L.; Hartmanis, J. 4 1971 Relativization: A revisionistic retrospective. Zbl 0746.68033Hartmanis, Juris; Chang, R.; Chari, S.; Ranjan, D.; Rohatgi, P. 4 1992 Two memory bounds for the recognition of primes by automata. Zbl 0179.02403Hartmanis, J.; Shank, H. 4 1969 Pair algebra and its application to automata theory. Zbl 0197.43604Hartmanis, J.; Stearns, R. E. 4 1964 The use of lists in the study of undecidable problems in automata theory. Zbl 0234.02024Hartmanis, J.; Lewis, F. D. 4 1971 On sparse oracles separating feasible complexity classes. Zbl 0605.68034Hartmanis, Juris; Hemachandra, Lane 4 1986 Complexity classes without machines: on complete languages for UP. Zbl 0655.68043Hartmanis, Juris; Hemachandra, Lane 3 1986 On simple Goedel numberings and translations. Zbl 0283.68055Hartmanis, J.; Baker, T. P. 3 1974 Computational complexity of formal translations. Zbl 0302.68066Hartmanis, J. 3 1975 On the succinctness of different representations of languages. Zbl 0412.68076Hartmanis, J. 3 1979 Group theoretic characterization of linear permutation automata. Zbl 0256.94051Hartmanis, J.; Walter, H. 3 1973 Some dangers in state reduction of sequential machines. Zbl 0105.32301Hartmanis, J.; Stearns, R. E. 3 1962 Generalized partitions and lattice embedding theorems. Zbl 0113.35901Hartmanis, J. 3 1961 On the computational complexity of algorithms. Zbl 0156.25604Hartmanis, J.; Stearns, R. E. 3 1967 Homomorphic images of linear sequential machines. Zbl 0174.03404Hartmanis, Juris; Davis, Wayne A. 3 1967 New developments in structural complexity theory. Zbl 0649.68047Hartmanis, J. 3 1988 An essay about research on sparse NP complete sets. Zbl 0444.68032Hartmanis, J.; Mahaney, S. R. 2 1980 Size arguments in the study of computation speeds. Zbl 0265.68029Hartmanis, J. 2 1971 An overview of the theory of computational complexity. Zbl 0289.68011Hartmanis, J.; Hopcroft, J. E. 2 1974 The application of some basic inequalities for entropy. Zbl 0096.11001Hartmanis, Juris 2 1959 Space bounded computations: Review and new separation results. Zbl 0755.68053Hartmanis, J.; Ranjan, Desh 2 1989 A study of feedback and errors in sequential machines. Zbl 0117.11505Hartmanis, J.; Stearns, R. E. 2 1963 Pair algebra and its application to automata theory. Zbl 0128.12001Hartmanis, J.; Stearns, R. E. 2 1964 Loop-free structure of sequential machines. Zbl 0163.14304Hartmanis, J. 2 1962 On the complexity of undecidable problems in automata theory. Zbl 0182.02403Hartmanis, J. 2 1969 What makes some language theory problems undecidable. Zbl 0231.68031Hartmanis, J.; Hopcroft, J. E. 2 1971 Relations between diagonalization, proof systems, and complexity gaps. Zbl 0398.68013Hartmanis, Juris 2 1979 On effective speed-up and long proofs of trivial theorems in formal theories. Zbl 0399.03042Hartmanis, J. 2 1976 The structural complexity column - The collapsing hierarchies. Zbl 0661.68047Hartmanis, Juris 2 1987 The structural complexity column: On the importance of being \(\Pi_2\)-hard. Zbl 1023.68585Hartmanis, Juris 1 1989 Selected papers presented at the 18th annual ACM symposium on theory of computing, STOC ’86, held May 28–30, 1986 in Berkeley, California. Zbl 0656.00030 1 1989 Advances in computers. Vol. 14. Zbl 0357.68002 1 1976 On the computing paradigm and computational complexity. Zbl 1193.68116Hartmanis, Juris 1 1995 Overview of computational complexity theory. Zbl 0675.68031Hartmanis, Juris 1 1989 Observations about the development of theoretical computer science. Zbl 0998.01539Hartmanis, Juris 1 1981 Two tests for the linearity of sequential machines. Zbl 0143.02001Hartmanis, Juris 1 1965 On memory requirements for context-free language recognition. Zbl 0155.01801Hartmanis, J. 1 1967 Two memory bounds for the recognition of primes by automata. Zbl 0175.00804Hartmanis, J.; Shank, H. 1 1969 Computational complexity of one-tape Turing machine computations. Zbl 0223.02037Hartmanis, J. 1 1970 Some observations about NP complete sets. Zbl 0642.68071Hartmanis, Juris 1 1987 Containment, separation, complete sets, and immunity of complexity classes. Zbl 0654.68051Hartmanis, Juris; Li, Ming; Yesha, Yaacov 1 1986 Structural complexity column - Sparse complete sets of NP and the optimal collapse of the polynomial hierarchy. Zbl 0661.68046Hartmanis, J. 1 1987 On the weight of computations. Zbl 0825.68389Hartmanis, Juris 8 1995 On the computing paradigm and computational complexity. Zbl 1193.68116Hartmanis, Juris 1 1995 On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line. Zbl 0824.68054Cai, Jin-Yi; Hartmanis, Juris 19 1994 The random oracle hypothesis is false. Zbl 0813.68100Chang, Richard; Chor, Benny; Goldreich, Oded; Hartmanis, Juris; Håstad, Johan; Ranjan, Desh; Rohatgi, Pankaj 12 1994 Relativization: A revisionistic retrospective. Zbl 0746.68033Hartmanis, Juris; Chang, R.; Chari, S.; Ranjan, D.; Rohatgi, P. 4 1992 One-way functions and the nonisomorphism of NP-complete sets. Zbl 0718.03031Hartmanis, Juris; Hemachandra, Lane A. 20 1991 Space bounded computations: Review and new separation results. Zbl 0745.68051Ranjan, Desh; Chang, Richard; Hartmanis, Juris 19 1991 Robust machines accept easy sets. Zbl 0701.68028Hartmanis, Juris; Hemachandra, Lane A. 8 1990 New developments in structural complexity theory. Zbl 0699.68065Hartmanis, J. 6 1990 The Boolean hierarchy. II: Applications. Zbl 0676.68012Cai, Jin-Yi; Gundermann, Thomas; Hartmanis, Juris; Hemachandra, Lane A.; Sewelson, Vivian; Wagner, Klaus; Wechsung, Gerd 32 1989 Space bounded computations: Review and new separation results. Zbl 0755.68053Hartmanis, J.; Ranjan, Desh 2 1989 The structural complexity column: On the importance of being \(\Pi_2\)-hard. Zbl 1023.68585Hartmanis, Juris 1 1989 Selected papers presented at the 18th annual ACM symposium on theory of computing, STOC ’86, held May 28–30, 1986 in Berkeley, California. Zbl 0656.00030 1 1989 Overview of computational complexity theory. Zbl 0675.68031Hartmanis, Juris 1 1989 The Boolean hierarchy. I: Structural properties. Zbl 0676.68011Cai, Jin-yi; Gundermann, Thomas; Hartmanis, Juris; Hemachandra, Lane A.; Sewelson, Vivian; Wagner, Klaus; Wechsung, Gerd 57 1988 Complexity classes without machines: on complete languages for UP. Zbl 0655.68044Hartmanis, Juris; Hemachandra, Lane A. 39 1988 On sparse oracles separating feasible complexity classes. Zbl 0658.68055Hartmanis, Juris; Hemachandra, Lane 6 1988 The structural complexity column - Some observations about relativization of space bounded computations. Zbl 0667.68062Hartmanis, Juris; Chang, R.; Kadin, J.; Mitchell, S. 5 1988 New developments in structural complexity theory. Zbl 0649.68047Hartmanis, J. 3 1988 The structural complexity column - The collapsing hierarchies. Zbl 0661.68047Hartmanis, Juris 2 1987 Some observations about NP complete sets. Zbl 0642.68071Hartmanis, Juris 1 1987 Structural complexity column - Sparse complete sets of NP and the optimal collapse of the polynomial hierarchy. Zbl 0661.68046Hartmanis, J. 1 1987 On sparse oracles separating feasible complexity classes. Zbl 0605.68034Hartmanis, Juris; Hemachandra, Lane 4 1986 Complexity classes without machines: on complete languages for UP. Zbl 0655.68043Hartmanis, Juris; Hemachandra, Lane 3 1986 Containment, separation, complete sets, and immunity of complexity classes. Zbl 0654.68051Hartmanis, Juris; Li, Ming; Yesha, Yaacov 1 1986 Sparse sets in NP-P: EXPTIME versus NEXPTIME. Zbl 0586.68042Hartmanis, J.; Immerman, N.; Sewelson, V. 43 1985 Independence results about context-free languages and lower bounds. Zbl 0586.68029Hartmanis, Juris 5 1985 Computation times of NP sets of different densities. Zbl 0985.68515Hartmanis, J.; Yesha, Y. 31 1984 On sparse sets in NP-P. Zbl 0501.68014Hartmanis, Juris 22 1983 On Goedel speed-up and succinctness of language representations. Zbl 0526.68034Hartmanis, J. 16 1983 A note on natural complete sets and Goedel numberings. Zbl 0483.03026Hartmanis, J. 4 1982 Languages simultaneously complete for one-way and two-way log-tape automata. Zbl 0471.68059Hartmanis, J.; Mahaney, S. 15 1981 Observations about the development of theoretical computer science. Zbl 0998.01539Hartmanis, Juris 1 1981 On the succinctness of different representations of languages. Zbl 0453.68054Hartmanis, J. 17 1980 An essay about research on sparse NP complete sets. Zbl 0444.68032Hartmanis, J.; Mahaney, S. R. 2 1980 On the succinctness of different representations of languages. Zbl 0412.68076Hartmanis, J. 3 1979 Relations between diagonalization, proof systems, and complexity gaps. Zbl 0398.68013Hartmanis, Juris 2 1979 Feasible computations and provable complexity properties. Zbl 0383.68043Hartmanis, Juris 15 1978 On log-tape isomorphisms of complete sets. Zbl 0387.68035Hartmanis, J. 15 1978 On isomorphisms and density of NP and other complete sets. Zbl 0356.68059Berman, L.; Hartmanis, J. 150 1977 On tape bounds for single letter alphabet language processing. Zbl 0351.68014Hartmanis, J.; Berman, L. 11 1977 On polynomial time isomorphisms of complete sets. Zbl 0359.68051Berman, L.; Hartmanis, J. 6 1977 On isomorphisms and density of NP and other complete sets. Zbl 0365.68045Hartmanis, J.; Berman, L. 6 1976 On effective speed-up and long proofs of trivial theorems in formal theories. Zbl 0399.03042Hartmanis, J. 2 1976 Advances in computers. Vol. 14. Zbl 0357.68002 1 1976 On simple Goedel numerings and translations. Zbl 0272.68046Hartmanis, J.; Baker, T. P. 5 1975 On the structure of feasible computations. Zbl 0341.68031Hartmanis, J.; Simon, J. 5 1975 Computational complexity of formal translations. Zbl 0302.68066Hartmanis, J. 3 1975 The LBA problem and its importance in the theory of computing. Zbl 0301.68056Hartmanis, J.; Hunt, H. B. III 6 1974 On simple Goedel numberings and translations. Zbl 0283.68055Hartmanis, J.; Baker, T. P. 3 1974 An overview of the theory of computational complexity. Zbl 0289.68011Hartmanis, J.; Hopcroft, J. E. 2 1974 The LBA problem and its importance in the theory of computing. Zbl 0352.68100Hartmanis, J.; Hunt, H. B. 8 1973 Group theoretic characterization of linear permutation automata. Zbl 0256.94051Hartmanis, J.; Walter, H. 3 1973 On non-determinacy in simple computing devices. Zbl 0229.68014Hartmanis, J. 44 1972 On overview of the theory of computational complexity. Zbl 0226.68024Hartmanis, J.; Hopcroft, J. E. 37 1971 Computational complexity of random access stored program machines. Zbl 0222.68020Hartmanis, J. 10 1971 Complexity of formal translations and speed-up results. Zbl 0257.68036Constable, R. L.; Hartmanis, J. 4 1971 The use of lists in the study of undecidable problems in automata theory. Zbl 0234.02024Hartmanis, J.; Lewis, F. D. 4 1971 Size arguments in the study of computation speeds. Zbl 0265.68029Hartmanis, J. 2 1971 What makes some language theory problems undecidable. Zbl 0231.68031Hartmanis, J.; Hopcroft, J. E. 2 1971 Hierarchies of memory limited computations. Zbl 0229.02033Stearns, R. E.; Hartmanis, J.; Lewis, P. M. II 72 1970 Memory bounds for recognition of context-free and context-sensitive languages. Zbl 0272.68054Lewis, P. M. II; Stearns, R. E.; Hartmanis, J. 38 1970 What makes some language theory problems undecidable. Zbl 0198.03001Hartmanis, J.; Hopcroft, J. E. 18 1970 Computational complexity of one-tape Turing machine computations. Zbl 0223.02037Hartmanis, J. 1 1970 Two memory bounds for the recognition of primes by automata. Zbl 0179.02403Hartmanis, J.; Shank, H. 4 1969 On the complexity of undecidable problems in automata theory. Zbl 0182.02403Hartmanis, J. 2 1969 Two memory bounds for the recognition of primes by automata. Zbl 0175.00804Hartmanis, J.; Shank, H. 1 1969 Computational complexity of one-tape Turing machine computations. Zbl 0162.31703Hartmanis, J. 22 1968 On the recognition of primes by automata. Zbl 0164.05201Hartmanis, J.; Shank, H. 22 1968 Tape-reversal bounded Turing machine computations. Zbl 0259.68020Hartmanis, J. 14 1968 Context-free languages and Turing machine computations. Zbl 0189.29101Hartmanis, J. 37 1967 Sets of numbers defined by finite automata. Zbl 0149.01002Hartmanis, J.; Stearns, R. E. 8 1967 On the computational complexity of algorithms. Zbl 0156.25604Hartmanis, J.; Stearns, R. E. 3 1967 Homomorphic images of linear sequential machines. Zbl 0174.03404Hartmanis, Juris; Davis, Wayne A. 3 1967 On memory requirements for context-free language recognition. Zbl 0155.01801Hartmanis, J. 1 1967 Algebraic structure theory of sequential machines. Zbl 0154.41701Hartmanis, J.; Stearns, R. E. 96 1966 On the computational complexity of algorithms. Zbl 0131.15404Hartmanis, J.; Stearns, R. E. 169 1965 Classifications of computations by time and memory requirements. Zbl 0203.16401Hartmanis, J.; Lewis, P. M. II; Stearns, R. E. 8 1965 Two tests for the linearity of sequential machines. Zbl 0143.02001Hartmanis, Juris 1 1965 Pair algebra and its application to automata theory. Zbl 0197.43604Hartmanis, J.; Stearns, R. E. 4 1964 Pair algebra and its application to automata theory. Zbl 0128.12001Hartmanis, J.; Stearns, R. E. 2 1964 Regularity preserving modifications of regular expressions. Zbl 0112.11307Stearns, R. E.; Hartmanis, J. 17 1963 A study of feedback and errors in sequential machines. Zbl 0117.11505Hartmanis, J.; Stearns, R. E. 2 1963 Loop-free structure of sequential machines. Zbl 0099.34503Hartmanis, J. 6 1962 Some dangers in state reduction of sequential machines. Zbl 0105.32301Hartmanis, J.; Stearns, R. E. 3 1962 Loop-free structure of sequential machines. Zbl 0163.14304Hartmanis, J. 2 1962 Generalized partitions and lattice embedding theorems. Zbl 0113.35901Hartmanis, J. 3 1961 Symbolic analysis of a decomposition of information processing machines. Zbl 0209.31101Hartmanis, J. 5 1960 Lattice theory of generalized partitions. Zbl 0089.37002Hartmanis, Juris 10 1959 The application of some basic inequalities for entropy. Zbl 0096.11001Hartmanis, Juris 2 1959 On the lattice of topologies. Zbl 0087.37403Hartmanis, Juris 15 1958 Two embedding theorems for finite lattices. Zbl 0074.36002Hartmanis, Juris 5 1956 all cited Publications top 5 cited Publications all top 5 Cited by 985 Authors 48 Hemaspaandra, Lane A. 29 Kutrib, Martin 28 Hartmanis, Juris 18 Malcher, Andreas 16 Geffert, Viliam 16 Ibarra, Oscar H. 15 Allender, Eric W. 13 Ko, Ker-I 13 Rothe, Jörg-Matthias 11 Book, Ronald Vernon 11 Holzer, Markus 11 Mitrana, Victor 11 Watanabe, Osamu 10 Hemaspaandra, Edith 10 Lutz, Jack H. 10 Mereghetti, Carlo 10 Okhotin, Alexander 10 Schöning, Uwe 9 Cai, Jin-Yi 9 Fortnow, Lance J. 9 Mayordomo, Elvira 9 Zhirabok, Alexey N. 8 Beigel, Richard 8 Glaßer, Christian 8 Ogihara, Mitsunori 8 Palano, Beatrice 8 Wendlandt, Matthias 7 Buhrman, Harry 7 Cook, Stephen Arthur 7 Hitchcock, John M. 7 Homer, Steven 7 Inoue, Katsushi 7 Köbler, Johannes 7 Meyer, Albert Ronald 7 Selman, Alan Louis 6 Adamczewski, Boris 6 Chang, Richard 6 Greibach, Sheila A. 6 Huynh, Dung T. 6 Manea, Florin 6 Pavan, Aduri 6 Pin, Jean-Eric 6 Shumsky, Alexey Ye. 6 Spakowski, Holger 6 Takanami, Itsuo 5 Agrawal, Manindra 5 Arvind, Vikraman 5 Case, John 5 Fischer, Patrick Carl 5 Goldsmith, Judy 5 Hempel, Harald 5 Ito, Akira 5 Kotta, Ulle 5 Lewis, Forbes D. 5 Mundhenk, Martin 5 Ravikumar, Bala 5 Royer, James S. 5 Seiferas, Joel I. 5 Shallit, Jeffrey O. 5 Silvestri, Riccardo 5 Torenvliet, Leen 5 Watson, William Stephen 5 Zimand, Marius 4 Aho, Alfred Vaino 4 Backhouse, Roland C. 4 Balcázar, José Luis 4 Borchert, Bernd 4 Brown, Jason Ira 4 Chrobak, Marek 4 Fu, Bin 4 Gasarch, William Ian 4 Goldreich, Oded 4 Jakobi, Sebastian 4 Joseph, Deborah 4 Kaldmäe, Arvo 4 Leivant, Daniel M. 4 Macarie, Ioan I. 4 Mahaney, Stephen R. 4 Martín-Vide, Carlos 4 Ogiwara, Mitsunori 4 Pighizzini, Giovanni 4 Regan, Kenneth W. 4 Rosenberg, Arnold Leonard 4 Shumskij, A. E. 4 Staiger, Ludwig 4 Stockmeyer, Larry J. 4 Szepietowski, Andrzej 4 Thakur, Mayur 4 Travers, Stephen D. 4 Tripathi, Rahul 4 Ullman, Jeffrey David 4 Vereshchagin, Nikolay K. 4 Wagner, Klaus W. 4 Wang, Jie 4 Yamakami, Tomoyuki 4 Yeh, Raymond T. 3 Baumeister, Dorothea 3 Bérczi, Kristóf 3 Biswas, Somenath 3 Bugeaud, Yann ...and 885 more Authors all top 5 Cited in 141 Serials 204 Theoretical Computer Science 137 Journal of Computer and System Sciences 81 Mathematical Systems Theory 60 Information and Computation 57 Information Processing Letters 28 Theory of Computing Systems 19 International Journal of Foundations of Computer Science 14 Annals of Pure and Applied Logic 14 Computational Complexity 10 Acta Informatica 10 Kybernetika 10 Transactions of the American Mathematical Society 8 The Journal of Symbolic Logic 8 RAIRO, Informatique Théorique 8 International Journal of Computer Mathematics 7 Discrete Mathematics 7 Journal of the Franklin Institute 7 Information Sciences 7 SIAM Journal on Computing 7 RAIRO. Informatique Théorique et Applications 6 Artificial Intelligence 6 Journal of Soviet Mathematics 6 Natural Computing 5 Discrete Applied Mathematics 5 Computing 5 Cybernetics 4 International Journal of Computer & Information Sciences 4 Proceedings of the American Mathematical Society 4 Order 4 Journal of Complexity 4 Mathematical Logic Quarterly (MLQ) 4 RAIRO. Theoretical Informatics and Applications 4 Fundamenta Informaticae 3 Mathematical Biosciences 3 Calcolo 3 Acta Mathematicae Applicatae Sinica. English Series 3 Aequationes Mathematicae 3 Automation and Remote Control 3 Journal of Computer and Systems Sciences International 3 Journal de Théorie des Nombres de Bordeaux 3 Journal of Mathematical Sciences (New York) 3 Philosophical Transactions of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences 3 International Journal of Applied Mathematics and Computer Science 3 Logical Methods in Computer Science 3 Proceedings of the Estonian Academy of Sciences 3 RAIRO. Theoretical Informatics and Applications 3 Computer Science Review 2 Computers & Mathematics with Applications 2 International Journal of General Systems 2 International Journal of Systems Science 2 International Journal of Theoretical Physics 2 Mathematical Proceedings of the Cambridge Philosophical Society 2 Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM) 2 Journal of Combinatorial Theory. Series A 2 Monatshefte für Mathematik 2 Studia Logica 2 Theory and Decision 2 Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 2 Topology and its Applications 2 Cybernetics and Systems 2 Mathematical Social Sciences 2 Algorithmica 2 MSCS. Mathematical Structures in Computer Science 2 European Journal of Operational Research 2 Distributed Computing 2 Annals of Mathematics and Artificial Intelligence 2 Nonlinear Analysis. Hybrid Systems 2 Revue Française d’Automatique, Informatique, Recherche Opérationnelle. Série Rouge 2 ACM Transactions on Computation Theory 1 Archiv für Mathematische Logik und Grundlagenforschung 1 Israel Journal of Mathematics 1 Mathematical Notes 1 Problems of Information Transmission 1 Ukrainian Mathematical Journal 1 Mathematics of Computation 1 The Mathematical Intelligencer 1 Acta Mathematica 1 Advances in Mathematics 1 Algebra Universalis 1 Annales de l’Institut Fourier 1 Automatica 1 Journal of Algebra 1 Journal of Combinatorial Theory. Series B 1 Journal of Philosophical Logic 1 Kybernetes 1 Mathematische Annalen 1 Mathematische Nachrichten 1 Mathematica Slovaca 1 Notre Dame Journal of Formal Logic 1 Semigroup Forum 1 European Journal of Combinatorics 1 Advances in Applied Mathematics 1 Acta Mathematica Hungarica 1 Graphs and Combinatorics 1 Journal of Symbolic Computation 1 New Generation Computing 1 Discrete & Computational Geometry 1 Journal of Automated Reasoning 1 SIAM Journal on Discrete Mathematics 1 MCSS. Mathematics of Control, Signals, and Systems ...and 41 more Serials all top 5 Cited in 36 Fields 855 Computer science (68-XX) 261 Mathematical logic and foundations (03-XX) 39 Information and communication theory, circuits (94-XX) 30 Combinatorics (05-XX) 29 Number theory (11-XX) 26 Systems theory; control (93-XX) 22 Order, lattices, ordered algebraic structures (06-XX) 22 Group theory and generalizations (20-XX) 16 Operations research, mathematical programming (90-XX) 14 General topology (54-XX) 14 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 10 General algebraic systems (08-XX) 9 Measure and integration (28-XX) 7 Probability theory and stochastic processes (60-XX) 6 Category theory; homological algebra (18-XX) 6 Quantum theory (81-XX) 6 Biology and other natural sciences (92-XX) 4 Dynamical systems and ergodic theory (37-XX) 4 Convex and discrete geometry (52-XX) 4 Numerical analysis (65-XX) 3 Commutative algebra (13-XX) 2 Algebraic geometry (14-XX) 2 Linear and multilinear algebra; matrix theory (15-XX) 2 Statistics (62-XX) 1 General and overarching topics; collections (00-XX) 1 History and biography (01-XX) 1 Field theory and polynomials (12-XX) 1 Nonassociative rings and algebras (17-XX) 1 Functions of a complex variable (30-XX) 1 Ordinary differential equations (34-XX) 1 Difference and functional equations (39-XX) 1 Approximations and expansions (41-XX) 1 Calculus of variations and optimal control; optimization (49-XX) 1 Geometry (51-XX) 1 Manifolds and cell complexes (57-XX) 1 Mechanics of particles and systems (70-XX) Citations by Year Wikidata Timeline The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.