{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:57:26Z","timestamp":1725544646923},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_30","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T08:27:54Z","timestamp":1141115274000},"page":"372-383","source":"Crossref","is-referenced-by-count":3,"title":["Tradeoffs in Depth-Two Superconcentrators"],"prefix":"10.1007","author":[{"given":"Chinmoy","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaikumar","family":"Radhakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/S0022-0000(05)80027-3","volume":"48","author":"N. Alon","year":"1994","unstructured":"Alon, N., Pudl\u00e1k, P.: Superconcentrators of depth 2 and 3; odd levels help (rarely). J. Comput. System Sci.\u00a048, 194\u2013202 (1994)","journal-title":"J. Comput. System Sci."},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Pippenger, N., Wigderson, A.: Superconcentrators, generalizers and generalized connectors with limited depth. In: Proc. 15th Annual ACM Symposium on Theory of Computing, New York, pp. 42\u201351 (1983)","DOI":"10.1145\/800061.808731"},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1006\/inco.2001.3046","volume":"171","author":"G.S. Frandsen","year":"2002","unstructured":"Frandsen, G.S., Hansen, J.P., Miltersen, P.B.: Lower bounds for dynamic algebraic problems. Information and Computation\u00a0171(2), 333\u2013349 (2002)","journal-title":"Information and Computation"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0304-3975(84)90032-X","volume":"32","author":"R. Meshulum","year":"1984","unstructured":"Meshulum, R.: A geometric construction of a superconcentrator of depth 2. Theoret. Comput. Sci.\u00a032, 215\u2013219 (1984)","journal-title":"Theoret. Comput. Sci."},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Paul, W.J., Tarjan, R.E., Celoni, J.R.: Space bounds for a game on graphs. In: Proc. 8th Annual ACM Symposium on Theory of Computing, Hershey, PA, May 1976, pp. 149\u2013160 (1976)","DOI":"10.1145\/800113.803643"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0206022","volume":"6","author":"N. Pippenger","year":"1977","unstructured":"Pippenger, N.: Superconcentrators. SIAM J. Comput.\u00a06, 298\u2013304 (1977)","journal-title":"SIAM J. Comput."},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/0022-0000(82)90056-3","volume":"24","author":"N. Pippenger","year":"1982","unstructured":"Pippenger, N.: Superconcentrators of depth 2. J. Comput. System Sci.\u00a024, 82\u201390 (1982)","journal-title":"J. Comput. System Sci."},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF01215351","volume":"14","author":"P. Pudl\u00e1k","year":"1994","unstructured":"Pudl\u00e1k, P.: Communication in bounded depth circuits. Combinatorica\u00a014, 203\u2013216 (1994)","journal-title":"Combinatorica"},{"key":"30_CR9","first-page":"1570","volume":"32","author":"J. Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors and depth-two superconcentrators. SIAM J. Disc. Math.\u00a032, 1570\u20131585 (2000)","journal-title":"SIAM J. Disc. Math."},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1006\/jagm.1995.0807","volume":"22","author":"J.H. Reif","year":"1997","unstructured":"Reif, J.H., Tate, S.R.: On dynamic algorithms for algebraic problems. Journal of Algorithms\u00a022, 347\u2013371 (1997)","journal-title":"Journal of Algorithms"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: On nonlinear lower bounds in computational complexity. In: Proc. 7th Annual ACM Symposium on Theory of Computing, Albuquerque, NM, May 1975, pp. 45\u201353 (1975)","DOI":"10.1145\/800116.803752"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/S0022-0000(76)80041-4","volume":"13","author":"L.G. Valiant","year":"1976","unstructured":"Valiant, L.G.: Graph-theoretic properties in computational complexity. J. Comput. System Sci.\u00a013, 278\u2013285 (1976)","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T03:31:31Z","timestamp":1555471891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11672142_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}