• DocumentCode
    1784826
  • Title

    The average number of times a stack exceeds a certain size

  • Author

    Manes, K. ; Tasoulas, I.

  • Author_Institution
    Dept. of Inf., Univ. of Piraeus, Piraeus, Greece
  • fYear
    2014
  • fDate
    7-9 July 2014
  • Firstpage
    261
  • Lastpage
    264
  • Abstract
    We obtain an explicit as well as an asymptotic formula for the average number of times a stack exceeds a fixed size j, after the execution of n push operations. The stack is assumed to have limitless capacity and all possible sequences of push and pop operations are considered to be equally likely.
  • Keywords
    data structures; elementary data structure; explicit-asymptotic formula; fixed size stack; limitless capacity; pop operation sequences; push operation sequences; Encyclopedias; IP networks; Informatics; Transforms; Vegetation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information, Intelligence, Systems and Applications, IISA 2014, The 5th International Conference on
  • Conference_Location
    Chania
  • Type

    conf

  • DOI
    10.1109/IISA.2014.6878799
  • Filename
    6878799
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1784826