no. 2
On a tree collision resolution algorithm in presence of capture
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 2, pp. 163-197. 
@article{ITA_1992__26_2_163_0,
     author = {Schmid, U.},
     title = {On a tree collision resolution algorithm in presence of capture},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {163--197},
     publisher = {EDP-Sciences},
     volume = {26},
     number = {2},
     year = {1992},
     mrnumber = {1166786},
     zbl = {0767.94001},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1992__26_2_163_0/}
}
TY  - JOUR
AU  - Schmid, U.
TI  - On a tree collision resolution algorithm in presence of capture
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1992
SP  - 163
EP  - 197
VL  - 26
IS  - 2
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1992__26_2_163_0/
LA  - en
ID  - ITA_1992__26_2_163_0
ER  - 
%0 Journal Article
%A Schmid, U.
%T On a tree collision resolution algorithm in presence of capture
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1992
%P 163-197
%V 26
%N 2
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1992__26_2_163_0/
%G en
%F ITA_1992__26_2_163_0
Schmid, U. On a tree collision resolution algorithm in presence of capture. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 2, pp. 163-197. http://archive.numdam.org/item/ITA_1992__26_2_163_0/

1. P. Mathys and Ph. Flajolet, Q-ary Collision Resolution Algorithms in Random Access Systems with Free or Blocked Channel Access, IEEE Trans. Inf. Th. 1985, IT-31, No. 2, pp. 217-243. | MR | Zbl

2. G. Fayolle, Ph. Flajolet, M. Hofri and P. Jacquet, The Evaluation of Packet Transmission Characteristics in a Multi-Access Channel with Stack Resolution Protocol, INRIA Rapports de Recherche, 1983, No. 245.

3. M. Sidi and I. Cidon, Splitting Protocols in presence of Capture, IEEE Trans. Inf. Th., 1985, IT-31, No. 2, pp. 295-301. | MR | Zbl

4. Ph. Flajolet and R. Sedgewick, Digital Search Trees revisited, SIAM J. Algorithms, August 1986, 15, (3), pp. 748-767. | MR | Zbl

5. D. E. Knuth, The Art of Computer Programming, Addison-Wesley, Reading, Mass., 1983. | MR

6. G. Andrews, The Theory of Partitions, Addison-Wesley, Reading, Mass, 1976. | MR | Zbl

7. N. E. Nörlund, Vorlesungen über Differenzenrechnung, Chelsea Publishing Company, New York, 1954.

8. J. Riordan, Combinatorial Identities, John Wiley & Sons, New York, 1968. | Zbl