On generating B-trees with constant average delay and in lexicographic order

DOI10.1016/0020-0190(94)90050-7zbMath0787.68025OpenAlexW2023952630MaRDI QIDQ1313707

Ivan Stojmenović, Mounir Belbaraka

Publication date: 24 February 1994

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90050-7

zbMATH Keywords

lexicographic orderB-trees2--3 treesgenerating combinatorial objects

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Data structures (68P05)

Related Items (2)

Distribution of distinguishable objects to bins: generating all distributions ⋮ Fast algorithms for genegrating integer partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Listing and counting subtrees of equal size of a binary tree
• Generating binary trees of bounded height
• Generating ordered trees
• A loopless algorithm for generating binary tree sequences
• Organization and maintenance of large ordered indexes
• Ranking and Unranking of AVL-Trees
• A Simple Algorithm for Generating Non-regular Trees in Lexicographic Order
• Generating trees withnnodes andmleaves
• Constant Time Generation of Rooted Trees
• Ranking and Unranking of 2-3 Trees
• Generating Binary Trees Lexicographically
• Generating t-Ary Trees Lexicographically
• Lexicographic generation of binary unordered trees
• Ranking and unranking trees using regular reductions
• Constant Time Generation of Free Trees
• Ranking and unranking of B-trees

This page was built for publication: On generating B-trees with constant average delay and in lexicographic order