Now showing items 1-1 of 1

    • Algorithmic issues in queueing systems and combinatorial counting problems 

      Katz-Rogozhnikov, Dmitriy A (Massachusetts Institute of Technology, 2008)
      (cont.) However, these randomized algorithms can never provide proven upper or lower bounds on the number of objects they are counting, but can only give probabilistic estimates. We propose a set of deterministic algorithms ...