1226 search results - page 54 / 246 » Proofs, Programs and Abstract Complexity |
147
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
131
Voted
COCO
1995
Springer
15 years 8 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
146
click to vote
SAS
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
133
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
138
click to vote
ICALP
2003
Springer
15 years 10 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...