Amir H. Salek
Massoud Pedram
- Be57.R. Bellman, Dynamic Programming, Princeton Univ. Press, 1957.]] Google Scholar
Digital Library
- CHKM96.J. Cong, L. He, C. Koh, and E Madden, "Performance optimization of VLSI interconnect layout," In Integration, the VLSI Journal 21, pp. 1-94, 1996.]] Google ScholarDigital Library
- CLZ93.J. Cong, K. Leung, and D. Zhou, "Performance-driven interconnect design based on distributed RC delay model," In Proceedings of the 30th Design Automation Conference, pp. 606-611, 1993.]] Google ScholarDigital Library
- El48.W. C. Elmore, "The transient response of damped linear network with particular regard to wideband amplifiers," In Journal of Applied Physics 19, pp. 55-63, 1948.]]Google ScholarCross Ref
- Gr92.L. K. Grover, "Local search and the local structure of NP-complete problems," In Operations Research Letters 12, pp. 235-243, Oct. 1992.]]Google ScholarDigital Library
- Gi90.L.EEE van Ginneken, "Buffer placement in distributed RC-tree networks for minimal Elmore delay," In Proceedings of International Symposium on Circuits and Systems, pp. 865-868, 1990.]]Google ScholarCross Ref
- GJ79.M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory ofNP-Completeness, W. H. Freeman, SF, CA, 1979.]] Google ScholarDigital Library
- Ha66.M. Hanan, "On Steiner's problem with rectilinear distance," SlAM Journal of Applied Mathematics, No. 14, pp. 255-265, 1966.]]Google Scholar
- LCLH96.J. Lillis, C. K. Cheng, T. Y. Lin, and C. Ho, "New performance driven routing techniques with explicit area/delay tradeoff and simultaneous wire sizing," In Proceedings of the 33th Design Automation Conference, pp. 395-400, 1996.]] Google ScholarDigital Library
- LSP98.J. Lou, A. H. Salek, and M. Pedram, "An integrated flow for technology remapping and placement of sub-half-micron circuits," In Proceedings of Asia and South Pacific Design Automation Conference, pp. 295-300, 1998.]]Google ScholarCross Ref
- OC96a.T. Okamoto, and J. Cong, "Buffered Steiner tree construction with wire sizing for interconnect layout optimization," In Proceedings of International Conference on Computer-Aided Design, pp. 44-49, 1996.]] Google ScholarDigital Library
- OC96b.T. Okamoto, and J. Cong, "Interconnect layout optimization by simultaneous Steiner tree construction and buffer insertion," In Proceedings of the 5'th ACM/SIGDA physical Design Workshop, pp. 1-6, 1996.]]Google Scholar
- SLP98.A. H. Salek, J. Lou, and M. Pedram, "A simultaneous routing tree construction and fanout optimization algorithm," In Proceedings of International Conference on Computer-Aided Design, 1998.]] Google ScholarDigital Library
- SSLM92.E. M. Sentovich, K. J. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, E R. Stephan, R. K. Brayton, and A. Sangiovanni- Vincentelli, "SIS: A system for sequential circuit synthesis," Memorandum No. UCB/ERL M92/41, Electronics Research Laboratory, College of Engineering, University of California, Berkeley, CA 94720, May 1992.]]Google Scholar
- To90.H. Touati, "Performance-oriented technology mapping," Ph.D. thesis, University of California, Berkeley, Technical Report UCB/ERL M90/ 109, November 1990.]] Google ScholarDigital Library
- WM89.W.S. Wong, and R.J.T. Morris, "A new approach to choosing initial points in local search," In Information Processing Letters 30, pp. 67-72, January 1989.]] Google ScholarDigital Library
- Ya92.M. Yannakakis, "The Analysis of Local Search Problems and Their Heuristics," In Proceedings of 7'th Annual Symposium on Theoretical Aspects of Computer Science, pp. 298-311, 1990.]] Google ScholarDigital Library
Index Terms
- MERLIN: semi-order-independent hierarchical buffered routing tree generation using local neighborhood search
Recommendations
MERLIN: Cross-layer integration of MAC and routing for low duty-cycle sensor networks
Sensor network MAC protocols typically sacrifice packet latency to achieve energy efficiency. Such delays may well increase due to routing protocol operation. For this reason it is imperative that we attempt to quantify the end-to-end delay and energy ...
An improved algorithm finding nearest neighbor using Kd-trees
LATIN'08: Proceedings of the 8th Latin American conference on Theoretical informaticsWe suggest a simple modification to the Kd-tree search algorithm for nearest neighbor search resulting in an improved performance. The Kd-tree data structure seems to work well in finding nearest neighbors in low dimensions but its performance degrades ...
K-Nearest Neighbor Finding Using MaxNearestDist
Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth- first or a best-first algorithm to the search hierarchy containing the data. These ...
Comments