[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_byId_300b636e-4837-428d-90e0-cdd8cbbd6d91":3,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:300b636e-4837-428d-90e0-cdd8cbbd6d91,\"}":98},{"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":45,"indexDatabases":60,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},"300b636e-4837-428d-90e0-cdd8cbbd6d91","2023-12-05T06:37:39.927+00:00","2025-11-21T09:50:31.744+00:00",[],"Journal-of-Computer-and-System-Sciences",{"issn":12,"title":14},{"VOID":13},"00220000",{"EN":15},"Journal of Computer and System Sciences","PUBLISHER","PENDING",null,0,[21,27,33,39],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":23,"label":24,"description":26,"parentId":18,"standard":18,"scholarHubFieldId":18},"e8c4e2fa-b139-4154-a158-595bd93d381c",[],{"EN":25},"Computational Theory and Mathematics",{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":29,"label":30,"description":32,"parentId":18,"standard":18,"scholarHubFieldId":18},"cfe20487-5108-4c23-a284-2aedca5fb76d",[],{"EN":31},"Theoretical Computer Science",{},{"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},"ee33e266-088e-4829-aa2f-5ea59917dac0",[],{"EN":43},"Applied Mathematics",{},[46,53],{"id":47,"createTime":18,"updateTime":18,"relativeEntities":48,"slug":18,"properties":49,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":52,"statistic":18},"e7771085-d41d-4eca-8ecb-0fc6ffbf3e95",[],{"title":50},{"EN":51},"ACADEMIC PRESS INC ELSEVIER SCIENCE",[],{"id":54,"createTime":18,"updateTime":18,"relativeEntities":55,"slug":18,"properties":56,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":59,"statistic":18},"9baa59fd-2797-44b1-ae61-cc362467e9d4",[],{"title":57},{"EN":58},"Academic Press Inc.",[],[61,81],{"id":62,"indexDatabase":63,"url":73,"indexYears":74,"academicFieldIds":75,"indexDatabaseRanking":80},"b980e2ed-dff3-43dd-8aa0-d749c7fad6aa",{"id":64,"createTime":18,"updateTime":18,"relativeEntities":65,"label":66,"description":68,"key":70,"publicationTags":71,"standard":18},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9",[],{"EN":67,"VI":67},"Scopus - Elsevier",{"EN":67,"VI":69},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[72],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F12370","1967-2025",[76,77,78,79],"bccef185-f7d5-4f2e-881a-2dc383ea6c57","8f050cfc-6be8-4218-91ba-e890405f0438","b4ee5f56-1514-428f-b517-37576cea076b","f58e9119-c14c-473f-8a7c-5a035e4ab69a","SCOPUS__Q1",{"id":82,"indexDatabase":83,"url":95,"indexYears":18,"academicFieldIds":96,"indexDatabaseRanking":18},"908bf7c5-d4ff-43f4-b2e4-7b3c59d2a603",{"id":84,"createTime":18,"updateTime":18,"relativeEntities":85,"label":86,"description":88,"key":91,"publicationTags":92,"standard":18},"a4921856-b128-4d9f-8f1f-e80813d3bbd4",[],{"EN":87,"VI":87},"ISI\u002FSCIE - Science Citation Index Expanded",{"EN":89,"VI":90},"SCIE database","Cơ sở dữ liệu SCIE","scie",[93,94],"SCIE","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0022-0000",[97],"874c55e0-262a-4246-b3d1-85e02c3c09db",{"meta":99,"data":101},{"total":100},"1420",[102,218,310,421,516,634,726,838,1106,1227],{"id":103,"createTime":104,"updateTime":105,"relativeEntities":106,"slug":107,"properties":108,"entityType":117,"verifyStatus":118,"verifyTime":119,"verifyNote":120,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":121,"fullTextUrl":18,"authors":122,"publicationType":141,"publisherRelationship":142,"citationCount":196,"citationInfo":197,"publishDate":213,"publishYear":198,"citationAnalyzeStatus":214,"lastCitationAnalyze":215,"indexDatabases":216,"openAccess":18,"references":18,"isForceReanalyzing":217},"967afc8a-72db-4ac0-8158-0a1a9421a11a","2024-01-13T11:16:15.803+00:00","2026-07-26T08:29:00.366+00:00",[],"On-the-severity-of-Braess-s-Paradox-Designing-networks-for-selfish-users-is-hard",{"title":109,"gsPaper":111,"references":113,"doi":115},{"EN":110},"On the severity of Braess's Paradox: Designing networks for selfish users is hard",{"VOID":112},"[\"3608737373851143597\"]",{"VOID":114},"D. Acemoglu, A. Ozdaglar, Flow control, routing, and performance under monopoly pricing, Technical Report WP-1696, MIT LIDS, 2003\nAho, 1974\nAhuja, 1993\nE. Altman, R. El Azouzi, O. Pourtallier, Avoiding paradoxes in routing games, in: Proceedings of the 17th International Teletraffic Conference, 2001\nE. Anshelevich, A. Dasgupta, É. Tardos, T. Wexler, Near-optimal network design with selfish agents, in: Proceedings of the 35th Annual ACM Symposium on the Theory of Computing, 2003, pp. 511–520\nArnott, 1993, Properties of dynamic traffic equilibrium involving bottlenecks, including a paradox and metering, Transportation Sci., 27, 148, 10.1287\u002Ftrsc.27.2.148\nArnott, 1994, The economics of traffic congestion, American Scientist, 82, 446\nArora, 1998, Proof verification and the hardness of approximation problems, J. ACM, 45, 501, 10.1145\u002F278298.278306\nArora, 1998, Probabilistic checking of proofs: A new characterization of NP, J. ACM, 45, 70, 10.1145\u002F273865.273901\nBass, 1992, Road to ruin, Discover, 13, 56\nBean, 1996, Secrets of network success, Phys. World, 9, 30, 10.1088\u002F2058-7058\u002F9\u002F2\u002F26\nBean, 1997, Braess's paradox in a loss network, J. Appl. Probab., 34, 155, 10.2307\u002F3215183\nBeckmann, 1956\nBoyce, 1979, Solutions to the optimal network design problem with shipments related to transportation cost, Transportation Res. Ser. B, 13, 65, 10.1016\u002F0191-2615(79)90007-9\nBraess, 1968, Über ein Paradoxon aus der Verkehrsplanung, Unternehmensforschung, 12, 258\nCalvert, 1997, The Downs–Thomson effect in a Markov process, Probab. Engrg. Inform. Sci., 11, 327, 10.1017\u002FS0269964800004861\nCalvert, 1993, Braess's paradox and power-law nonlinearities in networks, J. Austral. Math. Soc. Ser. B, 35, 1, 10.1017\u002FS0334270000007256\nCalvert, 1997, Braess's paradox in a queueing network with state-dependent routing, J. Appl. Probab., 34, 134, 10.2307\u002F3215182\nCatoni, 1991, Traffic equilibrium paradoxes, Transportation Sci., 25, 240, 10.1287\u002Ftrsc.25.3.240\nChau, 2003, The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands, Oper. Res. Lett., 31, 327, 10.1016\u002FS0167-6377(03)00030-0\nCocchi, 1993, Pricing in computer networks: Motivation, formulation, and example, IEEE\u002FACM Trans. Networking, 1, 614, 10.1109\u002F90.266050\nCohen, 1988, The counterintuitive in conflict and cooperation, American Scientist, 76, 577\nCohen, 1991, Paradoxical behavior of mechanical and electrical networks, Nature, 352, 699, 10.1038\u002F352699a0\nCohen, 1997, Congestion resulting from increased capacity in single-server queueing networks, IEEE\u002FACM Trans. Commun., 5, 305, 10.1109\u002F90.588114\nCohen, 1990, A paradox of congestion in a queuing network, J. Appl. Probab., 27, 730, 10.2307\u002F3214558\nR. Cole, Y. Dodis, T. Roughgarden, How much can taxes help selfish routing? in: Proceedings of the Fourth Annual ACM Conference on Electronic Commerce, 2003, pp. 98–107; J. Comput. System Sci., in press\nR. Cole, Y. Dodis, T. Roughgarden, Pricing network edges for heterogeneous selfish users, in: Proceedings of the 35th Annual ACM Symposium on the Theory of Computing, 2003, pp. 521–530\nCorrea, 2004, Computational complexity, fairness, and the price of anarchy of the maximum latency problem, vol. 3064, 59\nCorrea, 2004, Selfish routing in capacitated networks, Math. Oper. Res., 29, 961, 10.1287\u002Fmoor.1040.0098\nCottle, 1992\nA. Czumaj, P. Krysta, B. Vöcking, Selfish traffic allocation for server farms, in: Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, 2002, pp. 287–296\nA. Czumaj, B. Vöcking, Tight bounds for worst-case equilibria, in: Proceedings of the 13th Annual Symposium on Discrete Algorithms, 2002, pp. 413–420\nDafermos, 1984, On some traffic equilibrium theory paradoxes, Transportation Res. Ser. B, 18, 101, 10.1016\u002F0191-2615(84)90023-7\nDafermos, 1969, The traffic assignment problem for a general network, J. Res. National Bureau Standards Ser. B, 73, 91, 10.6028\u002Fjres.073B.010\nDaganzo, 1998, Queue spillovers in transportation networks with a route choice, Transportation Sci., 32, 3, 10.1287\u002Ftrsc.32.1.3\nDionne, 1979, Exact and approximate algorithms for optimal network design, Networks, 9, 37, 10.1002\u002Fnet.3230090104\nDowns, 1962, The law of peak-hour expressway congestion, Traffic Quarterly, 16, 393\nDubey, 1986, Inefficiency of Nash equilibria, Math. Oper. Res., 11, 1, 10.1287\u002Fmoor.11.1.1\nR. El Azouzi, E. Altman, O. Pourtallier, Properties of equilibria in competitive routing with several user types, in: Proceedings of the 41st IEEE Conference on Decision and Control, vol. 4, 2002, pp. 3646–3651\nA. Fabrikant, A. Luthra, E. Maneva, C.H. Papadimitriou, S.J. Shenker, On a network creation game, in: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing, 2003, pp. 347–351\nFeige, 1996, Interactive proofs and the hardness of approximating cliques, J. ACM, 43, 268, 10.1145\u002F226643.226652\nFisk, 1979, More paradoxes in the equilibrium assignment problem, Transportation Res. Ser. B, 13, 305, 10.1016\u002F0191-2615(79)90023-7\nFlorian, 1995, Network equilibrium models and algorithms, 485\nFortune, 1980, The directed subgraph homeomorphism problem, Theoret. Comput. Sci., 10, 111, 10.1016\u002F0304-3975(80)90009-2\nFrank, 1981, The Braess Paradox, Math. Program., 20, 283, 10.1007\u002FBF01589354\nFrank, 1983, Cost-deceptive links on ladder networks, Methods Oper. Res., 45, 75\nFriedman, 2004, Genericity and congestion control in selfish routing, 4667\nGarcia, 1981\nGarey, 1979\nGoemans, 1997, The primal-dual method for approximation algorithms and its application to network design problems, 144\nGrötschel, 1988\nJ.N. Hagstrom, R.A. Abrams, Characterizing Braess's paradox for traffic networks, in: Proceedings of the Fourth IEEE Conference on Intelligent Transportation Systems, 2001, pp. 837–842\nHall, 1978, Properties of the equilibrium state in transportation networks, Transportation Sci., 12, 208, 10.1287\u002Ftrsc.12.3.208\nHoc, 1973, A computational approach to the selection of an optimal network, Management Sci., 19, 488, 10.1287\u002Fmnsc.19.5.488\nIrvine, 1993, How Braess' paradox solves Newcomb's problem, Int. Stud. Philos. Sci., 7, 141, 10.1080\u002F02698599308573460\nH. Kameda, How harmful the paradox can be in the Braess\u002FCohen–Kelly–Jeffries networks, in: Proceedings of 21st INFOCOM Conference, vol. 1, 2002, pp. 437–445\nKameda, 2000, Braess-like paradoxes in distributed computer systems, IEEE Trans. Automat. Control, 45, 1687, 10.1109\u002F9.880619\nH. Kameda, E. Altman, J. Li, Y. Hosokawa, Paradoxes in performance optimization of distributed systems, in: Proceedings of the International Conference on Advances in Infrastructure for Electronic Business, Science, and Education on the Internet, 2000\nG. Keady, The Colebrook–White formula for pipe networks, Electronic report, Department of Mathematics, University of Western Australia, 1995\nKelly, 1991, Network routing, Philos. Trans. R. Soc. London Ser., 337, 343, 10.1098\u002Frsta.1991.0129\nKhuller, 1997, Approximation algorithms for finding highly connected subgraphs, 236\nKnight, 1924, Some fallacies in the interpretation of social cost, Quart. J. Econ., 38, 582, 10.2307\u002F1884592\nG. Kolata, What if they closed 42nd Street and nobody noticed? New York Times, December 25, 1990, p. 38\nKorilis, 1997, Achieving network optima using Stackelberg routing strategies, IEEE\u002FACM Trans. Networking, 5, 161, 10.1109\u002F90.554730\nKorilis, 1997, Capacity allocation under noncooperative routing, IEEE Trans. Automat. Control, 42, 309, 10.1109\u002F9.557575\nKorilis, 1999, Avoiding the Braess paradox in noncooperative networks, J. Appl. Probab., 36, 211, 10.1239\u002Fjap\u002F1032374242\nKörner, 1996\nE. Koutsoupias, C.H. Papadimitriou, Worst-case equilibria, in: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, 1999, pp. 404–413\nLeBlanc, 1975, An algorithm for the discrete network design problem, Transportation Res., 9, 183\nLibman, 1999, The designer's perspective to atomic noncooperative networks, IEEE\u002FACM Trans. Networking, 7, 875, 10.1109\u002F90.811452\nH. Lin, personal communication, December, 2003\nH. Lin, T. Roughgarden, É. Tardos, A stronger bound on Braess's Paradox, in: Proceedings of the 15th Annual Symposium on Discrete Algorithms, 2004, pp. 333–334\nLin, 2005, Braess's Paradox, Fibonacci numbers, and exponential inapproximability, vol. 3580, 497\nMagnanti, 1984, Network design and transportation planning: Models and algorithms, Transportation Sci., 18, 1, 10.1287\u002Ftrsc.18.1.1\nMarinoff, 1996, How Braess' paradox solves Newcomb's problem: Not!, Int. Stud. Philos. Sci., 10, 217, 10.1080\u002F02698599608573541\nM. Mavronicolas, P. Spirakis, The price of selfish routing, in: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, 2001, pp. 510–519\nI. Milchtaich, Network topology and the efficiency of equilibrium, Working paper 12-01, Department of Economics, Bar-Ilan University, Israel, 2001\nMurchland, 1970, Braess's paradox of traffic flow, Transportation Res., 4, 391, 10.1016\u002F0041-1647(70)90196-6\nNagurney, 1993\nNagurney, 2000\nNewell, 1980\nC.H. Papadimitriou, Algorithms, games, and the Internet, in: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing 2001, pp. 749–753\nPas, 1997, Braess' paradox: Some new insights, Transportation Res. Ser. B, 31, 265, 10.1016\u002FS0191-2615(96)00024-0\nPenchina, 1997, Braess paradox: Maximum penalty in a minimal critical network, Transportation Res. Ser. A, 31, 379\nPeterson, 1991, Strings and springs net mechanical surprise, Science News, 140, 118, 10.2307\u002F3976102\nPigou, 1920\nRaghavachari, 1997, Algorithms for finding low degree structures, 266\nRidley, 1968, An investment policy to reduce the travel time in a transportation network, Transportation Res., 2, 409, 10.1016\u002F0041-1647(68)90105-6\nRoughgarden, 2004, Stackelberg scheduling strategies, SIAM J. Comput., 33, 332, 10.1137\u002FS0097539701397059\nT. Roughgarden, How unfair is optimal routing? In: Proceedings of the 13th Annual Symposium on Discrete Algorithms, 2002, pp. 203–204\nRoughgarden, 2003, The price of anarchy is independent of the network topology, J. Comput. System Sci., 67, 341, 10.1016\u002FS0022-0000(03)00044-8\nT. Roughgarden, The maximum latency of selfish routing, in: Proceedings of the 15th Annual Symposium on Discrete Algorithms, 2004, pp. 973–974\nT. Roughgarden, Selfish Routing and the Price of Anarchy, MIT Press, 2005, in press\nRoughgarden, 2002, How bad is selfish routing?, J. ACM, 49, 236, 10.1145\u002F506147.506153\nRoughgarden, 2004, Bounding the inefficiency of equilibria in nonatomic congestion games, Games Econ. Behav., 47, 389, 10.1016\u002Fj.geb.2003.06.004\nL. Schulman, personal communication, October, 1999\nScott, 1969, The optimal network problem: Some computational procedures, Transportation Res., 3, 201, 10.1016\u002F0041-1647(69)90152-X\nSheffi, 1985\nShenker, 1995, Making greed work in networks: A game-theoretic analysis of switch service disciplines, IEEE\u002FACM Trans. Networking, 3, 819, 10.1109\u002F90.477727\nSmith, 1978, In a road network, increasing delay locally can reduce delay globally, Transportation Res., 12, 419, 10.1016\u002F0041-1647(78)90030-8\nSteinberg, 1988, The prevalence of paradoxes in transportation equilibrium problems, Transportation Sci., 22, 231, 10.1287\u002Ftrsc.22.4.231\nSteinberg, 1983, The prevalence of Braess' Paradox, Transportation Sci., 17, 301, 10.1287\u002Ftrsc.17.3.301\nStraffin, 1993\nTaguchi, 1982, Braess' paradox in a two-terminal transportation network, J. Oper. Res. Soc. Japan, 25, 376\nÉ. Tardos, A. Walkover, personal communication, November, 2003\nTarjan, 1983\nThomson, 1977\nA. Vetta, Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions, in: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, 2002, pp. 416–425\nVickrey, 1969, Congestion theory and transport investment, Amer. Econ. Rev., 59, 251\nJ.G. Wardrop, Some theoretical aspects of road traffic research, in: Proceedings of the Institute of Civil Engineers, Pt. II, vol. 1, 1952, pp. 325–378\nD. Weitz, The price of anarchy, unpublished manuscript, 2001\nWhitt, 1992, Counterexamples for comparisons of queues with finite waiting rooms, Queueing Syst., 10, 271, 10.1007\u002FBF01159210\nWong, 1984, Introduction and recent advances in network design: Models and algorithms, 187\nYang, 1998, A capacity paradox in network design and how to avoid it, Transportation Res. Ser. A, 32, 539",{"VOID":116},"10.1016\u002Fj.jcss.2005.05.009","PUBLICATION","VERIFIED","2024-06-24T23:11:30.841+00:00","Auto Verify","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0022000006000109",[123],{"id":124,"sortIndex":19,"researcher":18,"roles":125,"affiliations":127,"properties":136,"displayName":138,"givenName":18,"familyName":18},"b0cbb294-c7d4-4e07-89f9-8cbe2e5f1d39",[126],"AUTHOR",[128],{"id":129,"sortIndex":19,"affiliation":130,"properties":18},"692c519b-3412-498b-af65-40d2466b7ce3",{"id":129,"createTime":18,"updateTime":18,"relativeEntities":131,"slug":18,"properties":132,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":135,"statistic":18},[],{"title":133},{"VI":134},"Computer Science Division, UC Berkeley, 595 Soda Hall, Berkeley, CA 94720, USA",[],{"title":137,"gsAuthor":139},{"VI":138},"Tim Roughgarden",{"VOID":140},"[\"0lcJYs8AAAAJ\"]","ARTICLE",{"url":121,"publisher":143,"properties":191},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":144,"slug":10,"properties":145,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":148,"manageAffiliations":165,"indexDatabases":176,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":146,"title":147},{"VOID":13},{"EN":15},[149,153,157,161],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":150,"label":151,"description":152,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":154,"label":155,"description":156,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":158,"label":159,"description":160,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":162,"label":163,"description":164,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},[166,171],{"id":47,"createTime":18,"updateTime":18,"relativeEntities":167,"slug":18,"properties":168,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":170,"statistic":18},[],{"title":169},{"EN":51},[],{"id":54,"createTime":18,"updateTime":18,"relativeEntities":172,"slug":18,"properties":173,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":175,"statistic":18},[],{"title":174},{"EN":58},[],[177,184],{"id":62,"indexDatabase":178,"url":73,"indexYears":74,"academicFieldIds":183,"indexDatabaseRanking":80},{"id":64,"createTime":18,"updateTime":18,"relativeEntities":179,"label":180,"description":181,"key":70,"publicationTags":182,"standard":18},[],{"EN":67,"VI":67},{"EN":67,"VI":69},[72],[76,77,78,79],{"id":82,"indexDatabase":185,"url":95,"indexYears":18,"academicFieldIds":190,"indexDatabaseRanking":18},{"id":84,"createTime":18,"updateTime":18,"relativeEntities":186,"label":187,"description":188,"key":91,"publicationTags":189,"standard":18},[],{"EN":87,"VI":87},{"EN":89,"VI":90},[93,94],[97],{"pages":192,"volume":194},{"VOID":193},"922-953",{"VOID":195},"72",240,{"total":196,"publishYear":198,"statisticByYear":199},2006,{"2006":200,"2007":201,"2008":202,"2009":201,"2010":203,"2011":204,"2012":202,"2013":205,"2014":206,"2015":202,"2016":207,"2017":203,"2018":204,"2019":208,"2020":200,"2021":201,"2022":202,"2023":209,"2024":210,"2025":211,"2026":212},2,8,11,12,13,14,21,18,16,9,19,10,6,"2006-08-01","DONE_ANALYZE_CITATION","2026-07-26T08:29:00.365+00:00",[93,80],false,{"id":219,"createTime":220,"updateTime":221,"relativeEntities":222,"slug":223,"properties":224,"entityType":117,"verifyStatus":118,"verifyTime":233,"verifyNote":120,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":234,"fullTextUrl":18,"authors":235,"publicationType":141,"publisherRelationship":251,"citationCount":18,"citationInfo":18,"publishDate":305,"publishYear":306,"citationAnalyzeStatus":307,"lastCitationAnalyze":308,"indexDatabases":309,"openAccess":18,"references":18,"isForceReanalyzing":217},"b4d8c339-6421-43f5-815b-19342480fe7e","2023-12-20T22:41:29.029+00:00","2026-07-23T05:08:58.256+00:00",[],"Duality-theory-for-discrete-time-linear-systems",{"title":225,"gsPaper":227,"references":229,"doi":231},{"EN":226},"Duality theory for discrete-time linear systems",{"VOID":228},"[]",{"VOID":230},"Arbib, 1974, Foundations of system theory: Decomposable systems, Automatica-J. IFAC, 10, 285, 10.1016\u002F0005-1098(74)90039-9\nArbib, 1975, Time-varying systems, SIAM J. Control, 13, 1252, 10.1137\u002F0313078\nDieudonné, 1942, Sur le socle d'un anneau et les anneaux simples infinis, Bull. Soc. Math. France, 70, 46, 10.24033\u002Fbsmf.1338\nHegner, 1976, A Categorical Approach to Continuous-Time Linear Systems\nHerrlich, 1973\nJacobson, 1975, Vol. II“Linear Algebra”\nKalman, 1960, On the general theory of control systems, 481\nKalman, 1968, Lectures on controllability and observability\nKalman, 1969, Introduction to the algebraic theory of linear dynamical systems, Vol. 1, 41\nKnuth, 1968, Vol. 1, Fundamental Algorithms\nKöthe, 1969\nLefschetz, 1942\nMacLane, 1971\nRissanen, 1975, Duals of input\u002Foutput maps, 204\nSchubert, 1972",{"VOID":232},"10.1016\u002F0022-0000(78)90039-9","2024-06-25T10:38:14.195+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002F0022000078900399",[236],{"id":237,"sortIndex":19,"researcher":18,"roles":238,"affiliations":239,"properties":248,"displayName":250,"givenName":18,"familyName":18},"2314b9c6-9436-4b31-87e6-a83a76618e67",[126],[240],{"id":241,"sortIndex":19,"affiliation":242,"properties":18},"eb0505d2-25b5-43ca-adec-f15e478de513",{"id":241,"createTime":18,"updateTime":18,"relativeEntities":243,"slug":18,"properties":244,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":247,"statistic":18},[],{"title":245},{"VI":246},"University of Massachusetts, Amherst, Massachusetts 01003, USA",[],{"title":249},{"VI":250},"Stephen J. Hegner",{"url":234,"publisher":252,"properties":300},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":253,"slug":10,"properties":254,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":257,"manageAffiliations":274,"indexDatabases":285,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":255,"title":256},{"VOID":13},{"EN":15},[258,262,266,270],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":259,"label":260,"description":261,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":263,"label":264,"description":265,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":267,"label":268,"description":269,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":271,"label":272,"description":273,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},[275,280],{"id":47,"createTime":18,"updateTime":18,"relativeEntities":276,"slug":18,"properties":277,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":279,"statistic":18},[],{"title":278},{"EN":51},[],{"id":54,"createTime":18,"updateTime":18,"relativeEntities":281,"slug":18,"properties":282,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":284,"statistic":18},[],{"title":283},{"EN":58},[],[286,293],{"id":62,"indexDatabase":287,"url":73,"indexYears":74,"academicFieldIds":292,"indexDatabaseRanking":80},{"id":64,"createTime":18,"updateTime":18,"relativeEntities":288,"label":289,"description":290,"key":70,"publicationTags":291,"standard":18},[],{"EN":67,"VI":67},{"EN":67,"VI":69},[72],[76,77,78,79],{"id":82,"indexDatabase":294,"url":95,"indexYears":18,"academicFieldIds":299,"indexDatabaseRanking":18},{"id":84,"createTime":18,"updateTime":18,"relativeEntities":295,"label":296,"description":297,"key":91,"publicationTags":298,"standard":18},[],{"EN":87,"VI":87},{"EN":89,"VI":90},[93,94],[97],{"pages":301,"volume":303},{"VOID":302},"116-143",{"VOID":304},"17","1978-08-01",1978,"ERROR_IN_GET_PLATFORM_ID","2026-07-23T05:08:58.255+00:00",[93,80],{"id":311,"createTime":312,"updateTime":313,"relativeEntities":314,"slug":315,"properties":316,"entityType":117,"verifyStatus":118,"verifyTime":325,"verifyNote":120,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":326,"fullTextUrl":18,"authors":327,"publicationType":141,"publisherRelationship":361,"citationCount":19,"citationInfo":415,"publishDate":418,"publishYear":416,"citationAnalyzeStatus":214,"lastCitationAnalyze":419,"indexDatabases":420,"openAccess":18,"references":18,"isForceReanalyzing":217},"f551893d-b7d4-46c5-812c-fce1fa14cacb","2024-02-14T06:02:36.038+00:00","2026-07-22T16:40:34.891+00:00",[],"Constraint-satisfaction-with-bounded-treewidth-revisited",{"title":317,"gsPaper":319,"references":321,"doi":323},{"EN":318},"Constraint satisfaction with bounded treewidth revisited",{"VOID":320},"[\"3153441139644360507\"]",{"VOID":322},"Abiteboul, 1995\nBodlaender, 1996, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput., 25, 1305, 10.1137\u002FS0097539793251219\nBodlaender, 1998, A partial k-arboretum of graphs with bounded treewidth, Theoret. Comput. Sci., 209, 1, 10.1016\u002FS0304-3975(97)00228-4\nBodlaender, 1996, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, J. Algorithms, 21, 358, 10.1006\u002Fjagm.1996.0049\nChen, 2005, Beyond hypertree width: Decomposition methods without decompositions, vol. 3709, 167\nCohen, 2006, The complexity of constraint languages, 245\nCohen, 2005, A unified theory of structural tractability for constraint satisfaction and spread cut decomposition, 72\nDechter, 2006, Tractable structures for constraint satisfaction problems, 209\nDechter, 1989, Tree clustering for constraint networks, Artificial Intelligence, 38, 353, 10.1016\u002F0004-3702(89)90037-4\nDowney, 1999\nFlum, 2006\nFreuder, 1985, A sufficient condition for backtrack-bounded search, J. ACM, 32, 755, 10.1145\u002F4221.4225\nGarey, 1976, Some simplified NP-complete graph problems, Theoret. Comput. Sci., 1, 237, 10.1016\u002F0304-3975(76)90059-1\nGottlob, 2005, Hypertree decompositions: Structure, algorithms, and applications, vol. 3787, 1\nGottlob, 2001, Hypertree decompositions: A survey, vol. 2136, 37\nGottlob, 2002, Hypertree decompositions and tractable queries, J. Comput. System Sci., 64, 579, 10.1006\u002Fjcss.2001.1809\nGottlob, 2002, Fixed-parameter complexity in AI and nonmonotonic reasoning, Artificial Intelligence, 138, 55, 10.1016\u002FS0004-3702(02)00182-0\nGrohe, 2006, Constraint solving via fractional edge covers, 289\nImpagliazzo, 2001, Which problems have strongly exponential complexity?, J. Comput. System Sci., 63, 512, 10.1006\u002Fjcss.2001.1774\nKolaitis, 2000, Conjunctive-query containment and constraint satisfaction, J. Comput. System Sci., 61, 302, 10.1006\u002Fjcss.2000.1713\nNiedermeier, 2006\nPapadimitriou, 1999, On the complexity of database queries, J. Comput. System Sci., 58, 407, 10.1006\u002Fjcss.1999.1626\nReed, 1992, Finding approximate separators and computing tree width quickly, 221\nSamer, 2006, Constraint satisfaction with bounded treewidth revisited, vol. 4204, 499\nSamer, 2007, Algorithms for propositional model counting, vol. 4790, 484\nSamer, 2009, Fixed-parameter tractability, vol. 185, 425\nSzeider, 2004, On fixed-parameter tractable parameterizations of SAT, vol. 2919, 188\nYannakakis, 1981, Algorithms for acyclic database schemes, 82",{"VOID":324},"10.1016\u002Fj.jcss.2009.04.003","2024-05-28T00:25:03.175+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0022000009000300",[328,343],{"id":329,"sortIndex":19,"researcher":18,"roles":330,"affiliations":331,"properties":340,"displayName":342,"givenName":18,"familyName":18},"00d5d7df-5d11-4281-9c13-5ac54f099283",[126],[332],{"id":333,"sortIndex":19,"affiliation":334,"properties":18},"67b46f03-b95b-473f-8ade-ba9d20b04ae6",{"id":333,"createTime":18,"updateTime":18,"relativeEntities":335,"slug":18,"properties":336,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":339,"statistic":18},[],{"title":337},{"VI":338},"Department of Computer Science, TU Darmstadt, Germany",[],{"title":341},{"VI":342},"Marko Samer",{"id":344,"sortIndex":345,"researcher":18,"roles":346,"affiliations":347,"properties":356,"displayName":358,"givenName":18,"familyName":18},"3bb5f179-fe9e-4108-87f4-0e874ed4ce7c",1,[126],[348],{"id":349,"sortIndex":19,"affiliation":350,"properties":18},"5e5c668c-d4d9-4052-8c84-97ce0129e7da",{"id":349,"createTime":18,"updateTime":18,"relativeEntities":351,"slug":18,"properties":352,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":355,"statistic":18},[],{"title":353},{"VI":354},"Department of Computer Science, University of Durham, UK",[],{"title":357,"gsAuthor":359},{"VI":358},"Stefan Szeider",{"VOID":360},"[\"lJYKhNIAAAAJ\"]",{"url":326,"publisher":362,"properties":410},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":363,"slug":10,"properties":364,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":367,"manageAffiliations":384,"indexDatabases":395,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":365,"title":366},{"VOID":13},{"EN":15},[368,372,376,380],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":369,"label":370,"description":371,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":373,"label":374,"description":375,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":377,"label":378,"description":379,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":381,"label":382,"description":383,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},[385,390],{"id":47,"createTime":18,"updateTime":18,"relativeEntities":386,"slug":18,"properties":387,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":389,"statistic":18},[],{"title":388},{"EN":51},[],{"id":54,"createTime":18,"updateTime":18,"relativeEntities":391,"slug":18,"properties":392,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":394,"statistic":18},[],{"title":393},{"EN":58},[],[396,403],{"id":62,"indexDatabase":397,"url":73,"indexYears":74,"academicFieldIds":402,"indexDatabaseRanking":80},{"id":64,"createTime":18,"updateTime":18,"relativeEntities":398,"label":399,"description":400,"key":70,"publicationTags":401,"standard":18},[],{"EN":67,"VI":67},{"EN":67,"VI":69},[72],[76,77,78,79],{"id":82,"indexDatabase":404,"url":95,"indexYears":18,"academicFieldIds":409,"indexDatabaseRanking":18},{"id":84,"createTime":18,"updateTime":18,"relativeEntities":405,"label":406,"description":407,"key":91,"publicationTags":408,"standard":18},[],{"EN":87,"VI":87},{"EN":89,"VI":90},[93,94],[97],{"pages":411,"volume":413},{"VOID":412},"103-114",{"VOID":414},"76",{"total":19,"publishYear":416,"statisticByYear":417},2010,{},"2010-03-01","2026-07-22T16:40:34.889+00:00",[93,80],{"id":422,"createTime":423,"updateTime":424,"relativeEntities":425,"slug":426,"properties":427,"entityType":117,"verifyStatus":118,"verifyTime":436,"verifyNote":120,"languages":18,"translateLanguages":18,"viewCount":345,"primaryUrl":437,"fullTextUrl":18,"authors":438,"publicationType":141,"publisherRelationship":456,"citationCount":210,"citationInfo":510,"publishDate":514,"publishYear":511,"citationAnalyzeStatus":17,"lastCitationAnalyze":424,"indexDatabases":515,"openAccess":18,"references":18,"isForceReanalyzing":217},"83acefd4-c633-4ca3-80fe-d8cbeff73f05","2023-12-10T01:49:16.695+00:00","2026-07-22T05:43:32.436+00:00",[],"A-time-luck-tradeoff-in-relativized-cryptography",{"title":428,"gsPaper":430,"references":432,"doi":434},{"EN":429},"A time-luck tradeoff in relativized cryptography",{"VOID":431},"[\"10366105760257615359\"]",{"VOID":433},"Adleman, 1979, A subexponential algorithm for the discrete logarithm problem with applications to cryptography, 55\nAdleman, 1977, Reducibility, randomness and intractibility, 151\nAdleman, 1980\nBabai, 1979, Monte Carlo Algorithms in Graph Isomorphism Testing\nBaker, 1975, Relativizations of the P = ?NP question, SIAM J. Comput., 4, 431, 10.1137\u002F0204037\nBennett, 1979, Relative to a Random Oracle A, PA ≠ NPA ≠ co-NPA with Probability 1\nBrassard, 1979, A note on the complexity of cryptography, IEEE Trans. Inform. Theory, IT-25, 232, 10.1109\u002FTIT.1979.1056010\nBrassard, 1979, Relativized cryptography, 383\nG. Brassard, Relativized cryptography, IEEE Trans. Inform. Theory, to appear.\nDiffie, 1976, New directions in cryptography, IEEE Trans. Inform. Theory, IT-22, 644, 10.1109\u002FTIT.1976.1055638\nGarey, 1979\nHopcroft, 1979\nKahn, 1967\nLempel, 1979, Cryptology in transition: A survey, ACM Comput. Surveys, 11, 285, 10.1145\u002F356789.356792\nMcEliece, 1978, A Public-Key Cryptosystem Based on Algebraic Coding Theory, DSN Progress Report 42–44\nMerkle, 1978, Secure communication over insecure channels, Comm. Assoc. Comput. Mach., 21, 294\nMerkle, 1978, Hiding information and receipts in trap-door knapsacks, IEEE Trans. Inform. Theory, IT-24\nA. R. Meyer, personal communication, Aug. 1980.\nMiller, 1976, Riemann's hypothesis and tests for primality, J. Comput. System Sci., 13, 300, 10.1016\u002FS0022-0000(76)80043-8\nNational Bureau of Standards, “Federal Information Processing,” Standards Publication No. 46.\nRabin, 1976, Probabilistic algorithms, 21\nRabin, 1979\nRivest, 1978, On digital signatures and public-key cryptosystems, Comm. Assoc. Comput. Mach., 21, 120\nR. L. Rivest, personal communication, 1980.\nSchroeppel, 1979, A T.S2 = O(2n) time\u002Fspace tradeoff for certain NP-complete problems, 328\nShannon, 1948, The mathematical theory of communication, Bell System J., 27, 379, 10.1002\u002Fj.1538-7305.1948.tb01338.x\nShannon, 1948, The mathematical theory of communication, Bell System J., 27, 623, 10.1002\u002Fj.1538-7305.1948.tb00917.x\nShannon, 1949, Communication theory of secrecy systems, Bell System J., 28, 656, 10.1002\u002Fj.1538-7305.1949.tb00928.x\nStrassen, 1977, Fast Monte Carlo tests for primality, SIAM J. Comput., 6, 34",{"VOID":435},"10.1016\u002F0022-0000(81)90034-9","2024-05-15T02:32:29.253+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002F0022000081900349",[439],{"id":440,"sortIndex":19,"researcher":18,"roles":441,"affiliations":442,"properties":451,"displayName":453,"givenName":18,"familyName":18},"3c507b40-7417-47f0-a4e0-efea8ccc6939",[126],[443],{"id":444,"sortIndex":19,"affiliation":445,"properties":18},"2a8e054b-f35f-4a06-95f9-59ff8078f1a1",{"id":444,"createTime":18,"updateTime":18,"relativeEntities":446,"slug":18,"properties":447,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":450,"statistic":18},[],{"title":448},{"VI":449},"Département d'informatique et de recherche opérationnelle, Université de Montréal, C.P. 6128, Succursale “A,” Montréal H3C 3J7, Canada",[],{"title":452,"gsAuthor":454},{"VI":453},"Gilles Brassard",{"VOID":455},"[\"Rh7_srgAAAAJ\"]",{"url":437,"publisher":457,"properties":505},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":458,"slug":10,"properties":459,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":462,"manageAffiliations":479,"indexDatabases":490,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":460,"title":461},{"VOID":13},{"EN":15},[463,467,471,475],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":464,"label":465,"description":466,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":468,"label":469,"description":470,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":472,"label":473,"description":474,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":476,"label":477,"description":478,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},[480,485],{"id":47,"createTime":18,"updateTime":18,"relativeEntities":481,"slug":18,"properties":482,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":484,"statistic":18},[],{"title":483},{"EN":51},[],{"id":54,"createTime":18,"updateTime":18,"relativeEntities":486,"slug":18,"properties":487,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":489,"statistic":18},[],{"title":488},{"EN":58},[],[491,498],{"id":62,"indexDatabase":492,"url":73,"indexYears":74,"academicFieldIds":497,"indexDatabaseRanking":80},{"id":64,"createTime":18,"updateTime":18,"relativeEntities":493,"label":494,"description":495,"key":70,"publicationTags":496,"standard":18},[],{"EN":67,"VI":67},{"EN":67,"VI":69},[72],[76,77,78,79],{"id":82,"indexDatabase":499,"url":95,"indexYears":18,"academicFieldIds":504,"indexDatabaseRanking":18},{"id":84,"createTime":18,"updateTime":18,"relativeEntities":500,"label":501,"description":502,"key":91,"publicationTags":503,"standard":18},[],{"EN":87,"VI":87},{"EN":89,"VI":90},[93,94],[97],{"pages":506,"volume":508},{"VOID":507},"280-311",{"VOID":509},"22",{"total":210,"publishYear":511,"statisticByYear":512},1981,{"1982":200,"1983":513,"1984":345,"1985":345,"1987":345,"1988":345,"1989":345,"1995":345,"1996":345,"2008":345,"2011":345,"2012":345,"2013":345},3,"1981-06-01",[93,80],{"id":517,"createTime":518,"updateTime":519,"relativeEntities":520,"slug":521,"properties":522,"entityType":117,"verifyStatus":118,"verifyTime":530,"verifyNote":120,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":531,"fullTextUrl":18,"authors":532,"publicationType":141,"publisherRelationship":578,"citationCount":18,"citationInfo":18,"publishDate":631,"publishYear":198,"citationAnalyzeStatus":307,"lastCitationAnalyze":632,"indexDatabases":633,"openAccess":18,"references":18,"isForceReanalyzing":217},"b9b36af9-d5ea-48a7-815f-289fa257a313","2024-01-01T12:21:25.735+00:00","2026-07-21T05:05:02.316+00:00",[],"On-certain-connectivity-properties-of-the-internet-topology",{"title":523,"gsPaper":525,"references":526,"doi":528},{"EN":524},"On certain connectivity properties of the internet topology",{"VOID":228},{"VOID":527},"L. Adamic, R. Lukose, A. Puniyani, B. Huberman, Search in power law networks, Phys. Rev. E 64.\nW. Aiello, F.R.K. Chung, L. Lu, A random graph model for power law graphs, Exper. Math. 10 (2001) 53–66. (see also A Random Graph Model for Massive Graphs, STOC 2000, pp. 171–180).\nW. Aiello, F.R.K. Chung, L. Lu, Random evolution in massive graphs, in: James Abello et al. (Eds.), Handbook on Massive Data Sets, Kluwer Academic Publishers, 2002, pp. 97–122 (extended abstract in FOCS 2001, pp. 510–519).\nAlbert, 2000, Error and attack tolerance of complex networks, Nature, 406, 10.1038\u002F35019019\nA. Archer, E. Tárdos, Frugal path mechanisms, SODA, 2002, 991–999.\nBarabási, 1999, Emergence of scaling in random graphs, Science, 286, 509, 10.1126\u002Fscience.286.5439.509\nZ. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, D. Weitz, Approximating Aggregate Queries about Web Pages via Random Walks, VLDB 2000.\nBollobás, 2001\nBollobás, 1982, The diameter of random regular graphs, Combinatorica, 2, 125, 10.1007\u002FBF02579310\nBollobás, 2001, The degree sequence of a scale-free random graph process, Random Struct. Algorithms, 18, 279, 10.1002\u002Frsa.1009\nBollobás, O. Riordan, The diameter of scale-free graphs, Combinatorica, to appear.\nA. Broder, A. Frieze, E. Upfal, SIAM J. Comput. 23(5) 976–989.\nBroder, 1989, Bounds on the cover time, J. Theor. Probab., 2, 101, 10.1007\u002FBF01048273\nQ. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker, W. Willinger, The origins of power-laws in internet topologies revisited, Infocomm 2002.\nChung, 1997, Spectral graph theory, AMS-RCSM, 92\nChung, 2001, The diameter of random sparse graphs, Ad. Appl. Math., 26, 257, 10.1006\u002Faama.2001.0720\nF.R.K. Chung, L. Lu, The average distance in a random graph with given expected degrees, in: Proc. Nat. Acad. Sci. 99 (25) (December 2002).\nF.R.K. Chung, L. Lu, V. Vu. The spectra of random graphs with given expected degrees, in: Proc. Nat. Acad. Sci., to appear.\nC. Cooper, A. Frieze, A general model for web graphs, Proceedings of ESA, 2001, pp. 500–511.\nC. Cooper, A. Frieze, Crawling on Web Graphs, STOC, 2002, pp. 419–427.\nC. Cooper, A. Frieze, The Cover Time of Sparse Random Graphs, SODA, 2003, pp. 148–157.\nE. Elkind, A. Sahai, K. Steiglitz, Frugality in Path Auctions, Manuscript, 2003.\nA. Fabrikant, E. Koutsoupias, C.H. Papadimitriou, Heuristically Optimized Tradeoffs, ICALP, 2002.\nM. Faloutsos, P. Faloutsos, C. Faloutsos, On Power-law Relationships of the Internet Topology, in: Proceedings of Sigcomm, 1999, pp. 251–262.\nFeigenbaum, 2002, A BGP-based mechanism for lowest-cost routing, 173\nC. Gkantsidis, M. Mihail, E. Zegura, Spectral Analysis of Internet Topologies, INFOCOM, 2003, to appear.\nC. Gkantsidis, M. Mihail, A. Saberi, Throughput and Congestion in Power Law Graphs, Sigmetrics, 2003, to appear.\nT. Griffin, An Introduction to Interdomain Routing and BGP, SIGCOMM 2001 Tutorial.\nHolme, 2002, Edge overload breakdown in evolving networks, Phys. Rev. E, 66, 10.1103\u002FPhysRevE.66.036119\nHolme, 2002, Attack vulnerability of complex networks, Phys. Rev. E, 65, 10.1103\u002FPhysRevE.65.056109\nJ. Kleinberg, R. Rubinfeld, Short Paths in Expander Graphs, FOCS 96, pp. 86–95.\nR. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, E. Upfal, Stochastic models for the Web graph, FOCS 2000, pp. 57–65.\nLeighton, 1999, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM, 46, 787, 10.1145\u002F331524.331526\nMas-Collel, 1995\nM. Mihail, C.H. Papadimitriou, On the Eigenvalue Power Law, RANDOM 2002.\nMotwani, 1995\nNational Laboratory for Applied Networking Research, Routing Data, http:\u002F\u002Fmoat.lanr.net\u002FRouting\u002Frawdata.\nN. Nisan, A. Ronen, Algorithmic Mechanism Design STOC 1999, pp 129–140.\nPapadimitriou, 1994\nC.H. Papadimitriou, Algorithms, Games, and the Internet, Keynote Address, STOC 2001, pp. 749–753.\nC.H. Papadimitriou, Game Theory and Math Economics: A TCS Introduction, Tutorial, FOCS 2001.\nPublic Route Server and Looking Glass Site List, Traceroute.org, http:\u002F\u002Fwww.traceroute.org.\nSinclair, 1997\nD. Towsley, Modeling the Internet: Seeing the Forest through the Trees, Keynote Address, Sigmetrics 2002.\nVazirani, 2001\nWillinger, 2002, Scaling phenomena in the internet: critically examining criticality, Pro Natl. Acad. Sci., 99, 10.1073\u002Fpnas.012583099",{"VOID":529},"10.1016\u002Fj.jcss.2005.06.009","2024-06-26T02:57:57.747+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0022000005000942",[533,548,563],{"id":534,"sortIndex":19,"researcher":18,"roles":535,"affiliations":536,"properties":545,"displayName":547,"givenName":18,"familyName":18},"8fbd6392-84e5-4219-a55e-fe9ce56b532e",[126],[537],{"id":538,"sortIndex":19,"affiliation":539,"properties":18},"90723583-d2e0-4c5e-93c3-87c1a1db2ce6",{"id":538,"createTime":18,"updateTime":18,"relativeEntities":540,"slug":18,"properties":541,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":544,"statistic":18},[],{"title":542},{"VI":543},"College of Computing, Georgia Tech, USA",[],{"title":546},{"VI":547},"Milena Mihail",{"id":549,"sortIndex":345,"researcher":18,"roles":550,"affiliations":551,"properties":560,"displayName":562,"givenName":18,"familyName":18},"78510703-5136-40b2-bddf-49277f685f89",[126],[552],{"id":553,"sortIndex":19,"affiliation":554,"properties":18},"4bb678da-30db-46fc-8606-ee94f710b638",{"id":553,"createTime":18,"updateTime":18,"relativeEntities":555,"slug":18,"properties":556,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":559,"statistic":18},[],{"title":557},{"VI":558},"Department of Computer Science, U.C. Berkeley, USA",[],{"title":561},{"VI":562},"Christos Papadimitriou",{"id":564,"sortIndex":200,"researcher":18,"roles":565,"affiliations":566,"properties":575,"displayName":577,"givenName":18,"familyName":18},"b08f3697-94a4-4f19-aec6-6935e350166c",[126],[567],{"id":568,"sortIndex":19,"affiliation":569,"properties":18},"9fd94e5f-e7cb-4fb1-a1e7-d004859ad085",{"id":568,"createTime":18,"updateTime":18,"relativeEntities":570,"slug":18,"properties":571,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":574,"statistic":18},[],{"title":572},{"VI":573},"Department of Management Science and Engineering, Stanford University, USA",[],{"title":576},{"VI":577},"Amin Saberi",{"url":531,"publisher":579,"properties":627},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":580,"slug":10,"properties":581,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":584,"manageAffiliations":601,"indexDatabases":612,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":582,"title":583},{"VOID":13},{"EN":15},[585,589,593,597],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":586,"label":587,"description":588,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":590,"label":591,"description":592,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":594,"label":595,"description":596,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":598,"label":599,"description":600,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},[602,607],{"id":47,"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":51},[],{"id":54,"createTime":18,"updateTime":18,"relativeEntities":608,"slug":18,"properties":609,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":611,"statistic":18},[],{"title":610},{"EN":58},[],[613,620],{"id":62,"indexDatabase":614,"url":73,"indexYears":74,"academicFieldIds":619,"indexDatabaseRanking":80},{"id":64,"createTime":18,"updateTime":18,"relativeEntities":615,"label":616,"description":617,"key":70,"publicationTags":618,"standard":18},[],{"EN":67,"VI":67},{"EN":67,"VI":69},[72],[76,77,78,79],{"id":82,"indexDatabase":621,"url":95,"indexYears":18,"academicFieldIds":626,"indexDatabaseRanking":18},{"id":84,"createTime":18,"updateTime":18,"relativeEntities":622,"label":623,"description":624,"key":91,"publicationTags":625,"standard":18},[],{"EN":87,"VI":87},{"EN":89,"VI":90},[93,94],[97],{"pages":628,"volume":630},{"VOID":629},"239-251",{"VOID":195},"2006-03-01","2026-07-21T05:05:02.315+00:00",[93,80],{"id":635,"createTime":636,"updateTime":637,"relativeEntities":638,"slug":639,"properties":640,"entityType":117,"verifyStatus":118,"verifyTime":649,"verifyNote":120,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":650,"fullTextUrl":18,"authors":651,"publicationType":141,"publisherRelationship":667,"citationCount":19,"citationInfo":721,"publishDate":724,"publishYear":722,"citationAnalyzeStatus":214,"lastCitationAnalyze":637,"indexDatabases":725,"openAccess":18,"references":18,"isForceReanalyzing":217},"26582bae-bd43-41b4-811e-c5f97fc7ddc0","2024-01-25T06:06:20.984+00:00","2026-07-20T05:35:15.983+00:00",[],"The-node-deletion-problem-for-hereditary-properties-is-NP-complete",{"title":641,"gsPaper":643,"references":645,"doi":647},{"EN":642},"The node-deletion problem for hereditary properties is NP-complete",{"VOID":644},"[\"2153340787550496513\"]",{"VOID":646},"Ausiello, 1977, On the structure of combinatorial problems and structure preserving reductions, 45\nBerge, 1973\nCook, 1971, The complexity of theorem-proving procedures, 151\nGarey, 1978\nGarey, 1976, Some simplified NP-complete graph problems, Theor. Comp. Sci., 1, 237, 10.1016\u002F0304-3975(76)90059-1\nHarary, 1970\nHopcroft, 1969\nKarp, 1972, 85\nKirshnamoorthy, 1977, Node-Deletion NP-Complete Problems\nLewis, 1978, On the Complexity of the Maximum Subgraph Problem, 10.1145\u002F800133.804356\nPlaisted, 1976, Some polynomial and integer divisibility problems are NP-hard, 264\nPlaisted, 1977, New NP-hard and NP-complete polynomial and integer divisibility problems, 241\nRamsey, 1930, On a problem of formal logic, 30, 264\nTartan, 1972, Depth-first-search and linear graph algorithms, SIAM J. Comput., 1, 146, 10.1137\u002F0201010\nYannakakis, 1978, Edge-Deletion Problems",{"VOID":648},"10.1016\u002F0022-0000(80)90060-4","2024-06-23T05:13:35.878+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002F0022000080900604",[652],{"id":653,"sortIndex":19,"researcher":18,"roles":654,"affiliations":655,"properties":664,"displayName":666,"givenName":18,"familyName":18},"03dba885-9a80-4c09-8cc3-50831faf67c9",[126],[656],{"id":657,"sortIndex":19,"affiliation":658,"properties":18},"574023f3-671e-4e61-9632-1105ed779808",{"id":657,"createTime":18,"updateTime":18,"relativeEntities":659,"slug":18,"properties":660,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":663,"statistic":18},[],{"title":661},{"VI":662},"Yale University, New Haven, Connecticut 06520, USA",[],{"title":665},{"VI":666},"John M. Lewis",{"url":650,"publisher":668,"properties":716},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":669,"slug":10,"properties":670,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":673,"manageAffiliations":690,"indexDatabases":701,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":671,"title":672},{"VOID":13},{"EN":15},[674,678,682,686],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":675,"label":676,"description":677,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":679,"label":680,"description":681,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":683,"label":684,"description":685,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":687,"label":688,"description":689,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},[691,696],{"id":47,"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},{"EN":51},[],{"id":54,"createTime":18,"updateTime":18,"relativeEntities":697,"slug":18,"properties":698,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":700,"statistic":18},[],{"title":699},{"EN":58},[],[702,709],{"id":62,"indexDatabase":703,"url":73,"indexYears":74,"academicFieldIds":708,"indexDatabaseRanking":80},{"id":64,"createTime":18,"updateTime":18,"relativeEntities":704,"label":705,"description":706,"key":70,"publicationTags":707,"standard":18},[],{"EN":67,"VI":67},{"EN":67,"VI":69},[72],[76,77,78,79],{"id":82,"indexDatabase":710,"url":95,"indexYears":18,"academicFieldIds":715,"indexDatabaseRanking":18},{"id":84,"createTime":18,"updateTime":18,"relativeEntities":711,"label":712,"description":713,"key":91,"publicationTags":714,"standard":18},[],{"EN":87,"VI":87},{"EN":89,"VI":90},[93,94],[97],{"pages":717,"volume":719},{"VOID":718},"219-230",{"VOID":720},"20",{"total":19,"publishYear":722,"statisticByYear":723},1980,{},"1980-04-01",[93,80],{"id":727,"createTime":728,"updateTime":729,"relativeEntities":730,"slug":731,"properties":732,"entityType":117,"verifyStatus":118,"verifyTime":741,"verifyNote":120,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":742,"fullTextUrl":18,"authors":743,"publicationType":141,"publisherRelationship":778,"citationCount":209,"citationInfo":832,"publishDate":835,"publishYear":833,"citationAnalyzeStatus":214,"lastCitationAnalyze":836,"indexDatabases":837,"openAccess":18,"references":18,"isForceReanalyzing":217},"56cc0c7d-9b84-4aa1-8123-5a4383a9d1c4","2024-01-08T03:48:37.463+00:00","2026-07-19T17:26:09.520+00:00",[],"A-study-of-performance-and-scalability-metrics-of-a-SIP-proxy-server-a-practical-approach",{"title":733,"gsPaper":735,"references":737,"doi":739},{"EN":734},"A study of performance and scalability metrics of a SIP proxy server – a practical approach",{"VOID":736},"[\"11182873181969124379\"]",{"VOID":738},"International Telecommunications Union-Telecommunications Standardisation Sector (ITU-T), Principles of Intelligent network architecture, Recommendation Q1201, ITU-T, Geneva, Switzerland, October 1992.\nInternational Telecommunications Union-Telecommunications Standardisation Sector (ITU-T), Network grade of service parameters and target values for circuit-switched services in the evolving ISDN, Recommendation E.721, ITU-T, Geneva, Switzerland, 1992.\nJ..M. Lennox, Services for IP telephony, PhD dissertation, Columbia University, New York, 2004.\nRosenberg\nJohnston, 2004\nD. Towsley, S. Alouf, P. Nain, Inferring network characteristics via moment-based estimators, INFOCOM, Alaska, USA, July 2001.\nV.K. Gurbani, L. Jagadeesan, V.B. Mendiritta, Characterising the session initiation protocol (SIP) network performance and reliability, in: ISAS 2005, in: Lecture Notes in Comput. Sci., vol. 3694, April 2005, pp. 196–211.\nDe, 2002, End-to-end VoIP testing and the effort of QoS on signalling, IEEE Comput., 35, 80, 10.1109\u002FMC.2002.999779\nChatterjee, 2005, SIP based enterprise converged networks for voice\u002Fvideo over IP: Implementation and evaluation of components, IEEE Selected Areas Commun., 23, 1921, 10.1109\u002FJSAC.2005.854118\nV.K. Gurabani, Service oriented computing:enabling cross-network services between the internet and the telecommunications network, PhD dissertation, Illinois Institute of Technology, Chicago, IL, December 2004.\nN. Rajagopal, M. Devetsikiotis, Modelling and optimisation for the design of IMS networks, in: Proceedings of 39th Ann. Simulation Symp. 2006, ANSS06, Huntsville, AL, USA, April 2006.\nA. Ingolfsson, F. Gallop, Queuing tool pak 4.0, University of Alberta School of Business, Edmonton, Hungary, 2003.\nG. Stojsic, R. Radovic, S. Srbljic, Formal definition of SIP proxy behavior, in: Int. Conf. on Trends in Communications, EUROCON, Bratislava, Slovak Republic, July 2001.\nI. Adan, J. Resing, Queuing theory, Class Notes, Department of Computer Science and Mathematics, Eindhoven University of Technology, The Netherlands, February 2001.\nWilliam J. Stewart, Probability, queuing models and Markov chains: The tools of system performance evaluation, Lecture Notes, Department of Computer Science, North Carolina State University, Raleigh, USA, Fall 2003.\nMalas\nS.V. Subramanian R. Dutta, Comparative study of M\u002FM\u002F1 and M\u002FD\u002F1 models of a SIP proxy server, in: Australasian Telecommunications Networking and Application Conf., ATNACʼ08, Adelaide, Australia, December 2008.\nS.V. Subramanian, R. Dutta, Measurements and analysis of M\u002FM\u002F1 and M\u002FM\u002Fc queuing models of the SIP proxy server, in: Proceedings of 18th International Conference on Computer Communications and Networks, ICCCN 2009, San Fransisco, USA, August 2009.\nS.V. Subramanian, R. Dutta, Performance and scalability of M\u002FM\u002Fc based queuing model of the SIP proxy server – a practical approach, in: Australasian Telecommunications Networking and Application Conf., ATNACʼ09, Canberra, Australia, November 2009.",{"VOID":740},"10.1016\u002Fj.jcss.2010.08.006","2024-05-28T06:25:22.426+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0022000010001194",[744,761],{"id":745,"sortIndex":19,"researcher":18,"roles":746,"affiliations":747,"properties":756,"displayName":758,"givenName":18,"familyName":18},"9440fb87-4d23-423e-9756-6bb2760f0fdf",[126],[748],{"id":749,"sortIndex":19,"affiliation":750,"properties":18},"384f73c6-559a-4baf-8173-35a2521c1ef0",{"id":749,"createTime":18,"updateTime":18,"relativeEntities":751,"slug":18,"properties":752,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":755,"statistic":18},[],{"title":753},{"VI":754},"IP Communication Business Unit, CISCO Systems, Research Triangle Park, USA",[],{"title":757,"gsAuthor":759},{"VI":758},"Sureshkumar V. Subramanian",{"VOID":760},"[\"5q3OTZIAAAAJ\"]",{"id":762,"sortIndex":345,"researcher":18,"roles":763,"affiliations":764,"properties":773,"displayName":775,"givenName":18,"familyName":18},"09c7d9c5-07b6-49ef-b8a9-a1e207159e3b",[126],[765],{"id":766,"sortIndex":19,"affiliation":767,"properties":18},"26427917-b5d2-4e2a-8da5-8e55aedd4b63",{"id":766,"createTime":18,"updateTime":18,"relativeEntities":768,"slug":18,"properties":769,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":772,"statistic":18},[],{"title":770},{"VI":771},"Department of Computer Science, North Carolina State University, Raleigh, USA",[],{"title":774,"gsAuthor":776},{"VI":775},"Rudra Dutta",{"VOID":777},"[\"FODlT4sAAAAJ\"]",{"url":742,"publisher":779,"properties":827},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":780,"slug":10,"properties":781,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":784,"manageAffiliations":801,"indexDatabases":812,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":782,"title":783},{"VOID":13},{"EN":15},[785,789,793,797],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":786,"label":787,"description":788,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":790,"label":791,"description":792,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":794,"label":795,"description":796,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":798,"label":799,"description":800,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},[802,807],{"id":47,"createTime":18,"updateTime":18,"relativeEntities":803,"slug":18,"properties":804,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":806,"statistic":18},[],{"title":805},{"EN":51},[],{"id":54,"createTime":18,"updateTime":18,"relativeEntities":808,"slug":18,"properties":809,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":811,"statistic":18},[],{"title":810},{"EN":58},[],[813,820],{"id":62,"indexDatabase":814,"url":73,"indexYears":74,"academicFieldIds":819,"indexDatabaseRanking":80},{"id":64,"createTime":18,"updateTime":18,"relativeEntities":815,"label":816,"description":817,"key":70,"publicationTags":818,"standard":18},[],{"EN":67,"VI":67},{"EN":67,"VI":69},[72],[76,77,78,79],{"id":82,"indexDatabase":821,"url":95,"indexYears":18,"academicFieldIds":826,"indexDatabaseRanking":18},{"id":84,"createTime":18,"updateTime":18,"relativeEntities":822,"label":823,"description":824,"key":91,"publicationTags":825,"standard":18},[],{"EN":87,"VI":87},{"EN":89,"VI":90},[93,94],[97],{"pages":828,"volume":830},{"VOID":829},"884-897",{"VOID":831},"77",{"total":209,"publishYear":833,"statisticByYear":834},2011,{"2012":345,"2016":345,"2017":345,"2019":345,"2020":345,"2021":345,"2022":200,"2024":345},"2011-09-01","2026-07-19T17:26:09.519+00:00",[93,80],{"id":839,"createTime":840,"updateTime":841,"relativeEntities":842,"slug":843,"properties":844,"entityType":117,"verifyStatus":118,"verifyTime":851,"verifyNote":120,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":852,"fullTextUrl":18,"authors":853,"publicationType":141,"publisherRelationship":903,"citationCount":19,"citationInfo":957,"publishDate":960,"publishYear":958,"citationAnalyzeStatus":214,"lastCitationAnalyze":961,"indexDatabases":962,"openAccess":18,"references":963,"isForceReanalyzing":217},"71bd2e60-96a0-41d2-806d-05017ccc2603","2024-02-14T03:03:42.604+00:00","2026-07-19T04:58:18.054+00:00",[],"Typechecking-for-XML-transformers",{"title":845,"gsPaper":847,"doi":849},{"EN":846},"Typechecking for XML transformers",{"VOID":848},"[\"5939420303911739508\"]",{"VOID":850},"10.1016\u002Fs0022-0000(02)00030-2","2024-05-04T07:36:34.246+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0022000002000302",[854,871,888],{"id":855,"sortIndex":19,"researcher":18,"roles":856,"affiliations":857,"properties":866,"displayName":868,"givenName":18,"familyName":18},"74fcf37e-9679-4990-bbbd-309387489914",[126],[858],{"id":859,"sortIndex":19,"affiliation":860,"properties":18},"ab4f193c-b3fb-4f1f-8096-dd78f46f4b20",{"id":859,"createTime":18,"updateTime":18,"relativeEntities":861,"slug":18,"properties":862,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":865,"statistic":18},[],{"title":863},{"VI":864},"Computer Science Department, Tel Aviv University, Ramat Aviv, Tel Aviv 69978, Israel",[],{"title":867,"gsAuthor":869},{"VI":868},"Tova Milo",{"VOID":870},"[\"X1-ovCkAAAAJ\"]",{"id":872,"sortIndex":345,"researcher":18,"roles":873,"affiliations":874,"properties":883,"displayName":885,"givenName":18,"familyName":18},"df608e96-9263-4564-a590-c5c21e86256a",[126],[875],{"id":876,"sortIndex":19,"affiliation":877,"properties":18},"54897d24-d035-41a8-9ade-1bd2a1042052",{"id":876,"createTime":18,"updateTime":18,"relativeEntities":878,"slug":18,"properties":879,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":882,"statistic":18},[],{"title":880},{"VI":881},"Department of Computer Science, University of Washington, 114 Sieg Hall, Box 352350, Seattle, WA 98195, USA",[],{"title":884,"gsAuthor":886},{"VI":885},"Dan Suciu",{"VOID":887},"[\"SIxd6jgAAAAJ\"]",{"id":889,"sortIndex":200,"researcher":18,"roles":890,"affiliations":891,"properties":900,"displayName":902,"givenName":18,"familyName":18},"efd1f852-6e8b-4173-a656-800a4c776cc8",[126],[892],{"id":893,"sortIndex":19,"affiliation":894,"properties":18},"d9a18012-fd02-4bad-a6a7-f45f778d9654",{"id":893,"createTime":18,"updateTime":18,"relativeEntities":895,"slug":18,"properties":896,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":899,"statistic":18},[],{"title":897},{"VI":898},"University of California at San Diego, 9500 Gilman Dr., La Jolla, CA 92093, USA",[],{"title":901},{"VI":902},"Victor Vianu",{"url":852,"publisher":904,"properties":952},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":905,"slug":10,"properties":906,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":909,"manageAffiliations":926,"indexDatabases":937,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":907,"title":908},{"VOID":13},{"EN":15},[910,914,918,922],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":911,"label":912,"description":913,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":915,"label":916,"description":917,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":919,"label":920,"description":921,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":923,"label":924,"description":925,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},[927,932],{"id":47,"createTime":18,"updateTime":18,"relativeEntities":928,"slug":18,"properties":929,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":931,"statistic":18},[],{"title":930},{"EN":51},[],{"id":54,"createTime":18,"updateTime":18,"relativeEntities":933,"slug":18,"properties":934,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":936,"statistic":18},[],{"title":935},{"EN":58},[],[938,945],{"id":62,"indexDatabase":939,"url":73,"indexYears":74,"academicFieldIds":944,"indexDatabaseRanking":80},{"id":64,"createTime":18,"updateTime":18,"relativeEntities":940,"label":941,"description":942,"key":70,"publicationTags":943,"standard":18},[],{"EN":67,"VI":67},{"EN":67,"VI":69},[72],[76,77,78,79],{"id":82,"indexDatabase":946,"url":95,"indexYears":18,"academicFieldIds":951,"indexDatabaseRanking":18},{"id":84,"createTime":18,"updateTime":18,"relativeEntities":947,"label":948,"description":949,"key":91,"publicationTags":950,"standard":18},[],{"EN":87,"VI":87},{"EN":89,"VI":90},[93,94],[97],{"pages":953,"volume":955},{"VOID":954},"66-97",{"VOID":956},"66",{"total":19,"publishYear":958,"statisticByYear":959},2003,{},"2003-02-01","2026-07-19T04:58:18.053+00:00",[93,80],[964,970,977,981,987,990,996,1000,1004,1007,1013,1017,1021,1025,1028,1034,1037,1041,1044,1047,1053,1056,1059,1063,1066,1069,1072,1075,1078,1081,1084,1087,1090,1094,1097,1100,1103],{"id":965,"text":966,"url":967,"identifiers":968},"badce29d-4d90-4ac8-ada2-b2584b821537","S. Abiteboul, V. Vianu, Regular path queries with constraints, in: Proceedings of ACM Symposium on Principles of Database Systems, Tucson, AZ, 1997, pp. 122–133.","https:\u002F\u002Flinkinghub.elsevier.com\u002Fretrieve\u002Fpii\u002FS0022000099916276",{"doi":969},"10.1006\u002Fjcss.1999.1627",{"id":18,"text":971,"url":972,"identifiers":973},"Aho, 1971, Translations on a context free grammar, Inform. Control, 19, 439, 10.1016\u002FS0019-9958(71)90706-6","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fs0019-9958(71)90706-6",{"mag":974,"openalex":975,"doi":976},"1987709131","W1987709131","10.1016\u002Fs0019-9958(71)90706-6",{"id":18,"text":978,"url":979,"identifiers":980},"D. Beech, S. Lawrence, M. Maloney, N. Mendelsohn, H. Thompson, Xml schema part 1: structures, May 1999, http:\u002F\u002Fwww.w3.org\u002FTR\u002Fxmlschema-1.","http:\u002F\u002Fwww.w3.org\u002FTR\u002Fxmlschema-1",{},{"id":982,"text":983,"url":984,"identifiers":985},"4c68646b-0035-4279-8000-0006b275d4fa","C. Beeri, T. Milo, Schemas for integration and translation of structured and semi-structured data, in: Proceedings of the International Conference on Database Theory, Jerusalem, Israel, 1999, pp. 296–313.","https:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10440-022-00541-7",{"doi":986},"10.1007\u002Fs10440-022-00541-7",{"id":982,"text":988,"url":984,"identifiers":989},"C. Beeri, Y. Tzaban, SAL: an algebra for semistructured data and XML, in: Proceedings of WebDB, Philadelphia, PA, June 1999.",{"doi":986},{"id":991,"text":992,"url":993,"identifiers":994},"61662ba4-d41b-400a-ab84-6817afbaaa42","G.J. Bex, S. Maneth, F. Neven, A formal model for an expressive fragment of XSLT, in: L. et al. (Eds.), Computational Logic—CL 2000, Lecture Notes in Artificial Intelligence, Vol. 1861, Springer, Berlin, 2000, pp. 1137–1151.","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0306437901000333",{"doi":995},"10.1016\u002Fs0306-4379(01)00033-3",{"id":18,"text":997,"url":998,"identifiers":999},"P. Biron, A. Malhotra, Xml schema part 2: datatypes, May 1999, http:\u002F\u002Fwww.w3.org\u002FTR\u002Fxmlschema-2\u002F.","http:\u002F\u002Fwww.w3.org\u002FTR\u002Fxmlschema-2\u002F",{},{"id":18,"text":1001,"url":1002,"identifiers":1003},"A. Bruggemann-Klein, M. Murata, D. Wood, Regular tree languages over non-ranked alphabets, 1998, available at ftp:\u002F\u002Fftp11.informatik.tu-muenchen.de\u002Fpub\u002Fmisc\u002Fcaterpillars\u002F.","\u002F\u002Fftp11.informatik.tu-muenchen.de\u002Fpub\u002Fmisc\u002Fcaterpillars\u002F",{},{"id":982,"text":1005,"url":984,"identifiers":1006},"P. Buneman, S. Davidson, G. Hillebrand, D. Suciu, A query language and optimization techniques for unstructured data, in: Proceedings of ACM-SIGMOD International Conference on Management of Data, Montreal, Canada, 1996, pp. 505–516.",{"doi":986},{"id":1008,"text":1009,"url":1010,"identifiers":1011},"039fd870-1870-480b-89d9-3727948e8e90","Chandra, 1981, Alternation, J. ACM, 28, 114, 10.1145\u002F322234.322243","https:\u002F\u002Fdl.acm.org\u002Fdoi\u002F10.1145\u002F322234.322243",{"doi":1012},"10.1145\u002F322234.322243",{"id":18,"text":1014,"url":1015,"identifiers":1016},"J. Clark, XML path language (XPath), 1999, available from the W3C, http:\u002F\u002Fwww.w3.org\u002FTR\u002Fxpath.","http:\u002F\u002Fwww.w3.org\u002FTR\u002Fxpath",{},{"id":18,"text":1018,"url":1019,"identifiers":1020},"J. Clark, XSL transformations (XSLT) specification, 1999, available from the W3C, http:\u002F\u002Fwww.w3.org\u002FTR\u002FWD-xslt.","http:\u002F\u002Fwww.w3.org\u002FTR\u002FWD-xslt",{},{"id":18,"text":1022,"url":1023,"identifiers":1024},"J. Clark, M. Makoto, Relax ng specification, 2001, available from http:\u002F\u002Fwww.oasis-open.org\u002Fcommittees\u002Frelax-ng\u002F.","http:\u002F\u002Fwww.oasis-open.org\u002Fcommittees\u002Frelax-ng\u002F",{},{"id":982,"text":1026,"url":984,"identifiers":1027},"S. Cluet, C. Delobel, J. Simeon, K. Smaga, Your mediators need data conversion! in: Proceedings of ACM-SIGMOD International Conference on Management of Data, Seattle, WA, 1998, pp. 177–188.",{"doi":986},{"id":1029,"text":1030,"url":1031,"identifiers":1032},"38dc3568-bcfa-481d-9394-7351d9afca8a","A. Deutsch, M. Fernandez, D. Florescu, A. Levy, D. Suciu, A query language for XML, in: Proceedings of the Eights International World Wide Web Conference (WWW8), Toronto, 1999, pp. 77–91.","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1389128699000201",{"doi":1033},"10.1016\u002Fs1389-1286(99)00020-1",{"id":18,"text":1035,"url":18,"identifiers":1036},"Engelfriet, 1999, Trips on trees, Acta Cybernet., 14, 51",{},{"id":18,"text":1038,"url":1039,"identifiers":1040},"P. Fankhauser, M. Fernandez, A. Malhotra, M. Rys, J. Simeon, P. Wadler, XQuery 1.0 formal semantics, 2001, available from the W3C, http:\u002F\u002Fwww.w3.org\u002FTR\u002Fquery-semantics.","http:\u002F\u002Fwww.w3.org\u002FTR\u002Fquery-semantics",{},{"id":982,"text":1042,"url":984,"identifiers":1043},"M. Fernandez, D. Florescu, J. Kang, A. Levy, D. Suciu, Catching the boat with Strudel: experience with a Web-site management system, in: Proceedings of ACM-SIGMOD International Conference on Management of Data, Seattle, WA, 1998, pp. 414–425.",{"doi":986},{"id":18,"text":1045,"url":18,"identifiers":1046},"M. Fernandez, D. Suciu, W. Tan, SilkRoute: trading between relations and XML, in: Proceedings of the WWW9, Amsterdam, 2000, pp. 723–746.",{},{"id":1048,"text":1049,"url":1050,"identifiers":1051},"570ae6a3-f168-4af3-912b-d76e62e77a76","Garcia-Molina, 1997, The TSIMMIS project, J. Intell. Inform. Systems, 8, 117, 10.1023\u002FA:1008683107812","http:\u002F\u002Flink.springer.com\u002F10.1023\u002FA:1008683107812",{"doi":1052},"10.1023\u002FA:1008683107812",{"id":982,"text":1054,"url":984,"identifiers":1055},"N. Globerman, D. Harel, Complexity results for multi-pebble automata and their logics, in: Proceedings of ICALP, Jerusalem, Israel, 1994, pp. 73–82.",{"doi":986},{"id":18,"text":1057,"url":18,"identifiers":1058},"Greenlaw, 1995",{},{"id":18,"text":1060,"url":1061,"identifiers":1062},"H. Hosoya, B.C. Pierce, XDuce: an XML processing language (preliminary report), in: WebDB, 2000, Dallas, TX, 2000, pp. 226–244, http:\u002F\u002Fwww.research.att.com\u002Fconf\u002Fwebdb2000\u002F.","http:\u002F\u002Fwww.research.att.com\u002Fconf\u002Fwebdb2000\u002F",{},{"id":982,"text":1064,"url":984,"identifiers":1065},"H. Hosoya, J. Vouillon, B.C. Pierce, Regular expression types for XML, in: Proceedings of ICFP, 2000, pp. 11–22.",{"doi":986},{"id":18,"text":1067,"url":18,"identifiers":1068},"B. Ludaescher, Y. Papakonstantinou, P. Velikhov, V. Vianu, View definition and dtd inference for xml, in: Workshop on Semistructured Data and Nonstandard Data Formats, Jerusalem, Israel, January 1999.",{},{"id":982,"text":1070,"url":984,"identifiers":1071},"S. Maneth, F. Neven, Structured document transformations based on xsl, in: Proceedings of the Eighth International Workshop on Database Programming Languages, Scotland, 1999.",{"doi":986},{"id":982,"text":1073,"url":984,"identifiers":1074},"J. McHugh, J. Widom, Query optimization for XML, in: Proceedings of VLDB, Edinburgh, UK, September 1999, pp. 315–326.",{"doi":986},{"id":982,"text":1076,"url":984,"identifiers":1077},"T. Milo, D. Suciu, Type inference for queries on semistructured data, in: Proceedings of the ACM Symposium on Principles of Database Systems, Philadelphia, PA, 1999, pp. 215–226.",{"doi":986},{"id":18,"text":1079,"url":18,"identifiers":1080},"F. Neven, T. Schwentick, Query automata, in: Symposium on Principles of Database Systems, Philadelphia, PA, 1999, pp. 205–214.",{},{"id":982,"text":1082,"url":984,"identifiers":1083},"Y. Papakonstantinou, H. Garcia-Molina, J. Widom, Object exchange across heterogeneous information sources, in: IEEE International Conference on Data Engineering, March 1995, pp. 251–260.",{"doi":986},{"id":982,"text":1085,"url":984,"identifiers":1086},"Y. Papakonstantinou, P. Velikhov, Enhancing semistructured data mediators with document type definitions, in: International Conference on Data Engineering, Sydney, Australia, 1999.",{"doi":986},{"id":18,"text":1088,"url":18,"identifiers":1089},"Y. Papakonstantinou, V. Vianu, DTD inference for views of XML data, in: Proceedings of PODS, Dallas, TX, 2000, pp. 35–46.",{},{"id":18,"text":1091,"url":1092,"identifiers":1093},"J. Robie, The design of xql, 1999, http:\u002F\u002Fwww.texcel.no\u002Fwhitepapers\u002Fxql-design.html.","http:\u002F\u002Fwww.texcel.no\u002Fwhitepapers\u002Fxql-design.html",{},{"id":18,"text":1095,"url":18,"identifiers":1096},"Rozenberg, 1997",{},{"id":18,"text":1098,"url":18,"identifiers":1099},"T. Schwentick, Personal communication, 2000.",{},{"id":982,"text":1101,"url":984,"identifiers":1102},"L. Stockmeier, The complexity of decision problems in automata theory and logic, Ph.D. Thesis, Massachusetts Institute of Technology, 1974.",{"doi":986},{"id":18,"text":1104,"url":18,"identifiers":1105},"W. Thomas, Automata on infinite objects, in: Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 133–192 (Vol. B, Chapter 4).",{},{"id":1107,"createTime":1108,"updateTime":1109,"relativeEntities":1110,"slug":1111,"properties":1112,"entityType":117,"verifyStatus":118,"verifyTime":1119,"verifyNote":120,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":1120,"fullTextUrl":18,"authors":1121,"publicationType":141,"publisherRelationship":1137,"citationCount":513,"citationInfo":1191,"publishDate":1194,"publishYear":1192,"citationAnalyzeStatus":214,"lastCitationAnalyze":1195,"indexDatabases":1196,"openAccess":18,"references":1197,"isForceReanalyzing":217},"73e9222e-eb5f-4b22-8029-fe763774bcfc","2023-12-18T11:12:05.202+00:00","2026-07-19T04:16:59.650+00:00",[],"A-prime-decomposition-theorem-for-grammatical-families",{"title":1113,"gsPaper":1115,"doi":1117},{"EN":1114},"A prime decomposition theorem for grammatical families",{"VOID":1116},"[\"8718221709985713103\"]",{"VOID":1118},"10.1016\u002F0022-0000(82)90031-9","2024-04-29T18:09:54.425+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002F0022000082900319",[1122],{"id":1123,"sortIndex":19,"researcher":18,"roles":1124,"affiliations":1125,"properties":1134,"displayName":1136,"givenName":18,"familyName":18},"a088749a-0ace-4158-b42f-c9521aa262f2",[126],[1126],{"id":1127,"sortIndex":19,"affiliation":1128,"properties":18},"ed6db9fa-ec16-4515-b4ed-46b4391035d1",{"id":1127,"createTime":18,"updateTime":18,"relativeEntities":1129,"slug":18,"properties":1130,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1133,"statistic":18},[],{"title":1131},{"VI":1132},"University of Southern California, Los Angeles, California 90007, USA",[],{"title":1135},{"VI":1136},"Seymour Ginsburg",{"url":1120,"publisher":1138,"properties":1186},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1139,"slug":10,"properties":1140,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":1143,"manageAffiliations":1160,"indexDatabases":1171,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":1141,"title":1142},{"VOID":13},{"EN":15},[1144,1148,1152,1156],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":1145,"label":1146,"description":1147,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":1149,"label":1150,"description":1151,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":1153,"label":1154,"description":1155,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":1157,"label":1158,"description":1159,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},[1161,1166],{"id":47,"createTime":18,"updateTime":18,"relativeEntities":1162,"slug":18,"properties":1163,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1165,"statistic":18},[],{"title":1164},{"EN":51},[],{"id":54,"createTime":18,"updateTime":18,"relativeEntities":1167,"slug":18,"properties":1168,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1170,"statistic":18},[],{"title":1169},{"EN":58},[],[1172,1179],{"id":62,"indexDatabase":1173,"url":73,"indexYears":74,"academicFieldIds":1178,"indexDatabaseRanking":80},{"id":64,"createTime":18,"updateTime":18,"relativeEntities":1174,"label":1175,"description":1176,"key":70,"publicationTags":1177,"standard":18},[],{"EN":67,"VI":67},{"EN":67,"VI":69},[72],[76,77,78,79],{"id":82,"indexDatabase":1180,"url":95,"indexYears":18,"academicFieldIds":1185,"indexDatabaseRanking":18},{"id":84,"createTime":18,"updateTime":18,"relativeEntities":1181,"label":1182,"description":1183,"key":91,"publicationTags":1184,"standard":18},[],{"EN":87,"VI":87},{"EN":89,"VI":90},[93,94],[97],{"pages":1187,"volume":1189},{"VOID":1188},"315-361",{"VOID":1190},"24",{"total":513,"publishYear":1192,"statisticByYear":1193},1982,{"1983":345,"1984":345,"1986":345},"1982-06-01","2026-07-19T04:16:59.649+00:00",[93,80],[1198,1201,1207,1214,1217,1220,1224],{"id":982,"text":1199,"url":984,"identifiers":1200},"Blattner, 1979, The decidability of the equivalence of context-free grammar forms, 91",{"doi":986},{"id":1202,"text":1203,"url":1204,"identifiers":1205},"cdb7c363-3043-47d6-bd4e-43c5c956856f","Cremers, 1975, Context-free grammar forms, J. Comput. System Sci., 11, 86, 10.1016\u002FS0022-0000(75)80051-1","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0022000075800511",{"doi":1206},"10.1016\u002Fs0022-0000(75)80051-1",{"id":18,"text":1208,"url":1209,"identifiers":1210},"Cremers, 1977, The structure of context-free grammatical families, J. Comput. System Sci., 15, 262, 10.1016\u002FS0022-0000(77)80030-5","https:\u002F\u002Fdoi.org\u002F10.1016\u002Fs0022-0000(77)80030-5",{"mag":1211,"openalex":1212,"doi":1213},"2018473358","W2018473358","10.1016\u002Fs0022-0000(77)80030-5",{"id":18,"text":1215,"url":18,"identifiers":1216},"Ginsburg, 1975",{},{"id":982,"text":1218,"url":984,"identifiers":1219},"Ginsburg, 1978, A survey of grammar forms — 1977, Acta Cybernet., 3, 269",{"doi":986},{"id":18,"text":1221,"url":18,"identifiers":1222},"Ginsburg, 1974, On incomparable AFL, Comput. System Sci., 9, 88, 10.1016\u002FS0022-0000(74)80040-1",{"doi":1223},"10.1016\u002FS0022-0000(74)80040-1",{"id":18,"text":1225,"url":18,"identifiers":1226},"Wood, 1980, Grammar and L Forms: An Introduction, Vol. 91",{},{"id":1228,"createTime":1229,"updateTime":1230,"relativeEntities":1231,"slug":1232,"properties":1233,"entityType":117,"verifyStatus":118,"verifyTime":1241,"verifyNote":120,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":1242,"fullTextUrl":18,"authors":1243,"publicationType":141,"publisherRelationship":1259,"citationCount":18,"citationInfo":18,"publishDate":1313,"publishYear":1314,"citationAnalyzeStatus":307,"lastCitationAnalyze":1230,"indexDatabases":1315,"openAccess":18,"references":18,"isForceReanalyzing":217},"966af76d-18c9-418a-814b-cc094fd862c3","2024-02-11T00:53:09.244+00:00","2026-07-13T19:05:15.359+00:00",[],"Pattern-reproduction-in-tessellation-automata-of-arbitrary-dimension",{"title":1234,"gsPaper":1236,"references":1237,"doi":1239},{"EN":1235},"Pattern reproduction in tessellation automata of arbitrary dimension",{"VOID":228},{"VOID":1238},"S. Amoroso and G. Cooper, Tessellation Structures for Reproduction of Arbitrary Patterns, J. Comput. System Sci., to appear.\nMoore, 1962, Machine Models of Self-Reproduction, 14, 17\nYamada, 1969, Tessellation automata, Information and Control, 14, 299, 10.1016\u002FS0019-9958(69)90090-4\nKnuth, 1968, Vol. 1",{"VOID":1240},"10.1016\u002Fs0022-0000(71)80019-3","2024-06-26T00:21:08.003+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS0022000071800193",[1244],{"id":1245,"sortIndex":19,"researcher":18,"roles":1246,"affiliations":1247,"properties":1256,"displayName":1258,"givenName":18,"familyName":18},"5e1d452d-47ce-4cf3-9adf-87c0581ccbe8",[126],[1248],{"id":1249,"sortIndex":19,"affiliation":1250,"properties":18},"b435951d-d0bb-4885-b847-975933f02fbb",{"id":1249,"createTime":18,"updateTime":18,"relativeEntities":1251,"slug":18,"properties":1252,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1255,"statistic":18},[],{"title":1253},{"VI":1254},"Moore School of Electrical Engineering, University of Pennsylvania Philadelphia, Pa., USA.",[],{"title":1257},{"VI":1258},"Thomas J. Ostrand",{"url":1242,"publisher":1260,"properties":1308},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1261,"slug":10,"properties":1262,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":1265,"manageAffiliations":1282,"indexDatabases":1293,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":1263,"title":1264},{"VOID":13},{"EN":15},[1266,1270,1274,1278],{"id":22,"createTime":18,"updateTime":18,"relativeEntities":1267,"label":1268,"description":1269,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":25},{},{"id":28,"createTime":18,"updateTime":18,"relativeEntities":1271,"label":1272,"description":1273,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":31},{},{"id":34,"createTime":18,"updateTime":18,"relativeEntities":1275,"label":1276,"description":1277,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":37},{},{"id":40,"createTime":18,"updateTime":18,"relativeEntities":1279,"label":1280,"description":1281,"parentId":18,"standard":18,"scholarHubFieldId":18},[],{"EN":43},{},[1283,1288],{"id":47,"createTime":18,"updateTime":18,"relativeEntities":1284,"slug":18,"properties":1285,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1287,"statistic":18},[],{"title":1286},{"EN":51},[],{"id":54,"createTime":18,"updateTime":18,"relativeEntities":1289,"slug":18,"properties":1290,"entityType":18,"verifyStatus":18,"verifyTime":18,"verifyNote":18,"languages":18,"translateLanguages":18,"viewCount":18,"url":18,"parentIds":1292,"statistic":18},[],{"title":1291},{"EN":58},[],[1294,1301],{"id":62,"indexDatabase":1295,"url":73,"indexYears":74,"academicFieldIds":1300,"indexDatabaseRanking":80},{"id":64,"createTime":18,"updateTime":18,"relativeEntities":1296,"label":1297,"description":1298,"key":70,"publicationTags":1299,"standard":18},[],{"EN":67,"VI":67},{"EN":67,"VI":69},[72],[76,77,78,79],{"id":82,"indexDatabase":1302,"url":95,"indexYears":18,"academicFieldIds":1307,"indexDatabaseRanking":18},{"id":84,"createTime":18,"updateTime":18,"relativeEntities":1303,"label":1304,"description":1305,"key":91,"publicationTags":1306,"standard":18},[],{"EN":87,"VI":87},{"EN":89,"VI":90},[93,94],[97],{"pages":1309,"volume":1311},{"VOID":1310},"623-628",{"VOID":1312},"5","1971-12-01",1971,[93,80]]