Perfect trees and bit-reversal permutations

DOI10.1017/S0956796800003701MaRDI QIDQ4507961zbMATH OpenFDO

Authors Ralf Hinze

Publication date 10 October 2000

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0956796800003701

zbMATH Keywords

fast Fourier transformFFT algorithm

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 892276
• Permutations in binary trees and split trees
• The representation of permutations by trees
• Permutrees
• Permutrees
• Some considerations on permutation trees
• Tree traversals and permutations
• Consecutive permutation patterns in trees and mappings
• Increasing trees and alternating permutations
• Permutation representation of k-ary trees

Cited in

(8)

• Permutation representation of k-ary trees
• Concrete stream calculus: an extended study
• Type Fusion
• Parberry’s pairwise sorting network revealed
• scientific article; zbMATH DE number 871445 (Why is no real title available?)
• Chip firing on directed k-ary trees
• A principled approach to programming with nested types in Haskell
• Generic programming in 3D

This page was built for publication: Perfect trees and bit-reversal permutations

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