scientific article; zbMATH DE number 108385

MaRDI QIDQ4023845zbMATH OpenFDO

Authors Christoph Meinel

Publication date 23 January 1993

zbMATH Keywords

efficiencycomplexity of algorithms

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01)

Recommendations

• scientific article; zbMATH DE number 1552764
• Algorithms and data structures
• scientific article; zbMATH DE number 2167065
• scientific article; zbMATH DE number 108379
• scientific article; zbMATH DE number 2237397

Cited in

(6)

• scientific article; zbMATH DE number 3915626 (Why is no real title available?)
• scientific article; zbMATH DE number 5364247 (Why is no real title available?)
• scientific article; zbMATH DE number 2237397 (Why is no real title available?)
• scientific article; zbMATH DE number 1552764 (Why is no real title available?)
• scientific article; zbMATH DE number 108379 (Why is no real title available?)
• The principle of optimality in the design of efficient algorithms

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