Backing up in singly linked lists
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Software engineering education: Rôles of formal specification and design calculi
Annals of Software Engineering - Special issue on software engineering education
The size-change principle for program termination
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
A syntactical analysis of non-size-increasing polynomial time computation
ACM Transactions on Computational Logic (TOCL)
Kolmogorov complexity and non-determnism
Theoretical Computer Science
A Renee Equation for Algorithmic Complexity
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Termination Proofs and Complexity Certification
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Directions in Functional Programming for Real(-Time) Applications
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Applicative Control and Computational Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Analysing the implicit complexity of programs
Information and Computation - Special issue: ICC '99
The essence of computation
Homeomorphic embedding for online termination of symbolic methods
The essence of computation
A characterization of partial metrizability: domains are quantifiable
Theoretical Computer Science - Topology in computer science
Complexity classes and fragments of C
Information Processing Letters
The expressive power of higher-order types or, life without CONS
Journal of Functional Programming
On characterizations of the basic feasible functionals, Part I
Journal of Functional Programming
On the computational complexity of Longeley's H functional
Theoretical Computer Science - Implicit computational complexity
Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Programming languages capturing complexity classes
Nordic Journal of Computing
Backing up in singly linked lists
Journal of the ACM (JACM)
Resource control for synchronous cooperative threads
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Feasible reactivity in a synchronous Π-calculus
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Size-change termination with difference constraints
ACM Transactions on Programming Languages and Systems (TOPLAS)
Extending the loop language with higher-order procedural variables
ACM Transactions on Computational Logic (TOCL)
Sup-interpretations, a semantic method for static analysis of program resources
ACM Transactions on Computational Logic (TOCL)
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science
Bernoulli's principle of insufficient reason and conservation of information in computer search
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Program transformations for information personalization
Computer Languages, Systems and Structures
Max-plus quasi-interpretations
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Efficient first order functional program interpreter with time bound certifications
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Predicative analysis of feasibility and diagonalization
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Quasi-interpretation synthesis by decomposition an application to higher-order programs
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
The church-turing thesis over arbitrary domains
Pillars of computer science
Self-generating program specializers
Information Processing Letters
Size-change termination and transition invariants
SAS'10 Proceedings of the 17th international conference on Static analysis
Algorithms and theory of computation handbook
Derivational complexity is an invariant cost model
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Programming in Biomolecular Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
What do reversible programs compute?
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Computational biology: a programming perspective
Formal modeling
Resource bound certification for a tail-recursive virtual machine
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
An architecture for self-organising evolvable virtual machines
Engineering Self-Organising Systems
Some programming languages for LOGSPACE and PTIME
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Least upper bounds on the size of church-rosser diagrams in term rewriting and λ-calculus
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Verification of gap-order constraint abstractions of counter systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Strong termination for gap-order constraint abstractions of counter systems
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Personalizing communication about trust
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Characterizing languages by normalization and termination in string rewriting
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Synthesis of sup-interpretations: A survey
Theoretical Computer Science
Reversible representation and manipulation of constructor terms in the heap
RC'13 Proceedings of the 5th international conference on Reversible Computation
ACM Transactions on Computational Logic (TOCL)
Verification of gap-order constraint abstractions of counter systems
Theoretical Computer Science
| Hi-index | 0.00 |