Results 61 to 64 of about 3,332 (64)
Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We study the number of encryptions necessary to revoke a set of users in the complete subtree scheme (CST) and the subset-difference scheme (SD). These are well-known tree based broadcast encryption schemes.
Christopher Eagle +4 more
doaj +1 more source
A fixed point theorem for Boolean networks expressed in terms of forbidden subnetworks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We are interested in fixed points in Boolean networks, $\textit{i.e.}$ functions $f$ from $\{0,1\}^n$ to itself. We define the subnetworks of $f$ as the restrictions of $f$ to the hypercubes contained in $\{0,1\}^n$, and we exhibit a class $\mathcal{F ...
Adrien Richard
doaj +1 more source
Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Analytic information theory aims at studying problems of information theory using analytic techniques of computer science and combinatorics. Following Hadamard's precept, these problems are tackled by complex analysis methods such as generating functions,
Wojciech Szpankowski
doaj +1 more source
25th Annual Computational Neuroscience Meeting: CNS-2016. [PDF]
BMC Neurosci, 2016 europepmc +1 more source