On the principal recurrence of data structures organization and orthogonal polynomials

DOI10.1080/10652460108819296zbMath0982.68049OpenAlexW2050109659MaRDI QIDQ2759210

I. Jaroszewski, A. K. K. Kwaśniewski

Publication date: 8 April 2002

Published in: Integral Transforms and Special Functions (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10652460108819296

zbMATH Keywords

random walkdynamic data structures

Mathematics Subject Classification ID

General quantum mechanics and problems of quantization (81S99) Data structures (68P05)

Related Items (4)

Duality triads of higher rank: further properties and some examples ⋮ On a generalization of duality triads ⋮ Main theorems of extended finite operator calculus ⋮ A combinatorial interpretation of the connection constants for persistent sequences of polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal stack filters under rank selection and structural constraints
• Combinatorial aspects of continued fractions
• Sequence of operations analysis for dynamic data structures

This page was built for publication: On the principal recurrence of data structures organization and orthogonal polynomials