{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T02:26:03Z","timestamp":1648952763568},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,12,1]],"date-time":"1980-12-01T00:00:00Z","timestamp":344476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11916,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1980,12]]},"DOI":"10.1016\/0022-0000(80)90024-0","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"251-280","source":"Crossref","is-referenced-by-count":6,"title":["Straight-line program length as a parameter for complexity analysis"],"prefix":"10.1016","volume":"21","author":[{"given":"Nancy A.","family":"Lynch","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(80)90024-0_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1976"},{"issue":"No.3","key":"10.1016\/0022-0000(80)90024-0_BIB2","doi-asserted-by":"crossref","DOI":"10.2307\/2270453","article-title":"Hierarchies of computable groups and the word problem","volume":"21","author":"Cannonito","year":"1966","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(80)90024-0_BIB3","series-title":"Word Problems","article-title":"The algebraic invariance of the word problem in groups","volume":"Vol. 71","author":"Cannonito","year":"1973"},{"key":"10.1016\/0022-0000(80)90024-0_BIB4","series-title":"Word Problems","article-title":"The computability of group instructions, I","volume":"Vol 71","author":"Cannonito","year":"1973"},{"key":"10.1016\/0022-0000(80)90024-0_BIB5","doi-asserted-by":"crossref","article-title":"Abstract Data Types and Software Validation","author":"Guttag","year":"1976","DOI":"10.21236\/ADA029896"},{"key":"10.1016\/0022-0000(80)90024-0_BIB6","unstructured":"J. Goguen, J. Thatcher and E. Wagner, An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types, IBM Technical Report."},{"key":"10.1016\/0022-0000(80)90024-0_BIB7","unstructured":"N. A. Lynch, Accessibility of Values as a Determinant of Relative Complexity of Algebras, submitted for publication."},{"key":"10.1016\/0022-0000(80)90024-0_BIB8","series-title":"Proceedings 10th Annual Symposium on Theory of Computing","first-page":"150","article-title":"Straight-Line Program Length as a Parameter for Complexity Measures","author":"Lynch","year":"1978"},{"key":"10.1016\/0022-0000(80)90024-0_BIB9","series-title":"Proceedings, 9th Annual Symposium on Theory of Computing","first-page":"228","article-title":"Efficient reducibility between programming systems; preliminary report","author":"Lynch","year":"1977"},{"key":"10.1016\/0022-0000(80)90024-0_BIB10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01776573","article-title":"A difference in expressive power between flowcharts and recursion schemes","volume":"12","author":"Lynch","year":"1979","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(80)90024-0_BIB11","unstructured":"N. A. Lynch, and E. K. Blum, Relative computability and complexity of algebras. Math. Systems Theory, in press."},{"key":"10.1016\/0022-0000(80)90024-0_BIB12","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01744295","article-title":"Relative complexity of operations on numeric and bit string algebras","volume":"13","author":"Lynch","year":"1980","journal-title":"Math. Systems Theory"},{"issue":"No. 1","key":"10.1016\/0022-0000(80)90024-0_BIB13","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1109\/TSE.1975.6312816","article-title":"Specification techniques for data abstractions","volume":"SE-1","author":"Liskov","year":"1975","journal-title":"Software Eng."},{"key":"10.1016\/0022-0000(80)90024-0_BIB14","article-title":"The Metamathematics of algebraic systems","volume":"Vol. 66","author":"Maccev","year":"1971"},{"key":"10.1016\/0022-0000(80)90024-0_BIB15","article-title":"Combinatorial Group Theory","volume":"Vol. 13","author":"Magnus","year":"1966"},{"key":"10.1016\/0022-0000(80)90024-0_BIB16","first-page":"341","article-title":"Computable algebra, General theory and theory of computable fields","volume":"95","author":"Rabin","year":"1960","journal-title":"Trans."},{"key":"10.1016\/0022-0000(80)90024-0_BIB17","series-title":"Ninth Annual ACM Symposium on Theory of Computing","article-title":"On feasable numbers","author":"Simon","year":"1977"},{"key":"10.1016\/0022-0000(80)90024-0_BIB18","series-title":"Ninth Annual ACM Symposium on Theory of Computing","article-title":"Reference machines requires non-linear time to maintain disjoint sets","author":"Tarjan","year":"1977"},{"key":"10.1016\/0022-0000(80)90024-0_BIB19","unstructured":"M. Valiev, personal communication."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000080900240?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000080900240?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T16:50:16Z","timestamp":1585327816000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000080900240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,12]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,12]]}},"alternative-id":["0022000080900240"],"URL":"http:\/\/dx.doi.org\/10.1016\/0022-0000(80)90024-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1980,12]]}}}
