Emanuele Covino

Orcid: 0000-0002-2905-0314

According to our database1, Emanuele Covino authored at least 15 papers between 1997 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Analysis of Mobile Networks' Protocols Based on Abstract State Machine.
Proceedings of the Logic, Computation and Rigorous Methods, 2021

2011
An approach to use FB-AODV with Android.
Proceedings of the 2nd International Conference on Ambient Systems, 2011

A Formal Approach for Modeling Interactive Visual Interfaces.
Proceedings of the IEEE 10th International Conference on Trust, 2011

2010
Template Metaprogramming, Partial Evaluation and Computational Complexity Classes.
Proceedings of the 2010 International Conference on Foundations of Computer Science, 2010

2008
Complexity Certification of C++ Template Metaprogramming.
Proceedings of the Nineth Symposium on Trends in Functional Programming, 2008

Extending C++ Static Computation of Polynomial-Time Algorithms.
Proceedings of the 2008 International Conference on Foundations of Computer Science, 2008

2007
Compile-time Computation of Polytime Functions.
J. Univers. Comput. Sci., 2007

Static Computation of Polynomial-time Functions in C++.
Proceedings of the 2007 International Conference on Foundations of Computer Science, 2007

2005
A visual tool for multidimensional data analysis.
Proceedings of the 11th International Conference on Distributed Multimedia Systems, 2005

2003
A Refinement of the µ-measure for Stack Programs.
Proceedings of the Fifth International Workshop on Implicit Computational Complexity, 2003

2002
An Implicit Recursive Language for the Polynomial Time-space Complexity Classes.
J. Univers. Comput. Sci., 2002

2001
A predicative approach to the classification problem.
J. Funct. Program., 2001

2000
Incompleteness in Linear Time.
J. Univers. Comput. Sci., 2000

Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1997
Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997


  Loading...