Skip to main content


eCommons@Cornell

eCommons@Cornell >

Browsing by Author Hartmanis, Juris

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:   
Sort by: In order: Results/Page Authors/Record:
Showing results 47 to 56 of 56
< previous 
PreviewIssue DateTitleAuthor(s)
Aug-1970Size Arguments in the Study of Computation SpeedsHartmanis, Juris
Mar-1987Some Observations About NP Complete SetsHartmanis, Juris
May-1989Space Bounded Computations: Review And New Separation ResultsHartmanis, Juris; Ranjan, Desh
Feb-1983Sparse Sets in NP-P: EXPTIME Versus NEXPTIMEHartmanis, Juris; Sewelson, Vivian; Immerman, Neil
Jun-1987Structural Complexity Column for the Bulletin of the European Association for Theoretical Computer ScienceHartmanis, Juris
May-1988Structural Complexity Column: Some Observations About Relativization of Space Bounded ComputationsHartmanis, Juris
Apr-1990Structural Complexity Theory: Recent SurprisesHartmanis, Juris; Chang, Richard; Ranjan, Desh; Rohatgi, Pankaj
Feb-1968Tape Reversal Bounded Turing Machine ComputationsHartmanis, Juris
Jun-1968Two Memory Bounds for the Recognition of Primes by AutomataHartmanis, Juris; Shank, H.
Jan-1970The Use of Lists in the Study of Undecidable Problems in Automata TheoryHartmanis, Juris; Lewis, Forbes
Showing results 47 to 56 of 56
< previous 

 

© 2014 Cornell University Library Contact Us