2005 International Conference on Analysis of Algorithms
Conrado Martínez (ed.)
DMTCS Conference Volume AD (2005), pp. 357364
author:  László Györfi and Sándor Győri 

title:  Analysis of tree algorithm for collision resolution 
keywords:  random access communication, collision resolution time, tree algorithm 
abstract: 
For the tree algorithm introduced by [Cap79] and [TsMi78]
let
L
denote the expected collision resolution time given
the collision multiplicity
N
N
. If
L(z)
stands for the Poisson transform of
L
, then we show that
N
L
N
 L(N) ≃ 1.29·10
4
cos
(2 π
log
2
N + 0.698).

If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files.  
reference:  László Györfi and Sándor Győri (2005), Analysis of tree algorithm for collision resolution , in 2005 International Conference on Analysis of Algorithms, Conrado Martínez (ed.), Discrete Mathematics and Theoretical Computer Science Proceedings AD, pp. 357364 
bibtex:  For a corresponding BibTeX entry, please consider our BibTeXfile. 
ps.gzsource:  dmAD0133.ps.gz (109 K) 
pssource:  dmAD0133.ps (277 K) 
pdfsource:  dmAD0133.pdf (122 K) 
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.
Automatically produced on Di Sep 27 10:09:37 CEST 2005 by gustedt