Giovanni Pani

According to our database, Giovanni Pani authored at least 15 papers between 1980 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2021

Analysis of Mobile Networks' Protocols Based on Abstract State Machine.

Emanuele Covino, Giovanni Pani

Proceedings of the Logic, Computation and Rigorous Methods, 2021

2011

IFHNFS: fast indexing information in mobile devices.

Nicola Corriero, Giuseppe Gargiuolo, Giovanni Pani

Proceedings of the 2nd International Conference on Ambient Systems, 2011

A Formal Approach for Modeling Interactive Visual Interfaces.

Emanuele Covino, Giovanni Pani

Proceedings of the IEEE 10th International Conference on Trust, 2011

2010

Template Metaprogramming, Partial Evaluation and Computational Complexity Classes.

Emanuele Covino, Giovanni Pani

Proceedings of the 2010 International Conference on Foundations of Computer Science, 2010

2008

Complexity Certification of C++ Template Metaprogramming.

Emanuele Covino, Giovanni Pani

Proceedings of the Nineth Symposium on Trends in Functional Programming, 2008

Extending C++ Static Computation of Polynomial-Time Algorithms.

Emanuele Covino, Giovanni Pani, Daniele Scrimieri

Proceedings of the 2008 International Conference on Foundations of Computer Science, 2008

2007

Compile-time Computation of Polytime Functions.

Emanuele Covino, Giovanni Pani, Daniele Scrimieri

J. Univers. Comput. Sci., 2007

Static Computation of Polynomial-time Functions in C++.

Emanuele Covino, Giovanni Pani, Daniele Scrimieri

Proceedings of the 2007 International Conference on Foundations of Computer Science, 2007

2005

A visual tool for multidimensional data analysis.

Paolo Buono, Maria Francesca Costabile, Emanuele Covino, Giovanni Pani

Proceedings of the 11th International Conference on Distributed Multimedia Systems, 2005

2003

A Refinement of the µ-measure for Stack Programs.

Emanuele Covino, Giovanni Pani

Proceedings of the Fifth International Workshop on Implicit Computational Complexity, 2003

2002

An Implicit Recursive Language for the Polynomial Time-space Complexity Classes.

Emanuele Covino, Giovanni Pani

J. Univers. Comput. Sci., 2002

2001

A predicative approach to the classification problem.

Salvatore Caporaso, Emanuele Covino, Giovanni Pani

J. Funct. Program., 2001

2000

Incompleteness in Linear Time.

Salvatore Caporaso, Giovanni Pani, Emanuele Covino

J. Univers. Comput. Sci., 2000

Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes.

Emanuele Covino, Giovanni Pani, Salvatore Caporaso

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1980

Undecidability vs transfinite induction for the consistency of hyperarithmetical sets.

Salvatore Caporaso, Giovanni Pani

Arch. Math. Log., 1980