438 search results - page 53 / 88 » The forest hiding problem |
119
click to vote
ACRI
2010
Springer
14 years 10 months ago
2010
Springer
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical configurations. We prove that the algorithmic problem c...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
112
click to vote
CONCUR
2007
Springer
15 years 6 months ago
2007
Springer
The model checking problem for finite-state open systems (module checking) has been extensively studied in the literature, both in the context of environments with perfect and imp...
102
click to vote
EUROPAR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Algorithmic skeletons correspond to a high-level programming model that takes advantage of nestable programming patterns to hide the complexity of parallel/distributed ap...
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We provide a new characterization of certain zero-knowledge protocols as non-interactive instance-dependent commitment-schemes (NIC). To obtain this result we consider th...