{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:48:43Z","timestamp":1725468523233},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055828","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T13:36:31Z","timestamp":1155821791000},"page":"771-779","source":"Crossref","is-referenced-by-count":3,"title":["On the complexity of wavelength converters"],"prefix":"10.1007","author":[{"given":"Vincenzo","family":"Auletta","sequence":"first","affiliation":[]},{"given":"Ioannis","family":"Caragiannis","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[]},{"given":"Pino","family":"Persiano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"75_CR1","unstructured":"V. Auletta, I. Caragiannis, C. Kaklamanis, P. Persiano, \u201cBandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters\u201d. In Proc. of SIROCCO '97, 1997."},{"key":"75_CR2","doi-asserted-by":"crossref","unstructured":"V. Auletta, I. Caragiannis, C. Kaklamanis, P. Persiano, \u201cEfficient Wavelength Routing in Trees with Low-Degree Converters\u201d. In Proc. of the DIMACS Workshop on Optical Networks, 1998, to appear.","DOI":"10.1090\/dimacs\/046\/01"},{"key":"75_CR3","doi-asserted-by":"crossref","unstructured":"L. Gargano, \u201cLimited Wavelength Conversion in All-Optical Tree Networks\u201d. In Proc. of ICALP '98, 1998, to appear.","DOI":"10.1007\/BFb0055083"},{"key":"75_CR4","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis, P. Persiano, \u201cEfficient Wavelength Routing on Directed Fiber Trees\u201d. In Proc. of the 4th European Symposium on Algorithms (ESA '96), LNCS, Springer Verlag, 1996, pp. 460\u2013470.","DOI":"10.1007\/3-540-61680-2_75"},{"key":"75_CR5","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis, P. Persiano, T. Erlebach, K. Jansen, \u201cConstrained Bipartite Edge Coloring with Applications to Wavelength Routing\u201d. In Proc. of ICALP '97, LNCS 1256, Springer Verlag, 1997, pp. 493\u2013504.","DOI":"10.1007\/3-540-63165-8_205"},{"key":"75_CR6","unstructured":"V. Kumar, E. Schwabe, \u201cImproved Access to Optical Bandwidth in Trees\u201d. In Proc. of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 1997."},{"key":"75_CR7","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"L. A","year":"1988","unstructured":"A. Lubotsky, R. Philipps, P. Sarnak, \u201cRamanujan Graphs\u201d. Combinatorica, vol. 8, pp. 261\u2013278, 1988.","journal-title":"Combinatorica"},{"key":"75_CR8","unstructured":"M. Mihail, C. Kaklamanis, S. Rao, \u201cEfficient Access to Optical Bandwidth\u201d. In Proc. of the 36th Annual Symposium on Foundations of Computer Science, pp. 548\u2013557, 1995."},{"key":"75_CR9","doi-asserted-by":"crossref","unstructured":"J. Radhakrishnan, A. Ta-Shma, \u201cTight Bounds for Depth-Two Superconcentrators\u201d. In Proc. of the 38th Annual Symposium on Foundations of Computer Science, 1997.","DOI":"10.1109\/SFCS.1997.646148"},{"key":"75_CR10","doi-asserted-by":"crossref","unstructured":"P. Raghavan, E. Upfal, \u201cEfficient Routing in All-Optical Networks\u201d. In Proc. of the 26th Annual ACM Symposium on the Theory of Computing, 1994, pp. 133\u2013143.","DOI":"10.1145\/195058.195119"},{"key":"75_CR11","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0022-0000(88)90035-9","volume":"36","author":"M. Sipser","year":"1988","unstructured":"M. Sipser, \u201cExpanders, randomness, or time versus space\u201d. Journal of Computer and System Sciences, 36:379\u2013383, 1988.","journal-title":"Journal of Computer and System Sciences"},{"key":"75_CR12","doi-asserted-by":"crossref","unstructured":"A. Ta-Shma, \u201cAlmost Optimal Dispersere\u201d. In Proc. of STOC '98, 1998, to appear.","DOI":"10.1145\/276698.276736"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055828","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T14:44:43Z","timestamp":1555771483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055828"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0055828","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}