@article{Jones:1978:CFM:322063.322074,
    Address = {New York, NY, USA},
    Author = {Jones, Neil D. and Muchnick, Steven S.},
    File = {The Complexity of Finite Memory Programs with Recursion - Jones, Muchnick (0) (0) - a - a - w.pdf},
    ISSN = {0004-5411},
    Journal = {J. ACM},
    Month = {April},
    Number = {2},
    Pages = {312--321},
    Publisher = {ACM},
    Title = {The Complexity of Finite Memory Programs with Recursion},
    URL = {http://doi.acm.org/10.1145/322063.322074},
    Volume = {25},
    Year = {1978},
    acmid = {322074},
    bdsk-url-1 = {http://doi.acm.org/10.1145/322063.322074},
    bdsk-url-2 = {http://dx.doi.org/10.1145/322063.322074},
    date-added = {2012-04-15 08:59:47 +0100},
    date-modified = {2012-04-15 07:59:47 +0000},
    issue_date = {April 1978},
    numpages = {10},
    doi = {10.1145/322063.322074}
}

@article{Jones:1978:CFM:322063.322074, Address = {New York, NY, USA}, Author = {Jones, Neil D. and Muchnick, Steven S.}, File = {The Complexity of Finite Memory Programs with Recursion - Jones, Muchnick (0) (0) - a - a - w.pdf}, ISSN = {0004-5411}, Journal = {J. ACM}, Month = {April}, Number = {2}, Pages = {312--321}, Publisher = {ACM}, Title = {The Complexity of Finite Memory Programs with Recursion}, URL = {http://doi.acm.org/10.1145/322063.322074}, Volume = {25}, Year = {1978}, acmid = {322074}, bdsk-url-1 = {http://doi.acm.org/10.1145/322063.322074}, bdsk-url-2 = {http://dx.doi.org/10.1145/322063.322074}, date-added = {2012-04-15 08:59:47 +0100}, date-modified = {2012-04-15 07:59:47 +0000}, issue_date = {April 1978}, numpages = {10}, doi = {10.1145/322063.322074} }

Library Size: 13G (12942 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A badge