A Variant to Turing's Theory of Computing Machines
Journal of the ACM (JACM)
Categorizing Automata by W-Machine Programs
Journal of the ACM (JACM)
Motivating the Church-Turing thesis in the twenty-first century
ITiCSE '98 Proceedings of the 6th annual conference on the teaching of computing and the 3rd annual conference on Integrating technology into computer science education: Changing the delivery of computer science education
Universality of Tag Systems with P = 2
Journal of the ACM (JACM)
Random-Access Stored-Program Machines, an Approach to Programming Languages
Journal of the ACM (JACM)
An Abstract Machine for Symbolic Computation
Journal of the ACM (JACM)
On the Efficiency of Algorithms
Journal of the ACM (JACM)
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
Subrecursive Programming Languages, Part I: efficiency and program structure
Journal of the ACM (JACM)
On the expressive power of a language for programming coordination media
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
The Vienna Definition Language
ACM Computing Surveys (CSUR)
Logic for the computer sciences
Communications of the ACM
Multi-tape and infinite-state automata—a survey
Communications of the ACM
ACM-SE 14 Proceedings of the 14th annual Southeast regional conference
Design of embedded systems: formal models, validation, and synthesis
Readings in hardware/software co-design
Analysis issues in Petri nets with inhibitor arcs
Theoretical Computer Science
An Efficient Algorithm for Out-of-Core Matrix Transposition
IEEE Transactions on Computers
Shared Memory Multimicroprocessor Operating System with an Extended Petri Net Model
IEEE Transactions on Parallel and Distributed Systems
On the Expressiveness of Event Notification in Data-Driven Coordination Languages
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Temporary Data in Shared Dataspace Coordination Languages
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Expired data collection in shared dataspaces
Theoretical Computer Science - Foundations of software science and computation structures
Computer Science And Recursion Theory
ACM '78 Proceedings of the 1978 annual conference
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Predecessor machines and regressing functions
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Maze recognizing automata (Extended Abstract)
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
On the size of programs in subrecursive formalisms
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Computability over arbitrary fields
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Towards a theory of semantics and compilers for programming languages
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Programming with(out) the GOTO
ACM '72 Proceedings of the ACM annual conference - Volume 2
Invited papers—1: basic concepts of automata theory
ACM '65 Proceedings of the 1965 20th national conference
Translating recursion schemes into program schemes
Proceedings of ACM conference on Proving assertions about programs
A Logic-Based Policy Definition Language for Network Management
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Programming with(out) the GOTO
ACM SIGPLAN Notices - Special issue on control structures in programming languages
On the expressive power of movement and restriction in pure mobile ambients
Theoretical Computer Science - Special issue: Foundations of wide area network computing
On the computational strength of pure ambient calculi
Theoretical Computer Science - Expressiveness in concurrency
Quantitative information in the tuple space coordination model
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Variable Complexity of Simple Programs
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
B70-5 Theories of Abstract Automata
IEEE Transactions on Computers
Topology in PVS: continuous mathematics with applications
Proceedings of the second workshop on Automated formal methods
Minimality considerations for ordinal computers modeling constructibility
Theoretical Computer Science
Expressiveness Issues in Brane Calculi: A Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
Information Processing Letters
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Theory of computing in computer science education
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Computational expressiveness of Genetic Systems
Theoretical Computer Science
On the Expressive Power of Process Interruption and Compensation
Web Services and Formal Methods
On the expressive power of process interruption and compensation
Mathematical Structures in Computer Science
ACM Transactions on Computational Logic (TOCL)
On the Termination Problem for Declarative XML Message Processing
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Causes of ineradicable spurious predictions in qualitative simulation
Journal of Artificial Intelligence Research
On the computational power of BlenX
Theoretical Computer Science
On the Expressiveness of Probabilistic and Prioritized Data-retrieval in Linda
Electronic Notes in Theoretical Computer Science (ENTCS)
The lambda-gamma calculus: A language adequate for defining recursive functions
Information Sciences: an International Journal
(tissue) p systems with cell polarity
Mathematical Structures in Computer Science
On the expressive power of recursion, replication and iteration in process calculi
Mathematical Structures in Computer Science
Deciding reachability problems in turing-complete fragments of mobile ambients
Mathematical Structures in Computer Science
On transformations of programs
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Towards a theory of semantics and compilers for programming languages
Journal of Computer and System Sciences
Subrecursive programming languages II on program size
Journal of Computer and System Sciences
Maze recognizing automata and nondeterministic tape complexity
Journal of Computer and System Sciences
A characterization of the power of vector machines
Journal of Computer and System Sciences
Program schemes, recursion schemes, and formal languages
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Effective proper procedures and universal classes of program schemata
Journal of Computer and System Sciences
Translatability of schemas over restricted interpretations
Journal of Computer and System Sciences
On the expressiveness and decidability of higher-order process calculi
Information and Computation
A generalised dynamical system, infinite time register machines, and Π11-CA;0
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Computing with genetic gates, proteins, and membranes
WMC'06 Proceedings of the 7th international conference on Membrane Computing
The euclid abstract machine: trisection of the angle and the halting problem
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Deciding behavioural properties in brane calculi
CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
On the computational power of the mate/bud/drip brane calculus: interleaving vs. maximal parallelism
WMC'05 Proceedings of the 6th international conference on Membrane Computing
On the computational power of brane calculi
Transactions on Computational Systems Biology VI
Termination and divergence are undecidable under a maximum progress multi-step semantics for linca
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Deciding reachability in mobile ambients
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Register complexity of LOOP-, WHILE-, and GOTO-Programs
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Prioritized and parallel reactions in shared data space coordination languages
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
On the undecidability of coherent logic
Processes, Terms and Cycles
Hilbert's tenth problem and paradigms of computation
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Survey: A survey of state vectors
Computer Science Review
Variable Complexity of Simple Programs
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Relative Cost Random Access Machines
Fundamenta Informaticae
The Complexity Of Local Stratification
Fundamenta Informaticae
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.06 |