Trees for algorithmics

DOI10.1007/978-3-319-93725-0zbMATH Open1427.68007OpenAlexW2788657954MaRDI QIDQ723893FDOQ723893

Authors: Brigitte Chauvin, Julien Clément, Danièle Gardy 

Publication date: 24 July 2018

Published in: Mathématiques \& Applications (Berlin) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-93725-0

Recommendations

• scientific article; zbMATH DE number 1516798
• scientific article; zbMATH DE number 1865430
• scientific article; zbMATH DE number 51986
• scientific article; zbMATH DE number 645628
• Trees

zbMATH Keywords

Fourier transformLaplace transformMellin transformtreesbinary treesMarkov chainsJensen inequalityCayley trees2-3 treesB-treesbivariate seriesNorlund-Rice formulasearch treestree parameters

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) General topics in the theory of algorithms (68W01)

Cited In (13)

• A note on trees, tables, and algorithms
• Trees with the mos subtrees - an algorithmic approach
• Algorithmics of nonuniformity: tools and paradigms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Depth-first layout algorithm for trees.
• Title not available (Why is that?)
• Algorithms on Trees and Graphs
• Trees and linked lists with variable ordering relations (RTR structures)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Random Trees
• Title not available (Why is that?)

This page was built for publication: Trees for algorithmics

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