11345 search results - page 1892 / 2269 » Foundations of Computer Science |
133
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
112
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
At TCC 2005, Backes and Cachin proposed a new and very strong notion of security for public key steganography: secrecy against adaptive chosen covertext attack (SS-CCA); and posed ...
118
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We present a new primitive—Append-only Signatures (AOS)—with the property that any party given an AOS signature Sig[M1] on message M1 can compute Sig[M1 M2] for any message M2...
150
click to vote
ICS
2005
Tsinghua U.
15 years 9 months ago
2005
Tsinghua U.
We consider a cluster architecture in which dynamic content is generated by a database back-end and a collection of Web and application server front-ends. We study the effect of t...