Sciweavers

152 search results - page 11 / 31
» Constructive Proofs of Concentration Bounds
Sort
View
DCC
2005
IEEE
16 years 5 months ago
The Combinatorics of Dom de Caen
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
Edwin R. van Dam
FC
2010
Springer
230views Cryptology» more  FC 2010»
15 years 9 months ago
Multiple Denominations in E-cash with Compact Transaction Data
We present a new construction of divisible e-cash that makes use of 1) a new generation method of the binary tree of keys; 2) a new way of using bounded accumulators. The transacti...
Sébastien Canard, Aline Gouget
TCS
2011
15 years 21 days ago
Four states are enough!
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
Nicolas Ollinger, Gaétan Richard
JCT
2007
90views more  JCT 2007»
15 years 5 months ago
On the maximum number of edges in quasi-planar graphs
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
Eyal Ackerman, Gábor Tardos
ECCC
2006
134views more  ECCC 2006»
15 years 5 months ago
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
Avi Wigderson, David Xiao