The following pages link to Juris Hartmanis (Q1071499):
Displayed 50 items.
- (Q3975135) (← links)
- (Q4005200) (← links)
- (Q4055193) (← links)
- Computational complexity of formal translations (Q4057597) (← links)
- (Q4109294) (← links)
- (Q4122837) (← links)
- (Q4162663) (← links)
- (Q4182500) (← links)
- (Q4182501) (← links)
- (Q4197341) (← links)
- (Q4199562) (← links)
- (Q4299863) (← links)
- (Q4380143) (← links)
- (Q4431223) (← links)
- (Q4431362) (← links)
- (Q4712652) (← links)
- (Q4763511) (← links)
- (Q4770003) (← links)
- (Q4775857) (← links)
- (Q4778264) (← links)
- Observations About the Development of Theoretical Computer Science (Q4779209) (← links)
- (Q4904143) (← links)
- Structural complexity theory: Recent surprises (Q5056087) (← links)
- On Simple Goedel Numberings and Translations (Q5180402) (← links)
- (Q5180413) (← links)
- Pair algebra and its application to automata theory (Q5335652) (← links)
- On the Computational Complexity of Algorithms (Q5339741) (← links)
- Two Tests for the Linearity of Sequential Machines (Q5518382) (← links)
- Sets of Numbers Defined by Finite Automata (Q5527824) (← links)
- (Q5535414) (← links)
- (Q5536282) (← links)
- On Memory Requirements for Context-Free Language Recognition (Q5537612) (← links)
- Complete Sets of Functions of Two and Three Binary Variables (Q5537618) (← links)
- Computational Complexity of One-Tape Turing Machine Computations (Q5545959) (← links)
- (Q5547174) (← links)
- On the Recognition of Primes by Automata (Q5548359) (← links)
- Two memory bounds for the recognition of primes by automata (Q5563369) (← links)
- Two memory bounds for the recognition of primes by automata (Q5569461) (← links)
- On the Complexity of Undecidable Problems in Automata Theory (Q5573397) (← links)
- A note on one-way and two-way automata (Q5582343) (← links)
- (Q5583856) (← links)
- Pair algebra and its application to automata theory (Q5595898) (← links)
- (Q5601828) (← links)
- (Q5608485) (← links)
- Symbolic analysis of a decomposition of information processing machines (Q5611011) (← links)
- Computational complexity of random access stored program machines (Q5627619) (← links)
- (Q5628112) (← links)
- (Q5632147) (← links)
- An Overview of the Theory of Computational Complexity (Q5633652) (← links)
- (Q5636862) (← links)