2370 search results - page 179 / 474 » A Structured Set of Higher-Order Problems |
126
Voted
CORR
2010
Springer
15 years 12 days ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
153
Voted
TCC
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of threshold secret sharing in groups with hierarchical structure. In such settings, the secret is shared among a group of participants that is partitioned ...
144
Voted
TABLEAUX
2009
Springer
15 years 10 months ago
2009
Springer
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...
169
click to vote
PODS
1995
ACM
15 years 7 months ago
1995
ACM
During the last decade various spatial data structures have been designed and compared against each other with respect to their performance. Still missing is a lower bound result,...
152
Voted
COMPGEOM
2006
ACM
15 years 7 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...