Minimizing wirelength in zero and bounded skew clock trees

Cost-sensitive analysis of communication protocols

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing

Clock routing for high-performance ICs

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference

High-performance clock routing based on recursive geometric matching

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference

Nonclairvoyant scheduling

Theoretical Computer Science - Special issue on dynamic and on-line algorithms

An efficient zero-skew routing algorithm

DAC '94 Proceedings of the 31st annual Design Automation Conference

Various notions of approximations: good, better, best, and more

Approximation algorithms for NP-hard problems

Jitter-tolerant clock routing in two-phase synchronous systems

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design

A zero-skew clock routing scheme for VLSI circuits

ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design

Perfect-balance planar clock routing with minimal path-length

ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design

An improved approximation ratio for the minimum latency problem

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms

RNC-Approximation Algorithms for the Steiner Problem

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science

Nearly linear time approximation schemes for Euclidean TSP and other geometric problems

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science

Polynomial time approximation schemes for Euclidean TSP and other geometric problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science