Solution of a Linear Recurrence Equation Arising in Analysis of Some Algorithms

Abstract

ABSlRACf .-1 [ ] We study a recurrence equation of type 1. ...(2/1.+1-2)=0... + L Z lkt n ~N where all k=l is any sequence and s • N are integers. This recurrence arises in many applications, e.g. investigating the average number of bit inspection for a random unsuccessful search by Patricia tree, analyzing the average conflict resolution interval for… (More)

Topics

  • Presentations referencing similar topics