10585 search results - page 1941 / 2117 » The Orc Programming Language |
91
Voted
ICALP
2007
Springer
15 years 7 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...
111
Voted
ICALP
2007
Springer
15 years 7 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...
96
Voted
ICALP
2007
Springer
15 years 7 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...
96
Voted
ICALP
2007
Springer
15 years 7 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...
113
click to vote
ICALP
2007
Springer
15 years 7 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...