{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:52:44Z","timestamp":1775281964422,"version":"3.50.1"},"reference-count":82,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"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":6529,"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":[[1995,9]]},"DOI":"10.1016\/0304-3975(95)00031-q","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:06:05Z","timestamp":1027631165000},"page":"325-349","source":"Crossref","is-referenced-by-count":17,"title":["On quasilinear-time complexity theory"],"prefix":"10.1016","volume":"148","author":[{"given":"Ashish V.","family":"Naik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth W.","family":"Regan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Sivakumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00031-Q_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"issue":"2","key":"10.1016\/0304-3975(95)00031-Q_BIB2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/18.119713","article-title":"Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs","volume":"38","author":"Alon","year":"1992","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB3","series-title":"Proc. 5th Ann. IEEE Conf. on Structure in Complexity Theory","first-page":"232","article-title":"Some connections between bounded query classes and nonuniform complexity","author":"Amir","year":"1990"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB4","first-page":"37","article-title":"Polynomial terse sets","volume":"77","author":"Amir","year":"1988","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB5","series-title":"Proc. 23rd Ann. ACM Symp. on the Theory of Computing","first-page":"21","article-title":"Checking computations in polylogarithmic time","author":"Babai","year":"1991"},{"issue":"4","key":"10.1016\/0304-3975(95)00031-Q_BIB6","first-page":"175","article-title":"Self-reducibility structures and solutions of NP problems","volume":"4","author":"Balc\u00e1zar","year":"1990","journal-title":"Rivesta Matematica"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB7","series-title":"Structural Complexity Theory","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB8","series-title":"Proc. 7th Ann. IEEE Conf. on Structure in Complexity Theory","first-page":"86","article-title":"Quasipolynomial size circuit classes","author":"Barrington","year":"1992"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB9","series-title":"Ph.D. Thesis","article-title":"Query-limited reducibilities","author":"Beigel","year":"1987"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB10","series-title":"Proc. 2nd Ann. IEEE Conf. on Structure in Complexity Theory","first-page":"28","article-title":"A structural theorem that depends quantitatively on the complexity of SAT","author":"Beigel","year":"1987"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0304-3975(91)90160-4","article-title":"Bounded queries to SAT and the Boolean hierarchy","volume":"83","author":"Beigel","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB12","series-title":"Proc. 9th Ann. IEEE Conf. on Structure in Complexity Theory","first-page":"134","article-title":"Downward separation fails catastrophically for limited nondeterminism classes","author":"Beigel","year":"1994"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB13","series-title":"Proc. 32nd Ann. IEEE Symp. on Foundations of Computer Science","first-page":"19","article-title":"Languages that are easier than their proofs","author":"Beigel","year":"1991"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB14","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01620618","article-title":"Bounded query classes and the difference hierarchy","volume":"29","author":"Beigel","year":"1989","journal-title":"Archive Math. Logic"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB15","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1006\/inco.1993.1014","article-title":"Terse, superterse, and verbose sets","volume":"103","author":"Beigel","year":"1993","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB16","series-title":"Proc. 9th Ann. IEEE Conf. on Structure in Complexity Theory","first-page":"12","article-title":"Approximable sets","author":"Beigel","year":"1994"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB17","series-title":"Proc. 21st Ann. ACM Symp. on the Theory of Computing","first-page":"204","article-title":"On the theory of average-case complexity","author":"Ben-David","year":"1989"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB18","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"on isomorphisms and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB19","series-title":"Technical Report 76-284","article-title":"Some comments on functional self-reducibility and the NP hierarchy","author":"Borodin","year":"1976"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB20","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1137\/0222038","article-title":"Nondeterminism within P","volume":"22","author":"Buss","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB21","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0890-5401(91)90075-D","article-title":"On truth-table reducibility to SAT","volume":"91","author":"Buss","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB22","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","article-title":"Universal classes of hash functions","volume":"18","author":"Carter","year":"1979","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB23_1","series-title":"Ph.D. Thesis","article-title":"Randomness as a computational resource: issues in efficient computation","author":"Chari","year":"1994"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB23_2","author":"Chari","year":"1994","journal-title":"Cornell CS-TR-94-1449"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB24","series-title":"Proc. 25th Ann. ACM Symp. on the Theory of Computing","first-page":"458","article-title":"Randomness-optimal unique element isolation, with applications to perfect matching and related problems","author":"Chari","year":"1993"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB25","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB26","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","article-title":"Time bounded random access machines","volume":"7","author":"Cook","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB27","series-title":"Technical report","article-title":"Fast Turing reductions between problems in NP","author":"Dewdney","year":"1981"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB28","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1080\/00207168208803302","article-title":"Linear time transformations between combinatorial problems","volume":"11","author":"Dewdney","year":"1982","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB29","series-title":"Combinatorial Mathematics: Proceedings of the Third International Conference, Vol. 555 of Ann. the New York Academy of Sci.","first-page":"171","article-title":"Turing reductions of combinatorial problems and their algorithms","author":"Dewdney","year":"1989"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB30","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02090764","article-title":"Classes of bounded nondeterminism","volume":"23","author":"D\u00edaz","year":"1990","journal-title":"Math. Systems. Theory"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB31","series-title":"Concatenated Codes","author":"Forney","year":"1966"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB32","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB33","series-title":"Proc. 27th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"390","article-title":"Three results on polynomial-time isomorphism of NP-complete sets","author":"Goldsmith","year":"1986"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB34","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/BF01200120","article-title":"relativized isomorphisms of NP-completeness","volume":"3","author":"Goldsmith","year":"1993","journal-title":"Computat. Complexity"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB35","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1142\/S0129054190000217","article-title":"On the notion of linear-time computability","volume":"1","author":"Graedel","year":"1990","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB36","series-title":"Proc. Logic at Botik '89","article-title":"Nearly-linear time","author":"Gurevich","year":"1989"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB37","series-title":"Technical Report OSU-CISRC-6\/93-TR24","article-title":"On isolating an odd number of elements and its applications to complexity theory","author":"Gupta","year":"1993"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB38","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/321356.321362","article-title":"Two-way simulation of multitape Turing machines","volume":"13","author":"Hennie","year":"1966","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB39","series-title":"Proc. 10th Ann. Symp. on Theoretical Aspects of Computer Science","first-page":"196","article-title":"Counting, selecting, and sorting by query-bounded machines","volume":"Vol. 665","author":"Hoene","year":"1993"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB40","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02088290","article-title":"Absolute results concerning one-way functions and their applications","volume":"22","author":"Homer","year":"1989","journal-title":"Math. System. Theory"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB41","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB42","series-title":"Complexity Theory Retrospective","first-page":"82","article-title":"Self-reducibility: the effects of internal structure on computational complexity","author":"Joseph","year":"1990"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB43","series-title":"Proc. 34th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"177","article-title":"The complexity and distribution of hard problems","author":"Juedes","year":"1993"},{"issue":"1","key":"10.1016\/0304-3975(95)00031-Q_BIB44","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1109\/18.108255","article-title":"Fast decoding of codes from algebraic plane curves","volume":"38","author":"Justesen","year":"1992","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB45","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1137\/0209003","article-title":"Refining nondeterminism in relativized polynomial-time bounded computations","volume":"9","author":"Kintala","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB46","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(82)90139-9","article-title":"Some observations on the probabilistic algorithms and NP-hard problems","volume":"14","author":"Ko","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB47","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0304-3975(87)90078-8","article-title":"On helping by robust oracle machines","volume":"52","author":"Ko","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB48","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","article-title":"The complexity of optimization problems","volume":"36","author":"Krentel","year":"1988","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB49","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01683260","article-title":"Relativization of questions about log-space computability","volume":"10","author":"Ladner","year":"1976","journal-title":"Math. System. Theory"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB50","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1993"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB51","series-title":"Proc. 8th Ann. IEEE Conf. on Structure in Complexity Theory","first-page":"158","article-title":"The quantitative structure of exponential time","author":"Lutz","year":"1993"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB52","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB53","series-title":"Proc. 8th Ann. IEEE Conf. on Structure in Complexity Theory","first-page":"52","article-title":"P-selective sets, and reducing search to decision vs. self-reducibility","author":"Naik","year":"1993"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB54","series-title":"Proc. 22nd Ann. ACM Symp. on the Theory of Computing","first-page":"213","article-title":"Small-bias probability spaces: efficient constructions and applications","author":"Naor","year":"1990"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB55","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/0222053","article-title":"Small-bias probability spaces: efficient constructions and applications","volume":"22","author":"Naor","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB56","series-title":"The 6th GI Conference on Theoretical Computer Science","article-title":"Two remarks on the power of counting","author":"Papadimitriou","year":"1983"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB57","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/322123.322138","article-title":"Relations among complexity measures","volume":"26","author":"Pippenger","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB58","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0209024","article-title":"Probabilistic algorithms in finite fields","volume":"9","author":"Rabin","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB59","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1145\/193820.193839","article-title":"The quasilinear isomorphism challenge","volume":"25","author":"Regan","year":"1994","journal-title":"SIGACT News"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB60","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(91)90177-4","article-title":"An O(T log T) reduction from RAM computations to satisfiability","volume":"82","author":"Robson","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB61","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1145\/322047.322060","article-title":"Satisfiability is quasilinear complete in NQL","volume":"25","author":"Schnorr","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB62","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0304-3975(85)90158-6","article-title":"Robust algorithms: a different approach to oracles","volume":"40","author":"Sch\u00f6ning","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB63","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01744288","article-title":"P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP","volume":"13","author":"Selman","year":"1979","journal-title":"Math. System. Theory"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB64","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1137\/0217062","article-title":"Natural self-reducible sets","volume":"17","author":"Selman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB65","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0022-0000(05)80009-1","article-title":"A taxonomy of complexity classes of functions","volume":"48","author":"Selman","year":"1994","journal-title":"J. Comput. System. Sci."},{"issue":"1","key":"10.1016\/0304-3975(95)00031-Q_BIB66","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1109\/18.179365","article-title":"A Justesen construction of binary concatenated codes than asymptotically meet the Zyablov bound for low rate","volume":"39","author":"Shen","year":"1993","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB67","series-title":"Proc. 29th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"283","article-title":"New algorithms for finding irreducible polynomials over finite fields","author":"Shoup","year":"1988"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB68","article-title":"On the complexity of the satisfiability problem and the structure of NP","author":"Stearns","year":"1986"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB69","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02090776","article-title":"Power indices and easier hard problems","volume":"23","author":"Stearns","year":"1990","journal-title":"Math. System. Theory"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB70","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB71","article-title":"Efficient checking of polynomials and proofs and the hardness of approximation problems","author":"Sudan","year":"1992"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB72","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1137\/0220053","article-title":"PP is as hard as the polynomial-time hierarchy","volume":"20","author":"Toda","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB73","series-title":"Proc. 1st Ann. IEEE Conf. on Structure in Complexity Theory","first-page":"347","article-title":"Bounded oracles and complexity classes inside linear space","volume":"Vol. 223","author":"Tretkoff","year":"1986"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB74","article-title":"Algebraic-Geometric Codes, Mathematics and Its Applications","author":"Tsfasman","year":"1991"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB75","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","article-title":"NP is as easy as detecting unique solutions","volume":"47","author":"Valiant","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB76","first-page":"1","article-title":"Machine models and simulations","volume":"Vol. A","author":"van Emde Boas","year":"1990"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB77","series-title":"Proc. 32nd Ann. IEEE Symp. on Foundations of Computer Science","first-page":"384","article-title":"Efficient exponentiation in finite fields","author":"von zur Gathen","year":"1991"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB78","series-title":"Computational Complexity","author":"Wagner","year":"1986"},{"key":"10.1016\/0304-3975(95)00031-Q_BIB79","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0022-0000(85)90040-6","article-title":"Relativized circuit complexity","volume":"31","author":"Wilson","year":"1995","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB80","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","article-title":"Complete sets and the polynomial-time hierarchy","volume":"3","author":"Wrathall","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00031-Q_BIB81","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/0207018","article-title":"Rudimentary predicates and relative computation","volume":"7","author":"Wrathall","year":"1978","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500031Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500031Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:55:09Z","timestamp":1555376109000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759500031Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":82,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["030439759500031Q"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00031-q","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}