Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness (Q4903279): Difference between revisions

Latest revision as of 02:26, 6 July 2024

scientific article; zbMATH DE number 6127553

Language	Label	Description	Also known as
English	Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness	scientific article; zbMATH DE number 6127553

Statements

instance of

scholarly article

0 references

title

Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness (English)

0 references

0 references

0 references

Random Structures & Algorithms

0 references

publication date

21 January 2013

0 references

zbMATH Keywords

randomized algorithms

0 references

adaptive algorithms

0 references

combinatorial search

0 references

counterfeit coins

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1002/rsa.20417

0 references

cites work

Tree algorithms for packet broadcast channels

0 references

Q5302100

0 references

Q2747613

0 references

Forbidding just one intersection

0 references

A perspective on multiaccess channels

0 references

Optimal reconstruction of graphs under the additive model

0 references

Estimating the multiplicities of conflicts to speed their resolution in multiple access channels

0 references

A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels

0 references

An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels

0 references

On \(B_ 2\)-sequences of vectors

0 references

Probability and Computing

0 references

Resolution of a conflict of known multiplicity

0 references

Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel

0 references

Identifiers

zbMATH Open document ID

1262.68184

0 references

DOI

10.1002/rsa.20417

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4903279

@@ Property / cites work @@
+Tree algorithms for packet broadcast channels
@@ Property / cites work: Tree algorithms for packet broadcast channels / rank @@
+Normal rank
@@ Property / cites work @@
+Q5302100
@@ Property / cites work: Q5302100 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Forbidding just one intersection
@@ Property / cites work: Forbidding just one intersection / rank @@
+Normal rank
@@ Property / cites work @@
+A perspective on multiaccess channels
@@ Property / cites work: A perspective on multiaccess channels / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal reconstruction of graphs under the additive model
+Normal rank
@@ Property / cites work @@
+Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
+Normal rank
@@ Property / cites work @@
+A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
+Normal rank
@@ Property / cites work @@
+An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
+Normal rank
@@ Property / cites work @@
+On \(B_ 2\)-sequences of vectors
@@ Property / cites work: On \(B_ 2\)-sequences of vectors / rank @@
+Normal rank
@@ Property / cites work @@
+Probability and Computing
@@ Property / cites work: Probability and Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Resolution of a conflict of known multiplicity
@@ Property / cites work: Resolution of a conflict of known multiplicity / rank @@
+Normal rank
@@ Property / cites work @@
+Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
+Normal rank