{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T05:18:01Z","timestamp":1733548681434,"version":"3.30.1"},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7078,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0304-3975(94)90293-3","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T22:41:59Z","timestamp":1034289719000},"page":"45-59","source":"Crossref","is-referenced-by-count":57,"title":["Computational complexity of loss networks"],"prefix":"10.1016","volume":"125","author":[{"given":"Graham","family":"Louth","sequence":"first","affiliation":[]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Kelly","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1948","series-title":"The Life and Works of A.K. Erlang","author":"Brockmeyer","key":"10.1016\/0304-3975(94)90293-3_BIB1"},{"key":"10.1016\/0304-3975(94)90293-3_BIB2","doi-asserted-by":"crossref","first-page":"850","DOI":"10.2307\/3213701","article-title":"Insensitivity of blocking probabilities in a circuit switched network","volume":"21","author":"Burman","year":"1984","journal-title":"Adv. in Appl. Probab."},{"key":"10.1016\/0304-3975(94)90293-3_BIB3","unstructured":"A.E. Conway, E. Pinsky and S. Tridandapani, Efficient decomposition methods for the exact analysis of circuit-switched networks,J. ACM, to appear."},{"key":"10.1016\/0304-3975(94)90293-3_BIB4","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0166-5316(87)90013-7","article-title":"Congestion probabilities in a circuit-switched integrated services network","volume":"7","author":"Dziong","year":"1987","journal-title":"Performance Evaluation"},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/0304-3975(94)90293-3_BIB5"},{"year":"1976","series-title":"Graph Theory","author":"Harary","key":"10.1016\/0304-3975(94)90293-3_BIB6"},{"key":"10.1016\/0304-3975(94)90293-3_BIB7","article-title":"Determining grades of service in a network","author":"Harvey","year":"1979","journal-title":"9th Internat. Teletraffic Congress"},{"year":"1990","series-title":"Switching and Traffic Theory for Integrated Broadband Networks","author":"Hui","key":"10.1016\/0304-3975(94)90293-3_BIB8"},{"key":"10.1016\/0304-3975(94)90293-3_BIB9","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1137\/0218077","article-title":"Approximating the permanent","volume":"18","author":"Jerrum","year":"1989","journal-title":"SIAM. J. Comput."},{"key":"10.1016\/0304-3975(94)90293-3_BIB10","series-title":"Tech. Report CSR-1-90","article-title":"Polynomial time approximation algorithms for the Ising model","author":"Jerrum","year":"1990"},{"key":"10.1016\/0304-3975(94)90293-3_BIB11","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","article-title":"Random generation of combinatorial structures from a uniform distribution","volume":"43","author":"Jerrum","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90293-3_BIB12","series-title":"Proc. 24th Ann. Symp. on Foundations of Computer Science","first-page":"56","article-title":"Monte-Carlo algorithms for enumeration and reliability problems","author":"Karp","year":"1983"},{"year":"1979","series-title":"Reversibility and Stochastic Networks","author":"Kelly","key":"10.1016\/0304-3975(94)90293-3_BIB13"},{"key":"10.1016\/0304-3975(94)90293-3_BIB14","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1111\/j.2517-6161.1985.tb01367.x","article-title":"Stochastic models of computer communication systems","volume":"47","author":"Kelly","year":"1985","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"key":"10.1016\/0304-3975(94)90293-3_BIB15","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1214\/aoap\/1177005872","article-title":"Loss networks","volume":"1","author":"Kelly","year":"1991","journal-title":"Ann. Appl. Probab."},{"key":"10.1016\/0304-3975(94)90293-3_BIB16","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01158789","article-title":"Effective bandwidths at multi-class queues","volume":"9","author":"Kelly","year":"1991","journal-title":"Queueing Systems Theory Appl."},{"key":"10.1016\/0304-3975(94)90293-3_BIB17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(82)90139-9","article-title":"Some observations on probabilistic algorithms and NP-hard problems","volume":"14","author":"Ko","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)90293-3_BIB18","first-page":"275","article-title":"Realizable traffic patterns and capacity of disjointly shared networks","volume":"10","author":"Lagarias","year":"1985","journal-title":"Comput. Networks"},{"key":"10.1016\/0304-3975(94)90293-3_BIB19","series-title":"Ph.D. Thesis","article-title":"Stochastic networks: complexity, dependence, and routing","author":"Louth","year":"1991"},{"key":"10.1016\/0304-3975(94)90293-3_BIB20","doi-asserted-by":"crossref","first-page":"219","DOI":"10.2307\/1427381","article-title":"Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking","volume":"19","author":"Mitra","year":"1987","journal-title":"Adv. in Appl. Probab."},{"key":"10.1016\/0304-3975(94)90293-3_BIB21","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1145\/1634.2509","article-title":"Probabilistic models of database locking: solutions, computational algorithms and asymptotics","volume":"31","author":"Mitra","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90293-3_BIB22","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF02023089","article-title":"Computational algorithms for blocking probabilities in circuit-switched networks","volume":"35","author":"Pinsky","year":"1992","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/0304-3975(94)90293-3_BIB23","series-title":"Performance '84","article-title":"A statistical mechanics of some interconnection networks","author":"Pinsky","year":"1984"},{"key":"10.1016\/0304-3975(94)90293-3_BIB24","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","article-title":"The complexity of counting cuts and of computing the probability that a graph is connected","volume":"12","author":"Provan","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90293-3_BIB25","doi-asserted-by":"crossref","first-page":"657","DOI":"10.2307\/1427463","article-title":"Teletraffic engineering for product-form circuit-switched networks","volume":"22","author":"Ross","year":"1990","journal-title":"Adv. in. Appl. Probab."},{"key":"10.1016\/0304-3975(94)90293-3_BIB26","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1017\/S0269964800002576","article-title":"Monte-Carlo summation applied to product-form loss networks","volume":"6","author":"Ross","year":"1992","journal-title":"Prob. Eng. Inf. Sci."},{"key":"10.1016\/0304-3975(94)90293-3_BIB27","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90293-3_BIB28","series-title":"Disorder in Physical Systems","first-page":"307","article-title":"The computational complexity of some classical problems from statistical physics","author":"Welsh","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902933?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902933?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T19:50:48Z","timestamp":1733514648000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594902933"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0304397594902933"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90293-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}