@article{dmtcs:3568,
    title      = {On the number of zero increments of random walks with a barrier},
    author     = {Alex Iksanov and Pavlo Negadajlov},
    url        = {https://dmtcs.episciences.org/3568},
    doi        = {10.46298/dmtcs.3568},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science},
    issuetitle = {Proceedings},
    eid        = 17,
    year       = {2008},
    month      = {Jan},
    keywords   = {absorption time, recursion with random indices, random walk, undershoot, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]},
    language   = {English},
}