{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T13:54:49Z","timestamp":1648734889317},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,5,3]],"date-time":"2011-05-03T00:00:00Z","timestamp":1304380800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s00500-011-0727-y","type":"journal-article","created":{"date-parts":[[2011,5,2]],"date-time":"2011-05-02T12:23:12Z","timestamp":1304338992000},"page":"427-435","source":"Crossref","is-referenced-by-count":4,"title":["Distributed quantum entanglement sharing model for high-performance real-time system"],"prefix":"10.1007","volume":"16","author":[{"given":"Chi-Yuan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao-Hsin","family":"Chou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han-Chieh","family":"Chao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,5,3]]},"reference":[{"key":"727_CR9","doi-asserted-by":"crossref","unstructured":"Ambainis A, Schulman LJ, Ta-Shma A, Vazirani U, Wigderson A (1998) The quantum communication complexity of sampling. In: Proceedings of the 39th annual symposium on foundations of computer science, pp 342\u2013351","DOI":"10.1109\/SFCS.1998.743480"},{"key":"727_CR11","doi-asserted-by":"crossref","first-page":"1895","DOI":"10.1103\/PhysRevLett.70.1895","volume":"70","author":"C Bennett","year":"1993","unstructured":"Bennett C, Brassard G, Crepeau C, Jozsa R, Peres A, Wootters W (1993) Teleporting an unknown quantum state via dual classical and EPR channels. Phys Rev Lett 70:1895\u20131899","journal-title":"Phys Rev Lett"},{"key":"727_CR10","doi-asserted-by":"crossref","unstructured":"Brassard G (2003) Quantum communication complexity. Found Phys 33:1593\u20131616","DOI":"10.1023\/A:1026009100467"},{"key":"727_CR7","unstructured":"Buhrman H, Cleve R, Wigderson A (1998) Quantum vs. classical communication and computation. In: Proceedings of the 30th annual ACM symposium on theory of computing, pp 63\u201368"},{"key":"727_CR6","doi-asserted-by":"crossref","first-page":"2737","DOI":"10.1103\/PhysRevA.60.2737","volume":"60","author":"H Buhrman","year":"1999","unstructured":"Buhrman H, van Dam W, Hoyer P, Tapp A (1999) Muliparty quantum communication complexity. Phys Rev A 60:2737\u20132741","journal-title":"Phys Rev A"},{"key":"727_CR5","doi-asserted-by":"crossref","first-page":"1829","DOI":"10.1137\/S0097539797324886","volume":"30","author":"H Buhrman","year":"2001","unstructured":"Buhrman H, Cleve R, van Dam W (2001) Quantum entanglement and communication complexity. SIAM J Comput 30:1829\u20131841","journal-title":"SIAM J Comput"},{"key":"727_CR15","unstructured":"Chou Y, Tsai I, Kuo S (2006) Enhancing dependability through quantum entanglement in a real-time distributed system. In: Sixth IEEE conference on nanotechnology"},{"key":"727_CR16","doi-asserted-by":"crossref","unstructured":"Chou Y, Tsai I, Fahn C, Horng S, Kuo S (2007) Dependabilities in a high-performance quantum real-time distributed system. In: International conference on information technology","DOI":"10.1109\/ITNG.2007.64"},{"key":"727_CR4","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1103\/PhysRevA.56.1201","volume":"56","author":"R Cleve","year":"1997","unstructured":"Cleve R, Buhrman H (1997) Substituting quantum entanglement for communication. Phys Rev A 56:1201\u20131204","journal-title":"Phys Rev A"},{"key":"727_CR14","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1103\/RevModPhys.81.865","volume":"81","author":"R Horodecki","year":"2009","unstructured":"Horodecki R, Horodecki P, Horodecki M, Horodecki K (2009) Quantum entanglement. Rev Mod Phys 81:865\u2013942","journal-title":"Rev Mod Phys"},{"key":"727_CR3","doi-asserted-by":"crossref","unstructured":"Hromkovic J (1997) Communication complexity and parallel computing. Springer, Berlin","DOI":"10.1007\/978-3-662-03442-2"},{"issue":"4","key":"727_CR19","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1504\/IJAHUC.2010.035537","volume":"6","author":"C Hsu","year":"2010","unstructured":"Hsu C, Chen S (2010) A two-level scheduling strategy for optimising communications of data parallel programs in clusters. Int J Ad Hoc Ubiquitous Comput 6(4):263\u2013269","journal-title":"Int J Ad Hoc Ubiquitous Comput"},{"issue":"3","key":"727_CR18","first-page":"245","volume":"9","author":"P Hsuan","year":"2008","unstructured":"Hsuan P, Dow C, Chen S, Hwang S, Chen S (2008) Design and implementation of IPv6-based anycast system for mobile ad-hoc networks. J Int Technol 9(3):245\u2013256","journal-title":"J Int Technol"},{"key":"727_CR2","doi-asserted-by":"crossref","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication complexity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz E, Nisan N (1997) Communication complexity. University Press, Cambridge"},{"key":"727_CR12","unstructured":"Lee W, Stolfo SJ, Mok KW, Kui W (1999) A data mining framework for building intrusion detection models. In: IEEE symposium on security and privacy"},{"key":"727_CR13","doi-asserted-by":"crossref","unstructured":"Partridge C, Mendez T, Milliken W (1993) Host anycasting service. Request for comments: 1546, Category: Informational, BBN, Network Working Group. http:\/\/www.ietf.org\/rfc\/rfc1546.txt","DOI":"10.17487\/rfc1546"},{"key":"727_CR8","doi-asserted-by":"crossref","unstructured":"Raz R (1999) Exponential separation of quantum and classical communication complexity. In: Proceedings of the 31st annual ACM symposium on theory of computing, pp 358\u2013367","DOI":"10.1145\/301250.301343"},{"issue":"1","key":"727_CR17","first-page":"85","volume":"12","author":"N Sedaghat","year":"2011","unstructured":"Sedaghat N, Tabatabaee-Yazdi H, Akbarzadeh TM (2011) Pareto front based realistic soft real-time task scheduling with multi-objective genetic algorithm on arbitrary heterogeneous multiprocessor system. J Int Technol 12(1):85\u201393","journal-title":"J Int Technol"},{"key":"727_CR1","doi-asserted-by":"crossref","unstructured":"Yao A (1979) Some complexity questions related to distributive computing. In: Proceedings of the 11-th annual ACM symposium on theory of computing","DOI":"10.1145\/800135.804414"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-011-0727-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-011-0727-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-011-0727-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T12:34:59Z","timestamp":1560170099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-011-0727-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,3]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["727"],"URL":"https:\/\/doi.org\/10.1007\/s00500-011-0727-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,3]]}}}