A note on binomial recurrences arising in the analysis of algorithms

DOI10.1016/0020-0190(93)90070-PzbMATH Open0800.68497MaRDI QIDQ685508FDOQ685508

Authors: Wojciech Szpankowski, Helmut Prodinger 

Publication date: 19 September 1994

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

asymptotic expansionsanalysis of algorithmsbinomial recurrences arising

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• The evaluation of an alternative sum with applications to the analysis of some data structures
• Title not available (Why is that?)
• Digital Search Trees Revisited
• Tree algorithms for packet broadcast channels
• A characterization of digital search trees from the successful search viewpoint
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized Digital Trees and Their Difference—Differential Equations
• On The variance of the extremal path length in a symmetric digital trie
• On a recurrence equation arising in the analysis of conflict resolution algorithms
• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• Some results on V-ary asymmetric tries
• On the balance property of Patricia tries: External path length viewpoint
• Patricia tries again revisited
• On a tree collision resolution algorithm in presence of capture
• On some applications of formulae of Ramanujan in the analysis of algorithms
• On the performance evaluation of extendible hashing and trie searching
• Further results on digital search trees
• Analytic analysis of algorithms

Cited In (1)

• The number of winners in a discrete geometrically distributed sample

This page was built for publication: A note on binomial recurrences arising in the analysis of algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685508)