A theory of complexity for continuous time systems
Journal of Complexity
An analog characterization of the Grzegorczyk hierarchy
Journal of Complexity
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Elementarily computable functions over the real numbers and R-sub-recursive functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Abstract Geometrical Computation 1: Embedding Black Hole Computations with Rational Numbers
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
A new conceptual framework for analog computation
Theoretical Computer Science
Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs
Electronic Notes in Theoretical Computer Science (ENTCS)
Classes of Timed Automata and the Undecidability of Universality
Fundamenta Informaticae
Abstract geometrical computation 3: black holes for classical and analog computing
Natural Computing: an international journal
Reversible conservative rational abstract geometrical computation is turing-universal
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Forecasting black holes in abstract geometrical computation is highly unpredictable
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Real recursive functions and real extensions of recursive functions
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Abstract geometrical computation for black hole computation
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Controller synthesis and ordinal automata
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Abstract geometrical computation: turing-computing ability and undecidability
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Classes of Timed Automata and the Undecidability of Universality
Fundamenta Informaticae
Abstract Geometrical Computation 1: Embedding Black Hole Computations with Rational Numbers
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Computation with perturbed dynamical systems
Journal of Computer and System Sciences
Hi-index | 0.00 |