21 search results - page 3 / 5 » Linear Time Sorting of Skewed Distributions |
139
click to vote
TAMC
2007
Springer
15 years 10 months ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
167
Voted
SIAMCOMP
2011
14 years 11 months ago
2011
We investigate ways in which an algorithm can improve its expected performance by fine-tuning itself automatically with respect to an arbitrary, unknown input distribution. We gi...
124
click to vote
PODC
2009
ACM
16 years 4 months ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
156
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
128
click to vote
ISQED
2008
IEEE
15 years 10 months ago
2008
IEEE
Clock meshes have found increasingly wide applications in today’s high-performance IC designs. The inherent routing redundancies associated with clock meshes lead to improved cl...