{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T03:32:05Z","timestamp":1768879925192,"version":"3.49.0"},"reference-count":81,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"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":8539,"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":[[1990,3]]},"DOI":"10.1016\/0304-3975(90)90192-k","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T21:44:32Z","timestamp":1034286272000},"page":"95-132","source":"Crossref","is-referenced-by-count":151,"title":["A complexity theory of efficient parallel algorithms"],"prefix":"10.1016","volume":"71","author":[{"given":"Clyde P.","family":"Kruskal","sequence":"first","affiliation":[]},{"given":"Larry","family":"Rudolph","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Snir","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90192-K_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02122548","article-title":"A random NC algorithm for depth first search","volume":"8","author":"Aggarwal","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/0304-3975(90)90192-K_BIB2","first-page":"173","article-title":"Virtual memory algorithms","author":"Aggarwal","year":"1988","journal-title":"Proc. 20th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(90)90192-K_BIB3","series-title":"Proc. 15th Int. Colloquium on Automata, Languages and Programming","first-page":"1","article-title":"Communication complexity of PRAM's","volume":"317","author":"Aggarwal","year":"1988"},{"key":"10.1016\/0304-3975(90)90192-K_BIB4","first-page":"11","article-title":"On communication latency in PRAM computations","author":"Aggarwal","year":"1989","journal-title":"Proc. ACM Symp. on Parallel Algorithms and Architectures"},{"key":"10.1016\/0304-3975(90)90192-K_BIB5","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(90)90192-K_BIB6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0022-0000(89)90035-4","article-title":"Optimal parallel selection has complexity O(log log n)","volume":"38","author":"Ajtal","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90192-K_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"Sorting in c log n parallel steps","volume":"3","author":"Ajtal","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0304-3975(90)90192-K_BIB8","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0216053","article-title":"Deterministic simulation of idealized parallel computers on more realistic ones","volume":"16","author":"Alt","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB9","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1145\/2402.322387","article-title":"Efficiency of synchronous versus asynchronous distributed systems","volume":"30","author":"Arjomandi","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(90)90192-K_BIB10","first-page":"307","article-title":"Sorting networks and their applications","volume":"32","author":"Batcher","year":"1968","journal-title":"Proc. AFIPS"},{"key":"10.1016\/0304-3975(90)90192-K_BIB11","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1109\/TC.1978.1674957","article-title":"Optimal sorting algorithms for parallel computers","volume":"27","author":"Baudet","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB12","series-title":"Proc. Workshop on Parallel Processing: Logic Organization and Technology (WOPPLOT 86)","first-page":"206","article-title":"Parallel algorithms and the classification of problems","volume":"253","author":"Bertoni","year":"1986"},{"key":"10.1016\/0304-3975(90)90192-K_BIB13","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0218014","article-title":"Adaptive bitonic sorting: an optimal parallel algorithm for shared memory machines","volume":"18","author":"Bilardi","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB14","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine-independent theory of the complexity of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(90)90192-K_BIB15","first-page":"338","article-title":"Routing, merging and sorting on parallel models of computation","author":"Borodin","year":"1982","journal-title":"Proc. 14th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(90)90192-K_BIB16","series-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"Borodin","year":"1975"},{"key":"10.1016\/0304-3975(90)90192-K_BIB17","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"The parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(90)90192-K_BIB18","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","article-title":"New hash functions and their use in authentication and set equality","volume":"22","author":"Carter","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90192-K_BIB19","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1145\/358628.358650","article-title":"Efficient parallel algorithms for some graph problems","volume":"25","author":"Chin","year":"1982","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(90)90192-K_BIB20","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB21","first-page":"478","article-title":"Approximate and exact parallel scheduling with applications to list, tree and graph problems","author":"Cole","year":"1986","journal-title":"Proc. 27th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(90)90192-K_BIB22","first-page":"99","article-title":"Toward a complexity theory of synchronous parallel computations","volume":"XXVII","author":"Cook","year":"1981","journal-title":"Enseign. Math."},{"key":"10.1016\/0304-3975(90)90192-K_BIB23","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","article-title":"Upper and lower time bounds for parallel random access machines without simultaneous writes","volume":"15","author":"Cook","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB24","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1137\/0205040","article-title":"Fast parallel inversion algorithms","volume":"5","author":"Csanky","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB25","series-title":"3rd Aegean Workshop on Computing, AWOC 88","first-page":"456","article-title":"Cubesort: an optimal sorting algorithm for feasible parallel computers","volume":"319","author":"Cypher","year":"1988"},{"key":"10.1016\/0304-3975(90)90192-K_BIB26","unstructured":"Martin Dietzfelbinger, private communication."},{"key":"10.1016\/0304-3975(90)90192-K_BIB27","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1145\/50087.50096","article-title":"Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation","volume":"31","author":"Driscoll","year":"1988","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(90)90192-K_BIB28","series-title":"Proc. 13th Int. Colloquium on Automata, Languages and Programming","first-page":"95","article-title":"Parallel random access machines with owned global memory and deterministic context free language recognition","volume":"226","author":"Dymond","year":"1986"},{"key":"10.1016\/0304-3975(90)90192-K_BIB29","first-page":"21","article-title":"Parallel graph processing using depth-first search","author":"Eckstein","year":"1977","journal-title":"Conf. on Theoretical Computer Science at the University of Waterloo"},{"key":"10.1016\/0304-3975(90)90192-K_BIB30","first-page":"114","article-title":"Parallelism in random access machines","author":"Fortune","year":"1978","journal-title":"Proc. 10th ACM Symp. Theory of Computing"},{"key":"10.1016\/0304-3975(90)90192-K_BIB31","series-title":"Technical Report TR 79-07-03 CS","article-title":"Generalized iterative arrays","author":"Furer","year":"1979"},{"key":"10.1016\/0304-3975(90)90192-K_BIB32","first-page":"492","article-title":"An optimal randomized parallel algorithm for finding connected components in a graph","author":"Gazit","year":"1986","journal-title":"Proc. 27th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(90)90192-K_BIB33","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1109\/SFCS.1988.21959","article-title":"Sublinear-time parallel algorithms for matching and related problems","author":"Goldberg","year":"1988","journal-title":"29th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(90)90192-K_BIB34","first-page":"89","article-title":"A unified approach to models of synchronous parallel machines","author":"Goldschlager","year":"1978","journal-title":"Proc. 10th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(90)90192-K_BIB35","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/TC.1983.1676201","article-title":"The NYU Ultracomputer\u2014designing an MIMD parallel machine","volume":"32","author":"Gottlieb","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB36","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1145\/62.322423","article-title":"Complexity results for permuting data and other computations on parallel processots","volume":"31","author":"Gottlieb","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(90)90192-K_BIB37","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1137\/0909041","article-title":"Development of parallel methods for a 1024-processor hypercube","volume":"9","author":"Gustafson","year":"1988","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB38","series-title":"An optimal linked list prefix algorithm on local memory computer TR 111-88","author":"Han","year":"1987"},{"key":"10.1016\/0304-3975(90)90192-K_BIB39","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/2422.322412","article-title":"Bounding fan-out in logical networks","volume":"31","author":"Hoover","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(90)90192-K_BIB40","unstructured":"H.J. Hoover and W.L. Ruzzo, A compendium of problems complete for P. Manuscript."},{"key":"10.1016\/0304-3975(90)90192-K_BIB41","first-page":"160","article-title":"Parallel hashing\u2014an efficient implementation of shared memory","author":"Karlin","year":"1986","journal-title":"Proc. 18th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(90)90192-K_BIB42","unstructured":"R.M. Karp and V. Ramachandran, A survey of parallel algorithms for shared-memory machines. Report no. UCB\/CSD 88\/408, Computer Science Division (EECS), University of California, Berkeley, CA, U.S.A."},{"key":"10.1016\/0304-3975(90)90192-K_BIB43","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0022-0000(88)90027-X","article-title":"The complexity of parallel search","volume":"36","author":"Karp","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90192-K_BIB44","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02579407","article-title":"Constructing a maximum matching is in random NC","volume":"6","author":"Karp","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0304-3975(90)90192-K_BIB45","unstructured":"R. Koch, T. Leighton, B. Maggs, S. Rao and A. Rosenberg, Work-preserving simulations of fixed-connection network, Manuscript."},{"key":"10.1016\/0304-3975(90)90192-K_BIB46","series-title":"Proc. 3rd Aegaen Workshop in Computing, AWOC 88","first-page":"101","article-title":"Optimal parallel evaluation of tree-structured computations for raking (extended abstract)","volume":"319","author":"Kosaraju","year":"1988"},{"key":"10.1016\/0304-3975(90)90192-K_BIB47","first-page":"219","article-title":"Algorithms for replace-add based paracomputers","author":"Kruskal","year":"1982","journal-title":"Proc. Int. Conf. on Parallel Processing"},{"key":"10.1016\/0304-3975(90)90192-K_BIB48","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TC.1983.1676138","article-title":"Searching, merging, and sorting in parallel computation","volume":"32","author":"Kruskal","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB49","series-title":"Control Flow and Data Flow: Concepts of Distributed Programming","first-page":"331","article-title":"Performance bounds on parallel processors: an optimistic view","volume":"14","author":"Kruskal","year":"1985"},{"key":"10.1016\/0304-3975(90)90192-K_BIB50","first-page":"278","article-title":"Parallel prefix on fully connected direct connection machine","author":"Kruskal","year":"1986","journal-title":"Proc. Int. Conf. on Parallel Processing"},{"key":"10.1016\/0304-3975(90)90192-K_BIB51","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1145\/48022.48024","article-title":"Efficient synchronization in multiprocessors with shared memory","volume":"10","author":"Kruskal","year":"1988","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0304-3975(90)90192-K_BIB52","first-page":"869","article-title":"Efficient parallel algorithms for graph problems","author":"Kruskal","year":"1986","journal-title":"Proc. Int. Conf. on Parallel Processing"},{"key":"10.1016\/0304-3975(90)90192-K_BIB53","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","article-title":"Parallel computation and conflicts in memory accesses","volume":"14","author":"Kucera","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(90)90192-K_BIB54","series-title":"The Structure of Computers and Computations","author":"Kuck","year":"1978"},{"key":"10.1016\/0304-3975(90)90192-K_BIB55","first-page":"965","article-title":"Tight bounds on the complexity of parallel sorting","volume":"34","author":"Leighton","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB56","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1981.6312171","article-title":"A fast parallel algorithm for routing in permutation networks","volume":"30","author":"Lev","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB57","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(81)90109-2","article-title":"On describing the behavior an implementation of distributed systems","volume":"13","author":"Lynch","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90192-K_BIB58","series-title":"Ultracomputer Note 2","article-title":"Recurrent Ultracomputers are not log N-Fast","author":"Meertens","year":"1979"},{"key":"10.1016\/0304-3975(90)90192-K_BIB59","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF00264615","article-title":"Randomized and deterministic simulations of PRAMs by parallel machines with restricted granualarity of parallel memories","volume":"21","author":"Mehlhorn","year":"1984","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(90)90192-K_BIB60","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579206","article-title":"Matching is as easy as matrix inversion","volume":"7","author":"Mulmuley","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0304-3975(90)90192-K_BIB61","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TC.1981.6312172","article-title":"Data broadcasting in SIMD computers","volume":"30","author":"Nassimi","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB62","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1145\/321450.321457","article-title":"An adaptation of the fast Fourier transform for parallel processing","volume":"15","author":"Pease","year":"1968","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(90)90192-K_BIB63","first-page":"1032","article-title":"Sorting and selecting in rounds","volume":"6","author":"Pippenger","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB64","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1109\/SFCS.1987.32","article-title":"How to emulate shared memory","author":"Ranade","year":"1987","journal-title":"Proc. 28th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(90)90192-K_BIB65","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(85)90024-9","article-title":"Depth-first search is inherently sequential","volume":"20","author":"Reif","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(90)90192-K_BIB66","first-page":"496","article-title":"An optimal parallel algorithm for integer sorting","author":"Reif","year":"1985","journal-title":"Proc. 26th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(90)90192-K_BIB67","series-title":"Ph.D. Thesis","article-title":"Software structures for ultraparallel computing","author":"Rudolph","year":"1982"},{"key":"10.1016\/0304-3975(90)90192-K_BIB68","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357114.357116","article-title":"Ultracomputers","volume":"2","author":"Schwartz","year":"1980","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0304-3975(90)90192-K_BIB69","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","article-title":"An O(log n) parallel connectivity algorithm","volume":"3","author":"Shiloach","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(90)90192-K_BIB70","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1137\/0214051","article-title":"On parallel searching","volume":"14","author":"Snir","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB71","unstructured":"M. Snir, Asynchronous parallel computations, Manuscript."},{"key":"10.1016\/0304-3975(90)90192-K_BIB72","series-title":"IBM Tech. Rep. RC 13742","article-title":"Size depth trade-offs for monotone arithmetic circuits","author":"Snir","year":"1988"},{"key":"10.1016\/0304-3975(90)90192-K_BIB73","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/7531.7926","article-title":"How to share memory in a distributed system","volume":"34","author":"Upfal","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(90)90192-K_BIB74","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","article-title":"Parallelism in comparison problems","volume":"4","author":"Valiant","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB75","article-title":"Structures for highly parallel computing","volume":"Vol. A","author":"Valiant","year":"1990"},{"key":"10.1016\/0304-3975(90)90192-K_BIB76","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1137\/0212043","article-title":"Fast parallel computation of polynomials using few processors","volume":"12","author":"Valiant","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB77","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1109\/TC.1986.1676783","article-title":"New classes for parallel complexity: a study of unification and other complete problems for P","volume":"35","author":"Vitter","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(90)90192-K_BIB78","first-page":"294","article-title":"A combinatorial limit to the computing power of VLSI circuits","author":"Vuillemin","year":"1980","journal-title":"Proc. 21st Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(90)90192-K_BIB79","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/S0019-9958(83)80003-5","article-title":"Dynamic parallel memories","volume":"56","author":"Vishkin","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(90)90192-K_BIB80","first-page":"924","article-title":"Parallel algorithms for bucket sorting and the data dependent prefix problem","author":"Wagner","year":"1986","journal-title":"Proc. Int. Conf. on Parallel Processing"},{"key":"10.1016\/0304-3975(90)90192-K_BIB81","series-title":"An efficient and fast parallel connected component algorithm","author":"Wagner","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090192K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090192K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T07:16:53Z","timestamp":1580887013000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090192K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":81,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["030439759090192K"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90192-k","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,3]]}}}