Sciweavers

10666 search results - page 1955 / 2134
» Quantum programming languages
Sort
View
ICALP
2007
Springer
15 years 10 months ago
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
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...
Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh
ICALP
2007
Springer
15 years 10 months ago
Checking and Spot-Checking the Correctness of Priority Queues
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...
Matthew Chu, Sampath Kannan, Andrew McGregor
ICALP
2007
Springer
15 years 10 months ago
Succinct Ordinal Trees Based on Tree Covering
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...
Meng He, J. Ian Munro, S. Srinivasa Rao
ICALP
2007
Springer
15 years 10 months ago
Estimating Sum by Weighted Sampling
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...
Rajeev Motwani, Rina Panigrahy, Ying Xu 0002
ICALP
2007
Springer
15 years 10 months ago
Parameterized Algorithms for Directed Maximum Leaf Problems
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...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
« Prev « First page 1955 / 2134 Last » Next »