{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:54Z","timestamp":1725511794876},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_15","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"163-174","source":"Crossref","is-referenced-by-count":14,"title":["Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs"],"prefix":"10.1007","author":[{"given":"Robert","family":"Els\u00e4sser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Sauerwald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Akers, S., Harel, D., Krishnamurthy, B.: The star graph: An attractive alternative to the n-cube. In: Proc. of ICPP\u201987, pp. 393\u2013400 (1987)"},{"key":"15_CR2","unstructured":"Akers, S., Krishnamurthy, B.: A group-theoretic model for symmetric innterconnection networks. In: Proc. of ICPP\u201986, pp. 555\u2013565 (1986)"},{"key":"15_CR3","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, Chichester (2000)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"3013","DOI":"10.1090\/S0002-9947-05-03610-X","volume":"357","author":"I. Benjamini","year":"2005","unstructured":"Benjamini, I., et al.: Mixing times of the biased card shuffling and the asymmetric exclusion process. Transactions of the American Mathematical Society\u00a0357, 3013\u20133029 (2005)","journal-title":"Transactions of the American Mathematical Society"},{"key":"15_CR5","volume-title":"Algebraic Graph Theory","author":"N. Biggs","year":"1993","unstructured":"Biggs, N.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1993)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat.\u00a023, 493\u2013507 (1952)","journal-title":"Ann. Math. Stat."},{"key":"15_CR7","series-title":"CBMS Regional conference series in mathematics","volume-title":"Spectral Graph Theory","author":"F. Chung","year":"1997","unstructured":"Chung, F.: Spectral Graph Theory. CBMS Regional conference series in mathematics, vol.\u00a092. American Mathematical Society, Providence (1997)"},{"key":"15_CR8","unstructured":"Chung, F., Lu, L.: Concentration inequalities and martingale inequalities \u2014 a survey. In: Internet Mathematics (to appear)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Demers, A., et al.: Epidemic algorithms for replicated database maintenance. In: Proc. of PODC\u201987, pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Diaconis, P.: Group Representations in Probability and Statistics. Lecture notes-Monograph Series, vol.\u00a011 (1988)","DOI":"10.1214\/lnms\/1215467407"},{"issue":"7","key":"15_CR11","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/S0167-8191(99)00018-6","volume":"25","author":"R. Diekmann","year":"1999","unstructured":"Diekmann, R., Frommer, A., Monien, B.: Efficient schemes for nearest neighbor load balancing. Parallel Computing\u00a025(7), 789\u2013812 (1999)","journal-title":"Parallel Computing"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/11604686_27","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"R. Els\u00e4sser","year":"2005","unstructured":"Els\u00e4sser, R., Sauerwald, T.: On randomized broadcasting in star graphs. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 307\u2013318. Springer, Heidelberg (2005)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11940128_36","volume-title":"Algorithms and Computation","author":"R. Els\u00e4sser","year":"2006","unstructured":"Els\u00e4sser, R., Sauerwald, T.: On the runtime and robustness of randomized broadcasting. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 349\u2013358. Springer, Heidelberg (2006)"},{"issue":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1002\/rsa.3240010406","volume":"1","author":"U. Feige","year":"1990","unstructured":"Feige, U., et al.: Randomized broadcast in networks. Random Structures and Algorithm\u00a01(4), 447\u2013460 (1990)","journal-title":"Random Structures and Algorithm"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1016\/0167-8191(96)00023-3","volume":"22","author":"L. Gasieniec","year":"1996","unstructured":"Gasieniec, L., Pelc, A.: Adaptive broadcasting with faulty nodes. Parallel Computing\u00a022, 903\u2013912 (1996)","journal-title":"Parallel Computing"},{"key":"15_CR16","unstructured":"Habib, M., et al.: Probabilistic Methods for Algorithmic Discrete Mathematics. In: Algorithms and Combinatorics (1991)"},{"issue":"6","key":"15_CR17","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"36","author":"T. Hagerup","year":"1990","unstructured":"Hagerup, T., R\u00fcb, C.: A guided tour of chernoff bounds. Information Processing Letters\u00a036(6), 305\u2013308 (1990)","journal-title":"Information Processing Letters"},{"key":"15_CR18","volume-title":"Dissemination of Information in Communication Networks","author":"J. Hromkovi\u010d","year":"2005","unstructured":"Hromkovi\u010d, J., et al.: Dissemination of Information in Communication Networks. Springer, Heidelberg (2005)"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Leighton, F., Maggs, B., Sitamaran, R.: On the fault tolerance of some popular bounded-degree networks. In: Proc.\u00a0of FOCS\u201992, pp. 542\u2013552 (1992)","DOI":"10.1109\/SFCS.1992.267797"},{"issue":"3","key":"15_CR20","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica\u00a08(3), 261\u2013277 (1988)","journal-title":"Combinatorica"},{"issue":"1","key":"15_CR21","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1137\/0147013","volume":"47","author":"B. Pittel","year":"1987","unstructured":"Pittel, B.: On spreading rumor. SIAM Journal on Applied Mathematics\u00a047(1), 213\u2013223 (1987)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"A. Sinclair","year":"1989","unstructured":"Sinclair, A., Jerrum, M.: Approximate counting, uniform generation, and rapidly mixing markov chains. Inform. and Comput.\u00a082, 93\u2013113 (1989)","journal-title":"Inform. and Comput."},{"key":"15_CR23","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1214\/aoap\/1075828054","volume":"14","author":"D. Wilson","year":"2004","unstructured":"Wilson, D.: Mixing times of lozenge tiling and card shuffling markov chains. Annals of Applied Probability\u00a014, 274\u2013325 (2004)","journal-title":"Annals of Applied Probability"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T13:19:47Z","timestamp":1707916787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_15","relation":{},"subject":[]}}