Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Explicit construction of exponential sized families of k-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning a Hidden Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning a hidden graph using \(O(\log n)\)queries per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic construction of sets for <i>k</i> -restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect hash families: Probabilistic methods and explicit constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Multiplicative Sharing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testers and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the size of separating hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Difference Between Consecutive Primes, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric constructions of optimal linear perfect hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal linear perfect hash families with small parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for separating hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal linear perfect hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of hidden graphs and threshold group testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on nonadaptive group testing algorithms through the angle of decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-adaptive complex group testing with multiple positive sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On key storage in secure networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3469037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-cover-free families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Separating Systems and Families of Perfect Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of error-correcting pooling designs over complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fredman–Komlós bounds and information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for perfect hashing via information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrandom binary superimposed codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit constructions of separating hash families from algebraic curves over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3585504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Key storage in secure networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A group testing method for finding patterns in data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit constructions for perfect hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Hashing and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5457049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Nonadaptive Combinatorial Group Testing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning and Verifying Graphs Using Queries with a Focus on Edge Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some methods for unconditionally secure key distribution and broadcast encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multireceiver authentication codes: Models, bounds, constructions, and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4487082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized separating hash families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new bounds for cover-free families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new results on key distribution patterns and broadcast encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets pooling designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit constructions of perfect hash families from algebraic curves over finite fields / rank
 
Normal rank

Latest revision as of 19:36, 10 July 2024

scientific article
Language Label Description Also known as
English
Linear Time Constructions of Some $$d$$-Restriction Problems
scientific article

    Statements

    Linear Time Constructions of Some $$d$$-Restriction Problems (English)
    0 references
    0 references
    21 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    derandomization
    0 references
    \(d\)-restriction problems
    0 references
    perfect hash
    0 references
    cover-free families
    0 references
    separating hash functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references