9842 search results - page 114 / 1969 » Problem complexity |
134
click to vote
ASPDAC
2004
ACM
15 years 10 months ago
2004
ACM
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
119
click to vote
BIRTHDAY
2003
Springer
15 years 9 months ago
2003
Springer
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundament...
135
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
132
click to vote
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
146
click to vote
ICTCS
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...