Minimizing wirelength in zero and bounded skew clock trees
|
Authors:
|
Moses Charikar
|
Department of Computer Science, Stanford Universiry, Stanford, CA
|
|
|
Jon Kleinberg
|
Department of Computer Science, Cornell University, Ithaca, NY
|
|
|
Ravi Kumar
|
IBM Almaden Research Center, 650 Harry Road, San Jose, CA
|
|
|
Sridhar Rajagopalan
|
IBM Almaden Research Center, 650 Harry Road, San Jose, CA
|
|
|
Amit Sahai
|
Laboratory for Computer Science, M.I.T., Cambridge, MA
|
|
|
Andrew Tomkins
|
IBM Almaden Research Center, 650 Harry Road, San Jose, CA
|
|
|
1999 Article
|
Bibliometrics
|
· Downloads (6 Weeks): 0
· Downloads (12 Months): 1
· Downloads (cumulative): 232
· Citation Count: 2
|
|
| Published in: |
| · Proceeding |
|
SODA '99 Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
|
Pages 177-184
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1999
table of contents
ISBN:0-89871-434-6
|
|
powered by
|
|