{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:37Z","timestamp":1750308157217,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,3,4]],"date-time":"2006-03-04T00:00:00Z","timestamp":1141430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,3,4]]},"DOI":"10.1145\/1117278.1117281","type":"proceedings-article","created":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T21:40:43Z","timestamp":1147124443000},"page":"9-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A priori prediction of tightly clustered connections based on heuristic classification trees"],"prefix":"10.1145","author":[{"given":"Pranav","family":"Anbalagan","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey A.","family":"Davis","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,3,4]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"26","article-title":"Placement and average interconnection lengths of computer logic","author":"Donath W. E.","year":"1979","unstructured":"W. E. Donath , \" Placement and average interconnection lengths of computer logic ,\" in IEEE Transactions on Circuits and Systems , vol. C AS- 26 , pp. 272--277, April 1979 . W. E. Donath, \"Placement and average interconnection lengths of computer logic,\" in IEEE Transactions on Circuits and Systems, vol. CAS-26, pp. 272--277, April 1979.","journal-title":"IEEE Transactions on Circuits and Systems"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1147\/rd.252.0152"},{"key":"e_1_3_2_1_3_1","first-page":"390","article-title":"Interconnection length estimation for optimized standard cell layouts","author":"Pedram M.","year":"1989","unstructured":"M. Pedram and B. Preas , \" Interconnection length estimation for optimized standard cell layouts ,\" in Proceedings of International Conference on Computer-Aided Design , 1989 , pp. 390 -- 393 . M. Pedram and B. Preas, \"Interconnection length estimation for optimized standard cell layouts,\" in Proceedings of International Conference on Computer-Aided Design, 1989, pp. 390--393.","journal-title":"Proceedings of International Conference on Computer-Aided Design"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1109\/CICC.1996.510535"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1109\/43.784119"},{"key":"e_1_3_2_1_6_1","first-page":"465","article-title":"GLMC: Interconnect length estimation by growth-limited multifold clustering","author":"Alvandpour A.","year":"2000","unstructured":"A. Alvandpour , P. Larsson-Edefors and C. Svensson , \" GLMC: Interconnect length estimation by growth-limited multifold clustering ,\" in Proceedings of IEEE International Symposium on Circuits and Systems , 2000 , pp. 465 -- 468 . A. Alvandpour, P. Larsson-Edefors and C. Svensson, \"GLMC: Interconnect length estimation by growth-limited multifold clustering,\" in Proceedings of IEEE International Symposium on Circuits and Systems, 2000, pp. 465--468.","journal-title":"Proceedings of IEEE International Symposium on Circuits and Systems"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/333032.333038"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1109\/16.661219"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1155\/1999\/81698"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/775832.776035"},{"unstructured":"IBM Placement Benchmarks {Online}. Available: http:\/\/er.cs.ucla.edu\/benchmarks\/ibm-place\/  IBM Placement Benchmarks {Online}. Available: http:\/\/er.cs.ucla.edu\/benchmarks\/ibm-place\/","key":"e_1_3_2_1_11_1"},{"unstructured":"Capo Placement Tool {Online}. Available: http:\/\/vlsicad.eecs.umich.edu\/BK\/PDtools\/tar.gz\/Placement-bin\/  Capo Placement Tool {Online}. Available: http:\/\/vlsicad.eecs.umich.edu\/BK\/PDtools\/tar.gz\/Placement-bin\/","key":"e_1_3_2_1_12_1"},{"unstructured":"Dragon Placement Tool {Online}. Available: http:\/\/er.cs.ucla.edu\/Dragon\/  Dragon Placement Tool {Online}. Available: http:\/\/er.cs.ucla.edu\/Dragon\/","key":"e_1_3_2_1_13_1"}],"event":{"sponsor":["ACM Association for Computing Machinery","SIGDA ACM Special Interest Group on Design Automation"],"acronym":"SLIP06","name":"SLIP06: International Workshop on System Level Interconnect Prediction","location":"Munich Germany"},"container-title":["Proceedings of the 2006 international workshop on System-level interconnect prediction"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1117278.1117281","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1117278.1117281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:18:55Z","timestamp":1750263535000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1117278.1117281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3,4]]},"references-count":13,"alternative-id":["10.1145\/1117278.1117281","10.1145\/1117278"],"URL":"https:\/\/doi.org\/10.1145\/1117278.1117281","relation":{},"subject":[],"published":{"date-parts":[[2006,3,4]]},"assertion":[{"value":"2006-03-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}