2379 search results - page 386 / 476 » Computer Science in the Information Age |
161
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
107
click to vote
FOCS
1993
IEEE
15 years 8 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
129
click to vote
RTA
2010
Springer
15 years 8 months ago
2010
Springer
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
155
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
126
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
A desirable goal for cryptographic protocols is to guarantee security when the protocol is composed with other protocol instances. Universally Composable (UC) protocols provide th...