Nominative data with ordered set of names

zbMath1390.68197MaRDI QIDQ1650383

Mykola Nikitchenko, Ievgen Ivanov, Volodymyr G. Skobelev

Publication date: 3 July 2018

Published in: Computer Science Journal of Moldova (Search for Journal in Brave)

Full work available at URL: http://www.math.md/publications/csjm/issues/v25-n2/12461/

zbMATH Keywords

time complexity of algorithmslinear orderingnominative datanominative setset-theoretic operations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Data structures (68P05) Total orders (06A05) Other classical set theory (including functions, relations, and set algebra) (03E20) General topics in the theory of data (68P01)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Foundations of algebraic specification and formal software development.
• Set-theoretic analysis of nominative data
• Precise estimates for the time complexity of implementing algorithms of set-theoretic operations in table algebras
• Can programming be liberated from the von Neumann style?
• The verified software initiative
• An axiomatic basis for computer programming
• A relational model of data for large shared data banks

This page was built for publication: Nominative data with ordered set of names