3415 search results - page 458 / 683 » Lower bounds on kernelization |
143
click to vote
ASIACRYPT
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. In the standard general-adversary model for multi-party protocols, a global adversary structure is given, and every party must trust in this particular structure. We intr...
150
click to vote
ER
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...
157
click to vote
EUC
2007
Springer
16 years 21 days ago
2007
Springer
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...
165
click to vote
ISAAC
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
189
click to vote
LFCS
2007
Springer
16 years 20 days ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...