scientific article; zbMATH DE number 1947386

zbMATH Open1019.68524MaRDI QIDQ4411351

Arye Barkan, Haim Kaplan

Publication date: 8 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2461/24610114.htm

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Dynamic programming (90C39) Data structures (68P05)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Testing the optimality of alphabetic trees 👍 👎
• Alphabetic tree relations 👍 👎
• Lexicographically ordered trees 👍 👎
• Alphabetic Minimax Trees 👍 👎
• The Optimal Alphabetic Tree Problem Revisited 👍 👎
• The Optimal Alphabetic Tree problem revisited 👍 👎
• Upper and Lower Bounds on Constructing Alphabetic Binary Trees 👍 👎
• Partial alphabetic trees 👍 👎

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 Q4411351)