1686 search results - page 58 / 338 » Programs as polygraphs: computability and complexity |
173
click to vote
POPL
2008
ACM
16 years 5 days ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
ICALP
2005
Springer
15 years 5 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...
CGF
2008
14 years 12 months ago
2008
Depth and visual hulls are useful for quick reconstruction and rendering of a 3D object based on a number of reference views. However, for many scenes, especially multi-object, th...
ICALP
2003
Springer
15 years 5 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...
88
Voted
POPL
2010
ACM
15 years 6 months ago
2010
ACM
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...