Convexity-based algorithms for design centering
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Algorithms Based on Randomization and Linear and Semidefinite Programming
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Interconnect Delay Minimization Using a Novel Pre-Mid-Post Buffer Strategy
VLSID '03 Proceedings of the 16th International Conference on VLSI Design
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
Mathematics of Operations Research
Operations Research Letters
A polynomial time dual algorithm for the Euclidean multifacility location problem
Operations Research Letters
Dimension, halfspaces, and the density of hard sets
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Hi-index | 0.00 |
The use of highly expanding bipartite multigraphs (called dispersers) to reduce greatly the error of probabilistic algorithms at the cost of few additional random bits is treated. Explicit constructions of such graphs are generalized and used to obtain ...