ICALP
2007
Springer
14 years 5 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...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
ICALP
2007
Springer
14 years 5 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...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Ring signatures, introduced by Rivest, Shamir and Tauman, enable a user to sign a message anonymously on behalf of a “ring”. A ring is a group of users, which includes the sign...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer