{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:34:42Z","timestamp":1729632882931,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/ispan.2004.1300463","type":"proceedings-article","created":{"date-parts":[[2004,6,10]],"date-time":"2004-06-10T10:19:45Z","timestamp":1086862785000},"page":"86-91","source":"Crossref","is-referenced-by-count":0,"title":["Bounds on the client-server incremental computing"],"prefix":"10.1109","author":[{"family":"Cho-chin Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Tsan-sheng Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Da-wei Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/HCW.2000.843751"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36265-7_11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.1996.537155"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.1994.590409"},{"journal-title":"Scalable Parallel Computing Technology Architecture Programming","year":"1997","author":"hwang","key":"ref14"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2001.1818"},{"key":"ref3","article-title":"A Fast and Highly Quality Multilevel Scheme for Partitioning Irregular Graphs","volume":"20","author":"karypis","year":"1999","journal-title":"SIAM J Scientific Computing"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/78.984749"},{"key":"ref5","first-page":"650","article-title":"A Novel Message Scheduling Paradigm for Developing Algorithms in Network Computing Platform","author":"lin","year":"2003","journal-title":"Proc Int'l Conf Advanced Information Networking and Applications"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03927-4","article-title":"Introduction to Circuit Complexity — A Uniform Approach","author":"vollmer","year":"1999","journal-title":"Texts in Theoretical Computer Science An EATCS Series"},{"key":"ref7","article-title":"Efficient Communication Schedule for Block-Cyclic Array Redistribution between Processor Sets","volume":"10","author":"park","year":"1999","journal-title":"IEEE Trans Parallel and Distributed Systems"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP Completeness","year":"1979","author":"garey","key":"ref2"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1006\/jpdc.1999.1571","article-title":"Adaptive Communication Algorithms for Distributed Heterogeneous Systems","volume":"59","author":"bhat","year":"1999","journal-title":"J Parallel and Distributed Computing"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/59.630474"}],"event":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","start":{"date-parts":[[2004,5,12]]},"location":"Hong Kong, China","end":{"date-parts":[[2004,5,12]]}},"container-title":["7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9103\/28881\/01300463.pdf?arnumber=1300463","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T03:57:27Z","timestamp":1497585447000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1300463\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/ispan.2004.1300463","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}