{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:10:40Z","timestamp":1748405440376,"version":"3.41.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Parallel Programming"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1023\/a:1027336712552","type":"journal-article","created":{"date-parts":[[2003,11,9]],"date-time":"2003-11-09T22:46:39Z","timestamp":1068417999000},"page":"393-406","source":"Crossref","is-referenced-by-count":7,"title":["On the Performance of Randomized Embedding of Reproduction Trees in Static Networks"],"prefix":"10.1007","volume":"31","author":[{"given":"Keqin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"473581_CR1","doi-asserted-by":"crossref","unstructured":"S. Bhatt and J.-Y. Cai, Take a Walk, Grow a Tree, Proc. of IEEE Symp. on Foundations of Computer Science, pp. 469-478 (1988).","DOI":"10.1109\/SFCS.1988.21963"},{"issue":"3","key":"473581_CR2","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1145\/174130.174144","volume":"40","author":"S. Bhatt","year":"1993","unstructured":"S. Bhatt and J.-Y. Cai, Taking Random Walks to Grow Trees in Hypercubes, J. ACM, 40(3):741-764 (1993).","journal-title":"J. ACM"},{"issue":"4","key":"473581_CR3","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1137\/0221039","volume":"21","author":"F. T. Leighton","year":"1992","unstructured":"F. T. Leighton, M. J. Newman, A. G. Ranade, and E. J. Schwabe, Dynamic Tree Embeddings in Butterflies and Hypercubes, SIAM J. Comp., 21(4):639-654 (1992).","journal-title":"SIAM J. Comp."},{"key":"473581_CR4","doi-asserted-by":"crossref","unstructured":"W. Aiello and F. T. Leighton, Coding Theory, Hypercube Embeddings, and Fault Tolerance, Proc. of ACM Symp. on Parallel Algorithms and Architectures (1991).","DOI":"10.1145\/113379.113391"},{"key":"473581_CR5","first-page":"21","volume":"126","author":"\u00f6. E\u011fgecio\u011fglu","year":"1997","unstructured":"\u00f6. E\u011fgecio\u011fglu and M. Ibel, Asymptotic Hypercube Embeddings of Dynamic k-ary Trees, Congressus Numerantium, 126:21-32 (1997).","journal-title":"Congressus Numerantium"},{"key":"473581_CR6","doi-asserted-by":"crossref","unstructured":"V. Heun and E. W. Mayr, Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes, Lecture Notes in Computer Science, Vol. 1117, Springer-Verlag, pp. 287-298 (1996).","DOI":"10.1007\/BFb0030119"},{"issue":"2","key":"473581_CR7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1142\/S0129054100000132","volume":"11","author":"K. Li","year":"2000","unstructured":"K. Li, A Method for Evaluating the Expected Load of Dynamic Tree Embeddings in Hypercubes, International Journal on Foundations of Computer Science, 11(2):207-230 (2000).","journal-title":"International Journal on Foundations of Computer Science"},{"key":"473581_CR8","doi-asserted-by":"crossref","unstructured":"A. G. Ranade, Optimal Speedup for Backtrack Search on a Butterfly Network, Proc. of 3rd ACM Symp. on Parallel Algorithms and Architectures, pp. 40-48 (1991).","DOI":"10.1145\/113379.113383"},{"issue":"3","key":"473581_CR9","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1145\/174130.174145","volume":"40","author":"R. M. Karp","year":"1993","unstructured":"R. M. Karp and Y. Zhang, Randomized Parallel Algorithms for Backtrack Search and Branch-and-Bound Computation, J. ACM, 40(3):765-789 (1993).","journal-title":"J. ACM"},{"key":"473581_CR10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1080\/00207169908804790","volume":"71","author":"K. Li","year":"1999","unstructured":"K. Li, Efficient Randomized Load Distribution for Tree Structured Computations on Parallel and Distributed Computer Systems, Int. J. Comput. Math., 71:21-34 (1999).","journal-title":"Int. J. Comput. Math."},{"key":"473581_CR11","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis and G. Persiano, Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors, Proc. of ACM Symp. on Parallel Algorithms and Architectures, pp. 118-126 (1992).","DOI":"10.1145\/140901.140914"},{"key":"473581_CR12","unstructured":"M. A. Palis and D. S. L. Wei, Backtracking and Branch-and-Bound on Mesh-Connected Computers with Reconfigurable Buses, Proc. of 7th International Conference on Parallel and Distributed Computing and Systems, pp. 243-247 (1995)."},{"key":"473581_CR13","doi-asserted-by":"crossref","unstructured":"K. Li, Comparative Performance Evaluation of a Random-Walk-Based Algorithm for Embedding Dynamically Evolving Trees in Hypercubic Networks, to appear in Computation and Concurrency: Practice and Experience, Vol. 15 (2003).","DOI":"10.1002\/cpe.758"},{"issue":"2","key":"473581_CR14","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1137\/S0097539796308710","volume":"29","author":"S. Bhatt","year":"1999","unstructured":"S. Bhatt, D. Greenberg, T. Leighton, and P. Liu, Tight Bounds for On-Line Tree Embeddings, SIAM J. Comp., 29(2):474-491 (1999).","journal-title":"SIAM J. Comp."},{"key":"473581_CR15","doi-asserted-by":"crossref","unstructured":"J. Gaber and B. Toursel, Randomized Load Distribution of Arbitrary Trees on a Distributed Network, Proc. of 13th Annual ACM Symp. on Applied Computing, Atlanta, Georgia, pp. 564-568 (February 1998).","DOI":"10.1145\/330560.330936"},{"issue":"2","key":"473581_CR16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jpdc.1998.1475","volume":"53","author":"K. Li","year":"1998","unstructured":"K. Li, Y. Pan, H. Shen, G. H. Young, and S.-Q. Zheng, Lower Bounds for Dynamic Tree Embedding in Bipartite Graphs, J. Parallel Distr. Com., 53(2):119-143 (1998).","journal-title":"J. Parallel Distr. Com."},{"issue":"1","key":"473581_CR17","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1006\/jpdc.1998.1440","volume":"50","author":"H. Shen","year":"1998","unstructured":"H. Shen, K. Li, Y. Pan, G. H. Young, and S.-Q. Zheng, Performance Analysis for Dynamic Tree Embedding in k-Partite Networks by Random Walk, J. Parallel Distr. Com., 50(1):144-156 (1998).","journal-title":"J. Parallel Distr. Com."},{"key":"473581_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-51866-9","volume-title":"The Theory of Branching Processes","author":"T. Harris","year":"1963","unstructured":"T. Harris, The Theory of Branching Processes, Springer, Berlin (1963)."},{"key":"473581_CR19","volume-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","author":"J. Pearl","year":"1984","unstructured":"J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison\u2013Wesley, Reading, Massachusetts (1984)."},{"key":"473581_CR20","unstructured":"I. Stojmenovi\u0107c, Direct Interconnection Networks, in Parallel and Distributed Computing Handbook, A. Y. Zomaya (ed.), McGraw\u2013Hill, pp. 537-567 (1996)."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027336712552.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1027336712552\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027336712552.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:19:53Z","timestamp":1748333993000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1027336712552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["473581"],"URL":"https:\/\/doi.org\/10.1023\/a:1027336712552","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}