10871 search results - page 1996 / 2175 » A stable programming language |
147
Voted
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
We revisit the problem of memory checking considered by Blum et al. [3]. In this model, a checker monitors the behavior of a data structure residing in unreliable memory given an a...
138
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
131
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
We study the classic problem of estimating the sum of n variables. The traditional uniform sampling approach requires a linear number of samples to provide any non-trivial guarante...
150
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
138
click to vote
IFIP
2007
Springer
15 years 11 months ago
2007
Springer
Wormhole attacks can destabilize or disable wireless sensor networks. In a typical wormhole attack, the attacker receives packets at one point in the network, forwards them through...