Order:
Disambiguations
Nancy Lynch [5]Nancy A. Lynch [2]
  1.  10
    “Helping”: several formalizations.Nancy Lynch - 1975 - Journal of Symbolic Logic 40 (4):555-566.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  11
    Giorgio Ausiello. Abstract computational complexity and cycling computations. Journal of computer and system sciences, vol. 5 , pp. 118–128. [REVIEW]Nancy Lynch - 1975 - Journal of Symbolic Logic 40 (2):248.
  3.  12
    Lewis F. D.. The enumerability and invariance of complexity classes. Journal of computer and system sciences, vol. 5 , pp. 286–303. [REVIEW]Nancy A. Lynch - 1974 - Journal of Symbolic Logic 39 (2):349-349.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  13
    Machtey Michael and Young Paul. An introduction to the general theory of algorithms. The computer science library, Theory of computation series. North-Holland, New York, Oxford, and Shannon, 1978, vii + 264 pp. [REVIEW]Nancy Lynch - 1981 - Journal of Symbolic Logic 46 (4):877-878.
  5.  8
    Review: F. D. Lewis, The Enumerability and Invariance of Complexity Classes. [REVIEW]Nancy A. Lynch - 1974 - Journal of Symbolic Logic 39 (2):349-349.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  3
    Review: Giorgio Ausiello, Abstract Computational Complexity and Cycling Computations. [REVIEW]Nancy Lynch - 1975 - Journal of Symbolic Logic 40 (2):248-248.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7. Review: Michael Machtey, Paul Young, An Introduction to the General Theory of Algorithms. [REVIEW]Nancy Lynch - 1981 - Journal of Symbolic Logic 46 (4):877-878.