Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Cantor, David G.
and
Mills, W. H.
1966.
Determination of a Subset from Certain Combinatorial Properties.
Canadian Journal of Mathematics,
Vol. 18,
Issue. ,
p.
42.
Lindström, B.
and
Zetterström, H.-O.
1967.
A combinatorial problem in the 𝑘-adic number system.
Proceedings of the American Mathematical Society,
Vol. 18,
Issue. 1,
p.
166.
Lindström, Bernt
1969.
Determination of two vectors from the sum.
Journal of Combinatorial Theory,
Vol. 6,
Issue. 4,
p.
402.
Lindström, Bernt
1971.
On Möbius Functions and a Problem in Combinatorial Number Theory.
Canadian Mathematical Bulletin,
Vol. 14,
Issue. 4,
p.
513.
KATONA, G.O.H.
1973.
A Survey of Combinatorial Theory.
p.
285.
Pippenger, Nicholas
1977.
An information-theoretic method in combinatorial theory.
Journal of Combinatorial Theory, Series A,
Vol. 23,
Issue. 1,
p.
99.
Stolarsky, Kenneth B.
1977.
Power and Exponential Sums of Digital Sums Related to Binomial Coefficient Parity.
SIAM Journal on Applied Mathematics,
Vol. 32,
Issue. 4,
p.
717.
Guy, Richard K.
1981.
Unsolved Problems in Number Theory.
p.
58.
Guy, Richard K.
1982.
Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday.
Vol. 60,
Issue. ,
p.
141.
Christen, C.
1983.
Optimal Detection of Two Complementary Defectives.
SIAM Journal on Algebraic Discrete Methods,
Vol. 4,
Issue. 1,
p.
101.
Koubek, V
and
Rajlich, J
1985.
Combinatorics of the separaion by binary matrices.
Discrete Mathematics,
Vol. 57,
Issue. 1-2,
p.
203.
Li, Shuo-Yen Robert
1986.
Binary trees and uniform distribution of traffic cutback.
Journal of Computer and System Sciences,
Vol. 32,
Issue. 1,
p.
1.
Du, Ding-Zhu
and
Ko, Ker-I
1987.
Some Completeness Results on Decision Trees and Group Testing.
SIAM Journal on Algebraic Discrete Methods,
Vol. 8,
Issue. 4,
p.
762.
Panwar, S.S.
1991.
On Achieving A Throughput Of One For A Random Access Channel With Collisions Of Known Multiplicity.
p.
337.
Jevtić, Dušan B.
1992.
Low complexity inverse mappings on sum-distinct elements of a power set.
International Journal of Computer Mathematics,
Vol. 45,
Issue. 3-4,
p.
161.
Jevtic, D.B.
1992.
Disjoint uniquely decodable codebooks for noiseless synchronized multiple-access adder channels generated by integer sets.
IEEE Transactions on Information Theory,
Vol. 38,
Issue. 3,
p.
1142.
Li, Ming
and
Vitányi, Paul M.B
1994.
Kolmogorov complexity arguments in combinatorics.
Journal of Combinatorial Theory, Series A,
Vol. 66,
Issue. 2,
p.
226.
Ruszinko, H.
and
Vanroose, P.
1994.
A constructive code reaching capacity 1 for the multiple-access collision channel with multiplicity feedback.
p.
287.
Guy, Richard K.
1994.
Unsolved Problems in Number Theory.
Vol. 1,
Issue. ,
p.
105.
Guy, Richard K.
and
Nowakowski, Richard J.
1995.
Coin-Weighing Problems.
The American Mathematical Monthly,
Vol. 102,
Issue. 2,
p.
164.