On the public citation graph

Families of finite sets in which no set is covered by the union ofr others

https://doi.org/10.1007/bf02772959
0 signed · 421 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_27openalex-snapshot
A Theorem of Finite Sets
inferredcites →https://doi.org/10.1007/bf01171114openalex-snapshot
Ein Satz �ber Untermengen einer endlichen Menge
inferredcites →https://doi.org/10.1007/bf01904851openalex-snapshot
On generalized graphs
inferredcites →https://doi.org/10.1007/bf02024498openalex-snapshot
On maximal paths and circuits of graphs
inferredcites →https://doi.org/10.1007/bf02579460openalex-snapshot
Intersections ofk-element sets
inferredcites →https://doi.org/10.1016/0097-3165(76)90073-xopenalex-snapshot
On Sperner families satisfying an additional condition
inferredcites →https://doi.org/10.1016/0097-3165(78)90060-2openalex-snapshot
Combinatorial properties of systems of sets
inferredcites →https://doi.org/10.1016/0097-3165(82)90004-8openalex-snapshot
Families of finite sets in which no set is covered by the union of two others
inferredcites →https://doi.org/10.1016/0097-3165(86)90025-7openalex-snapshot
A new generalization of the Erdös-Ko-Rado theorem
inferredcites →https://doi.org/10.1016/s0167-5060(08)70032-3openalex-snapshot
A General Intersection Theorem For Finite Sets
inferredcites →https://doi.org/10.1016/s0304-0208(08)73398-xopenalex-snapshot
The Greatest Angle Among n Points in the d- Dimensional Euclidean Space
inferredcites →https://doi.org/10.1093/qmath/12.1.313openalex-snapshot
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
inferredcites →https://doi.org/10.1093/qmath/27.1.25openalex-snapshot
SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
inferredcites →https://doi.org/10.1525/9780520319875-014openalex-snapshot
12. The Number of Simplices in a Complex
inferredcites →https://doi.org/10.4153/cjm-1963-069-5openalex-snapshot
On Some Tactical Configurations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4651285openalex-extracted
An Efficient Algorithm For Group Testing with Runlength Constraints
inferred← citeshttps://doi.org/10.1002/(sici)1520-6610(2000)8:3<189::aid-jcd4>3.0.co;2-aopenalex-snapshot
New constructions for perfect hash families and related structures using combinatorial designs and codes
inferred← citeshttps://doi.org/10.1002/ett.4460110206openalex-snapshot
Exact Error Probability for Slow Frequency Hopping
inferred← citeshttps://doi.org/10.1002/itl2.102openalex-snapshot
Steiner system‐based topology‐transparent priority scheduling for wireless ad hoc networks
inferred← citeshttps://doi.org/10.1002/jcd.10056openalex-snapshot
On optimal superimposed codes
inferred← citeshttps://doi.org/10.1002/jcd.20029openalex-snapshot
Some new results on superimposed codes
inferred← citeshttps://doi.org/10.1002/jcd.20109openalex-snapshot
Constructions of 2‐cover‐free families and related separating hash families
inferred← citeshttps://doi.org/10.1002/jcd.21986openalex-snapshot
Constructions of Optimal Sparse r‐Disjunct Matrices via Packings
inferred← citeshttps://doi.org/10.1002/rsa.10095openalex-snapshot
On the distribution of the number of roots of polynomials and explicit weak designs
inferred← citeshttps://doi.org/10.1006/inco.1996.0076openalex-snapshot
Visual Cryptography for General Access Structures
inferred← citeshttps://doi.org/10.1006/inco.1998.2769openalex-snapshot
Multireceiver Authentication Codes: Models, Bounds, Constructions, and Extensions
inferred← citeshttps://doi.org/10.1006/jcss.2002.1824openalex-snapshot
Extracting all the Randomness and Reducing the Error in Trevisan's Extractors
inferred← citeshttps://doi.org/10.1006/jcta.1996.0012openalex-snapshot
Onr-Cover-free Families
inferred← citeshttps://doi.org/10.1006/jcta.1999.3036openalex-snapshot
Some New Bounds for Cover-Free Families
inferred← citeshttps://doi.org/10.1006/jcta.2000.3068openalex-snapshot
Explicit Constructions of Perfect Hash Families from Algebraic Curves over Finite Fields
inferred← citeshttps://doi.org/10.1006/jcta.2002.3257openalex-snapshot
Families of Finite Sets in which No Intersection of ℓ Sets Is Covered by the Union of s Others
inferred← citeshttps://doi.org/10.1007/1-4020-5334-4_2openalex-snapshot
FUNCTION FIELDS OVER FINITE FIELDS AND THEIR APPLICATIONS TO CRYPTOGRAPHY
inferred← citeshttps://doi.org/10.1007/11523468_18openalex-snapshot
Asynchronous Perfectly Secure Communication over One-Time Pads
inferred← citeshttps://doi.org/10.1007/11533719_18openalex-snapshot
Radio Networks with Reliable Communication
inferred← citeshttps://doi.org/10.1007/11560586_16openalex-snapshot
Faster Deterministic Wakeup in Multiple Access Channels
inferred← citeshttps://doi.org/10.1007/11593447_27openalex-snapshot
Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application
inferred← citeshttps://doi.org/10.1007/11593980_23openalex-snapshot
On Broadcast Encryption with Random Key Pre-distribution Schemes
inferred← citeshttps://doi.org/10.1007/3-540-36108-1_15openalex-snapshot
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
inferred← citeshttps://doi.org/10.1007/3-540-36178-2_5openalex-snapshot
Unconditionally Secure Anonymous Encryption and Group Authentication
inferred← citeshttps://doi.org/10.1007/3-540-36504-4_17openalex-snapshot
Redistribution of Mechanical Secret Shares
inferred← citeshttps://doi.org/10.1007/3-540-36552-4_17openalex-snapshot
Threshold MACs
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_18openalex-snapshot
Fault Tolerant and Distributed Broadcast Encryption
inferred← citeshttps://doi.org/10.1007/3-540-44598-6_21openalex-snapshot
Long-Lived Broadcast Encryption
inferred← citeshttps://doi.org/10.1007/3-540-44750-4_36openalex-snapshot
Collusion-Secure Fingerprinting for Digital Data
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_8openalex-snapshot
Generalized Framework for Selectors with Applications in Optimal Group Testing
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_19openalex-snapshot
A Combinatorial Approach to Anonymous Membership Broadcast
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_32openalex-snapshot
Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_5openalex-snapshot
Key-Insulated Public Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/3-540-48169-9_10openalex-snapshot
Randomness Recycling in Constant-Round Private Computations
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_24openalex-snapshot
Efficient Methods for Integrating Traceability and Broadcast Encryption
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_38openalex-snapshot
Coding Constructions for Blacklisting Problems without Computational Assumptions
inferred← citeshttps://doi.org/10.1007/3-540-48658-5_25openalex-snapshot
Tracing Traitors
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_16openalex-snapshot
Approximate Dictionaries
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_71openalex-snapshot
Advances in Group Testing
inferred← citeshttps://doi.org/10.1007/978-1-4612-0751-1_8openalex-snapshot
A Comparative Survey of Non-Adaptive Pooling Designs
inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_22openalex-snapshot
New Applications and Results of Superimposed Code Theory Arising from the Potentialities of Molecular Biology
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_16openalex-snapshot
Approximate Dictionaries
inferred← citeshttps://doi.org/10.1007/978-3-030-14094-6_1openalex-snapshot
Local Gossip and Neighbour Discovery in Mobile Ad Hoc Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-16458-4_21openalex-snapshot
On the Tracing Traitors Math
inferred← citeshttps://doi.org/10.1007/978-3-030-29959-0_29openalex-snapshot
Symmetric-Key Corruption Detection: When XOR-MACs Meet Combinatorial Group Testing
inferred← citeshttps://doi.org/10.1007/978-3-030-35423-7_2openalex-snapshot
Modification Tolerant Signature Schemes: Location and Correction
inferred← citeshttps://doi.org/10.1007/978-3-030-51938-4_12openalex-snapshot
Hash-Based Signatures Revisited: A Dynamic FORS with Adaptive Chosen Message Security
inferred← citeshttps://doi.org/10.1007/978-3-030-65072-8_8openalex-snapshot
One Sender Answering Several Questions of Receivers
inferred← citeshttps://doi.org/10.1007/978-3-031-06678-8_11openalex-snapshot
Structure-Aware Combinatorial Group Testing: A New Method for Pandemic Screening
inferred← citeshttps://doi.org/10.1007/978-3-031-22318-1_12openalex-snapshot
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-031-48679-1_11openalex-snapshot
A Survey of Cover-Free Families: Constructions, Applications, and Generalizations
inferred← citeshttps://doi.org/10.1007/978-3-031-48882-5_2openalex-snapshot
Conflict Resolution in Arbitrary Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-52113-3_11openalex-snapshot
Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-74580-5_8openalex-snapshot
On Permutation Selectors and their Applications in Ad-Hoc Radio Networks Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-81824-0_4openalex-snapshot
Fast Decoding of Group Testing Results from Reed-Solomon d-Disjunct Matrices
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_14openalex-snapshot
Improved Bounds for Group Testing in Arbitrary Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-032-12290-2_9openalex-snapshot
Generalized and Unified Equivalences Between Hardness and Pseudoentropy
inferred← citeshttps://doi.org/10.1007/978-3-319-12691-3_11openalex-snapshot
Information Gathering in Ad-Hoc Radio Networks with Tree Topology
inferred← citeshttps://doi.org/10.1007/978-3-319-12691-3_37openalex-snapshot
Efficient Group Testing Algorithms with a Constrained Number of Positive Responses
inferred← citeshttps://doi.org/10.1007/978-3-319-22177-9_20openalex-snapshot
$$\epsilon $$-Almost Selectors and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_15openalex-snapshot
A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-27659-5_7openalex-snapshot
Reducing Public Key Sizes in Bounded CCA-Secure KEMs with Optimal Ciphertext Length
inferred← citeshttps://doi.org/10.1007/978-3-319-47422-9_19openalex-snapshot
A Black-Box Construction of Strongly Unforgeable Signature Schemes in the Bounded Leakage Model
inferred← citeshttps://doi.org/10.1007/978-3-319-53058-1_4openalex-snapshot
A New Kind of Selectors and Their Applications to Conflict Resolution in Wireless Multichannels Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-60055-0_10openalex-snapshot
Lattice-Based Revocable Identity-Based Encryption with Bounded Decryption Key Exposure Resistance
inferred← citeshttps://doi.org/10.1007/978-3-319-60080-2_16openalex-snapshot
Symmetric-Key Broadcast Encryption: The Multi-sender Case
inferred← citeshttps://doi.org/10.1007/978-3-319-66278-7_8openalex-snapshot
Analysis of Two Tracing Traitor Schemes via Coding Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-71147-8_19openalex-snapshot
On k-Strong Conflict–Free Multicoloring
inferred← citeshttps://doi.org/10.1007/978-3-319-78455-7_15openalex-snapshot
Low-Weight Superimposed Codes and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-99807-7_12openalex-snapshot
A New Design of Online/Offline Signatures Based on Lattice
inferred← citeshttps://doi.org/10.1007/978-3-540-24654-1_7openalex-snapshot
Multiple-Time Signature Schemes against Adaptive Chosen Message Attacks
inferred← citeshttps://doi.org/10.1007/978-3-540-24676-3_30openalex-snapshot
Public Key Encryption with Keyword Search
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_47openalex-snapshot
An Information Theoretic Lower Bound for Broadcasting in Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-32777-6_3openalex-snapshot
Nonadaptive and Trivial Two-Stage Group Testing with Error-Correcting d e-Disjunct Inclusion Matrices
inferred← citeshttps://doi.org/10.1007/978-3-540-39611-6_22openalex-snapshot
Steiner Systems for Topology-Transparent Access Control in MANETs
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_32openalex-snapshot
Broadcast Authentication in Group Communication
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_22openalex-snapshot
Optimal Monotone Encodings
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_29openalex-snapshot
Conjunctive, Subset, and Range Queries on Encrypted Data
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_28openalex-snapshot
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
inferred← citeshttps://doi.org/10.1007/978-3-540-76900-2_31openalex-snapshot
Bounded CCA2-Secure Encryption
inferred← citeshttps://doi.org/10.1007/978-3-540-85093-9_10openalex-snapshot
Upper Bounds for Set Systems with the Identifiable Parent Property
inferred← citeshttps://doi.org/10.1007/978-3-540-85093-9_21openalex-snapshot
Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_43openalex-snapshot
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
inferred← citeshttps://doi.org/10.1007/978-3-642-03417-6_54openalex-snapshot
Social Network Privacy via Evolving Access Control
inferred← citeshttps://doi.org/10.1007/978-3-642-10230-1_4openalex-snapshot
Optimising SD and LSD in Presence of Non-uniform Probabilities of Revocation
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_12openalex-snapshot
On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_2openalex-snapshot
On Efficient Gossiping in Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-12678-9_10openalex-snapshot
Information-Theoretically Secure Key-Insulated Multireceiver Authentication Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-15763-9_14openalex-snapshot
What Is the Use of Collision Detection (in Wireless Networks)?
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_18openalex-snapshot
Superselectors: Efficient Constructions and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-15874-2_7openalex-snapshot
User-Irrepressible Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-17773-6_19openalex-snapshot
Distributed Double Spending Prevention
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_5openalex-snapshot
Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_47openalex-snapshot
Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_50openalex-snapshot
Combinatorial Group Testing for Corruption Localizing Hashing
inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_5openalex-snapshot
Combinatorial Algorithms for Distributed Graph Coloring
inferred← citeshttps://doi.org/10.1007/978-3-642-25385-0_28openalex-snapshot
On the Efficiency of Bit Commitment Reductions
inferred← citeshttps://doi.org/10.1007/978-3-642-25385-0_35openalex-snapshot
Short Signatures from Weaker Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_1-2openalex-snapshot
Abelian Hidden Subgroup Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_16-2openalex-snapshot
Approximate Dictionaries
inferred← citeshttps://doi.org/10.1007/978-3-642-27954-6_17openalex-snapshot
Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_18openalex-snapshot
Lower Bounds in Differential Privacy
inferred← citeshttps://doi.org/10.1007/978-3-642-32205-1_39openalex-snapshot
Data Forensics Constructions from Cryptographic Hashing and Coding
inferred← citeshttps://doi.org/10.1007/978-3-642-36899-8_26openalex-snapshot
New Construction of Error-Tolerant Pooling Designs
inferred← citeshttps://doi.org/10.1007/978-3-642-45346-5_18openalex-snapshot
On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0_15openalex-snapshot
Bounded-Collusion Identity-Based Encryption from Semantically-Secure Public-Key Encryption: Generic Constructions with Short Ciphertexts
inferred← citeshttps://doi.org/10.1007/978-3-662-46803-6_14openalex-snapshot
Hosting Services on an Untrusted Cloud
inferred← citeshttps://doi.org/10.1007/978-3-662-48000-7_13openalex-snapshot
Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_21openalex-snapshot
Faster Information Gathering in Ad-Hoc Radio Tree Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-53015-3_11openalex-snapshot
Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
inferred← citeshttps://doi.org/10.1007/978-981-15-8427-5_4openalex-snapshot
Identity-Based Encryption
inferred← citeshttps://doi.org/10.1007/bf00191355openalex-snapshot
On key storage in secure networks
inferred← citeshttps://doi.org/10.1007/bf01864160openalex-snapshot
Matchings and covers in hypergraphs
inferred← citeshttps://doi.org/10.1007/bf01864175openalex-snapshot
Finding defective coins
inferred← citeshttps://doi.org/10.1007/bfb0054151openalex-snapshot
New results on multi-receiver authentication codes
inferred← citeshttps://doi.org/10.1007/bfb0055750openalex-snapshot
Threshold traitor tracing
inferred← citeshttps://doi.org/10.1007/s00145-013-9153-xopenalex-snapshot
Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New Constructions
inferred← citeshttps://doi.org/10.1007/s00145-023-09488-wopenalex-snapshot
Lattice-Based Programmable Hash Functions and Applications
inferred← citeshttps://doi.org/10.1007/s00224-012-9425-0openalex-snapshot
Pseudo-Random Graphs and Bit Probe Schemes with One-Sided Error
inferred← citeshttps://doi.org/10.1007/s00446-009-0088-2openalex-snapshot
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
inferred← citeshttps://doi.org/10.1007/s00446-013-0203-2openalex-snapshot
Combinatorial algorithms for distributed graph coloring
inferred← citeshttps://doi.org/10.1007/s00446-022-00424-yopenalex-snapshot
Linial for lists
inferred← citeshttps://doi.org/10.1007/s00453-002-0979-0openalex-snapshot
The Quantum Complexity of Set Membership
inferred← citeshttps://doi.org/10.1007/s00453-012-9702-yopenalex-snapshot
Black-Box Trace&Revoke Codes
inferred← citeshttps://doi.org/10.1007/s00453-017-0336-yopenalex-snapshot
Faster Information Gathering in Ad-Hoc Radio Tree Networks
inferred← citeshttps://doi.org/10.1007/s10207-006-0007-5openalex-snapshot
Low-randomness constant-round private XOR computations
inferred← citeshttps://doi.org/10.1007/s10623-006-0007-5openalex-snapshot
Generalised Cumulative Arrays in Secret Sharing
inferred← citeshttps://doi.org/10.1007/s10623-006-0027-1openalex-snapshot
Secret sharing schemes with partial broadcast channels
inferred← citeshttps://doi.org/10.1007/s10623-008-9253-zopenalex-snapshot
Upper bounds for parent-identifying set systems
inferred← citeshttps://doi.org/10.1007/s10623-016-0279-3openalex-snapshot
Almost cover-free codes and designs
inferred← citeshttps://doi.org/10.1007/s10623-017-0444-3openalex-snapshot
Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
inferred← citeshttps://doi.org/10.1007/s10623-020-00749-4openalex-snapshot
On non-binary traceability set systems
inferred← citeshttps://doi.org/10.1007/s10623-020-00763-6openalex-snapshot
On 2-parent-identifying set systems of block size 4
inferred← citeshttps://doi.org/10.1007/s10623-021-00895-3openalex-snapshot
Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity
inferred← citeshttps://doi.org/10.1007/s10623-022-01008-4openalex-snapshot
On subset-resilient hash function families
inferred← citeshttps://doi.org/10.1007/s10776-018-0411-6openalex-snapshot
Interference Cancelling Codes for Ultra-Reliable Random Access
inferred← citeshttps://doi.org/10.1007/s10801-018-0828-0openalex-snapshot
Group testing with geometry of classical groups over finite fields
inferred← citeshttps://doi.org/10.1007/s10878-007-9058-4openalex-snapshot
Transport schemes for topology-transparent scheduling
inferred← citeshttps://doi.org/10.1007/s10878-007-9082-4openalex-snapshot
Locating and detecting arrays for interaction faults
inferred← citeshttps://doi.org/10.1007/s10878-007-9085-1openalex-snapshot
New combinatorial structures with applications to efficient group testing with inhibitors
inferred← citeshttps://doi.org/10.1007/s10878-007-9137-6openalex-snapshot
Error-correcting pooling designs associated with the dual space of unitary space and ratio efficiency comparison
inferred← citeshttps://doi.org/10.1007/s10878-008-9185-6openalex-snapshot
Pooling designs associated with unitary space and ratio efficiency comparison
inferred← citeshttps://doi.org/10.1007/s10878-009-9217-xopenalex-snapshot
Constructing error-correcting pooling designs with symplectic space
inferred← citeshttps://doi.org/10.1007/s10878-015-9949-8openalex-snapshot
Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
inferred← citeshttps://doi.org/10.1007/s10878-026-01429-0openalex-snapshot
Cover-free families on hypergraphs and combinatorial group testing
inferred← citeshttps://doi.org/10.1007/s11122-005-0024-4openalex-snapshot
A Note on the Uniqueness of (w, r) Cover-Free Codes
inferred← citeshttps://doi.org/10.1007/s11276-006-6528-zopenalex-snapshot
The effects of synchronization on topology-transparent scheduling
inferred← citeshttps://doi.org/10.1007/s11425-017-9378-yopenalex-snapshot
Some intriguing upper bounds for separating hash families
inferred← citeshttps://doi.org/10.1007/s11425-025-2493-7openalex-snapshot
Counting cliques with prescribed intersection sizes
inferred← citeshttps://doi.org/10.1007/s11590-008-0109-2openalex-snapshot
On the upper bounds of the minimum number of rows of disjunct matrices
inferred← citeshttps://doi.org/10.1007/s11768-011-0233-xopenalex-snapshot
A topology-transparent MAC scheduling algorithm with guaranteed QoS for multihop wireless network
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90065-8openalex-snapshot
Coloring graphs with locally few colors
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90161-5openalex-snapshot
Explicit construction of exponential sized families of k-independent sets
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00296-9openalex-snapshot
A simple construction of d-disjunct matrices with certain constant weights
inferred← citeshttps://doi.org/10.1016/0097-3165(94)90067-1openalex-snapshot
On the upper bound of the size of the r-cover-free families
inferred← citeshttps://doi.org/10.1016/0097-3165(95)90019-5openalex-snapshot
On the extremal combinatorics of the hamming space
inferred← citeshttps://doi.org/10.1016/0378-3758(94)90112-0openalex-snapshot
On the structure of a class of sets useful in nonadaptive group testing
inferred← citeshttps://doi.org/10.1016/j.aim.2013.03.009openalex-snapshot
Uniform hypergraphs containing no grids
inferred← citeshttps://doi.org/10.1016/j.dam.2005.03.033openalex-snapshot
Coding for a multiple access OR channel: A survey
inferred← citeshttps://doi.org/10.1016/j.dam.2006.03.009openalex-snapshot
A novel use of t-packings to construct d-disjunct matrices
inferred← citeshttps://doi.org/10.1016/j.dam.2006.08.009openalex-snapshot
Faster deterministic wakeup in multiple access channels
inferred← citeshttps://doi.org/10.1016/j.dam.2006.10.009openalex-snapshot
Exploring the missing link among d-separable, d¯ -separable and d-disjunct matrices
inferred← citeshttps://doi.org/10.1016/j.dam.2007.07.007openalex-snapshot
General theory of information transfer: Updated
inferred← citeshttps://doi.org/10.1016/j.dam.2008.06.004openalex-snapshot
Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix
inferred← citeshttps://doi.org/10.1016/j.dam.2018.12.002openalex-snapshot
Union–intersection-bounded families and their applications
inferred← citeshttps://doi.org/10.1016/j.dam.2020.11.022openalex-snapshot
Strongly separable matrices for nonadaptive combinatorial group testing
inferred← citeshttps://doi.org/10.1016/j.dam.2024.09.001openalex-snapshot
An efficient algorithm for group testing with runlength constraints
inferred← citeshttps://doi.org/10.1016/j.disc.2006.03.049openalex-snapshot
A classification of the structures of some Sperner families and superimposed codes
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.073openalex-snapshot
More on pooling spaces
inferred← citeshttps://doi.org/10.1016/j.disc.2011.07.005openalex-snapshot
Forbidden configurations and repeated induction
inferred← citeshttps://doi.org/10.1016/j.disc.2012.08.016openalex-snapshot
Some new bounds for cover-free families through biclique covers
inferred← citeshttps://doi.org/10.1016/j.disc.2015.01.003openalex-snapshot
New error-correcting pooling designs with vector spaces over finite field
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112027openalex-snapshot
A probabilistic variant of Sperner ’s theorem and of maximal r -cover free families
inferred← citeshttps://doi.org/10.1016/j.ejc.2006.05.001openalex-snapshot
Tracing a single user
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.02.005openalex-snapshot
On a problem of Erdős on integers, none of which divides the product of k others
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103912openalex-snapshot
Improved bounds for the dimension of divisibility
inferred← citeshttps://doi.org/10.1016/j.endm.2005.07.048openalex-snapshot
Coding for a Multiple Access OR Channel: a Survey
inferred← citeshttps://doi.org/10.1016/j.exco.2022.100095openalex-snapshot
Families of finite sets in which no set is covered by the union of the others
inferred← citeshttps://doi.org/10.1016/j.ic.2017.11.003openalex-snapshot
Information gathering in ad-hoc radio networks with tree topology
inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106365openalex-snapshot
Bounds and algorithms for generalized superimposed codes
inferred← citeshttps://doi.org/10.1016/j.jco.2025.101974openalex-snapshot
Lower bounds on the minimal dispersion of point sets via cover-free families
inferred← citeshttps://doi.org/10.1016/j.jcss.2008.07.007openalex-snapshot
Hardness of approximate two-level logic minimization and PAC learning with membership queries
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.04.003openalex-snapshot
Leader election in ad hoc radio networks: A keen ear helps
inferred← citeshttps://doi.org/10.1016/j.jcta.2014.04.005openalex-snapshot
Strict group testing and the set basis problem
inferred← citeshttps://doi.org/10.1016/j.jcta.2025.106131openalex-snapshot
On cover-free families of finite vector spaces
inferred← citeshttps://doi.org/10.1016/j.jcta.2026.106193openalex-snapshot
Focal-free uniform hypergraphs and codes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.09.012openalex-snapshot
Secured distributed algorithms without hardness assumptions
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.04.017openalex-snapshot
Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.06.017openalex-snapshot
Deterministic M2M multicast in radio networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.003openalex-snapshot
Improved lower bound for deterministic broadcasting in radio networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.08.009openalex-snapshot
Information dissemination in unknown radio networks with large labels
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.04.027openalex-snapshot
On the complexity of neighbourhood learning in radio networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.005openalex-snapshot
A fast network-decomposition algorithm and its applications to constant-time distributed computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.032openalex-snapshot
Low-weight superimposed codes and related combinatorial structures: Bounds and applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.10.010openalex-snapshot
Revocable identity-based encryption with bounded decryption key exposure resistance: Lattice-based construction and more
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.026openalex-snapshot
Generalized framework for Group Testing: Queries, feedbacks and adversaries
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115456openalex-snapshot
Locally-iterative (Δ + 1)-coloring in sublinear (in Δ) rounds
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00287-5openalex-snapshot
Generalized cover-free families
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00178-2openalex-snapshot
Faster broadcasting in unknown radio networks
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00088-xopenalex-snapshot
Improved algorithms for group testing with inhibitors
showing the first 200 of 406 · page through all 406
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.