Emmanuel Hainry

Proc. ACM Program. Lang., January, 2023

A feasible and unitary programming language with quantum control.

[BibT_eX]

[DOI]

CoRR, 2023

A Programming Language Characterizing Quantum Polynomial Time.

[BibT_eX]

[DOI]

Mário Silva

Proceedings of the Foundations of Software Science and Computation Structures, 2023

2022

A tier-based typed programming language characterizing Feasible Functionals.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2022

Complete and tractable machine-independent characterizations of second-order polytime.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2022

2021

ComplexityParser: An Automatic Tool for Certifying Poly-Time Complexity of Java Programs.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2021, 2021

2020

Theory of higher order interpretations and application to Basic Feasible Functions.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2020

Polynomial Time over the Reals with Parsimony.

[BibT_eX]

[DOI]

Damiano Mazza

Proceedings of the Functional and Logic Programming - 15th International Symposium, 2020

2018

A type-based complexity analysis of Object Oriented programs.

[BibT_eX]

[DOI]

Inf. Comput., 2018

2017

Higher order interpretation for higher order complexity.

[BibT_eX]

[DOI]

Proceedings of the LPAR-21, 2017

2016

A Framework for Algebraic Characterizations in Recursive Analysis.

[BibT_eX]

[DOI]

Walid Gomaa

CoRR, 2016

2015

Characterizing polynomial time complexity of stream programs using interpretations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Objects in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems - 13th Asian Symposium, 2015

2013

Computation with perturbed dynamical systems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Type-Based Complexity Analysis for Fork Processes.

[BibT_eX]

[DOI]

Jean-Yves Marion

Proceedings of the Foundations of Software Science and Computation Structures, 2013

2011

Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions.

[BibT_eX]

[DOI]

Walid Gomaa

Int. J. Unconv. Comput., 2011

2010

Robust Computations with Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2008

Computing Omega-Limit Sets in Linear Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computing, 7th International Conference, 2008

Reachability in Linear Dynamical Systems.

[BibT_eX]

[DOI]

Proceedings of the Logic and Theory of Algorithms, 2008

2007

Polynomial differential equations compute all real computable functions on computable compact intervals.

[BibT_eX]

[DOI]

Manuel Lameiras Campagnolo

J. Complex., 2007

On the Computational Capabilities of Several Models.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

2006

Modèles de calcul sur les réels, résultats de comparaison. (Computation on the reals.Comparison of some models).

[BibT_eX]

[DOI]

PhD thesis, 2006

Recursive Analysis Characterized as a Class of Real Recursive Functions.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation.

[BibT_eX]

[DOI]

Manuel Lameiras Campagnolo

Proceedings of the Theory and Applications of Models of Computation, 2006

2005

Elementarily computable functions over the real numbers and R-sub-recursive functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

2004

Real Recursive Functions and Real Extensions of Recursive Functions.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

An Analog Characterization of Elementarily Computable Functions over the Real Numbers.

[BibT_eX]

[DOI]