an o(nlogn) time algorithm for optimal buffer insertion
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n 2 ) , where n is the number of possible buffer positions.
buffer insertion routing data structure elmore delay