16666 search results - page 2489 / 3334 » Descriptive and Computational Complexity |
171
click to vote
FOCS
2005
IEEE
16 years 1 months ago
2005
IEEE
Barak et al. formalized the notion of obfuscation, and showed that there exist (contrived) classes of functions that cannot be obfuscated. In contrast, Canetti and Wee showed how ...
159
click to vote
FOCS
2005
IEEE
16 years 1 months ago
2005
IEEE
We study truthful mechanisms for auctions in which the auctioneer is trying to hire a team of agents to perform a complex task, and paying them for their work. As common in the ï¬...
189
click to vote
FOCS
2005
IEEE
16 years 1 months ago
2005
IEEE
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
213
Voted
FOCS
2005
IEEE
16 years 1 months ago
2005
IEEE
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
216
click to vote
GLVLSI
2005
IEEE
16 years 1 months ago
2005
IEEE
A hierarchical scheme with cells and modules is crucial for managing design complexity during a large integrated circuit design. We present a methodology for thermal aware cell-ba...