Sciweavers

3228 search results - page 563 / 646
» Computationally Sound Proofs
Sort
View
CORR
2008
Springer
119views Education» more  CORR 2008»
13 years 9 months ago
Capacity of the Discrete-Time AWGN Channel Under Output Quantization
We investigate the limits of communication over the discrete-time Additive White Gaussian Noise (AWGN) channel, when the channel output is quantized using a small number of bits. W...
Jaspreet Singh, Onkar Dabeer, Upamanyu Madhow
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 9 months ago
Random Oracles in a Quantum World
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
Özgür Dagdelen, Marc Fischlin, Anja Lehm...
CORR
2008
Springer
123views Education» more  CORR 2008»
13 years 8 months ago
Networks become navigable as nodes move and forget
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle...
ECCC
2008
122views more  ECCC 2008»
13 years 8 months ago
Every Minor-Closed Property of Sparse Graphs is Testable
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
Itai Benjamini, Oded Schramm, Asaf Shapira
ENTCS
2008
120views more  ENTCS 2008»
13 years 8 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke