[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_byId_6e1e2105-e3a0-410b-9107-06c8a7ba7180":3,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:6e1e2105-e3a0-410b-9107-06c8a7ba7180,\"}":105},{"code":4,"data":5,"meta":18},"SUCCESS",{"id":6,"createTime":7,"updateTime":8,"relativeEntities":9,"slug":10,"properties":11,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":20,"manageAffiliations":57,"indexDatabases":65,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},"6e1e2105-e3a0-410b-9107-06c8a7ba7180","2023-12-05T08:24:13.033+00:00","2025-11-21T09:51:59.904+00:00",[],"Parallel-Computing",{"issn":12,"title":14},{"VOID":13},"01678191",{"EN":15},"Parallel Computing","PUBLISHER","PENDING",null,0,[21,27,33,39,45,51],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":23,"label":24,"description":26,"parentId":18,"standard":18,"scholarHubFieldId":18},"6a3cb349-a9fc-40fb-9aa8-c9946de1e629",[],{"EN":25},"Artificial Intelligence",{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":29,"label":30,"description":32,"parentId":18,"standard":18,"scholarHubFieldId":18},"aae089e7-8b62-4df4-ab86-aada3693b3f8",[],{"EN":31},"Software",{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":35,"label":36,"description":38,"parentId":18,"standard":18,"scholarHubFieldId":18},"f0f0ec9c-bb68-4288-a6f1-ee3d47dc35eb",[],{"EN":37},"Computer Networks and Communications",{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":41,"label":42,"description":44,"parentId":18,"standard":18,"scholarHubFieldId":18},"cfe20487-5108-4c23-a284-2aedca5fb76d",[],{"EN":43},"Theoretical Computer Science",{},{"id":46,"createTime":18,"updateTime":18,"relativeEntities":47,"label":48,"description":50,"parentId":18,"standard":18,"scholarHubFieldId":18},"6dbce0ad-8fe9-432e-b415-2441d8c2f0bd",[],{"EN":49},"Hardware and Architecture",{},{"id":52,"createTime":18,"updateTime":18,"relativeEntities":53,"label":54,"description":56,"parentId":18,"standard":18,"scholarHubFieldId":18},"4e896d33-26c2-4e3f-a97e-e17cfeda3425",[],{"EN":55},"Computer Graphics and Computer-Aided Design",{},[58],{"id":59,"createTime":18,"updateTime":18,"relativeEntities":60,"slug":18,"properties":61,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":64,"statistic":18},"c749757b-dddf-4e6f-9697-b9c441adc06c",[],{"title":62},{"EN":63},"Elsevier",[],[66,83],{"id":67,"indexDatabase":68,"url":80,"indexYears":18,"academicFieldIds":81,"indexDatabaseRanking":18},"db3add98-9d5d-4862-a774-f1661dcf4e9a",{"id":69,"createTime":18,"updateTime":18,"relativeEntities":70,"label":71,"description":73,"key":76,"publicationTags":77,"standard":18},"a4921856-b128-4d9f-8f1f-e80813d3bbd4",[],{"EN":72,"VI":72},"ISI\u002FSCIE - Science Citation Index Expanded",{"EN":74,"VI":75},"SCIE database","Cơ sở dữ liệu SCIE","scie",[78,79],"SCIE","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0167-8191",[82],"874c55e0-262a-4246-b3d1-85e02c3c09db",{"id":84,"indexDatabase":85,"url":95,"indexYears":96,"academicFieldIds":97,"indexDatabaseRanking":104},"c2771a68-6db2-4b20-825f-b67a996b5539",{"id":86,"createTime":18,"updateTime":18,"relativeEntities":87,"label":88,"description":90,"key":92,"publicationTags":93,"standard":18},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9",[],{"EN":89,"VI":89},"Scopus - Elsevier",{"EN":89,"VI":91},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[94],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F26138","1984-2025",[98,99,100,101,102,103],"8f050cfc-6be8-4218-91ba-e890405f0438","ea95f5ee-62c8-4ccb-8e3e-d3a8bc9e97cb","d5abd5bd-04fc-4adb-ad3e-286daf3b4967","f8ab36fc-bc72-48f2-a425-9f3e042f2272","b4ee5f56-1514-428f-b517-37576cea076b","ee665440-0967-40f8-92e7-239e7375196a","SCOPUS__Q2",{"meta":106,"data":108},{"total":107},"1388",[109,344,522,640,761,902,1234,1342,1453,1562],{"id":110,"createTime":111,"updateTime":112,"relativeEntities":113,"slug":114,"properties":115,"entityType":122,"verifyStatus":123,"verifyTime":124,"verifyNote":125,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":126,"fullTextUrl":18,"authors":127,"publicationType":146,"publisherRelationship":147,"citationCount":19,"citationInfo":204,"publishDate":207,"publishYear":205,"citationAnalyzeStatus":208,"lastCitationAnalyze":209,"indexDatabases":210,"openAccess":18,"references":211,"isForceReanalyzing":343},"fe203ff5-7d50-4c38-8064-f4065828602b","2023-12-24T01:16:22.611+00:00","2026-08-16T00:55:58.430+00:00",[],"Partitioning-strategies-for-structured-multiblock-grids",{"title":116,"gsPaper":118,"doi":120},{"EN":117},"Partitioning strategies for structured multiblock grids",{"VOID":119},"[\"13465640332959231434\"]",{"VOID":121},"10.1016\u002Fs0167-8191(00)00044-2","PUBLICATION","VERIFIED","2024-05-05T11:42:22.369+00:00","Auto Verify","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0167819100000442",[128],{"id":129,"sortIndex":19,"researcher":18,"roles":130,"affiliations":132,"properties":141,"displayName":143,"givenName":18,"familyName":18},"79c45c01-260c-427b-88ca-7c216573d33f",[131],"AUTHOR",[133],{"id":134,"sortIndex":19,"affiliation":135,"properties":18},"605830ed-70d4-43b8-a5a5-e904ea2448e3",{"id":134,"createTime":18,"updateTime":18,"relativeEntities":136,"slug":18,"properties":137,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":140,"statistic":18},[],{"title":138},{"VI":139},"Computer Science and Engineering, University of California, San Diego, 9500 Gilman Dr. La Jolla, CA 92093-0114, USA",[],{"title":142,"gsAuthor":144},{"VI":143},"J Rantakokko",{"VOID":145},"[\"sRvwsJAAAAAJ\"]","ARTICLE",{"url":126,"publisher":148,"properties":199},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":149,"slug":10,"properties":150,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":153,"manageAffiliations":178,"indexDatabases":184,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":151,"title":152},{"VOID":13},{"EN":15},[154,158,162,166,170,174],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":155,"label":156,"description":157,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":159,"label":160,"description":161,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":163,"label":164,"description":165,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":167,"label":168,"description":169,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},{"id":46,"createTime":18,"updateTime":18,"relativeEntities":171,"label":172,"description":173,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":49},{},{"id":52,"createTime":18,"updateTime":18,"relativeEntities":175,"label":176,"description":177,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":55},{},[179],{"id":59,"createTime":18,"updateTime":18,"relativeEntities":180,"slug":18,"properties":181,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":183,"statistic":18},[],{"title":182},{"EN":63},[],[185,192],{"id":67,"indexDatabase":186,"url":80,"indexYears":18,"academicFieldIds":191,"indexDatabaseRanking":18},{"id":69,"createTime":18,"updateTime":18,"relativeEntities":187,"label":188,"description":189,"key":76,"publicationTags":190,"standard":18},[],{"EN":72,"VI":72},{"EN":74,"VI":75},[78,79],[82],{"id":84,"indexDatabase":193,"url":95,"indexYears":96,"academicFieldIds":198,"indexDatabaseRanking":104},{"id":86,"createTime":18,"updateTime":18,"relativeEntities":194,"label":195,"description":196,"key":92,"publicationTags":197,"standard":18},[],{"EN":89,"VI":89},{"EN":89,"VI":91},[94],[98,99,100,101,102,103],{"pages":200,"volume":202},{"VOID":201},"1661-1680",{"VOID":203},"26",{"total":19,"publishYear":205,"statisticByYear":206},2000,{},"2000-11-01","ERROR_IN_ANALYZE_CITATION","2026-08-16T00:55:58.429+00:00",[104,78],[212,219,222,228,234,237,244,247,250,255,258,261,268,275,278,285,288,291,295,298,301,307,310,313,319,326,333,337,340],{"id":18,"text":213,"url":214,"identifiers":215},"Ålund, 1997, Parallel single and multigrid solution of industrial compressible flow problems, Computers and Fluids, 26, 775, 10.1016\u002FS0045-7930(97)00018-2","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fs0045-7930(97)00018-2",{"mag":216,"openalex":217,"doi":218},"2076832469","W2076832469","10.1016\u002Fs0045-7930(97)00018-2",{"id":18,"text":220,"url":18,"identifiers":221},"C. Chase, K. Crowley, J. Saltz, A. Reeves, Parallelization of Irregularly Coupled Regular Meshes, ICASE Report No. 92-1, NASA Langley Research Center, Hampton, VA, 1992",{},{"id":223,"text":224,"url":225,"identifiers":226},"4c68646b-0035-4279-8000-0006b275d4fa","G. Chesshire, V.K. Naik, An Environment for Parallel and Distributed Computation with Application to Overlapping Grids, IBM, T.J. Watson Research Center Yorktown Heights, NY 10598, 1993","https:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10440-022-00541-7",{"doi":227},"10.1007\u002Fs10440-022-00541-7",{"id":229,"text":230,"url":231,"identifiers":232},"75cfbaa6-4dae-4df8-952c-726efdc6371c","Y.P. Chien, F. Carpenter, A. Ecer, H.U. Akay, Load balancing for parallel computation of fluid dynamics problems, in: Ecer et al. (Eds.), Proceedings of the Parallel Computational Fluid Dynamics – New Trends and Advances, Elsevier, Amsterdam, 1995","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002F004578259400048R",{"doi":233},"10.1016\u002F0045-7825(94)00048-r",{"id":18,"text":235,"url":18,"identifiers":236},"R. Enander, Grid patching and residual smoothing for computations of steady state solutions of first order hyperbolic systems, Thesis, Department of Scientific Computing, Uppsala University, Uppsala, 1991",{},{"id":18,"text":238,"url":239,"identifiers":240},"Evans, 1994, Load balancing with network partitioning using host groups, Parallel Computing, 20, 325, 10.1016\u002FS0167-8191(06)80016-5","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fs0167-8191(06)80016-5",{"mag":241,"openalex":242,"doi":243},"2003991774","W2003991774","10.1016\u002Fs0167-8191(06)80016-5",{"id":223,"text":245,"url":225,"identifiers":246},"S.J. Fink, S.B. Baden, Runtime support for multi-tier programming of block-structured applications on SMP clusters, in: Proceedings of the ISCOPE 97: Scientific Computing in Object-Oriented Parallel Environments, Lecture Notes in Computer Science 1343, Springer, New York, 1997",{"doi":227},{"id":223,"text":248,"url":225,"identifiers":249},"B. Hendrickson, R. Leland, A multilevel algorithm for partitioning graphs, in: Proceedings of the Supercomputing'95, 1995",{"doi":227},{"id":18,"text":251,"url":252,"identifiers":253},"Häuser, 1992, Parallel computing in aerospace using multiblock grids part 1: application to grid generation, Concurrency, 4, 357, 10.1002\u002Fcpe.4330040503","http:\u002F\u002Fdx.doi.org\u002F10.1002\u002Fcpe.4330040503",{"doi":254},"10.1002\u002Fcpe.4330040503",{"id":223,"text":256,"url":225,"identifiers":257},"M.A. Iqbal, J.H. Saltz, S.H. Bohkari, Performance tradeoffs in static and dynamic load balancing strategies, Technical Report 86-13, ICASE, NASA Langley Research Center, Hampton, VA, 1986",{"doi":227},{"id":223,"text":259,"url":225,"identifiers":260},"G. Karypis, V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, Technical Report, University of Minnesota, Department of Computer Science, Minneapolis, 1995",{"doi":227},{"id":18,"text":262,"url":263,"identifiers":264},"DeKeyser, 1994, Run-time load balancing support for a parallel multiblock Euler\u002FNavier–Stokes code with adaptive refinement on distributed memory computers, Parallel Computing, 20, 1069, 10.1016\u002F0167-8191(94)90069-8","https:\u002F\u002Fdoi.org\u002F10.1016\u002F0167-8191(94)90069-8",{"mag":265,"openalex":266,"doi":267},"2050167412","W2050167412","10.1016\u002F0167-8191(94)90069-8",{"id":18,"text":269,"url":270,"identifiers":271},"Liebrock, 1997, Automatic data distribution for composite grid applications, Scientific Programming, 6, 95, 10.1155\u002F1997\u002F174748","https:\u002F\u002Fdoi.org\u002F10.1155\u002F1997\u002F174748",{"mag":272,"openalex":273,"doi":274},"1968707605","W1968707605","10.1155\u002F1997\u002F174748",{"id":223,"text":276,"url":225,"identifiers":277},"F. Manne, T. Sørvik, Partitioning an array onto a mesh of processors, in: Proceedings of the PARA'96, Workshop on Applied Parallel Computing in Industrial Problems and Optimization, Lecture notes in computer science 1184, Springer, Berlin, pp. 467–477",{"doi":227},{"id":18,"text":279,"url":280,"identifiers":281},"Mushtaq, 1996, A multiblock solution process for the equations of fluid dynamics on a network of transputers, Advances in Engineering Software, 26, 133, 10.1016\u002F0965-9978(95)00124-7","https:\u002F\u002Fdoi.org\u002F10.1016\u002F0965-9978(95)00124-7",{"mag":282,"openalex":283,"doi":284},"1967180955","W1967180955","10.1016\u002F0965-9978(95)00124-7",{"id":223,"text":286,"url":225,"identifiers":287},"C. deNicola, R. Tognaccini, P. Visingardi, Multiblock structured algorithms in parallel cfd, in: Ecer et al. (Eds.), Proceedings of the Parallel Computational Fluid Dynamics-Implementations and Results using Parallel Computers, Elsevier, Amsterdam, 1996",{"doi":227},{"id":223,"text":289,"url":225,"identifiers":290},"P. Olsson, J. Rantakokko, M. Thuné, Software tools for parallel CFD on composite grids, in: Ecer et al. (Eds.), Proceedings of the Parallel Computational Fluid Dynamics-Implementations and Results using Parallel Computers, Elsevier, Amsterdam, 1996",{"doi":227},{"id":18,"text":292,"url":18,"identifiers":293},"Rantakokko, 1998, A framework for partitioning structured grids with inhomo-geneous workload, Parallel Algorithms and Applications, 13, 135, 10.1080\u002F01495739808947364",{"doi":294},"10.1080\u002F01495739808947364",{"id":18,"text":296,"url":18,"identifiers":297},"J. Rantakokko, Data partitioning methods and parallel block-oriented PDE solvers, Ph.D. thesis, Department of Scientific Computing, Uppsala University, Sweden, 1998",{},{"id":223,"text":299,"url":225,"identifiers":300},"J. Rantakokko, Comparison of partitioning strategies for PDE solvers on multiblock grids, in: B. Kågström, J. Dongarra, E. Elmroth, J. Wasniewski (Eds.), Proceedings of PARA'98, Applied Parallel Computing, Fourth International Workshop, PARA'98, Lecture Notes in Computer Science, No. 1541, Springer, Berlin, 1998",{"doi":227},{"id":302,"text":303,"url":304,"identifiers":305},"982c18fd-e6f5-4b40-99bb-a1c8db4d57d6","Sawley, 1995, A comparison of parallel programming models for multiblock flow computations, Journal of Computational Physics, 122, 280, 10.1006\u002Fjcph.1995.1213","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0021999185712132",{"doi":306},"10.1006\u002Fjcph.1995.1213",{"id":18,"text":308,"url":18,"identifiers":309},"M.L. Sawley, J.K. Tegnér, C.M. Bergman, A serial data-parallel multi-block method for compressible flow, in: Ecer et al. (Eds.), Proceedings of the Parallel Computational Fluid Dynamics – New Trends and Advances, Elsevier, Amsterdam, 1995",{},{"id":223,"text":311,"url":225,"identifiers":312},"K. Shimano, C. Arakawa, Numerical simulation of incompressible flow on parallel computer with the domain decomposition technique, in: Satofuka et al. (Eds.), Proceedings of the Parallel Computational Fluid Dynamics – New Algorithms and Applications, Elsevier, Amsterdam, 1995",{"doi":227},{"id":314,"text":315,"url":316,"identifiers":317},"1e13f1aa-d570-4071-9d0b-1881b3a8d691","Simon, 1991, Partitioning of unstructured problems for parallel processing, Computing Systems in Engineering, 2, 135, 10.1016\u002F0956-0521(91)90014-V","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002F095605219190014V",{"doi":318},"10.1016\u002F0956-0521(91)90014-v",{"id":18,"text":320,"url":321,"identifiers":322},"Thuné, 1991, Straightforward partitioning of composite grids for explicit difference methods, Parallel Computing, 17, 665, 10.1016\u002FS0167-8191(05)80056-0","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fs0167-8191(05)80056-0",{"mag":323,"openalex":324,"doi":325},"2004452520","W2004452520","10.1016\u002Fs0167-8191(05)80056-0",{"id":18,"text":327,"url":328,"identifiers":329},"Thuné, 1992, The partitioning problem for a class of data parallel algorithms, Parallel Computing, 18, 867, 10.1016\u002F0167-8191(92)90033-4","https:\u002F\u002Fdoi.org\u002F10.1016\u002F0167-8191(92)90033-4",{"mag":330,"openalex":331,"doi":332},"2040990903","W2040990903","10.1016\u002F0167-8191(92)90033-4",{"id":18,"text":334,"url":18,"identifiers":335},"Thuné, 1997, Partitioning strategies for composite grids, Parallel Algorithms and Applications, 11, 325, 10.1080\u002F10637199708915601",{"doi":336},"10.1080\u002F10637199708915601",{"id":18,"text":338,"url":18,"identifiers":339},"R.F. Van der Wijngaart, Personal communication",{},{"id":18,"text":341,"url":18,"identifiers":342},"D. Quagliarella, Optimal domain decomposition for parallel multiblock flow-field solvers using genetic algorithms, in: Satofuka et al. (Eds.), Proceedings of the Parallel Computational Fluid Dynamics – New Algorithms and Applications, Elsevier, Amsterdam, 1995",{},false,{"id":345,"createTime":346,"updateTime":347,"relativeEntities":348,"slug":349,"properties":350,"entityType":122,"verifyStatus":123,"verifyTime":357,"verifyNote":125,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":358,"fullTextUrl":18,"authors":359,"publicationType":146,"publisherRelationship":393,"citationCount":450,"citationInfo":451,"publishDate":454,"publishYear":452,"citationAnalyzeStatus":208,"lastCitationAnalyze":455,"indexDatabases":456,"openAccess":18,"references":457,"isForceReanalyzing":343},"30ac45ce-6454-4856-8019-a03f44504219","2024-01-08T18:40:31.391+00:00","2026-07-30T20:18:12.138+00:00",[],"Performance-of-parallel-algorithms-for-the-evaluation-of-power-series",{"title":351,"gsPaper":353,"doi":355},{"EN":352},"Performance of parallel algorithms for the evaluation of power series",{"VOID":354},"[\"14241255650263558583\"]",{"VOID":356},"10.1016\u002F0167-8191(94)90076-0","2024-04-26T16:49:28.050+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002F0167819194900760",[360,377],{"id":361,"sortIndex":19,"researcher":18,"roles":362,"affiliations":363,"properties":372,"displayName":374,"givenName":18,"familyName":18},"effb9311-7e64-4a82-890f-20dd642e3c08",[131],[364],{"id":365,"sortIndex":19,"affiliation":366,"properties":18},"16c06a5e-4da9-4148-88aa-c2ad0eb3342f",{"id":365,"createTime":18,"updateTime":18,"relativeEntities":367,"slug":18,"properties":368,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":371,"statistic":18},[],{"title":369},{"VI":370},"Algorithm Design Group, Department of Computer Science, King's College London, Strand, London WC2R 2LS, UK",[],{"title":373,"gsAuthor":375},{"VI":374},"Richard E. Overill",{"VOID":376},"[\"7nEJuhMAAAAJ\"]",{"id":378,"sortIndex":379,"researcher":18,"roles":380,"affiliations":381,"properties":390,"displayName":392,"givenName":18,"familyName":18},"00092008-499a-45eb-84be-400b128a6737",1,[131],[382],{"id":383,"sortIndex":19,"affiliation":384,"properties":18},"e7b7d435-dafd-49f1-bf2d-21ddf4ec0dc3",{"id":383,"createTime":18,"updateTime":18,"relativeEntities":385,"slug":18,"properties":386,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":389,"statistic":18},[],{"title":387},{"VI":388},"Rutherford Appleton Laboratory, Chilton, Oxfordshire OX11 0QX, UK",[],{"title":391},{"VI":392},"Stephen Wilson",{"url":358,"publisher":394,"properties":445},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":395,"slug":10,"properties":396,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":399,"manageAffiliations":424,"indexDatabases":430,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":397,"title":398},{"VOID":13},{"EN":15},[400,404,408,412,416,420],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":401,"label":402,"description":403,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":405,"label":406,"description":407,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":409,"label":410,"description":411,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":413,"label":414,"description":415,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},{"id":46,"createTime":18,"updateTime":18,"relativeEntities":417,"label":418,"description":419,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":49},{},{"id":52,"createTime":18,"updateTime":18,"relativeEntities":421,"label":422,"description":423,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":55},{},[425],{"id":59,"createTime":18,"updateTime":18,"relativeEntities":426,"slug":18,"properties":427,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":429,"statistic":18},[],{"title":428},{"EN":63},[],[431,438],{"id":67,"indexDatabase":432,"url":80,"indexYears":18,"academicFieldIds":437,"indexDatabaseRanking":18},{"id":69,"createTime":18,"updateTime":18,"relativeEntities":433,"label":434,"description":435,"key":76,"publicationTags":436,"standard":18},[],{"EN":72,"VI":72},{"EN":74,"VI":75},[78,79],[82],{"id":84,"indexDatabase":439,"url":95,"indexYears":96,"academicFieldIds":444,"indexDatabaseRanking":104},{"id":86,"createTime":18,"updateTime":18,"relativeEntities":440,"label":441,"description":442,"key":92,"publicationTags":443,"standard":18},[],{"EN":89,"VI":89},{"EN":89,"VI":91},[94],[98,99,100,101,102,103],{"pages":446,"volume":448},{"VOID":447},"1205-1213",{"VOID":449},"20",6,{"total":450,"publishYear":452,"statisticByYear":453},1994,{"1997":379,"1999":379,"2000":379,"2003":379,"2013":379,"2020":379},"1994-08-01","2026-07-30T20:18:12.137+00:00",[104,78],[458,461,464,467,470,475,478,481,488,491,498,501,504,507,510,513,516,519],{"id":18,"text":459,"url":18,"identifiers":460},"Brent, 1973, The parallel evaluation of arithmetic expressions in logarithmic time, 83",{},{"id":18,"text":462,"url":18,"identifiers":463},"Borodin, 1975, The Computational Complexity of Algebraic and Numeric Problems, 132",{},{"id":18,"text":465,"url":18,"identifiers":466},"Mikloško, 1984, Complexity of parallel algorithms, 47",{},{"id":223,"text":468,"url":225,"identifiers":469},"Estrin, 1960, Organization of computer systems — The fixed plus variable structure computer, 33",{"doi":227},{"id":18,"text":471,"url":472,"identifiers":473},"Dorn, 1962, Generalizations of Horner's rule for polynomial evaluation, IBM J. Res.&Dev., 6, 239, 10.1147\u002Frd.62.0239","http:\u002F\u002Fdx.doi.org\u002F10.1147\u002Frd.62.0239",{"doi":474},"10.1147\u002Frd.62.0239",{"id":223,"text":476,"url":225,"identifiers":477},"Muraoka, 1971, Parallelism exposure and exploitation in programs",{"doi":227},{"id":18,"text":479,"url":18,"identifiers":480},"Munro, 1971, Optimal algorithms for polynomial evaluation",{},{"id":18,"text":482,"url":483,"identifiers":484},"Munro, 1973, Optimal algorithms for parallel polynomial evaluation, J. Comput.&Sysytem Sci., 7, 189, 10.1016\u002FS0022-0000(73)80043-1","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fs0022-0000(73)80043-1",{"mag":485,"openalex":486,"doi":487},"1995782589","W1995782589","10.1016\u002Fs0022-0000(73)80043-1",{"id":18,"text":489,"url":18,"identifiers":490},"Stoyanova, 1988, Stability and error estimates of some parallel algorithms for polynomial evaluation, Doklady Bolgarskoi Akkademii Nauk, 41, 25",{},{"id":18,"text":492,"url":493,"identifiers":494},"Butel, 1992, A Cray-2 versus CM-2 comparison using several polynomial benchmarks, Parallel Comput., 18, 931, 10.1016\u002F0167-8191(92)90038-9","https:\u002F\u002Fdoi.org\u002F10.1016\u002F0167-8191(92)90038-9",{"mag":495,"openalex":496,"doi":497},"2079201050","W2079201050","10.1016\u002F0167-8191(92)90038-9",{"id":18,"text":499,"url":18,"identifiers":500},"Pizer, 1975, Numerical Computing & Mathematical Analysis, 236",{},{"id":18,"text":502,"url":18,"identifiers":503},"Overill, 1991, On the rapid parallel evaluation of power series, Supercomput., VIII, 38",{},{"id":223,"text":505,"url":225,"identifiers":506},"Wilson, 1990, Numerical recipes for supercomputers, 81",{"doi":227},{"id":18,"text":508,"url":18,"identifiers":509},"Hockney, 1988, 2, 89",{},{"id":18,"text":511,"url":18,"identifiers":512},"Hockney, 1988, 2, 95",{},{"id":18,"text":514,"url":18,"identifiers":515},"Hockney, 1988, 2, 142",{},{"id":18,"text":517,"url":18,"identifiers":518},"Hockney, 1988, 2, 465",{},{"id":223,"text":520,"url":225,"identifiers":521},"Hockney, 1992, A framework for benchmark performance analysis, Supercomput., IX, 9",{"doi":227},{"id":523,"createTime":524,"updateTime":525,"relativeEntities":526,"slug":527,"properties":528,"entityType":122,"verifyStatus":123,"verifyTime":537,"verifyNote":125,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":538,"fullTextUrl":18,"authors":539,"publicationType":146,"publisherRelationship":570,"citationCount":627,"citationInfo":628,"publishDate":636,"publishYear":629,"citationAnalyzeStatus":637,"lastCitationAnalyze":638,"indexDatabases":639,"openAccess":18,"references":18,"isForceReanalyzing":343},"62391c5c-dbb3-4383-8140-f3eca585f931","2023-11-25T00:53:37.456+00:00","2026-07-27T17:27:04.903+00:00",[],"Parallel-computation-in-atmospheric-chemical-modeling",{"title":529,"gsPaper":531,"references":533,"doi":535},{"EN":530},"Parallel computation in atmospheric chemical modeling",{"VOID":532},"[\"13736788381774218651\"]",{"VOID":534},"Abramson, 1994, Modelling photochemical pollution using parallel distributed computing platforms, 817\nBott, 1989, A positive definite advection scheme obtained by nonlinear renormalization of the advective fluxes, Mon. Wea. Rev., 117, 1006, 10.1175\u002F1520-0493(1989)117\u003C1006:APDASO>2.0.CO;2\nBrown, 1989, Reduced storage matrix methods in stiff ODE systems, J. Appl. Math. Comput., 31, 40, 10.1016\u002F0096-3003(89)90110-0\nButler, 1994, Monitors, messages, and clusters —the p4 parallel programming system, Parallel Computing, 20, 547, 10.1016\u002F0167-8191(94)90028-0\nCarmichael, 1986, A second generation model for regional-scale transport\u002Fchemistry\u002Fdeposition, Atmospheric Environment, 20, 173, 10.1016\u002F0004-6981(86)90218-0\nCarver, 1978, The method of lines and the advection equation, Simulation, 31, 59, 10.1177\u002F003754977803100205\nChang, 1987, A three-dimensional eulerian acid deposition model: physical concepts and formulation, J. Geophys. Res., 92, 14681, 10.1029\u002FJD092iD12p14681\nDabdub, 1994, Air quality modeling on Massively Parallel Computers, Atmospheric Environment, 28, 1679, 10.1016\u002F1352-2310(94)90313-1\nDabdub, 1994, Numerical advective schemes used in air quality models-sequential and parallel implementation, Atmospheric Environment, 28, 3369, 10.1016\u002F1352-2310(94)00124-4\nDabdub, 1995, Extrapolation techniques used in the solution of stiff ODEs associated with chemical kinetics of air quality models, Atmospheric Environment, 29, 403, 10.1016\u002F1352-2310(94)00282-P\nEmde, 1992, Solving conservation laws with parabolic and cubic splines, Mon. Wea. Rev., 120, 82, 10.1175\u002F1520-0493(1992)120\u003C0482:SCLWPA>2.0.CO;2\nGazdag, 1973, Numerical convective schemes based on accurate computation of space derivatives, J. Comp. Phys., 13, 100, 10.1016\u002F0021-9991(73)90128-9\nHarley, 1993, Photochemical modeling of the Southern California air quality study, Environ. Sci. Technol., 27, 378, 10.1021\u002Fes00039a019\nHesstvedt, 1978, Quasi-steady-state approximations in air pollution modeling: comparison of two numerical schemes for oxidant prediction, Int. J. Chem. Kinetics, 10, 971, 10.1002\u002Fkin.550100907\nHindmarsh, 1980, LSODE and LSODI, two new initial value ordinary differential equation solvers, ACM-SIGNUM, 15-4, 10, 10.1145\u002F1218052.1218054\nKahaner, 1989\nJohnson, 1987\nMcRae, 1982, Development of a second generation mathematical model for urban air pollution-I. Model formulation, Atmospheric Environment, 16, 679, 10.1016\u002F0004-6981(82)90386-9\nMcRae, 1982, Numerical solution of the atmospheric diffusion equation for chemically reactive flows, J. Comp. Phys., 45, 1, 10.1016\u002F0021-9991(82)90101-2\nMorris, 1990, User's guide for the Urban Airshed Model — Volume I: User's manual for UAM (CB-IV)\nNational Research Council, 1991\nOdman, 1992, A comparison of fast chemical kinetic solvers for air-quality modeling, Atmospheric Environment, 26, 1783, 10.1016\u002F0960-1686(92)90075-V\nPai, 1992, Parallel computations of turbulent-diffusion in convective boundary-layers on shared-memory machines, Atmospheric Environment, 26A, 2425, 10.1016\u002F0960-1686(92)90372-R\nPai, 1993, On parallelization of time-dependent 3-dimensional transport-equations in air-pollution modeling, Atmospheric Environment, 27, 2009, 10.1016\u002F0960-1686(93)90274-3\nPilinis, 1988, Development and evaluation of an eulerian photochemical gas-aerosol model, Atmospheric Environment, 22, 1985, 10.1016\u002F0004-6981(88)90088-1\nSaylor, 1993, On the parallelization of a comprehensive regional-scale air quality model, Atmospheric Environment, 27A, 625, 10.1016\u002F0960-1686(93)90220-S\nSchere, 1991\nSchiesser, 1991\nSeinfeld, 1986\nSeinfeld, 1989, Urban air pollution: state of the science, Science, 243, 745, 10.1126\u002Fscience.243.4892.745\nShin, 1992, Comprehensive air pollution modeling on a multiprocessor system, Computers Chem. Engng., 16, 805, 10.1016\u002F0098-1354(92)80062-E\nSmolarkiewicz, 1984, A simple positive definite advection scheme with small implicit diffusion, Mon. Wea. Rev., 111, 479, 10.1175\u002F1520-0493(1983)111\u003C0479:ASPDAS>2.0.CO;2\nWalker, 1994, The design of a standard message-passing interface for distributed-memory concurrent computers, Parallel Computing, 20, 657, 10.1016\u002F0167-8191(94)90033-7\nWexler, 1994, Modelling urban and regional aerosol —I. Model development, Atmospheric Environment, 28, 531, 10.1016\u002F1352-2310(94)90129-5\nVenkatram, 1988, Testing a comprehensive acid deposition model, Atmospheric Environment, 22, 737, 10.1016\u002F0004-6981(88)90011-X\nYoung, 1977, A numerical technique for solving stiff ordinary differential equations associated with the chemical kinetics of reactive-flow problems, J. Phys. Chem., 81, 2424, 10.1021\u002Fj100540a018",{"VOID":536},"10.1016\u002F0167-8191(95)00063-1","2024-06-26T23:36:14.770+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002F0167819195000631",[540,557],{"id":541,"sortIndex":19,"researcher":18,"roles":542,"affiliations":543,"properties":552,"displayName":554,"givenName":18,"familyName":18},"4de829ce-80d7-4654-9db5-e10b0780345a",[131],[544],{"id":545,"sortIndex":19,"affiliation":546,"properties":18},"029db9b4-d8ff-4f6d-9176-a7ff21a67d18",{"id":545,"createTime":18,"updateTime":18,"relativeEntities":547,"slug":18,"properties":548,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":551,"statistic":18},[],{"title":549},{"VI":550},"Department of Chemical Engineering. California Institute of Technology. Pasadena. CA 91125. USA",[],{"title":553,"gsAuthor":555},{"VI":554},"Donald Dabdub",{"VOID":556},"[\"QlLKRz4AAAAJ\"]",{"id":558,"sortIndex":379,"researcher":18,"roles":559,"affiliations":560,"properties":567,"displayName":569,"givenName":18,"familyName":18},"c2a606c8-c5ad-4413-9d5e-eac91a232ff8",[131],[561],{"id":545,"sortIndex":19,"affiliation":562,"properties":18},{"id":545,"createTime":18,"updateTime":18,"relativeEntities":563,"slug":18,"properties":564,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":566,"statistic":18},[],{"title":565},{"VI":550},[],{"title":568},{"VI":569},"John H. Seinfeld",{"url":538,"publisher":571,"properties":622},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":572,"slug":10,"properties":573,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":576,"manageAffiliations":601,"indexDatabases":607,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":574,"title":575},{"VOID":13},{"EN":15},[577,581,585,589,593,597],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":578,"label":579,"description":580,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":582,"label":583,"description":584,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":586,"label":587,"description":588,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":590,"label":591,"description":592,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},{"id":46,"createTime":18,"updateTime":18,"relativeEntities":594,"label":595,"description":596,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":49},{},{"id":52,"createTime":18,"updateTime":18,"relativeEntities":598,"label":599,"description":600,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":55},{},[602],{"id":59,"createTime":18,"updateTime":18,"relativeEntities":603,"slug":18,"properties":604,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":606,"statistic":18},[],{"title":605},{"EN":63},[],[608,615],{"id":67,"indexDatabase":609,"url":80,"indexYears":18,"academicFieldIds":614,"indexDatabaseRanking":18},{"id":69,"createTime":18,"updateTime":18,"relativeEntities":610,"label":611,"description":612,"key":76,"publicationTags":613,"standard":18},[],{"EN":72,"VI":72},{"EN":74,"VI":75},[78,79],[82],{"id":84,"indexDatabase":616,"url":95,"indexYears":96,"academicFieldIds":621,"indexDatabaseRanking":104},{"id":86,"createTime":18,"updateTime":18,"relativeEntities":617,"label":618,"description":619,"key":92,"publicationTags":620,"standard":18},[],{"EN":89,"VI":89},{"EN":89,"VI":91},[94],[98,99,100,101,102,103],{"pages":623,"volume":625},{"VOID":624},"111-130",{"VOID":626},"22",61,{"total":627,"publishYear":629,"statisticByYear":630},1996,{"1996":631,"1997":450,"1998":631,"1999":632,"2000":633,"2001":379,"2002":634,"2003":379,"2004":379,"2006":635,"2007":635,"2008":379,"2009":379,"2010":631,"2011":635,"2013":635,"2016":633,"2017":379,"2018":631,"2021":631,"2022":379,"2024":379,"2026":379},2,8,4,5,3,"1996-01-01","DONE_ANALYZE_CITATION","2026-07-27T17:27:04.902+00:00",[104,78],{"id":641,"createTime":642,"updateTime":643,"relativeEntities":644,"slug":645,"properties":646,"entityType":122,"verifyStatus":123,"verifyTime":655,"verifyNote":125,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":656,"fullTextUrl":18,"authors":657,"publicationType":146,"publisherRelationship":699,"citationCount":18,"citationInfo":18,"publishDate":756,"publishYear":757,"citationAnalyzeStatus":758,"lastCitationAnalyze":759,"indexDatabases":760,"openAccess":18,"references":18,"isForceReanalyzing":343},"07225f02-7cea-48bf-815a-909237a64d71","2024-01-05T10:00:01.993+00:00","2026-07-23T11:49:49.082+00:00",[],"Parallel-graph-component-labelling-with-GPUs-and-CUDA",{"title":647,"gsPaper":649,"references":651,"doi":653},{"EN":648},"Parallel graph component labelling with GPUs and CUDA",{"VOID":650},"[]",{"VOID":652},"Kawasaki, 1966, Diffusion constants near the critical point for time dependent Ising model I, Physical Review, 145, 224, 10.1103\u002FPhysRev.145.224\nBarbosa, 2004, On the phase transitions of graph coloring and independent sets, Physica A, 343, 401, 10.1016\u002Fj.physa.2004.05.055\nHarish, 2007, Accelerating large graph algorithms on the GPU using CUDA, vol. 4873, 197\nGebremedhin, 2000, Scalable Parallel Graph Coloring Algorithms, Concurrency: Practice and Experience, 12, 1131, 10.1002\u002F1096-9128(200010)12:12\u003C1131::AID-CPE528>3.0.CO;2-2\nBoman, 2005, A scalable parallel graph coloring algorithm for distributed memory computers, 241\nBaillie, 1991, Cluster identification algorithms for spin models – sequential and parallel, Concurrency: Practice and Experience, 3, 129, 10.1002\u002Fcpe.4330030205\nBaillie, 1991, Comparison of cluster algorithms for two-dimensional Potts models, Physical Review B, 43, 10617, 10.1103\u002FPhysRevB.43.10617\nDewar, 1987, Parallel computation of cluster properties: application to 2d percolation, Journal of Physics A – Mathematical and General, 20, 985, 10.1088\u002F0305-4470\u002F20\u002F4\u002F032\nHawick, 1992, Relaxation in the dilute Ising model, Journal of Magnetism and Magnetic Materials, 104–107, 423, 10.1016\u002F0304-8853(92)90862-I\nP.M. Flanders, Effective use of SIMD processor arrays, in: Parallel Digital Processors, IEE, Portugal, 1988, pp. 143–147, iEE Conf. Pub. No. 298.\nHillis, 1985\nGould, 1988\nCormen, 2001\nBrelaz, 1979, New methods to color the vertices of a graph, Communications of the ACM, 22, 251, 10.1145\u002F359094.359101\nGallian, 2005, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 16, DS6\nPress, 1988\nK. Hawick, D. Playne, Hypercubic storage in arbitrary dimensions, Tech. Rep., Massey University, 2009.\nErdös, 1959, On random graphs, Publicationes Mathematicae, 6, 290, 10.5486\u002FPMD.1959.6.3-4.12\nJeong, 2000, The large-scale organization of metabolic networks, Nature, 407, 651, 10.1038\u002F35036627\nFell, 2000, The small world of metabolism, Nature Biotechnology, 18, 1121, 10.1038\u002F81025\nWagner, 2001, The small world inside large metabolic networks, Proceedings of the Royal Society B, 268, 1803, 10.1098\u002Frspb.2001.1711\nNewman, 2001, The structure of scientific collaboration networks, PNAS, 98, 404, 10.1073\u002Fpnas.021544898\nNewman, 2003, Ego-centered networks and the ripple effect, Social Networks, 25, 83, 10.1016\u002FS0378-8733(02)00039-4\nMilgram, 1967, The small-world problem, Psychology Today, 1, 61\nLiljeros, 2001, The web of human sexual contacts, Nature, 411, 907, 10.1038\u002F35082140\nLiben-Nowell, 2008, Tracing information flow on a global scale using Internet chain-letter data, PNAS, 105, 4633, 10.1073\u002Fpnas.0708471105\nAlbert, 1999, Diameter of the World-Wide Web, Nature, 401, 130, 10.1038\u002F43601\nNVIDIA®Corporation, CUDA®2.1 Programming Guide, 2009, \u003Chttp:\u002F\u002Fwww.nvidia.com\u002F> (accessed May 2009).\nLeist, 2009, Exploiting graphical processing units for data-parallel scientific applications, Concurrency and Computation: Practice and Experience, 21, 2400, 10.1002\u002Fcpe.1462\nWu, 2009, Optimizing two-pass connected-component labeling algorithms, Pattern Analysis and Applications, 12, 117, 10.1007\u002Fs10044-008-0109-y\nK. Suzuki, I. Horiba, N. Sugie, Fast connected-component labeling based on sequential local operations in the course of forward raster scan followed by backward raster scan, in: Proceedings of the 15th International Conference on Pattern Recognition (ICPR’00), vol. 2, 2000, pp. 434–437.\nBarabási, 1999, Emergence of scaling in random networks, Science, 286, 509, 10.1126\u002Fscience.286.5439.509\nPrice, 1965, Networks of scientific papers, Science, 149, 510, 10.1126\u002Fscience.149.3683.510\nWatts, 1998, Collective dynamics of ‘small-world’ networks, Nature, 393, 440, 10.1038\u002F30918\nK.A. Hawick, H.A. James, Ising model scaling behaviour on z-preserving small-world networks, Tech. Rep. arXiv.org Condensed Matter: cond-mat\u002F0611763, Information and Mathematical Sciences, Massey University, February 2006.",{"VOID":654},"10.1016\u002Fj.parco.2010.07.002","2024-06-25T08:25:52.497+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0167819110001055",[658,673,686],{"id":659,"sortIndex":19,"researcher":18,"roles":660,"affiliations":661,"properties":670,"displayName":672,"givenName":18,"familyName":18},"67609153-3f92-4f2b-8d3f-011ee92575a5",[131],[662],{"id":663,"sortIndex":19,"affiliation":664,"properties":18},"143c0f45-112a-4515-b836-b20f867ebe47",{"id":663,"createTime":18,"updateTime":18,"relativeEntities":665,"slug":18,"properties":666,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":669,"statistic":18},[],{"title":667},{"VI":668},"Institute of Information and Mathematical Sciences, Massey University – Albany, North Shore 102-904, Auckland, New Zealand",[],{"title":671},{"VI":672},"K.A. Hawick",{"id":674,"sortIndex":379,"researcher":18,"roles":675,"affiliations":676,"properties":683,"displayName":685,"givenName":18,"familyName":18},"aa5123ae-5616-4f1e-aba7-af71026b76da",[131],[677],{"id":663,"sortIndex":19,"affiliation":678,"properties":18},{"id":663,"createTime":18,"updateTime":18,"relativeEntities":679,"slug":18,"properties":680,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":682,"statistic":18},[],{"title":681},{"VI":668},[],{"title":684},{"VI":685},"A. Leist",{"id":687,"sortIndex":631,"researcher":18,"roles":688,"affiliations":689,"properties":696,"displayName":698,"givenName":18,"familyName":18},"d6e2a1cd-a43f-4d65-9a26-b29fe8ebd6e6",[131],[690],{"id":663,"sortIndex":19,"affiliation":691,"properties":18},{"id":663,"createTime":18,"updateTime":18,"relativeEntities":692,"slug":18,"properties":693,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":695,"statistic":18},[],{"title":694},{"VI":668},[],{"title":697},{"VI":698},"D.P. Playne",{"url":656,"publisher":700,"properties":751},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":701,"slug":10,"properties":702,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":705,"manageAffiliations":730,"indexDatabases":736,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":703,"title":704},{"VOID":13},{"EN":15},[706,710,714,718,722,726],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":707,"label":708,"description":709,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":711,"label":712,"description":713,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":715,"label":716,"description":717,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":719,"label":720,"description":721,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},{"id":46,"createTime":18,"updateTime":18,"relativeEntities":723,"label":724,"description":725,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":49},{},{"id":52,"createTime":18,"updateTime":18,"relativeEntities":727,"label":728,"description":729,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":55},{},[731],{"id":59,"createTime":18,"updateTime":18,"relativeEntities":732,"slug":18,"properties":733,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":735,"statistic":18},[],{"title":734},{"EN":63},[],[737,744],{"id":67,"indexDatabase":738,"url":80,"indexYears":18,"academicFieldIds":743,"indexDatabaseRanking":18},{"id":69,"createTime":18,"updateTime":18,"relativeEntities":739,"label":740,"description":741,"key":76,"publicationTags":742,"standard":18},[],{"EN":72,"VI":72},{"EN":74,"VI":75},[78,79],[82],{"id":84,"indexDatabase":745,"url":95,"indexYears":96,"academicFieldIds":750,"indexDatabaseRanking":104},{"id":86,"createTime":18,"updateTime":18,"relativeEntities":746,"label":747,"description":748,"key":92,"publicationTags":749,"standard":18},[],{"EN":89,"VI":89},{"EN":89,"VI":91},[94],[98,99,100,101,102,103],{"pages":752,"volume":754},{"VOID":753},"655-678",{"VOID":755},"36","2010-12-01",2010,"ERROR_IN_GET_PLATFORM_ID","2026-07-23T11:49:49.081+00:00",[104,78],{"id":762,"createTime":763,"updateTime":764,"relativeEntities":765,"slug":766,"properties":767,"entityType":122,"verifyStatus":123,"verifyTime":775,"verifyNote":125,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":776,"fullTextUrl":18,"authors":777,"publicationType":146,"publisherRelationship":841,"citationCount":18,"citationInfo":18,"publishDate":898,"publishYear":899,"citationAnalyzeStatus":758,"lastCitationAnalyze":900,"indexDatabases":901,"openAccess":18,"references":18,"isForceReanalyzing":343},"5e04d355-4bf1-47c5-815c-063e7e2463d6","2024-01-22T01:49:41.857+00:00","2026-07-22T21:53:14.921+00:00",[],"Cellular-automata-for-polymer-simulation-with-application-to-polymer-melts-and-polymer-collapse-including-implications-for-protein-folding",{"title":768,"gsPaper":770,"references":771,"doi":773},{"EN":769},"Cellular automata for polymer simulation with application to polymer melts and polymer collapse including implications for protein folding",{"VOID":650},{"VOID":772},"Bar-Yam, 1997\nK. Binder, (Ed.), Applications of Monte Carlo Methods in Statistical Physics, second ed., Springer, Berlin, 1987\nCarmesin, 1990, Static and dynamic properties of two-dimensional polymer melts, J. Phys. France, 51, 915, 10.1051\u002Fjphys:019900051010091500\nChan, 1991, Polymer principles in protein structure and stability, Annu. Rev. Biophys. Biophys. Chem., 20, 447, 10.1146\u002Fannurev.bb.20.060191.002311\nCrooks, 1999, Mesostructure of polymer collapse and fractal smoothing, Phys. Rev. E, 60, 4559, 10.1103\u002FPhysRevE.60.4559\nde Gennes, 1979\nDoi, 1986\nG.D. Doolen, (Ed.), Lattice Gas Methods for Partial Differential Equations, Addison-Wesley, Reading, MA, 1990\nD. Farmer, T. Toffoli, S. Wolfram, (Eds.), Cellular Automata, North-Holland, Amsterdam, 1984\nFreire, 1995, Thermodynamics of partly folded intermediates in proteins, Annu. Rev. Biophys. Biomol. Struct., 24, 141, 10.1146\u002Fannurev.bb.24.060195.001041\nOstrovsky, 1994, Irreversible polymer collapse in 2 and 3 dimensions, Europhys. Lett., 25, 409, 10.1209\u002F0295-5075\u002F25\u002F6\u002F003\nOstrovsky, 1995, Motion of polymer ends in homopolymer and heteropolymer collapse, Biophys. J., 68, 1694, 10.1016\u002FS0006-3495(95)80347-4\nOstrovsky, 1995, Applications of parallel computing to biological problems, Annu. Rev. Biophys. Biomol. Struct., 24, 239, 10.1146\u002Fannurev.bb.24.060195.001323\nB. Ostrovsky, M.A. Smith, Y. Bar-Yam, Polymer interpenetration in 2D high density melts, Int. J. Polym. Complex Fluids (4) (1995)\nB. Ostrovsky, M.A. Smith, M. Biafore, Y. Bar-Yam, Y. Rabin, N. Margolus and T. Toffoli, Massively parallel architectures and polymer simulation, in: Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993, p. 193\nM.A. Smith, Cellular automata methods in mathematical physics, Ph.D. Thesis, MIT, Cambridge, 1994\nM.A. Smith, Y. Bar-Yam, Y. Rabin, C.H. Bennett, N. Margolus, T. Toffoli, Cellular automata simulation of polymers, in: E.B. Sirota, D. Weitz, T. Witten, J. Israelachvili (Eds.), Complex Fluids, MRS Symposium Proceedings, vol. 248, 1992, p. 483\nSmith, 1992, Parallel processing simulation of polymers, J. Comput. Polym. Sci., 2, 165\nToffoli, 1987\nS. Wolfram, (Ed.), Theory and Applications of Cellular Automata, World Scientific, Singapore, 1986",{"VOID":774},"10.1016\u002Fs0167-8191(00)00081-8","2024-06-25T14:13:47.020+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0167819100000818",[778,793,811,826],{"id":779,"sortIndex":19,"researcher":18,"roles":780,"affiliations":781,"properties":790,"displayName":792,"givenName":18,"familyName":18},"ca59923f-be5f-439a-9567-be1bb25c7989",[131],[782],{"id":783,"sortIndex":19,"affiliation":784,"properties":18},"138e552b-75c5-4df1-b2d8-0e6924e9fe32",{"id":783,"createTime":18,"updateTime":18,"relativeEntities":785,"slug":18,"properties":786,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":789,"statistic":18},[],{"title":787},{"VI":788},"Sun Microsystems Computer Company, 5 Omni Way, Chelmsford, MA 01824, USA",[],{"title":791},{"VI":792},"B. Ostrovsky",{"id":794,"sortIndex":379,"researcher":18,"roles":795,"affiliations":796,"properties":808,"displayName":810,"givenName":18,"familyName":18},"3203eda5-5fb1-43d4-8e92-2134ebcf8ca3",[131],[797],{"id":798,"sortIndex":19,"affiliation":799,"properties":805},"2d0d8464-f036-4f7d-86e7-a7f02c604c3f",{"id":798,"createTime":18,"updateTime":18,"relativeEntities":800,"slug":18,"properties":801,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":804,"statistic":18},[],{"title":802},{"VI":803},"Department of Chemistry, University of California, Berkeley, CA 94720, United States",[],{"title":806},{"VI":807},"Department of Chemistry, University of California, Berkeley, CA 94720, USA",{"title":809},{"VI":810},"G. Crooks",{"id":812,"sortIndex":631,"researcher":18,"roles":813,"affiliations":814,"properties":823,"displayName":825,"givenName":18,"familyName":18},"adcd091d-cc23-458d-a839-9a3ff947099b",[131],[815],{"id":816,"sortIndex":19,"affiliation":817,"properties":18},"deee250a-81b9-4543-b028-dbfcdf8600dc",{"id":816,"createTime":18,"updateTime":18,"relativeEntities":818,"slug":18,"properties":819,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":822,"statistic":18},[],{"title":820},{"VI":821},"Department of Molecular and Cellular Biology, Harvard University, 16 Divinity Ave, Cambridge, MA 02138, USA",[],{"title":824},{"VI":825},"M.A. Smith",{"id":827,"sortIndex":635,"researcher":18,"roles":828,"affiliations":829,"properties":838,"displayName":840,"givenName":18,"familyName":18},"2c865f64-1811-49d1-9c59-63b0238d0430",[131],[830],{"id":831,"sortIndex":19,"affiliation":832,"properties":18},"f735a73c-4d47-4e2b-907f-c14c19ac96e2",{"id":831,"createTime":18,"updateTime":18,"relativeEntities":833,"slug":18,"properties":834,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":837,"statistic":18},[],{"title":835},{"VI":836},"New England Complex Systems Institute, 24 Mt. Auburn St., Cambridge, MA 02138, USA",[],{"title":839},{"VI":840},"Y. Bar-Yam",{"url":776,"publisher":842,"properties":893},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":843,"slug":10,"properties":844,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":847,"manageAffiliations":872,"indexDatabases":878,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":845,"title":846},{"VOID":13},{"EN":15},[848,852,856,860,864,868],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":849,"label":850,"description":851,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":853,"label":854,"description":855,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":857,"label":858,"description":859,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":861,"label":862,"description":863,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},{"id":46,"createTime":18,"updateTime":18,"relativeEntities":865,"label":866,"description":867,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":49},{},{"id":52,"createTime":18,"updateTime":18,"relativeEntities":869,"label":870,"description":871,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":55},{},[873],{"id":59,"createTime":18,"updateTime":18,"relativeEntities":874,"slug":18,"properties":875,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":877,"statistic":18},[],{"title":876},{"EN":63},[],[879,886],{"id":67,"indexDatabase":880,"url":80,"indexYears":18,"academicFieldIds":885,"indexDatabaseRanking":18},{"id":69,"createTime":18,"updateTime":18,"relativeEntities":881,"label":882,"description":883,"key":76,"publicationTags":884,"standard":18},[],{"EN":72,"VI":72},{"EN":74,"VI":75},[78,79],[82],{"id":84,"indexDatabase":887,"url":95,"indexYears":96,"academicFieldIds":892,"indexDatabaseRanking":104},{"id":86,"createTime":18,"updateTime":18,"relativeEntities":888,"label":889,"description":890,"key":92,"publicationTags":891,"standard":18},[],{"EN":89,"VI":89},{"EN":89,"VI":91},[94],[98,99,100,101,102,103],{"pages":894,"volume":896},{"VOID":895},"613-641",{"VOID":897},"27","2001-04-01",2001,"2026-07-22T21:53:14.920+00:00",[104,78],{"id":903,"createTime":904,"updateTime":905,"relativeEntities":906,"slug":907,"properties":908,"entityType":122,"verifyStatus":123,"verifyTime":915,"verifyNote":125,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":916,"fullTextUrl":18,"authors":917,"publicationType":146,"publisherRelationship":995,"citationCount":379,"citationInfo":1052,"publishDate":1055,"publishYear":1053,"citationAnalyzeStatus":208,"lastCitationAnalyze":905,"indexDatabases":1056,"openAccess":18,"references":1057,"isForceReanalyzing":343},"bd7a4ed8-bf6e-482e-8034-2025a93543c7","2024-02-08T15:00:02.099+00:00","2026-07-22T01:00:05.565+00:00",[],"Reconfiguration-algorithms-for-synchronous-communication-on-switch-based-degradable-arrays",{"title":909,"gsPaper":911,"doi":913},{"EN":910},"Reconfiguration algorithms for synchronous communication on switch based degradable arrays",{"VOID":912},"[\"4132890303031110376\"]",{"VOID":914},"10.1016\u002Fj.parco.2022.102901","2024-05-02T15:30:17.246+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0167819122000084",[918,935,950,963,980],{"id":919,"sortIndex":19,"researcher":18,"roles":920,"affiliations":921,"properties":930,"displayName":932,"givenName":18,"familyName":18},"454fd1cf-7ab0-4567-97e3-761fe3aef797",[131],[922],{"id":923,"sortIndex":19,"affiliation":924,"properties":18},"ccbd380b-0584-4c3a-a21d-e9be233a6770",{"id":923,"createTime":18,"updateTime":18,"relativeEntities":925,"slug":18,"properties":926,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":929,"statistic":18},[],{"title":927},{"VI":928},"School of Computer Science and Technology, Guangdong University of Technology, 510006, China",[],{"title":931,"gsAuthor":933},{"VI":932},"Yalan Wu",{"VOID":934},"[\"sVLcusgAAAAJ\"]",{"id":936,"sortIndex":379,"researcher":18,"roles":937,"affiliations":938,"properties":945,"displayName":947,"givenName":18,"familyName":18},"76f03942-3664-4422-8b9a-0d65193ed2e7",[131],[939],{"id":923,"sortIndex":19,"affiliation":940,"properties":18},{"id":923,"createTime":18,"updateTime":18,"relativeEntities":941,"slug":18,"properties":942,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":944,"statistic":18},[],{"title":943},{"VI":928},[],{"title":946,"gsAuthor":948},{"VI":947},"Jigang Wu",{"VOID":949},"[\"Br_m_PwAAAAJ\"]",{"id":951,"sortIndex":631,"researcher":18,"roles":952,"affiliations":953,"properties":960,"displayName":962,"givenName":18,"familyName":18},"2ede354b-cd0d-4e42-95cc-435ea794db75",[131],[954],{"id":923,"sortIndex":19,"affiliation":955,"properties":18},{"id":923,"createTime":18,"updateTime":18,"relativeEntities":956,"slug":18,"properties":957,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":959,"statistic":18},[],{"title":958},{"VI":928},[],{"title":961},{"VI":962},"Peng Liu",{"id":964,"sortIndex":635,"researcher":18,"roles":965,"affiliations":966,"properties":975,"displayName":977,"givenName":18,"familyName":18},"6b54015f-6383-4b97-8a38-e56e71eeb80a",[131],[967],{"id":968,"sortIndex":19,"affiliation":969,"properties":18},"82b05365-06b7-45a2-a503-e7fe2ada61bb",{"id":968,"createTime":18,"updateTime":18,"relativeEntities":970,"slug":18,"properties":971,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":974,"statistic":18},[],{"title":972},{"VI":973},"Institute of Computing Technology, Chinese Academy of Sciences, 100190, China",[],{"title":976,"gsAuthor":978},{"VI":977},"Yinhe Han",{"VOID":979},"[\"t40cM-4AAAAJ\"]",{"id":981,"sortIndex":633,"researcher":18,"roles":982,"affiliations":983,"properties":992,"displayName":994,"givenName":18,"familyName":18},"bca98f6f-b31a-40ec-81ba-a5306ab066aa",[131],[984],{"id":985,"sortIndex":19,"affiliation":986,"properties":18},"61d5c5ed-87be-48de-9886-37ec812da8ac",{"id":985,"createTime":18,"updateTime":18,"relativeEntities":987,"slug":18,"properties":988,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":991,"statistic":18},[],{"title":989},{"VI":990},"School of Computer Science and Engineering, Nanyang Technological University, 639798 Singapore",[],{"title":993},{"VI":994},"Thambipillai Srikanthan",{"url":916,"publisher":996,"properties":1047},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":997,"slug":10,"properties":998,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":1001,"manageAffiliations":1026,"indexDatabases":1032,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":999,"title":1000},{"VOID":13},{"EN":15},[1002,1006,1010,1014,1018,1022],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":1003,"label":1004,"description":1005,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":1007,"label":1008,"description":1009,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":1011,"label":1012,"description":1013,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":1015,"label":1016,"description":1017,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},{"id":46,"createTime":18,"updateTime":18,"relativeEntities":1019,"label":1020,"description":1021,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":49},{},{"id":52,"createTime":18,"updateTime":18,"relativeEntities":1023,"label":1024,"description":1025,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":55},{},[1027],{"id":59,"createTime":18,"updateTime":18,"relativeEntities":1028,"slug":18,"properties":1029,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1031,"statistic":18},[],{"title":1030},{"EN":63},[],[1033,1040],{"id":67,"indexDatabase":1034,"url":80,"indexYears":18,"academicFieldIds":1039,"indexDatabaseRanking":18},{"id":69,"createTime":18,"updateTime":18,"relativeEntities":1035,"label":1036,"description":1037,"key":76,"publicationTags":1038,"standard":18},[],{"EN":72,"VI":72},{"EN":74,"VI":75},[78,79],[82],{"id":84,"indexDatabase":1041,"url":95,"indexYears":96,"academicFieldIds":1046,"indexDatabaseRanking":104},{"id":86,"createTime":18,"updateTime":18,"relativeEntities":1042,"label":1043,"description":1044,"key":92,"publicationTags":1045,"standard":18},[],{"EN":89,"VI":89},{"EN":89,"VI":91},[94],[98,99,100,101,102,103],{"pages":1048,"volume":1050},{"VOID":1049},"102901",{"VOID":1051},"111",{"total":379,"publishYear":1053,"statisticByYear":1054},2022,{"2023":379},"2022-07-01",[104,78],[1058,1061,1064,1067,1070,1073,1080,1087,1090,1097,1104,1111,1114,1121,1128,1135,1142,1145,1150,1153,1156,1159,1164,1171,1178,1185,1188,1195,1202,1208,1211,1214,1217,1224,1231],{"id":18,"text":1059,"url":18,"identifiers":1060},"Negrini, 1989",{},{"id":18,"text":1062,"url":18,"identifiers":1063},"Eijkhout, 2014",{},{"id":223,"text":1065,"url":225,"identifiers":1066},"W. Jigang, G. Jiang, Y. Zhang, Y. Zhu, Algorithm for communication synchronization on reconfigurable processor arrays with faults, in: IEEE International Parallel and Distributed Processing Symposium Workshops PhD Forum, 2012, pp. 266–270.",{"doi":227},{"id":223,"text":1068,"url":225,"identifiers":1069},"M.B. Stensgaard, J. Spars, ReNoC: A network-on-chip architecture with reconfigurable topology, in: ACM\u002FIEEE International Symposium on Networks-on-Chip, 2008, pp. 55–64.",{"doi":227},{"id":223,"text":1071,"url":225,"identifiers":1072},"A. Avakian, J. Nafziger, A. Panda, R. Vemuri, A reconfigurable architecture for multicore systems, in: IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum, 2010, pp. 1–8.",{"doi":227},{"id":18,"text":1074,"url":1075,"identifiers":1076},"Collet, 2011, Chip self-organization and fault tolerance in massively defective multicore arrays, IEEE Trans. Dependable Secur. Comput., 8, 207, 10.1109\u002FTDSC.2009.53","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftdsc.2009.53",{"mag":1077,"openalex":1078,"doi":1079},"2101818246","W2101818246","10.1109\u002Ftdsc.2009.53",{"id":18,"text":1081,"url":1082,"identifiers":1083},"Duraisamy, 2017, Multicast-aware high-performance wireless network-on-chip architectures, IEEE Trans. Very Large Scale Integr. (VLSI) Syst., 25, 1126, 10.1109\u002FTVLSI.2016.2612647","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftvlsi.2016.2612647",{"mag":1084,"openalex":1085,"doi":1086},"2531531221","W2531531221","10.1109\u002Ftvlsi.2016.2612647",{"id":18,"text":1088,"url":18,"identifiers":1089},"Xue, 2015, User cooperation network coding approach for NoC performance improvement, 1",{},{"id":18,"text":1091,"url":1092,"identifiers":1093},"Bogdan, 2007, Stochastic communication: A new paradigm for fault-tolerant networks-on-chip, VLSI Des., 1, 10.1155\u002F2007\u002F95348","https:\u002F\u002Fdoi.org\u002F10.1155\u002F2007\u002F95348",{"mag":1094,"openalex":1095,"doi":1096},"1975329204","W1975329204","10.1155\u002F2007\u002F95348",{"id":18,"text":1098,"url":1099,"identifiers":1100},"Bogdan, 2011, Hitting time analysis for fault-tolerant communication at nanoscale in future multiprocessor platforms, IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., 30, 1197, 10.1109\u002FTCAD.2011.2138430","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftcad.2011.2138430",{"mag":1101,"openalex":1102,"doi":1103},"2158901422","W2158901422","10.1109\u002Ftcad.2011.2138430",{"id":18,"text":1105,"url":1106,"identifiers":1107},"Xiang, 2009, Practical deadlock-free fault-tolerant routing in meshes based on the planar network fault model, IEEE Trans. Comput., 58, 620, 10.1109\u002FTC.2008.211","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftc.2008.211",{"mag":1108,"openalex":1109,"doi":1110},"2153327847","W2153327847","10.1109\u002Ftc.2008.211",{"id":223,"text":1112,"url":225,"identifiers":1113},"D. Xiang, A cost-effective scheme for network-on-chip router and interconnect testing, in: Asian Test Symposium, 2013, pp. 207–212.",{"doi":227},{"id":18,"text":1115,"url":1116,"identifiers":1117},"Akbar, 2016, An efficient fault-tolerant routing algorithm in NoCs to tolerate permanent faults, J. Supercomput., 72, 1, 10.1007\u002Fs11227-016-1749-0","https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs11227-016-1749-0",{"mag":1118,"openalex":1119,"doi":1120},"2407928780","W2407928780","10.1007\u002Fs11227-016-1749-0",{"id":18,"text":1122,"url":1123,"identifiers":1124},"Chen, 2017, Path-diversity-aware fault-tolerant routing algorithm for network-on-chip systems, IEEE Trans. Parallel Distrib. Syst., 28, 838, 10.1109\u002FTPDS.2016.2588482","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftpds.2016.2588482",{"mag":1125,"openalex":1126,"doi":1127},"2460840235","W2460840235","10.1109\u002Ftpds.2016.2588482",{"id":18,"text":1129,"url":1130,"identifiers":1131},"Kuo, 1992, Efficient reconfiguration algorithms for degradable VLSI\u002FWSI arrays, IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., 11, 1289, 10.1109\u002F43.170991","https:\u002F\u002Fdoi.org\u002F10.1109\u002F43.170991",{"mag":1132,"openalex":1133,"doi":1134},"2146393011","W2146393011","10.1109\u002F43.170991",{"id":18,"text":1136,"url":1137,"identifiers":1138},"Chen, 1997, A comprehensive reconfiguration scheme for fault-tolerant VLSI\u002FWSI array processors, IEEE Trans. Comput., 46, 1363, 10.1109\u002F12.641936","https:\u002F\u002Fdoi.org\u002F10.1109\u002F12.641936",{"mag":1139,"openalex":1140,"doi":1141},"2171918708","W2171918708","10.1109\u002F12.641936",{"id":18,"text":1143,"url":1130,"identifiers":1144},"Low, 2000, An efficient reconfiguration algorithm for degradable VLSI\u002FWSI arrays, IEEE Trans. Comput., 49, 553, 10.1109\u002F12.862215",{"mag":1132,"openalex":1133,"doi":1134},{"id":18,"text":1146,"url":1147,"identifiers":1148},"Wu, 2014, Constructing sub-arrays with short interconnects from degradable VLSI arrays, IEEE Trans. Parallel Distrib. Syst., 25, 929, 10.1109\u002FTPDS.2013.114","http:\u002F\u002Fdx.doi.org\u002F10.1109\u002Ftpds.2013.114",{"doi":1149},"10.1109\u002Ftpds.2013.114",{"id":223,"text":1151,"url":225,"identifiers":1152},"S.Y. Lin, W.C. Shen, C.C. Hsu, C.H. Chao, Fault-tolerant router with built-in self-test\u002Fself-diagnosis and fault-isolation circuits for 2D-mesh based chip multiprocessor systems, in: International Symposium on VLSI Design, Automation and Test, 2009, pp. 72–75.",{"doi":227},{"id":223,"text":1154,"url":225,"identifiers":1155},"I. Takanami, T. Horita, A built-in circuit for self-repairing mesh-connected processor arrays by direct spare replacement, in: IEEE Pacific Rim International Symposium on Dependable Computing, 2012, pp. 96–104.",{"doi":227},{"id":223,"text":1157,"url":225,"identifiers":1158},"Bruck, 1993, Fault-tolerant meshes with small degree, IEEE Trans. Comput., 51, 553",{"doi":227},{"id":18,"text":1160,"url":1161,"identifiers":1162},"Horita, 2000, Fault-tolerant processor arrays based on the 1.5-track switches with flexible spare distributions, IEEE Trans. Comput., 49, 542, 10.1109\u002F12.862214","http:\u002F\u002Fdx.doi.org\u002F10.1109\u002F12.862214",{"doi":1163},"10.1109\u002F12.862214",{"id":18,"text":1165,"url":1166,"identifiers":1167},"Low, 1997, On the reconfiguration of degradable VLSI\u002FWSI arrays, IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., 16, 1213, 10.1109\u002F43.662684","https:\u002F\u002Fdoi.org\u002F10.1109\u002F43.662684",{"mag":1168,"openalex":1169,"doi":1170},"2162584664","W2162584664","10.1109\u002F43.662684",{"id":18,"text":1172,"url":1173,"identifiers":1174},"Wu, 2006, Reconfiguration algorithms for power efficient VLSI subarrays with four-port switches, IEEE Trans. Comput., 55, 243, 10.1109\u002FTC.2006.43","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftc.2006.43",{"mag":1175,"openalex":1176,"doi":1177},"2152312767","W2152312767","10.1109\u002Ftc.2006.43",{"id":18,"text":1179,"url":1180,"identifiers":1181},"Qian, 2016, Optimal reconfiguration of high-performance VLSI subarrays with network flow, IEEE Trans. Parallel Distrib. Syst., 27, 3575, 10.1109\u002FTPDS.2016.2539958","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftpds.2016.2539958",{"mag":1182,"openalex":1183,"doi":1184},"2344157501","W2344157501","10.1109\u002Ftpds.2016.2539958",{"id":223,"text":1186,"url":225,"identifiers":1187},"Y. Fukushima, M. Fukushi, S. Horiguchi, An improved reconfiguration method for degradable processor arrays using genetic algorithm, in: IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems, 2006, pp. 353–361.",{"doi":227},{"id":18,"text":1189,"url":1190,"identifiers":1191},"Wu, 2010, Preprocessing and partial rerouting techniques for accelerating reconfiguration of degradable VLSI arrays, IEEE Trans. Very Large Scale Integr. (VLSI) Syst., 18, 315, 10.1109\u002FTVLSI.2008.2009057","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftvlsi.2008.2009057",{"mag":1192,"openalex":1193,"doi":1194},"2070784944","W2070784944","10.1109\u002Ftvlsi.2008.2009057",{"id":18,"text":1196,"url":1197,"identifiers":1198},"Qian, 2017, Efficient abstraction algorithms for accelerating reconfiguration of VLSI arrays, IEEJ Trans. Electr. Electron. Eng., 12, 759, 10.1002\u002Ftee.22463","https:\u002F\u002Fdoi.org\u002F10.1002\u002Ftee.22463",{"mag":1199,"openalex":1200,"doi":1201},"2625999319","W2625999319","10.1002\u002Ftee.22463",{"id":1203,"text":1204,"url":1205,"identifiers":1206},"7ecd5fe4-abf7-4bb6-924a-20f17d801328","Wu, 2014, Parallel reconfiguration algorithms for mesh-connected processor arrays, J. Supercomput., 69, 610, 10.1007\u002Fs11227-014-1096-y","http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs11227-014-1096-y",{"doi":1207},"10.1007\u002Fs11227-014-1096-y",{"id":223,"text":1209,"url":225,"identifiers":1210},"Y. Wu, J. Wu, Y. Miu, T. Srikanthan, Fault-driven reconfiguration algorithm for processor arrays, in: IEEE International Symposium on Parallel and Distributed Processing with Applications, 2017, pp. 519–524.",{"doi":227},{"id":223,"text":1212,"url":225,"identifiers":1213},"M. Fukushi, S. Horiguchi, Reconfiguration algorithm for degradable processor arrays based on row and column rerouting, in: IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, 2004, pp. 496–504.",{"doi":227},{"id":223,"text":1215,"url":225,"identifiers":1216},"Y. Fukushima, M. Fukushi, S. Horiguchi, A genetic approach for the reconfiguration of degradable processor arrays, in: IEEE IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, 2005, pp. 63–71.",{"doi":227},{"id":18,"text":1218,"url":1219,"identifiers":1220},"Wu, 2007, Integrated row and column rerouting for reconfiguration of VLSI arrays with four-port switches, IEEE Trans. Comput., 56, 1387, 10.1109\u002FTC.2007.1085","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftc.2007.1085",{"mag":1221,"openalex":1222,"doi":1223},"2165068028","W2165068028","10.1109\u002Ftc.2007.1085",{"id":18,"text":1225,"url":1226,"identifiers":1227},"Jiang, 2015, Reconfiguring three-dimensional processor arrays for fault-tolerance: Hardness and heuristic algorithms, IEEE Trans. Comput., 64, 2926, 10.1109\u002FTC.2015.2389846","https:\u002F\u002Fdoi.org\u002F10.1109\u002Ftc.2015.2389846",{"mag":1228,"openalex":1229,"doi":1230},"1985574589","W1985574589","10.1109\u002Ftc.2015.2389846",{"id":223,"text":1232,"url":225,"identifiers":1233},"L. Zhu, J. Wu, G. Jiang, J. Sun, Interconnection network reconstruction for fault-tolerance of torus-connected VLSI array, in: International Conference on Algorithms and Architectures for Parallel Processing, 2014, pp. 285–298.",{"doi":227},{"id":1235,"createTime":1236,"updateTime":1237,"relativeEntities":1238,"slug":1239,"properties":1240,"entityType":122,"verifyStatus":123,"verifyTime":1248,"verifyNote":125,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":1249,"fullTextUrl":18,"authors":1250,"publicationType":146,"publisherRelationship":1281,"citationCount":18,"citationInfo":18,"publishDate":1338,"publishYear":1339,"citationAnalyzeStatus":758,"lastCitationAnalyze":1340,"indexDatabases":1341,"openAccess":18,"references":18,"isForceReanalyzing":343},"4bb60453-2077-464f-815e-d0ab58d77aa3","2024-01-04T04:45:25.898+00:00","2026-07-21T10:04:50.234+00:00",[],"Skeletons-for-parallel-image-processing-an-overview-of-the-SKIPPER-project",{"title":1241,"gsPaper":1243,"references":1244,"doi":1246},{"EN":1242},"Skeletons for parallel image processing: an overview of the SKIPPER project",{"VOID":650},{"VOID":1245},"Arvind, 1982, The U-interpreter, IEEE Computer, 15, 42, 10.1109\u002FMC.1982.1653940\nArvind, 1990, Executing a program on the MIT tagged-token dataflow architecture, IEEE Transactions on Computers, 39, 300, 10.1109\u002F12.48862\nBacci, 1995, P3L: a structured high level programming language and its structured support, Concurrency: Practice and Experience, 7, 225, 10.1002\u002Fcpe.4330070305\nG.H. Botorog, H. Kuchen, SKIL: an imperative language with algorithmic skeletons for efficient distributed programming, in: International Symposium on High Performance Distributed Computing, IEEE Computer, pp 243–252\nG.H. Botorog, High-level parallel programming and the efficient implementation of numerical algorithms. Ph.D. Thesis, RWTH-Aachen, 1998\nS. Ciarpaglini, M. Danelutto, L. Folchi, C. Manconi, S. Pelagatti, anacleto: a template-based p3l compiler, in: Proceedings of the Seventh Parallel Computing Workshop (PCW ’97), Australian National University, Canberra, 1997\nCole, 1989\nCole, 1999, Algorithmic skeletons\nR. Coudarcher, J. Sérot, J.P. Dérutin, Implementation of a Skeleton-based Parallel Programming Environment Supporting Arbitrary Nesting. in: Proceedings of the 6th International Workshop on High-Level Parallel Programming Models and Supportive Environments, San Francisco, Lecture Notes in Computer Science, vol. 2026, Springer, Berlin, April 2001, pp. 71–85\nR. Coudarcher, Composition de squelettes algorithmiques: application au prototypage rapide d’applications de vision. Ph.D. Thesis, Université Blaise Pascal Clermont-Ferrand (France), 2002, in press\nM. Danelutto, S. Pelagatti, R. Ravazzolon, A. Riaudo, Parallel OCR in P3L: a case study, in: High Performance Computing and Networking, vol 1067, Lecture Notes in Computer Science, Springer, Berlin, 1996, pp. 1017–1019\nM. Danelutto, Dynamic run time support for skeletons, in: Proceedings of the ParCo99 Conference, Delft, The Netherlands, August 1999\nDanelutto, 2001, Efficient run-time support for skeletons on workstation clusters, Parallel Processing Letters, 11, 41, 10.1142\u002FS0129626401000415\nA. Dias, C. Lavarenne, M. Akil, Y. Sorel, Optimized implementation of real-time image processing algorithms on field programmable gate arrays, in: ICSP’98 Fourth International Conference on Signal Processing, Beijing, China, 1998\nD. Ginhac, Prototypage rapide d’applications parallèles de vision artificielle par squelettes fonctionnels. Ph.D. Thesis, Université Blaise Pascal Clermont-Ferrand (France), 1999\nD. Ginhac, J. Sérot, J. Dérutin, Fast prototyping of image processing applications using functional skeletons on an MIMD-DM architecture, in: IAPR Workshop on Machine Vision and Applications, Chiba, Japan, 1998, pp. 468–471\nT. Grandpierre, C. Lavarenne, Y. Sorel, Optimized rapid prototyping for real time embedded heterogeneous multiprocessors, in: Proceedings of 7th International Workshop on Hardware\u002FSoftware Co-Design, Rome, 1999\nC. Lavarenne, Y. Sorel, Modèle d’exécutif distribué temps-réel pour SynDEx INRIA Research Report, RR-3476, 1998\nP. Legrand, R. Canals, J.P. Dérutin, Edge and region segmentation processes on the parallel vision machine Transvision, in: Computer Architecture for Machine Perception, New-Orleans, USA, 1993, pp. 410–420\nMichaelson, 1995, Prototyping a parallel vision system in standard ML, Journal of Functional Programming, 5, 345, 10.1017\u002FS0956796800001398\nNajjar, 1999, Advances in the dataflow computational model, Parallel Computing, 1907, 10.1016\u002FS0167-8191(99)00070-8\nN. Scaife, P. Bristow, G. Michaelson, P. King. Engineering a parallel compiler for SML. Proceedings of the 10th International Workshop on Implementation of Functional Languages, September, 1998, pp. 213–226\nN. Scaife, A dual source parallel architecture for computer vision Ph.D. Thesis, U. Heriot-Watt, Edinburgh, 2000\nSérot, 2001, Tagged-token data-flow for skeletons, Parallel Processing Letters, 11, 10.1016\u002FS0129-6264(01)00067-1\nJ. Sérot, D. Ginhac, J. Dérutin. Skipper: a skeleton-based parallel programming environment for real-time image processing applications, in: Proceedings of 5th International Conference on Parallel Computing Technologies, 6–10 September, 1999, Lecture Notes in Computer Science, vol. 1662, Springer, Berlin, 1999, pp. 296–305\nJ. Sérot, CamlFlow: a Caml to data-flow graph translator, in: S. Gilmore (Ed.), Trends in Functional Programming, Intellect, vol 2, 2001\nSérot, 2001, Fast prototyping of parallel vision applications using functional skeletons, Journal of Machine Vision and Applications, 12, 271, 10.1007\u002Fs001380050146\nZaki, 1999, Toward scalable performance visualization with Jumpshot, High Performance Computing Applications, 13\nOnline bibliography available at http:\u002F\u002Fhypatia.dcs.qmw.ac.uk\u002FSEL-HPC\u002FArticles\u002FSkeletonArchive.html",{"VOID":1247},"10.1016\u002Fs0167-8191(02)00189-8","2024-06-26T01:30:05.627+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0167819102001898",[1251,1266],{"id":1252,"sortIndex":19,"researcher":18,"roles":1253,"affiliations":1254,"properties":1263,"displayName":1265,"givenName":18,"familyName":18},"e3c1b3ac-0bd3-4c3f-93e3-8d6b7a1ec04c",[131],[1255],{"id":1256,"sortIndex":19,"affiliation":1257,"properties":18},"2e175549-9a91-4499-8afb-ac808cf052cb",{"id":1256,"createTime":18,"updateTime":18,"relativeEntities":1258,"slug":18,"properties":1259,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1262,"statistic":18},[],{"title":1260},{"VI":1261},"LASMEA, UMR 6602 CNRS, University Blaise Pascal de Clermont-Ferrand, Campus des Cézeaux, F-63177 Aubière, France",[],{"title":1264},{"VI":1265},"Jocelyn Sérot",{"id":1267,"sortIndex":379,"researcher":18,"roles":1268,"affiliations":1269,"properties":1278,"displayName":1280,"givenName":18,"familyName":18},"fab6d067-d9e2-43f4-a326-4dedd1e28e03",[131],[1270],{"id":1271,"sortIndex":19,"affiliation":1272,"properties":18},"a7f736db-71cb-4014-be73-9ed816e45fbc",{"id":1271,"createTime":18,"updateTime":18,"relativeEntities":1273,"slug":18,"properties":1274,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1277,"statistic":18},[],{"title":1275},{"VI":1276},"LE2I, FRE 2309 CNRS, University of Burgundy, F-21078 Dijon, France",[],{"title":1279},{"VI":1280},"Dominique Ginhac",{"url":1249,"publisher":1282,"properties":1333},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1283,"slug":10,"properties":1284,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":1287,"manageAffiliations":1312,"indexDatabases":1318,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":1285,"title":1286},{"VOID":13},{"EN":15},[1288,1292,1296,1300,1304,1308],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":1289,"label":1290,"description":1291,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":1293,"label":1294,"description":1295,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":1297,"label":1298,"description":1299,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":1301,"label":1302,"description":1303,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},{"id":46,"createTime":18,"updateTime":18,"relativeEntities":1305,"label":1306,"description":1307,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":49},{},{"id":52,"createTime":18,"updateTime":18,"relativeEntities":1309,"label":1310,"description":1311,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":55},{},[1313],{"id":59,"createTime":18,"updateTime":18,"relativeEntities":1314,"slug":18,"properties":1315,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1317,"statistic":18},[],{"title":1316},{"EN":63},[],[1319,1326],{"id":67,"indexDatabase":1320,"url":80,"indexYears":18,"academicFieldIds":1325,"indexDatabaseRanking":18},{"id":69,"createTime":18,"updateTime":18,"relativeEntities":1321,"label":1322,"description":1323,"key":76,"publicationTags":1324,"standard":18},[],{"EN":72,"VI":72},{"EN":74,"VI":75},[78,79],[82],{"id":84,"indexDatabase":1327,"url":95,"indexYears":96,"academicFieldIds":1332,"indexDatabaseRanking":104},{"id":86,"createTime":18,"updateTime":18,"relativeEntities":1328,"label":1329,"description":1330,"key":92,"publicationTags":1331,"standard":18},[],{"EN":89,"VI":89},{"EN":89,"VI":91},[94],[98,99,100,101,102,103],{"pages":1334,"volume":1336},{"VOID":1335},"1685-1708",{"VOID":1337},"28","2002-12-01",2002,"2026-07-21T10:04:50.233+00:00",[104,78],{"id":1343,"createTime":1344,"updateTime":1345,"relativeEntities":1346,"slug":1347,"properties":1348,"entityType":122,"verifyStatus":123,"verifyTime":1357,"verifyNote":125,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":1358,"fullTextUrl":18,"authors":1359,"publicationType":146,"publisherRelationship":1390,"citationCount":19,"citationInfo":1447,"publishDate":1450,"publishYear":1448,"citationAnalyzeStatus":637,"lastCitationAnalyze":1451,"indexDatabases":1452,"openAccess":18,"references":18,"isForceReanalyzing":343},"f622dd87-78e2-449d-80f2-aa6ee1194b01","2024-01-14T03:23:07.763+00:00","2026-07-18T01:10:15.108+00:00",[],"Assigning-dependency-graphs-onto-processor-networks",{"title":1349,"gsPaper":1351,"references":1353,"doi":1355},{"EN":1350},"Assigning dependency graphs onto processor networks",{"VOID":1352},"[\"16247517862127167958\"]",{"VOID":1354},"Coffman, 1976\nGarey, 1979\nHwang, 1989, Scheduling precedence graphs in systems with interprocessor communication times, SIAM J. Comput., 18, 244, 10.1137\u002F0218016\nKruatrachue, 1988, Grain size determination for parallel processing, IEEE Software, 23, 10.1109\u002F52.1991\nManber, 1989\nMarkenscoff, 1986, Task allocation problems in distributed computer systems, 953\nPolychronopoulos, 1987, Processor allocation for horizontal and vertical parallelism and related speedup bounds, IEEE Trans. Comput., C-36, 410, 10.1109\u002FTC.1987.1676923\nRayward-Smith, 1987, UET scheduling with unit interprocessor communication delays, Discrete Applied Mathematics, 18, 55, 10.1016\u002F0166-218X(87)90042-4",{"VOID":1356},"10.1016\u002Fs0167-8191(05)80018-3","2024-05-15T18:01:59.584+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0167819105800183",[1360,1377],{"id":1361,"sortIndex":19,"researcher":18,"roles":1362,"affiliations":1363,"properties":1372,"displayName":1374,"givenName":18,"familyName":18},"cdabd01a-ad28-46c7-9917-8f2fff23a37c",[131],[1364],{"id":1365,"sortIndex":19,"affiliation":1366,"properties":18},"f49d48d8-fa73-4f91-905d-20f1716a9310",{"id":1365,"createTime":18,"updateTime":18,"relativeEntities":1367,"slug":18,"properties":1368,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1371,"statistic":18},[],{"title":1369},{"VI":1370},"Dept. of Computer Science, University of Edinburgh, Mayfield Road, Edinburgh EH9 3JZ, UK",[],{"title":1373,"gsAuthor":1375},{"VI":1374},"Sathiamoorthy Manoharan",{"VOID":1376},"[\"2h0XFe8AAAAJ\"]",{"id":1378,"sortIndex":379,"researcher":18,"roles":1379,"affiliations":1380,"properties":1387,"displayName":1389,"givenName":18,"familyName":18},"cb78348a-b8f7-4f67-ab85-574c207ce452",[131],[1381],{"id":1365,"sortIndex":19,"affiliation":1382,"properties":18},{"id":1365,"createTime":18,"updateTime":18,"relativeEntities":1383,"slug":18,"properties":1384,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1386,"statistic":18},[],{"title":1385},{"VI":1370},[],{"title":1388},{"VI":1389},"Peter Thanisch",{"url":1358,"publisher":1391,"properties":1442},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1392,"slug":10,"properties":1393,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":1396,"manageAffiliations":1421,"indexDatabases":1427,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":1394,"title":1395},{"VOID":13},{"EN":15},[1397,1401,1405,1409,1413,1417],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":1398,"label":1399,"description":1400,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":1402,"label":1403,"description":1404,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":1406,"label":1407,"description":1408,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":1410,"label":1411,"description":1412,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},{"id":46,"createTime":18,"updateTime":18,"relativeEntities":1414,"label":1415,"description":1416,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":49},{},{"id":52,"createTime":18,"updateTime":18,"relativeEntities":1418,"label":1419,"description":1420,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":55},{},[1422],{"id":59,"createTime":18,"updateTime":18,"relativeEntities":1423,"slug":18,"properties":1424,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1426,"statistic":18},[],{"title":1425},{"EN":63},[],[1428,1435],{"id":67,"indexDatabase":1429,"url":80,"indexYears":18,"academicFieldIds":1434,"indexDatabaseRanking":18},{"id":69,"createTime":18,"updateTime":18,"relativeEntities":1430,"label":1431,"description":1432,"key":76,"publicationTags":1433,"standard":18},[],{"EN":72,"VI":72},{"EN":74,"VI":75},[78,79],[82],{"id":84,"indexDatabase":1436,"url":95,"indexYears":96,"academicFieldIds":1441,"indexDatabaseRanking":104},{"id":86,"createTime":18,"updateTime":18,"relativeEntities":1437,"label":1438,"description":1439,"key":92,"publicationTags":1440,"standard":18},[],{"EN":89,"VI":89},{"EN":89,"VI":91},[94],[98,99,100,101,102,103],{"pages":1443,"volume":1445},{"VOID":1444},"63-73",{"VOID":1446},"17",{"total":19,"publishYear":1448,"statisticByYear":1449},1991,{},"1991-04-01","2026-07-18T01:10:15.107+00:00",[104,78],{"id":1454,"createTime":1455,"updateTime":1456,"relativeEntities":1457,"slug":1458,"properties":1459,"entityType":122,"verifyStatus":123,"verifyTime":1468,"verifyNote":125,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":1469,"fullTextUrl":18,"authors":1470,"publicationType":146,"publisherRelationship":1501,"citationCount":1557,"citationInfo":1558,"publishDate":1560,"publishYear":205,"citationAnalyzeStatus":637,"lastCitationAnalyze":1456,"indexDatabases":1561,"openAccess":18,"references":18,"isForceReanalyzing":343},"fa9b1b7b-eee6-4503-80f2-d4f296e0a96f","2023-12-11T06:06:30.440+00:00","2026-07-17T23:42:41.440+00:00",[],"An-efficient-heuristic-for-code-partitioning",{"title":1460,"gsPaper":1462,"references":1464,"doi":1466},{"EN":1461},"An efficient heuristic for code partitioning",{"VOID":1463},"[\"5248180166078723202\"]",{"VOID":1465},"M. Ayed, Automatic code partitioning for distributed memory multiprocessors, Ph.D. Thesis, University of Southern California, EE Systems Department, Computer Engineering Division, November 1996, Technical Report Number: CENG 96-36\nGerasoulis, 1993, On the granularity and clustering of directed acyclic task graphs, IEEE Transactions on Parallel and Distributed Systems, 4, 686, 10.1109\u002F71.242154\nM. Haines, W. Bohm, Towards a distributed memory implementation of sisal, Technical Report CS-91-123, Computer Science Department, Colorado State University, Fort Collins, CO 80523, November 1991\nM. Haines, W. Bohm, A comparison of explicit and implicit programming styles for distributed memory multiprocessors, Technical Report CS-93-104, Colorado State University, March 1993\nM.D. Haines, Distributed runtime support for task and data management, Ph.D. Dissertation CS-93-110, Colorado State University, August 1993\nHiranandani, 1992, Compiling fortran d for mimid distributed-memory machines, CACM, 35, 66, 10.1145\u002F135226.135230\nV. Sarkar, J. Hennessey, Compile-time partitioning and scheduling of parallel programs, in: Proceedings of the SIGPLAN 1986 Symposium on Compiler Construction, Palo Alto, CA, June 1986, ACM, New York, pp. 17–26\nV. Sarkar, J. Hennessey, Partioning parallel programs for macro-dataflow, in: Proceedings of the 1986 ACM Conference on Lisp and Functional Programming, August 1986, pp. 202–211\nV. Sarkar, Partitioning and scheduling parallel programs for execution on multiprocessors, Ph.D. Thesis CSL-TR-87-328, Stanford University, Stanford, CA 94305-2192, April 1987\nV. Sarkar, S. Skedzielewski, P. Miller, An automatically partitioning compiler for sisal, Technical Report UCRL-98289, Lawrence Livermore National Laboratory, Livermore CA 94550, December 1988\nT. Yang, Scheduling and code generation for parallel architectures, Ph.D. Thesis, Rutgers University, New Brunswick, NJ, May 1993\nYang, 1994, Dsc: scheduling parallel tasks on an unbounded number of processors, IEEE Transactions on Parallel and Distributed Systems, 5, 951, 10.1109\u002F71.308533",{"VOID":1467},"10.1016\u002Fs0167-8191(99)00110-6","2024-05-15T17:17:55.495+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0167819199001106",[1471,1486],{"id":1472,"sortIndex":19,"researcher":18,"roles":1473,"affiliations":1474,"properties":1483,"displayName":1485,"givenName":18,"familyName":18},"42d7e442-1cfa-4bfc-95b0-b82b268eb214",[131],[1475],{"id":1476,"sortIndex":19,"affiliation":1477,"properties":18},"1fb1572a-c784-4081-b87a-d4913a2dc980",{"id":1476,"createTime":18,"updateTime":18,"relativeEntities":1478,"slug":18,"properties":1479,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1482,"statistic":18},[],{"title":1480},{"VI":1481},"Department of EE-Systems, University of Southern California, Los Angeles, CA 90089-2563, USA",[],{"title":1484},{"VI":1485},"Moez Ayed",{"id":1487,"sortIndex":379,"researcher":18,"roles":1488,"affiliations":1489,"properties":1496,"displayName":1498,"givenName":18,"familyName":18},"23a52d1a-b9e3-4aee-91b3-31ecca0bad84",[131],[1490],{"id":1476,"sortIndex":19,"affiliation":1491,"properties":18},{"id":1476,"createTime":18,"updateTime":18,"relativeEntities":1492,"slug":18,"properties":1493,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1495,"statistic":18},[],{"title":1494},{"VI":1481},[],{"title":1497,"gsAuthor":1499},{"VI":1498},"Jean-Luc Gaudiot",{"VOID":1500},"[\"K4R30ooAAAAJ\"]",{"url":1469,"publisher":1502,"properties":1553},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1503,"slug":10,"properties":1504,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":1507,"manageAffiliations":1532,"indexDatabases":1538,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":1505,"title":1506},{"VOID":13},{"EN":15},[1508,1512,1516,1520,1524,1528],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":1509,"label":1510,"description":1511,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":1513,"label":1514,"description":1515,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":1517,"label":1518,"description":1519,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":1521,"label":1522,"description":1523,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},{"id":46,"createTime":18,"updateTime":18,"relativeEntities":1525,"label":1526,"description":1527,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":49},{},{"id":52,"createTime":18,"updateTime":18,"relativeEntities":1529,"label":1530,"description":1531,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":55},{},[1533],{"id":59,"createTime":18,"updateTime":18,"relativeEntities":1534,"slug":18,"properties":1535,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1537,"statistic":18},[],{"title":1536},{"EN":63},[],[1539,1546],{"id":67,"indexDatabase":1540,"url":80,"indexYears":18,"academicFieldIds":1545,"indexDatabaseRanking":18},{"id":69,"createTime":18,"updateTime":18,"relativeEntities":1541,"label":1542,"description":1543,"key":76,"publicationTags":1544,"standard":18},[],{"EN":72,"VI":72},{"EN":74,"VI":75},[78,79],[82],{"id":84,"indexDatabase":1547,"url":95,"indexYears":96,"academicFieldIds":1552,"indexDatabaseRanking":104},{"id":86,"createTime":18,"updateTime":18,"relativeEntities":1548,"label":1549,"description":1550,"key":92,"publicationTags":1551,"standard":18},[],{"EN":89,"VI":89},{"EN":89,"VI":91},[94],[98,99,100,101,102,103],{"pages":1554,"volume":1556},{"VOID":1555},"399-426",{"VOID":203},13,{"total":1557,"publishYear":205,"statisticByYear":1559},{"2001":379,"2002":379,"2003":379,"2004":379,"2006":631,"2007":379,"2010":379,"2012":379,"2015":379,"2019":379,"2020":631},"2000-03-01",[104,78],{"id":1563,"createTime":1564,"updateTime":1565,"relativeEntities":1566,"slug":1567,"properties":1568,"entityType":122,"verifyStatus":123,"verifyTime":1577,"verifyNote":125,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":1578,"fullTextUrl":18,"authors":1579,"publicationType":146,"publisherRelationship":1625,"citationCount":18,"citationInfo":18,"publishDate":1682,"publishYear":1683,"citationAnalyzeStatus":637,"lastCitationAnalyze":1565,"indexDatabases":1684,"openAccess":18,"references":18,"isForceReanalyzing":343},"78b144b9-a98a-4c69-80f7-12093733190b","2023-12-19T17:16:29.235+00:00","2026-07-13T15:44:33.271+00:00",[],"Analysis-of-two-level-data-mapping-in-an-HPF-compiler-for-distributed-memory-machines",{"title":1569,"gsPaper":1571,"references":1573,"doi":1575},{"EN":1570},"Analysis of two-level data mapping in an HPF compiler for distributed-memory machines",{"VOID":1572},"[\"4353428186042039712\"]",{"VOID":1574},"D. Bailey, J. Barton, T. Lasinski (Eds.), The NAS Parallel Benchmarks, RNR Technical Report, RNR-94-007, NASA Ames Research Center, 1994.\nBozkus, 1994, Compiling Fortran 90D\u002FHPF for distributed memory MIMD computers, J. Parallel Distribut. Comput., 21, 15, 10.1006\u002Fjpdc.1994.1039\nD. Callahan, B.L. Chamberlain, H.P. Zima, The cascade high productivity language, in: Proc. HIPS ’04, 2004, pp. 52–60.\nB. Chapman, P. Mehrotra, H. Moritsch, H. Zima, Dynamic data distribution in Vienna Fortran, in: Proc. Supercomputing ’93, 1993, pp. 284–293.\nCray Inc., Chapel Specification 0.4, http:\u002F\u002Fchapel.cs.washington.edu\u002F, 2005.\nCoelho, 1996, Optimal compilation of HPF remappings, J. Parallel Distribut. Comput., 38, 229, 10.1006\u002Fjpdc.1996.0143\nF. Coelho, Compiling dynamic mappings with array copies, in: Proc. PPoPP ’97, 1997, pp. 168–179.\nS.J. Deitz, B.L. Chamberlain, S.-E. Choi, L. Snyder, The design and implementation of a parallel array operator for the arbitrary remapping of data, in: Proc. PPoPP ’03, 2003.\nT.A. El-Ghazawi, W.W. Carlson, J.M. Draper, UPC language specifications, Ver. 1.1.1, http:\u002F\u002Fupc.gwu.edu\u002F, 2003.\nG. Fox, S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, C. Tseng, M. Wu, Fortran D language specification, Technical Report CRPC-TR90079, CRPC, Rice Univ., 1990.\nM.W. Hall, S. Hiranandani, K. Kennedy, C. W. Tseng, Interprocedural compilation of Fortran D for MIMD distributed-memory machines, in: Proc. Supercomputing ’92, 1992, pp. 522–534.\nHigh Performance Fortran Forum, High Performance Fortran language specification, Ver. 2.0.α.2, CRPC, Rice Univ., 1996.\nHiranandani, 1994, Evaluating of compiler optimizations for Fortran D, J. Parallel Distribut. Comput., 21, 27, 10.1006\u002Fjpdc.1994.1040\nHPF\u002FJA Language Specifcations, Ver. 1.0, http:\u002F\u002Fwww.hpfpc.org\u002Fjahpf\u002F, 1999.\nE. Kalns, L. Ni, Processor mapping techniques toward efficient data redistribution, in: Proc. IPPS’94, 1994, pp. 469–476.\nT. Kamachi, K. Kusano, K. Suehiro, Y. Seo, M. Tamura, S. Sakon, Generating realignment-based communication for HPF programs, in: Proc. IPPS’96, 1996, pp. 364–371.\nKremer, 1994, Automatic data layout for distributed-memory machines in d programming environment, 136\nPalermo, 1995, Automatic selection of dynamic data partitioning schemes for distributed-memory multicomputers, 1033, 392\nD.J. Palermo, E.W. Hodges, P. Banerjee, Interprocedural array redistribution data-flow analysis, in: Proc. LCPC’96, 1996, pp. aa.1–aa.15.\nRamaswamy, 1996, Optimizations for efficient array redistribution on distributed memory multicomputers, J. Parallel Distribut. Comput., 38, 217, 10.1006\u002Fjpdc.1996.0142\nH. Sakagami, H. Murai, Y. Seo, M. Yokokawa, 14.9 TFLOPS three-dimensional fluid simulation for fusion science with HPF on the earth simulator, in: Proc. Supercomputing ’02, 2002, pp. 1–14.\nL. Snyder, A programmers guide to ZPL, Version 6.3., http:\u002F\u002Fwww.cs.washington.edu\u002Fresearch\u002Fzpl\u002Fhome\u002Findex.html, 1999.\nE. Su, A. Lain, S. Ramaswamy, D.J. Palermo, E.W. Hodges, P. Banerjee, Advanced compilation techniques in the PARADIGM compiler for distributed-memory multicomputers, in: Proc. ICS ’95, 1995, pp. 424–433.\nA. Wakatani, M. Wolfe, A new approach to array redistribution: strip mining redistribution, in: Proc. PALE ’94, 1994, pp. 323–335.\nZima, 1991",{"VOID":1576},"10.1016\u002Fj.parco.2005.11.003","2024-05-15T01:23:51.026+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0167819106000123",[1580,1595,1610],{"id":1581,"sortIndex":19,"researcher":18,"roles":1582,"affiliations":1583,"properties":1592,"displayName":1594,"givenName":18,"familyName":18},"a587c1ef-e649-4ad9-84c8-544fc4b23320",[131],[1584],{"id":1585,"sortIndex":19,"affiliation":1586,"properties":18},"9f14b324-1492-4026-a563-156fa3187526",{"id":1585,"createTime":18,"updateTime":18,"relativeEntities":1587,"slug":18,"properties":1588,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1591,"statistic":18},[],{"title":1589},{"VI":1590},"Systems Development Laboratory, Hitachi, Ltd., 1099 Ohzenji, Asao, Kawasaki 215-0013, Japan",[],{"title":1593},{"VI":1594},"Makoto Satoh",{"id":1596,"sortIndex":379,"researcher":18,"roles":1597,"affiliations":1598,"properties":1607,"displayName":1609,"givenName":18,"familyName":18},"a36b717b-1b7f-418a-be14-038f8452edf1",[131],[1599],{"id":1600,"sortIndex":19,"affiliation":1601,"properties":18},"ad9e4005-ddbf-4a0d-84c3-f4456ee4692d",{"id":1600,"createTime":18,"updateTime":18,"relativeEntities":1602,"slug":18,"properties":1603,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1606,"statistic":18},[],{"title":1604},{"VI":1605},"Software Development Center, Hitachi, Ltd., 549-6 Shinanocho, Tozuka, Yokohama 244-0801, Japan",[],{"title":1608},{"VI":1609},"Kiyoshi Negishi",{"id":1611,"sortIndex":631,"researcher":18,"roles":1612,"affiliations":1613,"properties":1622,"displayName":1624,"givenName":18,"familyName":18},"c94370ea-e79e-4d7d-afce-c1e157144fc1",[131],[1614],{"id":1615,"sortIndex":19,"affiliation":1616,"properties":18},"034273e7-e2ea-4e46-a1a4-ea44c35921d8",{"id":1615,"createTime":18,"updateTime":18,"relativeEntities":1617,"slug":18,"properties":1618,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1621,"statistic":18},[],{"title":1619},{"VI":1620},"Hitachi East Japan Solutions, Ltd., 549-6 Shinanocho, Tozuka, Yokohama 244-0801, Japan",[],{"title":1623},{"VI":1624},"Atsushi Kobayashi",{"url":1578,"publisher":1626,"properties":1677},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1627,"slug":10,"properties":1628,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":1631,"manageAffiliations":1656,"indexDatabases":1662,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":1629,"title":1630},{"VOID":13},{"EN":15},[1632,1636,1640,1644,1648,1652],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":1633,"label":1634,"description":1635,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":1637,"label":1638,"description":1639,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":1641,"label":1642,"description":1643,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":1645,"label":1646,"description":1647,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},{"id":46,"createTime":18,"updateTime":18,"relativeEntities":1649,"label":1650,"description":1651,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":49},{},{"id":52,"createTime":18,"updateTime":18,"relativeEntities":1653,"label":1654,"description":1655,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":55},{},[1657],{"id":59,"createTime":18,"updateTime":18,"relativeEntities":1658,"slug":18,"properties":1659,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1661,"statistic":18},[],{"title":1660},{"EN":63},[],[1663,1670],{"id":67,"indexDatabase":1664,"url":80,"indexYears":18,"academicFieldIds":1669,"indexDatabaseRanking":18},{"id":69,"createTime":18,"updateTime":18,"relativeEntities":1665,"label":1666,"description":1667,"key":76,"publicationTags":1668,"standard":18},[],{"EN":72,"VI":72},{"EN":74,"VI":75},[78,79],[82],{"id":84,"indexDatabase":1671,"url":95,"indexYears":96,"academicFieldIds":1676,"indexDatabaseRanking":104},{"id":86,"createTime":18,"updateTime":18,"relativeEntities":1672,"label":1673,"description":1674,"key":92,"publicationTags":1675,"standard":18},[],{"EN":89,"VI":89},{"EN":89,"VI":91},[94],[98,99,100,101,102,103],{"pages":1678,"volume":1680},{"VOID":1679},"280-300",{"VOID":1681},"32","2006-04-01",2006,[104,78]]