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):
Displayed 50 items.
- 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)
- Some new bounds for cover-free families (Q1976329) (← links)
- Predicate signatures from pair encodings via dual system proof technique (Q2009416) (← links)
- Modification tolerant signature schemes: location and correction (Q2179378) (← links)
- Generalization of IPP codes and IPP set systems (Q2190902) (← links)
- Traceability codes and their generalizations (Q2190905) (← links)
- On non-binary traceability set systems (Q2200518) (← links)
- Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
- Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500) (← links)
- Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
- Group testing with geometry of classical groups over finite fields (Q2313412) (← links)
- New error-correcting pooling designs with vector spaces over finite field (Q2407018) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)
- New combinatorial structures with applications to efficient group testing with inhibitors (Q2426666) (← links)
- A note on the uniqueness of \((w, r)\) cover-free codes (Q2432945) (← links)
- Transport schemes for topology-transparent scheduling (Q2471060) (← links)
- A novel use of \(t\)-packings to construct \(d\)-disjunct matrices (Q2499596) (← links)
- A classification of the structures of some Sperner families and superimposed codes (Q2502898) (← links)
- Deterministic M2M multicast in radio networks (Q2508975) (← links)
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes (Q2829951) (← links)
- 2-Cancellative Hypergraphs and Codes (Q2883859) (← links)
- $$\epsilon $$-Almost Selectors and Their Applications (Q2947885) (← links)
- A Black-Box Construction of Strongly Unforgeable Signature Schemes in the Bounded Leakage Model (Q2953870) (← links)
- Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications (Q3012832) (← links)
- Combinatorial Algorithms for Distributed Graph Coloring (Q3095316) (← links)
- (Q3300801) (← links)
- On Efficient Gossiping in Radio Networks (Q3408156) (← links)
- Constructions of 2-cover-free families and related separating hash families (Q3419697) (← links)