10988 search results - page 2132 / 2198 » Algorithmic Folding Complexity |
150
Voted
WOLLIC
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...
144
Voted
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
109
click to vote
VISUALIZATION
2002
IEEE
15 years 7 months ago
2002
IEEE
For quantitative examination of phenomena that simultaneously occur on very different spatial and temporal scales, adaptive hierarchical schemes are required. A special numerical ...
141
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
121
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
This paper studies non-cryptographic authenticated broadcast in radio networks subject to malicious failures. We introduce two protocols that address this problem. The first, Nei...