13306 search results - page 269 / 2662 » Theoretical Computer Science |
173
click to vote
SPIN
2004
Springer
15 years 12 months ago
2004
Springer
Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution
142
click to vote
RTA
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We investigate conditions under which con uence and or termination are preserved for constructor-sharing and hierarchical combinations of rewrite systems, one of which is...
156
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Suppose that every k points in a n point metric space X are D-distortion embed
198
click to vote
DLT
2009
15 years 4 months ago
2009
A survey of applications of factorization forests. Fix a regular language L A . You are given a word a1
208
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...