Pages that link to "Item:Q1072559"
From MaRDI portal
The following pages link to Families of finite sets in which no set is covered by the union of \(r\) others (Q1072559):
Displaying 50 items.
- Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing (Q346522) (← links)
- Black-box Trace\&Revoke codes (Q378263) (← links)
- Uniform hypergraphs containing no grids (Q390731) (← links)
- Information dissemination in unknown radio networks with large labels (Q391755) (← links)
- Leader election in ad hoc radio networks: a keen ear helps (Q394338) (← links)
- Constructing error-correcting pooling designs with symplectic space (Q613666) (← links)
- Separating codes and a new combinatorial search model (Q619509) (← links)
- Forbidden configurations and repeated induction (Q641192) (← links)
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others (Q696905) (← links)
- On the construction of \((w,r)\) cover-free codes (Q734287) (← links)
- Verifiable random functions: relations to identity-based key encapsulation and new constructions (Q744351) (← links)
- A probabilistic variant of Sperner's theorem and of maximal \(r\)-cover free families (Q785827) (← links)
- Error-correcting pooling designs associated with the dual space of unitary space and ratio efficiency comparison (Q839673) (← links)
- Tracing a single user (Q850073) (← links)
- Generalised cumulative arrays in secret sharing (Q851749) (← links)
- Secret sharing schemes with partial broadcast channels (Q851779) (← links)
- Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices (Q875600) (← links)
- Faster deterministic wakeup in multiple access channels (Q881569) (← links)
- On the complexity of neighbourhood learning in radio networks (Q896133) (← links)
- General theory of information transfer: Updated (Q947076) (← links)
- Coding for a multiple access OR channel: A survey (Q947083) (← links)
- Pooling designs associated with unitary space and ratio efficiency comparison (Q987500) (← links)
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
- More on pooling spaces (Q998372) (← links)
- Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix (Q1003685) (← links)
- Upper bounds for parent-identifying set systems (Q1009142) (← links)
- On the upper bounds of the minimum number of rows of disjunct matrices (Q1024738) (← links)
- On a problem of Erdős on integers, none of which divides the product of \(k\) others (Q1041201) (← links)
- Explicit construction of exponential sized families of k-independent sets (Q1073031) (← links)
- Finding defective coins (Q1112024) (← links)
- Non-adaptive group testing in the presence of errors (Q1281776) (← links)
- On the upper bound of the size of the \(r\)-cover-free families (Q1328402) (← links)
- On the structure of a class of sets useful in nonadaptive group testing (Q1330209) (← links)
- A simple construction of \(d\)-disjunct matrices with certain constant weights (Q1356684) (← links)
- Distributed broadcast in radio networks of unknown topology. (Q1401336) (← links)
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. (Q1426451) (← links)
- Generalized cover-free families. (Q1428544) (← links)
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures (Q1569877) (← links)
- Faster broadcasting in unknown radio networks (Q1603436) (← links)
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (Q1625605) (← links)
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions (Q1671634) (← links)
- Information gathering in ad-hoc radio networks with tree topology (Q1686117) (← links)
- Some intriguing upper bounds for separating hash families (Q1729948) (← links)
- Faster information gathering in ad-hoc radio tree networks (Q1742375) (← links)
- Some new bounds for cover-free families through biclique covers (Q1759404) (← links)
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism (Q1770372) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Multireceiver authentication codes: Models, bounds, constructions, and extensions (Q1854288) (← links)
- On the extremal combinatorics of the Hamming space (Q1894014) (← links)
- On key storage in secure networks (Q1903344) (← links)
