Born again group testing: Multiaccess communications

From MaRDI portal
Revision as of 09:30, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3713985

DOI10.1109/TIT.1985.1057026zbMath0586.94011MaRDI QIDQ3713985

Jack Keil Wolf

Publication date: 1985

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)




Related Items (52)

Multistage Group Testing Procedure (Group Screening)A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary eventsImproved algorithms for group testing with inhibitorsGeneralized framework for group testing: queries, feedbacks and adversariesPattern matching with don't cares and few errorsExact learning from an honest teacher that answers membership queriesOn optimal policy in the group testing with incomplete identificationConstraining the number of positive responses in adaptive, non-adaptive, and two-stage group testingTandem queues with impatient customers for blood screening proceduresOverlaps help: Improved bounds for group testing with interval queriesStrongly separable matrices for nonadaptive combinatorial group testingA Zig-Zag Approach for Competitive Group TestingImproved constructions for non-adaptive threshold group testingOptimal sampling op hierarchical screening with inspection errorsErasure combinatorial batch codes based on nonadaptive group testingAn efficient randomized group testing procedure to determine the number of defectivesOn a couple of unresolved group testing conjecturesASYMPTOTIC ANALYSIS OF OPTIMAL NESTED GROUP-TESTING PROCEDURESOn a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling designNew combinatorial structures with applications to efficient group testing with inhibitorsNonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theoryAn improved zig zag approach for competitive group testingAn efficient FPRAS type group testing procedure to approximate the number of defectives2-Stage Fault Tolerant Interval Group TestingBounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group TestingA new strongly competitive group testing algorithm with small sequentialityInspection errors in graff-roeloffs modification of hierarchical dorfman screening proceduresA class of asymptotically optimal group testing strategies to identify good itemsA randomized competitive group testing procedureCoding for a multiple access OR channel: A surveyRecycled incomplete identification procedures for blood screeningOn the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomizationEfficient algorithms for chemical threshold testing problemsA two-stage group testing model for infections with window periodsA probabilistic analysis of some tree algorithmsOn optimal randomized group testing with one defective item and a constrained number of positive responsesQuaternary splitting algorithm in group testingSubquadratic non-adaptive threshold group testingSterrett procedure for the generalized group testing problemLow-weight superimposed codes and related combinatorial structures: bounds and applicationsOptimal deterministic group testing algorithms to estimate the number of defectivesOptimal sequential decisions for incomplete identification of group testable itemsSeparable collusion-secure multimedia codesOptimal deterministic group testing algorithms to estimate the number of defectivesOn optimal nested group testing algorithmsGroup testing with unreliable testsOn the upper bounds of the minimum number of rows of disjunct matricesNon-adaptive group testing in the presence of errorsA class of asymptotically optimal group screening strategies with limited item participationMultinomial group testing models with incomplete identificationRevisiting Nested Group Testing Procedures: New Results, Comparisons, and RobustnessA new randomized algorithm for group testing with unknown number of defective items







This page was built for publication: Born again group testing: Multiaccess communications