7661 search results - page 1343 / 1533 » Languages and the Computing Profession |
161
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
146
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
Say that f : {0, 1}n → {0, 1} -approximates g : {0, 1}n → {0, 1} if the functions disagree on at most an fraction of points. This paper contains two results about approximatio...
177
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We provide a new characterization of certain zero-knowledge protocols as non-interactive instance-dependent commitment-schemes (NIC). To obtain this result we consider th...
196
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
We revisit the problem of memory checking considered by Blum et al. [3]. In this model, a checker monitors the behavior of a data structure residing in unreliable memory given an a...
191
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...