scientific article; zbMATH DE number 4205968

MaRDI QIDQ3355223zbMATH OpenFDO

Authors Giorgio Gambosi, Maurizio Talamo, Marco Protasi

Publication date 1989

zbMATH Keywords

forestspath testingsearchingtrees

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An efficient implicit data structure for relation testing and searching in partially ordered sets
• A new representation of binary search trees
• A data structure for lattice representation
• scientific article; zbMATH DE number 3876615
• Implicit \(B\)-trees: A new data structure for the dictionary problem

Cited in

(4)

• A new representation of binary search trees
• An efficient implicit data structure for relation testing and searching in partially ordered sets
• scientific article; zbMATH DE number 3876615 (Why is no real title available?)
• scientific article; zbMATH DE number 6297801 (Why is no real title available?)

This page was built for publication:

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