16616 search results - page 3320 / 3324 » Extending Extended Vacuity |
COCO
2003
Springer
15 years 3 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
ECOOP
2010
Springer
15 years 2 months ago
2010
Springer
We reduce JavaScript to a core calculus structured as a small-step operational semantics. We present several peculiarities of the language and show that our calculus models them. W...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
CAV
2010
Springer
15 years 1 months ago
2010
Springer
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...