The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Juris Hartmanis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Richard Edwin Stearns, Juris Hartmanis, Philip M. Lewis II
    Hierarchies of memory limited computations [Citation Graph (1, 0)][DBLP]
    FOCS, 1965, pp:179-190 [Conf]
  2. Juris Hartmanis, Neil Immerman, Vivian Sewelson
    Sparse Sets in NP-P: EXPTIME versus NEXPTIME [Citation Graph (1, 0)][DBLP]
    Information and Control, 1985, v:65, n:2/3, pp:158-181 [Journal]
  3. Juris Hartmanis
    New Developments in Structural Complexity Theory. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:71, n:1, pp:79-93 [Journal]
  4. Herbert S. Lin, Juris Hartmanis, John R. Rice, Morton Lowengrub
    Computing the Future: Whither Computer Science and Engineering? [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1993, pp:530- [Conf]
  5. Juris Hartmanis, Suresh Chari
    On the Intellectual Terrain Around NP. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:1-11 [Conf]
  6. Jin-yi Cai, Juris Hartmanis
    The Complexity Of The Real Line Is A Fractal. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:138-146 [Conf]
  7. Juris Hartmanis
    Computational Complexity and Mathematical Proofs. [Citation Graph (0, 0)][DBLP]
    Informatics, 2001, pp:251-256 [Conf]
  8. Juris Hartmanis
    Some Observations of NP Complete Sets. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:185-196 [Conf]
  9. Theodore P. Baker, Juris Hartmanis
    Succinctness, Verifiability and Determinism in Representations of Polynomial-Time Languages [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:392-396 [Conf]
  10. Patrick C. Fischer, Juris Hartmanis, Manuel Blum
    Tape Reversal Complexity Hierarchies [Citation Graph (0, 0)][DBLP]
    FOCS, 1968, pp:373-382 [Conf]
  11. Juris Hartmanis
    On the Complexity of Undecidable Problems in Automata Theory [Citation Graph (0, 0)][DBLP]
    FOCS, 1967, pp:112-116 [Conf]
  12. Juris Hartmanis
    Observations about the Development of Theoretical Computer Science [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:224-233 [Conf]
  13. Juris Hartmanis
    Generalized Kolmogorov Complexity and the Structure of Feasible Computations (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:439-445 [Conf]
  14. Juris Hartmanis, Leonard Berman
    A Note on Tape Bounds for SLA Language Processing [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:65-70 [Conf]
  15. Juris Hartmanis, John E. Hopcroft
    Structure of Undecidable Problems in Automata Theory [Citation Graph (0, 0)][DBLP]
    FOCS, 1968, pp:327-333 [Conf]
  16. Juris Hartmanis, Neil Immerman, Stephen R. Mahaney
    One-Way Log-Tape Reductions [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:65-72 [Conf]
  17. Juris Hartmanis, Richard Edwin Stearns
    Computational complexity of recursive sequences [Citation Graph (0, 0)][DBLP]
    FOCS, 1964, pp:82-90 [Conf]
  18. Juris Hartmanis, Janos Simon
    On the Power of Multiplication in Random Access Machines [Citation Graph (0, 0)][DBLP]
    FOCS, 1974, pp:13-23 [Conf]
  19. Philip M. Lewis II, Richard Edwin Stearns, Juris Hartmanis
    Memory bounds for recognition of context-free and context-sensitive languages [Citation Graph (0, 0)][DBLP]
    FOCS, 1965, pp:191-202 [Conf]
  20. Richard Edwin Stearns, Juris Hartmanis
    On the application of pair algebra to automata theory [Citation Graph (0, 0)][DBLP]
    FOCS, 1964, pp:192-196 [Conf]
  21. Juris Hartmanis
    Some Observations About the Nature of Computer Science. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:1-12 [Conf]
  22. Juris Hartmanis, Janos Simon
    On the Structure of Feasible Computation. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1974, pp:3-51 [Conf]
  23. Juris Hartmanis
    Undecidability and Incompleteness Results in Automata Theory. [Citation Graph (0, 0)][DBLP]
    A Half-Century of Automata Theory, 2000, pp:21-35 [Conf]
  24. Juris Hartmanis
    On the Succintness of Different Representations of Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:282-288 [Conf]
  25. Juris Hartmanis
    New Developments in Structural Complexity Theory. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:271-286 [Conf]
  26. Juris Hartmanis
    Observations about the Nature and State of Computer Science (Keynote Address). [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:105- [Conf]
  27. Juris Hartmanis, Theodore P. Baker
    On Simple Goedel Numberings and Translations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1974, pp:301-316 [Conf]
  28. Juris Hartmanis, Lane A. Hemachandra
    Complexity Classes Without Machines: On Complete Languages for UP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:123-135 [Conf]
  29. Juris Hartmanis, Yaacov Yesha
    Computation Times of NP Sets of Different Densities. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:319-330 [Conf]
  30. Juris Hartmanis, Neil Immerman
    On Complete Problems for NP$\cap$CoNP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:250-259 [Conf]
  31. Juris Hartmanis, Ming Li, Yaacov Yesha
    Containment, Separation, Complete Sets, and Immunity of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:136-145 [Conf]
  32. Juris Hartmanis
    Pragmatic Aspects of Complexity Theory (Panel). [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1986, pp:3-4 [Conf]
  33. Juris Hartmanis
    The Structure of the Complexity of Computations: A Guided Tour Through Complexity Classes. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:213-220 [Conf]
  34. Juris Hartmanis
    On the Problem of Finding Natural Computational Complexity Measures. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:95-103 [Conf]
  35. Juris Hartmanis
    On the Computing Paradigm and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:82-92 [Conf]
  36. Juris Hartmanis, Theodore P. Baker
    Relative Succinctness of Representations of Languages and Separation of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1979, pp:70-88 [Conf]
  37. Juris Hartmanis, Stephen R. Mahaney
    An Eassay about Research on Sparse NP Complete Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1980, pp:40-57 [Conf]
  38. Juris Hartmanis, Desh Ranjan
    Space Bounded Computations: Review And New Separation Results. [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:49-66 [Conf]
  39. Juris Hartmanis, Lane A. Hemachandra
    On Sparse Oracles Separating Feasible Complexity Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:321-333 [Conf]
  40. Robert L. Constable, Juris Hartmanis
    Complexity of Formal Translations and Speed-Up Results [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:244-250 [Conf]
  41. Juris Hartmanis
    Relations Between Diagonalization, Proof Systems, and Complexity Gaps (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1977, pp:223-227 [Conf]
  42. Juris Hartmanis, Leonard Berman
    On Isomorphisms and Density of NP and Other Complete Sets [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:30-40 [Conf]
  43. Juris Hartmanis, Vivian Sewelson, Neil Immerman
    Sparse Sets in NP-P: EXPTIME versus NEXPTIME [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:382-391 [Conf]
  44. Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi
    Structural Complexity Theory: recent Surprises. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:1-12 [Conf]
  45. Leonard Berman, Juris Hartmanis
    On polynomial time isomorphisms of complete sets. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1977, pp:1-16 [Conf]
  46. Juris Hartmanis, Janos Simon
    On the Structure of Feasible Computations. [Citation Graph (0, 0)][DBLP]
    Advances in Computers, 1976, v:14, n:, pp:1-43 [Journal]
  47. Juris Hartmanis
    On Non-Determinancy in Simple Computing Devices [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1972, v:1, n:, pp:336-344 [Journal]
  48. Ted Eisenberg, David Gries, Juris Hartmanis, Don Holcomb, M. Stuart Lynn, Thomas Santoro
    The Cornell Commission: On Morris and the Worm. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1989, v:32, n:6, pp:706-709 [Journal]
  49. Juris Hartmanis
    Computing the Future - Comittee to Assess the Scope and Direction of Computer Science and Technology of the National Research Council. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1992, v:35, n:11, pp:30-40 [Journal]
  50. Juris Hartmanis
    Turing Award Lecture: On Computational Complexity and the Nature of Computer Science. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1994, v:37, n:10, pp:37-43 [Journal]
  51. David D. Clark, Edward A. Feigenbaum, Donald P. Greenberg, Juris Hartmanis, Robert W. Lucky, Robert Metcalfe, Raj Reddy, Mary Shaw, William A. Wulf
    Innovation and Obstacles: The Future of Computing. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 1998, v:31, n:, pp:29-38 [Journal]
  52. Juris Hartmanis
    Turing Award Lecture: On Computational Complexity and the Nature of Computer Science. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1995, v:27, n:1, pp:7-16 [Journal]
  53. Juris Hartmanis
    Response to the Essays "On Computational Complexity and the Nature of Computer Science". [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1995, v:27, n:1, pp:59-61 [Journal]
  54. Juris Hartmanis
    On non-isomorphic NP complete sets. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1984, v:24, n:, pp:73-77 [Journal]
  55. Juris Hartmanis
    Solvable problems with conflicting relativizations. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:27, n:, pp:40-48 [Journal]
  56. Juris Hartmanis
    The Structural Complexity Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1987, v:33, n:, pp:26-39 [Journal]
  57. Juris Hartmanis
    Structural Complexity Columns in Sparse complete sets for NP and the optimal collpase of the polynomial hierarchy. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1987, v:32, n:, pp:73-81 [Journal]
  58. Juris Hartmanis
    The Structural Complexity Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:82-91 [Journal]
  59. Juris Hartmanis
    The Structural Complexity Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1989, v:38, n:, pp:101-106 [Journal]
  60. Juris Hartmanis
    The Structural Complexity Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1989, v:37, n:, pp:117-126 [Journal]
  61. Juris Hartmanis
    A Broader Research Agenda for Theory. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1993, v:49, n:, pp:125-129 [Journal]
  62. Juris Hartmanis
    About the Nature of the Computer Science. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1994, v:53, n:, pp:170-190 [Journal]
  63. Juris Hartmanis
    On the Weight of Computations. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1995, v:55, n:, pp:- [Journal]
  64. Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi
    On Unique Staisfiability and Randomized Reductions. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1990, v:41, n:, pp:166-174 [Journal]
  65. Juris Hartmanis
    The Applications of Some Basic Inequalities for Entropy [Citation Graph (0, 0)][DBLP]
    Information and Control, 1959, v:2, n:3, pp:199-213 [Journal]
  66. Juris Hartmanis
    Symbolic Analysis of a Decomposition of Information Processing Machines [Citation Graph (0, 0)][DBLP]
    Information and Control, 1960, v:3, n:2, pp:154-178 [Journal]
  67. Juris Hartmanis
    Loop-Free Structure of Sequential Machines [Citation Graph (0, 0)][DBLP]
    Information and Control, 1962, v:5, n:1, pp:25-43 [Journal]
  68. Juris Hartmanis, Richard Edwin Stearns
    Some Dangers in State Reduction of Sequential Machines [Citation Graph (0, 0)][DBLP]
    Information and Control, 1962, v:5, n:3, pp:252-260 [Journal]
  69. Juris Hartmanis, Richard Edwin Stearns
    Pair Algebra and Its Application to Automata Theory [Citation Graph (0, 0)][DBLP]
    Information and Control, 1964, v:7, n:4, pp:485-507 [Journal]
  70. Richard Edwin Stearns, Juris Hartmanis
    Regularity Preserving Modifications of Regular Expressions [Citation Graph (0, 0)][DBLP]
    Information and Control, 1963, v:6, n:1, pp:55-69 [Journal]
  71. Juris Hartmanis
    On Sparse Sets in NP - P. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:2, pp:55-60 [Journal]
  72. Juris Hartmanis
    Independence Results About Context-Free Languages and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:5, pp:241-248 [Journal]
  73. Juris Hartmanis, Lane A. Hemachandra
    On Sparse Oracles Separating Feasible Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:6, pp:291-295 [Journal]
  74. Juris Hartmanis
    On Effective Speed-Up and Long Proofs of Trivial Theorems in Formal Theories. [Citation Graph (0, 0)][DBLP]
    ITA, 1976, v:10, n:1, pp:29-38 [Journal]
  75. Juris Hartmanis
    Separation of complexity classes. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:1, pp:58-62 [Journal]
  76. Juris Hartmanis
    Further Results on the Structure of Sequential Machines. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1963, v:10, n:1, pp:78-88 [Journal]
  77. Juris Hartmanis
    On Memory Requirements for Context-Free Language Recognition. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1967, v:14, n:4, pp:663-665 [Journal]
  78. Juris Hartmanis
    Computational Complexity of One-Tape Turing Machine Computations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1968, v:15, n:2, pp:325-339 [Journal]
  79. Juris Hartmanis
    On the Complexity of Undecidable Problems in Automata Theory. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1969, v:16, n:1, pp:160-167 [Journal]
  80. Juris Hartmanis, John E. Hopcroft
    An Overview of the Theory of Computational Complexity. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1971, v:18, n:2, pp:444-475 [Journal]
  81. Juris Hartmanis, H. Shank
    On the Recognition of Primes by Automata. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1968, v:15, n:3, pp:382-389 [Journal]
  82. Jin-yi Cai, Juris Hartmanis
    On Hausdorff and Topological Dimensions of the Kolmogorov Complexity of the Real Line. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:3, pp:605-619 [Journal]
  83. Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan Håstad, Desh Ranjan, Pankaj Rohatgi
    The Random Oracle Hypothesis Is False. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:1, pp:24-39 [Journal]
  84. Juris Hartmanis
    Tape-Reversal Bounded Turing Machine Computations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1968, v:2, n:2, pp:117-135 [Journal]
  85. Juris Hartmanis, Leonard Berman
    On Polynomial Time Isomorphisms of Some New Complete Sets. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1978, v:16, n:3, pp:418-422 [Journal]
  86. Juris Hartmanis, Wayne A. Davis
    Homomorphic Images of Linear Sequential Machines. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1967, v:1, n:2, pp:155-165 [Journal]
  87. Juris Hartmanis, John E. Hopcroft
    What makes Some Language Theory Problems Undecidable. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1970, v:4, n:4, pp:368-376 [Journal]
  88. Juris Hartmanis, Forbes D. Lewis
    The use of Lists in the Study of Undecidable Problems in Automata Theory. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1971, v:5, n:1, pp:54-66 [Journal]
  89. Juris Hartmanis, H. Walter
    Group Theoretic Characterization of Linear Permutation Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1973, v:7, n:2, pp:168-188 [Journal]
  90. Juris Hartmanis
    A Note on One-Way and Two-Way Automata. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1970, v:4, n:1, pp:24-28 [Journal]
  91. Juris Hartmanis
    Computational Complexity of Random Acess Stored Program Machines. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1971, v:5, n:3, pp:232-245 [Journal]
  92. Juris Hartmanis
    Computational Complexity of Formal Translations. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1975, v:8, n:2, pp:156-167 [Journal]
  93. Juris Hartmanis, H. Shank
    Two Memory Bounds for the Recognition of Primes by Automata. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1969, v:3, n:2, pp:125-129 [Journal]
  94. Leonard Berman, Juris Hartmanis
    On Isomorphisms and Density of NP and Other Complete Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:2, pp:305-322 [Journal]
  95. Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung
    The Boolean Hierarchy I: Structural Properties. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1232-1252 [Journal]
  96. Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung
    The Boolean Hierarchy II: Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:1, pp:95-111 [Journal]
  97. Juris Hartmanis
    On the Succinctness of Different Representations of Languages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:114-120 [Journal]
  98. Juris Hartmanis, Theodore P. Baker
    On Simple Gödel Numberings and Translations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1975, v:4, n:1, pp:1-11 [Journal]
  99. Juris Hartmanis, Stephen R. Mahaney
    Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:383-390 [Journal]
  100. Juris Hartmanis
    On Log-Tape Isomorphisms of Complete Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1978, v:7, n:, pp:273-286 [Journal]
  101. Juris Hartmanis
    Relations Between Diagonalization, Proof Systems, and Complexity Gaps. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:239-253 [Journal]
  102. Juris Hartmanis
    A Note on Natural Complete Sets and Gödel Numberings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:75-89 [Journal]
  103. Juris Hartmanis
    On Gödel Speed-Up and Succinctness of Language Representations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:335-342 [Journal]
  104. Juris Hartmanis, Leonard Berman
    On Tape Bounds for Single Letter Alphabet Language Processing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:3, n:2, pp:213-224 [Journal]
  105. Juris Hartmanis, Lane A. Hemachandra
    Complexity Classes without Machines: On Complete Languages for UP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:58, n:, pp:129-142 [Journal]
  106. Juris Hartmanis, Lane A. Hemachandra
    Robust Machines Accept Easy Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:74, n:2, pp:217-225 [Journal]
  107. Juris Hartmanis, Lane A. Hemachandra
    One-Way Functions and the Nonisomorphism of NP-Complete Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:1, pp:155-163 [Journal]
  108. Juris Hartmanis, Yaacov Yesha
    Computation Times of NP Sets of Different Densities. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:34, n:, pp:17-32 [Journal]
  109. Desh Ranjan, Richard Chang, Juris Hartmanis
    Space Bounded Computations: Review and New Separation Results. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:80, n:2, pp:289-302 [Journal]

Search in 0.111secs, Finished in 0.114secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002