{"title":"路径搜索复杂度的平均情况边界","authors":"N. Pippenger","doi":"10.1090/dimacs/042/01","DOIUrl":null,"url":null,"abstract":"Extended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation Constructing nonblocking multicast switching networks with fanout reduction Multirate broadcast switching networks nonblocking in a wide sense Repackable networks-The concept and applications Modeling the blocking behavior of Clos networks Performance of a new decomposition algorithm for rearrangeable fault-tolerant Clos interconnection networks under sub-maximal and no-fault conditions","PeriodicalId":403643,"journal":{"name":"Advances in Switching Networks","volume":"181 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Average-case bounds for the complexity of path-search\",\"authors\":\"N. Pippenger\",\"doi\":\"10.1090/dimacs/042/01\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Extended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation Constructing nonblocking multicast switching networks with fanout reduction Multirate broadcast switching networks nonblocking in a wide sense Repackable networks-The concept and applications Modeling the blocking behavior of Clos networks Performance of a new decomposition algorithm for rearrangeable fault-tolerant Clos interconnection networks under sub-maximal and no-fault conditions\",\"PeriodicalId\":403643,\"journal\":{\"name\":\"Advances in Switching Networks\",\"volume\":\"181 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Switching Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/dimacs/042/01\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Switching Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/dimacs/042/01","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Average-case bounds for the complexity of path-search
Extended generalized shuffle networks: Sufficient conditions for strictly nonblocking operation Constructing nonblocking multicast switching networks with fanout reduction Multirate broadcast switching networks nonblocking in a wide sense Repackable networks-The concept and applications Modeling the blocking behavior of Clos networks Performance of a new decomposition algorithm for rearrangeable fault-tolerant Clos interconnection networks under sub-maximal and no-fault conditions