Syntactic Characterization in Lisp of the
Polynomial Complexity Classes and Hierarchy
S. Caporaso, E. Covino, N. Galesi, M. Zito
CIAC '97, Lecture Notes in Computer Science, 1203(97),
61-73.
Predicative Recursion, Constructive
Diagonalization and the Elementary Functions
S. Caporaso, G. Pani, E. Covino
Workshop on Implicit Computational Complexity
(ICC'99),
affiliated with Logic in Computer Science (LICS'99),
Trento, Italy.
Extending the Implicit Computational Complexity
Approach to the sub-elementary time-space classes
E. Covino, G. Pani, S. Caporaso
CIAC 2000, Lecture Notes in Computer Science,
1767(00), 239-252.
A resource-free classification of the
time-space complexity classes between Lintime and Expspace
S. Caporaso, G. Pani, E. Covino
Second International Workshop on Implicit
Computational Complexity (ICC'00),
affiliated with Logic in Computer Science (LICS'00),
S. Barbara, Cal.
Incompleteness in Linear Time
S. Caporaso, G. Pani, E. Covino
Journal of Universal Computer Science, vol.6, no.12
(2000), 1185-1196
A Predicative Approach to the Classification
Problem
S. Caporaso, E. Covino, G. Pani
Journal of Functional Programming, 11(1):95-116,
January 2001.
Bayesian Cognitive Diagnosis in Believable
Multiagent Systems
F. de Rosis, E. Covino, R.
Falcone, C. Castelfranchi
International Belief Revision NMR7 Workshop, Trento,
Italy.
Also in "Frontiers of Belief Revision", M.A.
Williams, H. Rott (eds.),
Kluwerg
Academic Press, June 2001.
Recursive programming languages for complexity classes
E. Covino e G. Pani
16th Annual IEEE Symposium on Logic In Computer
Science (LICS 2001), June 16-19, 2001, Boston.
An implicit recursive language for the polynomial
time-space complexity classes
E. Covino e G. Pani
Journal of Universal Computer Science, vol. 8, no. 1
(2002).
Time-space computational complexity of imperative
programming languages
E. Covino e G. Pani
17th Annual IEEE Symposium on Logic In Computer
Science (LICS 2002), July 22-25, 2002, Copenhagen.
Space complexity analysis for stack programs
E. Covino e G. Pani
Fifth International Workshop in Implicit Computational
Complexity (ICC'03), Ottawa.
A refinement of the sigma-measure for stack programs
E. Covino e G. Pani
Electronic Notes in Theoretical Computer Science 90(1)
37-44 (2003).
A visual tool for multidimensional data analysis
P. Buono, M. F. Costabile, E. Covino, G. Pani
7th international conference on distributed multimedia
systems, Banff (2005).
Implicit computational complexity and the exponential
time-space classes
S. Caporaso, E. Covino, P. Gissi, G. Pani,
6th WSEAS international conference on
telecommunications and informatics (TELE-INFO 2007),
March 22-24, 2007, Dallas, pag
65-70. ISNN: 1790-5117. ISBN: 978-960-8457-60-7.
A hierarchy of imperative languages for the feasible
classes DTIMEF(n^k) and for the k-superexponential
classes(k_n)
S. Caporaso, E. Covino, V. Cozza, P. Gissi, G. Pani,
6th WSEAS 2007 International Conference on Applied
Computer Science (ACOS '07),
April 15-17, Hangzhou. ISSN: 1790-5117. ISBN:
978-960-8457-66-9
Compile-time Computation of Polytime Functions,
E. Covino, G. Pani and D. Scrimieri,
Journal of Universal Computer Science, vol. 13, no. 4
(2007), 468-478
Static computation of polynomial-time functions in C++
E. Covino, G. Pani, and D. Scrimieri,
2007 International Conference on Foundations of
Computer Science
(FCS '07, Hamid R. Arabnia
and P. L. Zhou, Eds.),
June 25-28, Las Vegas.
Predicative Recursion, Ramified Diagonalization and
the Elementary Functions
Salvatore Caporaso, Emanuele
Covino, Vittoria Cozza, Giovanni Pani,
Eustrat Zhupa,
WSEAS transactions on Mathematics, vol. 6, issue 9, pag. 824, September 2007. ISSN 1109-2769
Complexity certification of C++ template
metaprogramming
Emanuele Covino and Giovanni Pani
Ninth symposium on Trends in Functional Programming
(TFP '08, Peter Achten, Pieter Koopman and Marco T. Morazan, eds.)
May 26 - 28, Heijen, The
Netherlands
TR: ICIS - R08007, May, Radboud University Nijmegen,
2008.
Extending C++ static computation of polynomial-time
algorithms
E. Covino, G. Pani, D. Scrimieri
2008 International Conference on Foundations of
Computer Science
(FCS '08, Hamid R. Arabnia
and P. L. Zhou, Eds.),
July 14-17, Las Vegas.
Complexity certification of C++ templates
E. Covino and G. Pani,
Proc. of Informatics 2008, IADIS International
Conference on computer science and information systems.
Amsterdam, The Nederlands,
July 25-27, 2008.
ISBN: 978-972-8924-63-8.
Complexity certification of
C++ template metaprogramming (extended version),
E. Covino, G. Pani,
Trends in functional
programming, volume 9 (Peter Achten, Pieter Koopman,
Marco Morazan, eds.), 2009. ISBN 9781841502779.
Template Metaprogramming,
Partial Evaluation and Computational Complexity Classes,
E. Covino, G. Pani,
2010 International Conference
on Foundations of Computer Science (FCS '10, Hamid R. Arabnia,
George A. Gravvanis, Ashu M. G. Solo Eds.), July
12-15, Las Vegas. ISBN 1-60132-142-2.
Bluetooth and filesystem to
manage a ubiquitous mesh network,
N. Corriero, E. Covino, G. Pani,, E. Zhupa,
The Fourth International
Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies,
(UBICOMM 2010), October 25 - 30, 2010 - Florence, Italy. ISBN
978-1-61208-000-0. ----- scopus 2-s2.0-84881601351
HSFS: a compress filesystem
for metadata files,
N. Corriero, E. Covino, G. D'amore and G. Pani,
The International Conference
on Digital Information Processing and Communications (ICDIPC 2011), July, 7-9,
2011, Ostrava, Czech Republic. Communications
in Computer and Information Science (CCIS), Springer LNCS, pag
289-300. CCIS 189, ISBN 978-3-642-22409-6. http://www.sdiwc.net/public/cz/public/index.php,
An approach to use FB-AODV
with Android,
N. Corriero, E. Covino, A. Mottola,
the 2nd International
Conference on Ambient Systems, Networks and Technologies (ANT 2011), (336-343),
September 19-21, 2011, Niagara Falls, Ontario, Canada. ISBN: 9781627488075 ----- scopus
2-s2.0-84856474540
A Tool for the Evaluation of
the Complexity of Programs Using C++ Templates,
N. Corriero, E. Covino
and G. Pani,
The Second International
Conference on Computational Logics, Algebras, Programming, Tools, and
Benchmarking, (COMPUTATION TOOLS 2011), September 25-30, 2011 - Rome, Italy.
ISBN: 978-1-61208-159-5
A Formal Approach for Modeling
Interactive Visual Interfaces,
E. Covino and G. Pani,
the 6th International Conference on Frontier
of Computer Science and Technology (FCST-11),
(1675-1683), November 16-18, 2011, Changsha, China. ISBN 978-1-4577-2135-9 ---- scopus
2-s2.0-84856182154
A Compress Filesystem to
Improve the Files Contents Search,
N. Corriero, E. Covino, G. Pani,
International Journal of
Digital Information and Wireless Communications (IJDIWC) 1(2): 611-619, The Society
of Digital Information and Wireless Communications, 2011. ISSN: 2225-658X
A Specialized Recursive
Language for Capturing Time-Space Complexity Classes, (best paper award)
E. Covino, G. Pani,
The Sixth International Conference
on Computational Logics, Algebras, Programming, Tools, and Benchmarking,
(COMPUTATION TOOLS 2015), March 22 - 27, 2015 - Nice, France. ISBN:
978-1-61208-394-0. ISSN: 2308-4170
Predicative Recursion,
Diagonalization, and Slow-growing Hierarchies of Time-bounded Programs,
E. Covino and G. Pani,
International Journal On
Advances in Intelligent Systems, vol 8 nr 3 and 4, December 2015.
A Slow-growing Hierarchy of
Time-bounded Programs,
Emanuele
Covino and Giovanni Pani,
Advances in Intelligent Systems:
Reviews' Book Series, Vol. 1, IFSA Publishing, Barcelona, Spain, 2017, pag. 151-171. ISBN:
978-84-697-8924-7.
Diagonalization and the
complexity of programs,
Emanuele Covino and Giovanni Pani, ,
The Ninth International
Conference on Computational Logics, Algebras, Programming, Tools, and
Benchmarking, (COMPUTATION TOOLS 2018), February 18 - 22, 2018 – Barcelona,
Spain. ISBN: 978-1-61208-394-0. ISSN: 2308-4170
Diagonalization and Elementary
Complexity,
Emanuele Covino and Giovanni Pani,
the 14th International Conference on
Foundations of Computer Science (FCS'18), July 30 - August 2, 2018, Las Vegas,
USA. ISBN: 1-60132-476-6.
On the Complexity of Programs with Nested Loops,
Emanuele Covino and Giovanni Pani,
The 15th International Conference on Foundations of
Computer Science (FCS'19), July 29 - August 1, 2019, Las Vegas, USA.
Editors: Hamid R. Arabnia, Fernando G.
Tinetti. ISBN: 1-60132-497-9
C++ Template Metaprogramming and Polynomial-Time
Functions,
Emanuele Covino and
Giovanni Pani,
Advances in Computers and Software Engineering:
Reviews, Book Series, Vol. 2., IFSA Publishing, Barcelona, Spain, 2020, pag. 13-34. ISBN: 978-84-09-17945-9.
A Tool for the Analysis of MANET Routing Protocols
based on Abstract State Machines,
A. Bianchi, E. Covino, G.
Pani, S. Pizzutilo,
The 19th International Conference on Wireless networks
(ICWN 2020), July 27-30, 2020, Las Vegas, USA. ISBN # 1-60132-512-6.
A
Java Application for Modeling and Simulating Mobile Ad-hoc NETworks,
E.
Covino and G.Pani, Advances in Intelligent Systems:
Reviews, Book Series, Vol. 2, IFSA Publishing, Barcelona, Spain, 2021, pag. 131-148. ISBN: 978-84-09-29876-1.
A
Tool for the Analysis of MANET Routing Protocols based on Abstract State Machines
(book version),
A. Bianchi, E. Covino, G. Pani, S. Pizzutilo,
Advances
in Security, Networks, and Internet of Things, K. Daimi,
H.R. Arabnia, L. Deligiannidis,
M.-S. Hwang, F.G. Tinetti, (Eds.), May 2021, Springer, ISBN 978-3-030-71016-3. https://doi.org/10.1007/978-3-030-71017-0
Analysis of Mobile Networks’ Protocols Based on
Abstract State Machines,
E. Covino, G. Pani,
Boerger Festschrift, A. Raschke et
al. (Eds.), LNCS 12750, pp. 187-198, 2021.
https://doi.org/10.1007/978-3-030-76020-5_11
Analysis of a Formal Model for Social Groups,
E. Covino and G. Pani,
ICOMP'22 - The 23rd Int'l Conf on Internet Computing and
Internet of Things, July 25th-28th, 2022, Las Vegas, USA
Unpublished
Sulla
complessità computazionale delle condizioni sintattiche di Hilbert
E. Covino, Laurea
degree in Scienze dell’Informazione, University of Bari, 1994.
A syntactical characterization of the polynomial time
computable functions
E. Covino, University of Bari, 1995.
The
documents distributed by this server have been provided by the contributing
authors
as a means to ensure
timely dissemination of scholarly and technical work on a noncommercial basis.
Copyright and all
rights therein are maintained by the authors or by other copyright holders,
notwithstanding that they
have offered their works here electronically. It is understood that all
persons copying this
information will adhere to the terms and constraints invoked by each author's
copyright. These works
may not be reposted without the explicit permission of the copyright holder.
Please contact me for
the complete versions of the papers.