1274 search results - page 71 / 255 » New Proofs for |
120
click to vote
ESOP
2008
Springer
15 years 2 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
91
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
112
click to vote
BIRTHDAY
1997
Springer
15 years 4 months ago
1997
Springer
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
107
Voted
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we show the optimality of a certain class of disturbance-affine control policies in the context of one-dimensional, constrained, multi-stage robust optimization. Ou...
121
Voted
CSL
2007
Springer
15 years 4 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...