Selected developments in Soviet mathematical cybernetics
Selected developments in Soviet mathematical cybernetics
Comparing the Church and Turing approaches: two prophetical messages
A half-century survey on The Universal Turing Machine
Nets of processes and data flow
Proceedings of the Fourth Annual Symposium on Logic in computer science
Proceedings of the seventeenth international colloquium on Automata, languages and programming
A type-theoretical alternative to ISWIM, CUCH, OWHY
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
On being incoherent without being very hard
Computational Complexity
On the power of compositional proofs for nets: relationships between completeness and modularity
Fundamenta Informaticae
Discerning Causality in Interleaving Behavior
Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
From Finite Automata toward Hybrid Systems (Extended Abstract)
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
From Denotational to Operational and Axiomatic Semantics for ALGOL-like Languages: an Overview
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Nets of processes and data flow
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Origins and Metamorphoses of The Trinity: Logic, Nets, Automata
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
The semantics of local storage, or what makes the free-list free?(Preliminary Report)
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Classes of computable functions defined by bounds on computation: Preliminary Report
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
A Logic Framework for Verification of Timed Algorithms
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Understanding Basic Automata Theory in the Continuous Time Setting
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
IEEE Annals of the History of Computing
| Hi-index | 0.00 |