5084 search results - page 913 / 1017 » Proving Possibility Properties |
247
click to vote
POPL
2004
ACM
16 years 4 months ago
2004
ACM
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
151
click to vote
RECOMB
2007
Springer
16 years 4 months ago
2007
Springer
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
158
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
135
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
170
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...