Mikhail Ju. Moshkov

Discret. Appl. Math., 2021

On the depth of decision trees over infinite 1-homogeneous binary information systems.

[BibT_eX]

[DOI]

Array, 2021

Critical Properties and Complexity Measures of Read-Once Boolean Functions.

[BibT_eX]

[DOI]

Vadim V. Lozin

Ann. Math. Artif. Intell., 2021

Minimizing Depth of Decision Trees with Hypotheses.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets - International Joint Conference, 2021

Minimizing Number of Nodes in Decision Trees with Hypotheses.

[BibT_eX]

[DOI]

Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 25th International Conference KES-2021, 2021

Sorting by Decision Trees with Hypotheses (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the 29th International Workshop on Concurrency, 2021

Dynamic Programming Multi-Objective Combinatorial Optimization

[BibT_eX]

[DOI]

331, Springer, ISBN: 978-3-030-63919-8, 2021

2020

Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions

[BibT_eX]

[DOI]

Intelligent Systems Reference Library 156, Springer, ISBN: 978-3-030-12853-1, 2020

Extensions of dynamic programming for multi-stage combinatorial optimization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Dynamic programming bi-criteria combinatorial optimization.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Representation of Knowledge by Decision Trees for Decision Tables with Multiple Decisions.

[BibT_eX]

[DOI]

Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 24th International Conference KES-2020, 2020

2019

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

[BibT_eX]

[DOI]

Intelligent Systems Reference Library 146, Springer, ISBN: 978-3-319-91838-9, 2019

Comparison of Heuristics for Optimization of Association Rules.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2019

Experimental Study of Totally Optimal Decision Trees.

[BibT_eX]

[DOI]

Abdulla Aldilaijan

Fundam. Informaticae, 2019

Experimental Study of Totally Optimal Decision Rules.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Soft Computing, 2019

Decision Trees for Knowledge Representation (short paper).

[BibT_eX]

[DOI]

Proceedings of the 28th International Workshop on Concurrency, 2019

2018

Bi-criteria optimization of decision trees with applications to data analysis.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

Totally optimal decision rules.

[BibT_eX]

[DOI]

Talha Amin

Discret. Appl. Math., 2018

Bi-criteria optimization problems for decision rules.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2018

Bisections-Weighted-by-Element-Size-and-Order Algorithm to Optimize Direct Solver Performance on 3D hp-adaptive Grids.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2018, 2018

2017

WQO is decidable for factorial languages.

[BibT_eX]

[DOI]

Aistis Atminas

Vadim V. Lozin

Inf. Comput., 2017

Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

Element Partition Trees For H-Refined Meshes to Optimize Direct Solver Performance. Part I: Dynamic Programming.

[BibT_eX]

[DOI]

Int. J. Appl. Math. Comput. Sci., 2017

Multi-stage Optimization of Matchings in Trees with Application to Kidney Exchange.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets - International Joint Conference, 2017

On Importance of Rows for Decision Tables.

[BibT_eX]

[DOI]

Hassan AbouEisha

Proceedings of the Rough Sets - International Joint Conference, 2017

2016

Greedy Algorithm for the Construction of Approximate Decision Rules for Decision Tables with Many-Valued Decisions.

[BibT_eX]

[DOI]

Trans. Rough Sets, 2016

Diagnosis of three types of constant faults in read-once contact networks over finite bases.

[BibT_eX]

[DOI]

Monther Busbait

Theor. Comput. Sci., 2016

Dynamic Programming Approach for Construction of Association Rule Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

Totally optimal decision trees for Boolean functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Decision trees with minimum average depth for sorting eight elements.

[BibT_eX]

[DOI]

Hassan AbouEisha

Discret. Appl. Math., 2016

Classification for Inconsistent Decision Tables.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets - International Joint Conference, 2016

Hybrid Direct and Iterative Solver with Library of Multi-criteria Optimal Orderings for h Adaptive Finite Element Method Computations.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computational Science 2016, 2016

2015

Three Approaches to Deal with Tests for Inconsistent Decision Tables - Comparative Study.

[BibT_eX]

[DOI]

Trans. Rough Sets, 2015

Quasi-Optimal Elimination Trees for 2D Grids with Singularities.

[BibT_eX]

[DOI]

Sci. Program., 2015

Diagnosis of constant faults in read-once contact networks over finite bases.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Towards Green Multi-frontal Solver for Adaptive Finite Element Method.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computational Science, 2015

Classification and optimization of decision trees for inconsistent decision tables represented as MVD tables.

[BibT_eX]

[DOI]

Proceedings of the 2015 Federated Conference on Computer Science and Information Systems, 2015

Dynamic Programming Approach for Study of Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the 24th International Workshop on Concurrency, 2015

Comparison of Heuristics for Optimization of Association Rules.

[BibT_eX]

[DOI]

Proceedings of the 24th International Workshop on Concurrency, 2015

Multi-pruning of decision trees for knowledge representation and classification.

[BibT_eX]

[DOI]

Proceedings of the 3rd IAPR Asian Conference on Pattern Recognition, 2015

2014

Optimization of Decision Rules Based on Dynamic Programming Approach.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Intelligent Machines-4, 2014

Relationships between Average Depth and Number of Misclassifications for Decision Trees.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

Relationships Between Length and Coverage of Decision Rules.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

Diagnosis of constant faults in iteration-free circuits over monotone basis.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Decision Rule Classifiers for Multi-label Decision Tables.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Intelligent Systems Paradigms, 2014

Minimization of Decision Tree Average Depth for Decision Tables with Many-valued Decisions.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2014

Comparison of Heuristics for Inhibitory Rule Optimization.

[BibT_eX]

[DOI]

Fawaz Alsolami

Proceedings of the 18th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2014

Dynamic Programming Algorithm for Generation of Optimal Elimination Trees for Multi-frontal Direct Solver Over H-refined Grids.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computational Science, 2014

‘Misclassification Error' Greedy Heuristic to Construct Decision Trees for Inconsistent Decision Tables.

[BibT_eX]

[DOI]

Proceedings of the KDIR 2014 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval, Rome, Italy, 21, 2014

Minimization of decision tree depth for multi-label decision tables.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Conference on Granular Computing, 2014

Minimizing Size of Decision Trees for Multi-label Decision Tables.

[BibT_eX]

[DOI]

Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 2014

2013

Relationships for Cost and Uncertainty of Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, 2013

Dynamic Programming Approach for Exact Decision Rule Optimization.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, 2013

Comparison of Greedy Algorithms for Decision Tree Optimization.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, 2013

Three Approaches to Data Analysis - Test Theory, Rough Sets and Logical Analysis of Data

[BibT_eX]

[DOI]

Intelligent Systems Reference Library 41, Springer, ISBN: 978-3-642-28666-7, 2013

Dynamic programming approach to optimization of approximate decision rules.

[BibT_eX]

[DOI]

Inf. Sci., 2013

Optimization and analysis of decision trees and rules: dynamic programming approach.

[BibT_eX]

[DOI]

Int. J. Gen. Syst., 2013

A Greedy Algorithm for Construction of Decision Trees for Tables with Many-Valued Decisions - A Comparative Study.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2013

Classifiers Based on Optimal Decision Rules.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2013

Optimization of Decision Rule Complexity for Decision Tables with Many-Valued Decisions.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Systems, 2013

Sequential Optimization of Approximate Inhibitory Rules Relative to the Length, Coverage and Number of Misclassifications.

[BibT_eX]

[DOI]

Fawaz Alsolami

Proceedings of the Rough Sets and Knowledge Technology - 8th International Conference, 2013

Three Approaches to Deal with Inconsistent Decision Tables - Comparison of Decision Tree Complexity.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 2013

An Automatic Way of Finding Robust Elimination Trees for a Multi-frontal Sparse Solver for Radical 2D Hierarchical Meshes.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2013

Deciding WQO for Factorial Languages.

[BibT_eX]

[DOI]

Aistis Atminas

Vadim V. Lozin

Proceedings of the Language and Automata Theory and Applications, 2013

Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2013

Decision Rules, Trees and Tests for Tables with Many-valued Decisions-comparative Study.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2013

Optimization of Approximate Inhibitory Rules Relative to Number of Misclassifications.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2013

An algorithm for reduct cardinality minimization.

[BibT_eX]

[DOI]

Hassan AbouEisha

Mohammed A. Al Farhan

Proceedings of the 2013 IEEE International Conference on Granular Computing, 2013

2012

Greedy Algorithms for Construction of Approximate Tests for Decision Tables with Many-Valued Decisions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Dynamic Programming Approach for Partial Decision Rule Optimization.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Optimization of Inhibitory Decision Rules Relative to Length and Coverage.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology - 7th International Conference, 2012

Relationships between Number of Nodes and Number of Misclassifications for Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2012

On Cost and Uncertainty of Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2012

Optimization of Approximate Decision Rules Relative to Number of Misclassifications: Comparison of Greedy and Dynamic Programming Approaches.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Engineering, Machine Learning and Lattice Computing with Applications, 2012

Optimization of Approximate Decision Rules Relative to Number of Misclassifications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge-Based and Intelligent Information and Engineering Systems, 2012

Length and Coverage of Inhibitory Decision Rules.

[BibT_eX]

[DOI]

Proceedings of the Computational Collective Intelligence. Technologies and Applications, 2012

Tests for Decision Tables with Many-Valued Decisions - Comparative Study.

[BibT_eX]

[DOI]

Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

Average Depth and Number of Misclassifications for Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the 21th International Workshop on Concurrency, 2012

Greedy Algorithm for Construction of Decision Trees for Tables with Many-Valued Decisions.

[BibT_eX]

[DOI]

Proceedings of the 21th International Workshop on Concurrency, 2012

Relationships Between Length and Coverage of Exact Decision Rules.

[BibT_eX]

[DOI]

Proceedings of the 21th International Workshop on Concurrency, 2012

2011

Combinatorial Machine Learning - A Rough Set Approach

[BibT_eX]

[DOI]

Studies in Computational Intelligence 360, Springer, ISBN: 978-3-642-20994-9, 2011

Sequential Optimization of Paths in Directed Graphs Relative to Different Cost Functions.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computational Science, 2011

Learning Probabilistic Models of Hydrogen Bond Stability from Molecular Dynamics Simulation Trajectories.

[BibT_eX]

[DOI]

J. Intell. Learn. Syst. Appl., 2011

Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Construction of α-Decision Trees for Tables with Many-Valued Decisions.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology - 6th International Conference, 2011

Constructing an Optimal Decision Tree for FAST Corner Point Detection.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology - 6th International Conference, 2011

Comparison of Greedy Algorithms for α-Decision Tree Construction.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology - 6th International Conference, 2011

Online Learning Algorithm for Ensemble of Decision Rules.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, 2011

Relationships between Depth and Number of Misclassifications for Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, 2011

Comparison of Greedy Algorithms for Decision Tree Construction.

[BibT_eX]

Proceedings of the KDIR 2011, 2011

Sequential Optimization of Binary Search Trees for Multiple Cost Functions.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

Irreducible Descriptive Sets of Attributes for Information Systems.

[BibT_eX]

[DOI]

Trans. Rough Sets, 2010

Comparison of Some Classification Algorithms Based on Deterministic and Nondeterministic Decision Rules.

[BibT_eX]

[DOI]

Pawel Delimata

Barbara Marszal-Paszek

Trans. Rough Sets, 2010

Greedy Algorithm with Weights for Decision Tree Construction.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

A Tool for Study of Optimal Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Rough Set and Knowledge Technology - 5th International Conference, 2010

Upper Bounds on Minimum Cardinality of Exact and Approximate Reducts.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2010

On Algorithm for Building of Optimal <i>alpha</i>-Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2010

2009

Inhibitory Rules in Data Analysis: A Rough Set Approach

[BibT_eX]

[DOI]

Studies in Computational Intelligence 163, Springer, ISBN: 978-3-540-85637-5, 2009

On Minimal Inhibitory Rules for Almost All k-Valued Information Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

Greedy Algorithms with Weights for Construction of Partial Association Rules.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

Greedy Algorithm for Construction of Partial Association Rules.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

On Construction of Partial Association Rules.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology, 4th International Conference, 2009

On Construction of Partial Association Rules with Weights.

[BibT_eX]

[DOI]

Proceedings of the Man-Machine Interactions, 2009

2008

Partial Covers, Reducts and Decision Rules in Rough Sets - Theory and Applications

[BibT_eX]

[DOI]

Studies in Computational Intelligence 145, Springer, ISBN: 978-3-540-69027-6, 2008

Extracting Relevant Information about Reduct Sets from Data Tables.

[BibT_eX]

[DOI]

Trans. Rough Sets, 2008

Universal Problem of Attribute Reduction.

[BibT_eX]

[DOI]

Trans. Rough Sets, 2008

On Partial Covers, Reducts and Decision Rules.

[BibT_eX]

[DOI]

Trans. Rough Sets, 2008

Maximal consistent extensions of information systems relative to their theories.

[BibT_eX]

[DOI]

Inf. Sci., 2008

Comparison of Lazy Classification Algorithms Based on Deterministic and Inhibitory Decision Rules.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology, Third International Conference, 2008

2007

On Partial Covers, Reducts and Decision Rules with Weights.

[BibT_eX]

[DOI]

Trans. Rough Sets, 2007

On algorithms for construction of all irreducible partial covers.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

On Minimal Rule Sets for Almost All Binary Information Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

On Construction of Partial Reducts and Irreducible Partial Decision Rules.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

On the class of restricted linear information systems.

[BibT_eX]

[DOI]

Discret. Math., 2007

Graphical Representation of Information on the Set of Reducts.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology, Second International Conference, 2007

Two Families of Classification Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets, 2007

On Covering Attribute Sets by Reducts.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Intelligent Systems Paradigms, International Conference, 2007

Universal Attribute Reduction Problem.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Intelligent Systems Paradigms, International Conference, 2007

2006

Lower Bounds on Minimal Weight of Partial Reducts and Partial Decision Rules.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology, First International Conference, 2006

On Testing Membership to Maximal Consistent Extensions of Information Systems.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2006

On Greedy Algorithms with Weights for Construction of Partial Covers.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Information Processing and Web Mining, 2006

2005

Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity Local Approach.

[BibT_eX]

[DOI]

Trans. Rough Sets, 2005

Time Complexity of Decision Trees.

[BibT_eX]

[DOI]

Trans. Rough Sets, 2005

On Optimization of Decision Trees.

[BibT_eX]

[DOI]

Maria S. Zelentsova

Trans. Rough Sets, 2005

On Construction of the Set of Irreducible Partial Covers.

[BibT_eX]

[DOI]

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2005

On Partial Tests and Partial Reducts for Decision Tables.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets, 2005

Restricted Linear Information Systems.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Information Processing and Web Mining, 2005

On Cardinality of Reducts for the Most Part of Binary Decision Tables.

[BibT_eX]

Proceedings of the 2nd Indian International Conference on Artificial Intelligence, 2005

2004

Greedy Algorithm of Decision Tree Construction for Real Data Tables.

[BibT_eX]

[DOI]

Trans. Rough Sets, 2004

Consecutive Optimization of Decision Trees Concerning Various Complexity Measures.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2004

Greedy Algorithm for Decision Tree Construction in Context of Knowledge Discovery Problems.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2004

Decision Trees and Reducts for Distributed Decision Tables.

[BibT_eX]

[DOI]

Proceedings of the Monitoring, Security, and Rescue Techniques in Multiagent Systems, 2004

2003

Compressible Infinite Information Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

Classification of Infinite Information Systems Depending on Complexity of Decision Trees and Decision Rule Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

Greedy Algorithm for Set Cover in Context of Knowledge Discovery Problems.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Rough Sets in Knowledge Discovery and Soft Computing, 2003

Approximate Algorithm for Minimization of Decision Tree Depth.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets, 2003

2002

On Decision Trees for (1, 2)-Bayesian Networks.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2002

On Compressible Information Systems.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2002

2000

On Algorithm for Constructing of Decision Trees with Minimal Depth.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2000

Decision Trees for Regular Language Word Recognition.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2000

Deterministic and Nondeterministic Decision Trees for Rough Computing.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2000

Classification of Infinite Information Systems.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2000

1998

Some Relationships between Decision Trees and Decision Rule Systems.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 1998

1997

Bounds on Average Weighted Depth of Decision Trees.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1997

Unimprovable Upper Bounds on Time Complexity of Decision Trees.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1997

Algorithms for Constructing of Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Principles of Data Mining and Knowledge Discovery, 1997

Complexity of Deterministic and Nondeterministic Decision Trees for Regular Language Word Recognition.

[BibT_eX]

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

1996

Some Bounds on Minimal Decision Tree Depth.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

Comparative Analysis of Deterministic and Nondeterministic Decision Tree Complexity.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

1995

About the Depth of Decision Trees Computing Boolean Functions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1995

Relationships between depth of deterministic and nondeterministic acyclic programs computing functions of k-valued logic.

[BibT_eX]

Bull. EATCS, 1995

Two Approaches to Investigation of Deterministic and Nondeterministic Decision Trees Complexity.

[BibT_eX]

Proceedings of the Second World Conference on the Fundamentals of Artificial Intelligence, 1995

1994

Optimization Problems for Decision Trees.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1994

1993

Decision Trees for Decision Tables.

[BibT_eX]

Proceedings of the Rough Sets, 1993

1987

On the Programs with Finite Development.

[BibT_eX]

[DOI]