12 search results - page 1 / 3 » Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower ... |
117
click to vote
COCO
2004
Springer
15 years 4 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
116
Voted
ECCC
2010
14 years 11 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
100
Voted
ICCAD
1997
IEEE
15 years 4 months ago
1997
IEEE
Maximum instantaneous power in VLSI circuits has a great impact on circuit's reliability and the design of power and ground lines. To synthesizehighlyreliablesystems,accurate...
100
click to vote
DATE
1998
IEEE
15 years 4 months ago
1998
IEEE
We present an integer-linear-programming-based approach for estimating the maximum instantaneous current through the power supply lines for CMOS circuits. It produces the exact so...
TVLSI
1998
15 years 1 days ago
1998
— Excessive instantaneous power consumption may reduce the reliability and performance of VLSI chips. Hence, to synthesize circuits with high reliability, it is imperative to efï...