Skip to main content
Extensions of Dynamic Programming, Machine Learning, Discrete Optimization
TREES
Extensions of Dynamic Programming, Machine Learning, Discrete Optimization
Main navigation
Home
People
Principal Investigators
Postdoctoral Fellows
Students
All Profiles
Alumni
Former Members
Events
All Events
Events Calendar
News
Teaching
Collaborators
Books
Contact Us
computational geometry
Professor Mikhail Moshkov’s new book published by Springer
1 min read ·
Tue, Aug 26 2025
News
decision trees
computation
combinatorial optimization
computational geometry
Professor Mikhail Moshkov’s new book, “Computation Trees: A Generalization of Decision Trees,” has been published by Springer. Moshkov’s book is devoted to the study of deterministic and nondeterministic computation trees. Computation trees are a natural generalization of decision trees: in addition to the one-place predicate-type operations (attributes) used in decision trees, computation trees can use multi-place predicate and function operations. These models arise in areas such as combinatorial optimization, computational geometry, and classification or prediction tasks, particularly when