{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:46Z","timestamp":1725456766044},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029647","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:33:46Z","timestamp":1133397226000},"page":"492-498","source":"Crossref","is-referenced-by-count":3,"title":["The parallel complexity of some constructions in combinatorial group theory (abstract)"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Waack","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF00263767","volume":"9","author":"J. Avenhaus","year":"1977","unstructured":"J. Avenhaus, K. Madlener, Subrekursive Komplexit\u00e4t bei Gruppen, I. Gruppen mit vorgeschriebener Komplexit\u00e4t, Acta Informatica 9 (1977) 87\u2013104.","journal-title":"Acta Informatica"},{"key":"56_CR2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00289077","volume":"9","author":"J. Avenhaus","year":"1978","unstructured":"J. Avenhaus, K. Madlener, Subrekursive Komplexit\u00e4t bei Gruppen, II. Der Einbettungssatz von Higman f\u00fcr entscheidbare Gruppen. Acta Informatica 9 (1978) 183\u2013193.","journal-title":"Acta Informatica"},{"key":"56_CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(84)90024-0","volume":"32","author":"J. Avenhaus","year":"1984","unstructured":"J. Avenhaus, K. Madlener, The Nielson reduction and P-complete problems in free groups, Theoret. Comput. Sci. 32 (1984) 61\u201376.","journal-title":"Theoret. Comput. Sci."},{"key":"56_CR4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(84)90046-X","volume":"32","author":"J. Avenhaus","year":"1984","unstructured":"J. Avenhaus, K. Madlener, On the complexity of intersection and conjugacy problems in free groups, Theoret. Comput. Sci. 32 (1984) 279\u2013295.","journal-title":"Theoret. Comput. Sci."},{"key":"56_CR5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/3-540-51498-8_28","volume":"380","author":"M. Krause","year":"1989","unstructured":"M. Krause, S. Waack, On oblivious branching programs of linear length, in: Proc. FCT'89 Szeged, Lecture Notes in Computer Science 380 (Springer-Verlag, Berlin, 1989) 287\u2013296.","journal-title":"Lecture Notes in Computer Science"},{"issue":"4","key":"56_CR6","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1051\/ita\/1988220404471","volume":"22","author":"K. Kriegel","year":"1988","unstructured":"K. Kriegel, S. Waack, Lower bounds on the complexity of real-time branching programs, Informatique theorique et Applications\/Theoretical Informatics and Applications 22 (4) 447\u2013459 (1988).","journal-title":"Informatique theorique et Applications\/Theoretical Informatics and Applications"},{"issue":"3","key":"56_CR7","first-page":"322","volume":"24","author":"R.J. Lipton","year":"1977","unstructured":"R.J. Lipton, Y. Zalcstein, Word problems solvable in logspace, Journal of the ACM, 24 (3) (1977) 322\u2013526.","journal-title":"Journal of the ACM"},{"key":"56_CR8","unstructured":"H. Neumann, Varieties of groups, Ergebnisse der Mathematik und Grenzgebiete Band 37, Springer-Verlag 1967."},{"key":"56_CR9","volume-title":"Proc. FCT'79","author":"H.U. Simon","year":"1979","unstructured":"H.U. Simon, Word problems for groups and contextfree recognition, in: Proc. FCT'79, Akademie-Verlag, Berlin 1979."},{"key":"56_CR10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(88)90134-X","volume":"56","author":"C. Tretkoff","year":"1988","unstructured":"C. Tretkoff, Complexity, combinatorial group theory and the language of pulatators, Theoret. Comput. Sci. 56 (1988) 253\u2013275.","journal-title":"Theoret. Comput. Sci."},{"key":"56_CR11","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/3-540-10854-8_50","volume":"117","author":"S. Waack","year":"1981","unstructured":"S. Waack, Tape complexity of word problems, in: Proc. FCT'81, Lecture Notes in Computer Science 117 (Springer-Verlag, Berlin, 1981) 467\u2013471.","journal-title":"Lecture Notes in Computer Science"},{"key":"56_CR12","volume-title":"Tape complexity of word problems","author":"S. Waack","year":"1981","unstructured":"S. Waack, Tape complexity of word problems, TR IMATH der AdW der DDR, Berlin 1981."},{"key":"56_CR13","unstructured":"S. Waack, Raumkomplexit\u00e4t von Wortproblemen endlicher Gruppenpr\u00e4sentationen, Dissertation A, Berlin 1983."},{"key":"56_CR14","unstructured":"S. Waack, On the parallel complexity of linear groups, submitted to publication."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029647.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:59:53Z","timestamp":1607533193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0029647","relation":{},"subject":[]}}