Michał Morayne
Publications by Year
Research Areas
Advanced Topology and Set Theory, Mathematical Dynamics and Fractals, Optimization and Search Problems, Computability, Logic, AI Algorithms, Functional Equations Stability Results
Most-Cited Works
- → Partial-order analogue of the secretary problem the binary tree case(1998)38 cited
- → Decomposing Baire functions(1991)37 cited
- → Topological graph inverse semigroups(2016)33 cited
- → On a universal best choice algorithm for partially ordered sets(2007)27 cited
- → Universal functions and generalized classes of functions(1988)21 cited
- → RANK PROPERTIES OF ENDOMORPHISMS OF INFINITE PARTIALLY ORDERED SETS(2006)20 cited
- → On differentiability of Peano type functions(1984)19 cited
- → Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case(2005)17 cited