乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:18:04Z","timestamp":1649128684572},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"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":5556,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0304-3975(97)00033-9","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"99-130","source":"Crossref","is-referenced-by-count":4,"title":["A communication hierarchy of parallel computations"],"prefix":"10.1016","volume":"198","author":[{"given":"Viliam","family":"Geffert","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00033-9_BIB1","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00033-9_BIB2","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1137\/0220031","article-title":"Nondeterministic computations in sublogarithmic space and space constructibility","volume":"20","author":"Geffert","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00033-9_BIB3","series-title":"Proc. MFCS'95","first-page":"50","article-title":"Bridging across the log (n) space frontier","volume":"vol. 969","author":"Geffert","year":"1995"},{"key":"10.1016\/S0304-3975(97)00033-9_BIB4","series-title":"Proc. MFCS'90","first-page":"292","article-title":"On possibilities of one-way synchronized and alternating automata","volume":"vol. 452","author":"Geidmanis","year":"1990"},{"key":"10.1016\/S0304-3975(97)00033-9_BIB5","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(97)00033-9_BIB6","series-title":"How to organize the communication among parallel processes in alternating computations","author":"Hromkovic\u0306","year":"1986"},{"key":"10.1016\/S0304-3975(97)00033-9_BIB7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1142\/S0129054192000073","article-title":"On the power of one-way synchronized alternating machines with small space","volume":"3","author":"Hromkovic\u0306","year":"1992","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00033-9_BIB8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(91)90098-H","article-title":"On the power of synchronization in parallel computations","volume":"32","author":"Hromkovic\u0306","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(97)00033-9_BIB9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0304-3975(94)90238-0","article-title":"Deterministic versus nondeterministic space in terms of synchronized alternating machines","volume":"132","author":"Hromkovic\u0306","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00033-9_BIB10","series-title":"Proc. FCT'91","first-page":"248","article-title":"On space-bounded synchronized alternating Turing machines","volume":"vol. 529","author":"Ibarra","year":"1991"},{"key":"10.1016\/S0304-3975(97)00033-9_BIB11","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complement","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00033-9_BIB12","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1137\/0222011","article-title":"ASPACE(o(log logn)) is regular","volume":"22","author":"Iwama","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00033-9_BIB13","series-title":"Proc. ICALP'81","first-page":"506","article-title":"Alternating multihead finite automata","volume":"vol. 115","author":"King","year":"1981"},{"key":"10.1016\/S0304-3975(97)00033-9_BIB14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00033-9_BIB15","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1145\/48014.63141","article-title":"Counting is easy","volume":"35","author":"Sciferas","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00033-9_BIB16","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01193576","article-title":"Communication for alternating machines","volume":"29","author":"Slobodov\u00e1","year":"1992","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(97)00033-9_BIB17","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0304-3975(92)90346-H","article-title":"Some properties of space-bounded synchronized alternating Turing machines with universal states only","volume":"96","author":"Slobodov\u00e1","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00033-9_BIB18","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1142\/S0129054195000238","article-title":"On the power of one-way globally deterministic synchronized alternating Turing machines and multihead automata","volume":"6","author":"Slobodov\u00e1","year":"1995","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00033-9_BIB19","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","article-title":"The method of forced enumeration for nondeterministic automata","volume":"26","author":"Szelepcs\u00e9nyi","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(97)00033-9_BIB20","article-title":"Turing Machines with Sublogarithmic Space","volume":"vol. 843","author":"Szepietowski","year":"1994"},{"key":"10.1016\/S0304-3975(97)00033-9_BIB21","doi-asserted-by":"crossref","DOI":"10.1016\/B978-0-444-88071-0.50006-0","article-title":"Machine models and simulations","author":"van Emde Boas","year":"1989"},{"key":"10.1016\/S0304-3975(97)00033-9_BIB22","first-page":"499","article-title":"On the power of synchronization","volume":"25","author":"Wiedermann","year":"1989","journal-title":"J. Inform. Process. Cybernet. (EIK)"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000339?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000339?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:26:38Z","timestamp":1556508398000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0304397597000339"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00033-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}