Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Von Schelling, Hermann
1954.
Coupon Collecting for Unequal Probabilities.
The American Mathematical Monthly,
Vol. 61,
Issue. 5,
p.
306.
Jablonski, Aleksander
1980.
A Monte Carlo algorithm for solving systems of non-linear equations.
Journal of Computational and Applied Mathematics,
Vol. 6,
Issue. 3,
p.
171.
Chvátal, V.
1991.
Almost all graphs with 1.44n edges are 3‐colorable.
Random Structures & Algorithms,
Vol. 2,
Issue. 1,
p.
11.
DeHon, André
2004.
Nano, Quantum and Molecular Computing.
p.
213.
Dehon, André
2005.
Nanowire-based programmable architectures.
ACM Journal on Emerging Technologies in Computing Systems,
Vol. 1,
Issue. 2,
p.
109.
DeHon, André
2010.
Nanotechnology.
p.
287.
Giesen, Hans
Gojman, Benjamin
Rubin, Raphael
Kim, Ji
and
DeHon, Andre
2016.
Continuous Online Self-Monitoring Introspection Circuitry for Timing Repair by Incremental Partial-Reconfiguration (COSMIC TRIP).
p.
111.
Doumas, Aristides V.
and
Papanicolaou, Vassilis G.
2017.
The siblings of the coupon collector.
Теория вероятностей и ее применения,
Vol. 62,
Issue. 3,
p.
556.
Giesen, Hans
Gojman, Benjamin
Rubin, Raphael
Kim, Ji
and
Dehon, André
2018.
Continuous Online Self-Monitoring Introspection Circuitry for Timing Repair by Incremental Partial-Reconfiguration (COSMIC TRIP).
ACM Transactions on Reconfigurable Technology and Systems,
Vol. 11,
Issue. 1,
p.
1.
Doumas, A. V.
and
Papanicolaou, V. G.
2018.
The Siblings of the Coupon Collector.
Theory of Probability & Its Applications,
Vol. 62,
Issue. 3,
p.
444.
Barak-Pelleg, Dina
and
Berend, Daniel
2022.
Cyber Security, Cryptology, and Machine Learning.
Vol. 13301,
Issue. ,
p.
66.