Luciano Margara

Orcid: 0000-0001-7816-1937

Affiliations:
  • University of Bologna, Italy


According to our database1, Luciano Margara authored at least 78 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An efficient algorithm deciding chaos for linear cellular automata over (Z/mZ)n with applications to data encryption.
Inf. Sci., February, 2024

A note on solving basic equations over the semiring of functional digraphs.
CoRR, 2024

On the Dynamical Behavior of Cellular Automata on Finite Groups.
IEEE Access, 2024

2023
A topology for P-systems with active membranes.
J. Membr. Comput., December, 2023

An algorithmic pipeline for solving equations over discrete dynamical systems modelling hypothesis on real phenomena.
J. Comput. Sci., January, 2023

A Heuristic for Direct Product Graph Decomposition.
J. Graph Algorithms Appl., 2023

An Easily Checkable Algebraic Characterization of Positive Expansivity for Additive Cellular Automata over a Finite Abelian Group.
CoRR, 2023

An Easy to Check Characterization of Positive Expansivity for Additive Cellular Automata Over a Finite Abelian Group.
IEEE Access, 2023

2022
A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum.
Discret. Math. Theor. Comput. Sci., 2022

Hard to Detect Factors of Univariate Integer Polynomials.
CoRR, 2022

2021
Direct product primality testing of graphs is GI-hard.
Theor. Comput. Sci., 2021

An efficiently computable characterization of stability and instability for linear cellular automata.
J. Comput. Syst. Sci., 2021

Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption.
Inf. Sci., 2021

2020
Dynamical behavior of additive cellular automata over finite abelian groups.
Theor. Comput. Sci., 2020

Chaos and ergodicity are decidable for linear cellular automata over (Z/mZ)n.
Inf. Sci., 2020

From Linear to Additive Cellular Automata.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
On the dynamical behaviour of linear higher-order cellular automata and its decidability.
Inf. Sci., 2019

Integrality of matrices, finiteness of matrix semigroups, and dynamics of linear cellular automata.
CoRR, 2019

Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Decidability of Sensitivity and Equicontinuity for Linear Higher-Order Cellular Automata.
Proceedings of the Language and Automata Theory and Applications, 2019

Solving Equations on Discrete Dynamical Systems.
Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2019

2015
GOTA: GO term annotation of biomedical literature.
BMC Bioinform., 2015

2014
Nondeterministic Cellular Automata.
Inf. Sci., 2014

2013
Periodic Orbits and Dynamical Complexity in Cellular Automata.
Fundam. Informaticae, 2013

2012
On the Undecidability of Attractor Properties for Cellular Automata.
Fundam. Informaticae, 2012

Strictly Temporally Periodic Points in Cellular Automata
Proceedings of the Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires, 2012

2011
Is There an Optimal Substitution Matrix for Contact Prediction with Correlated Mutations?
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Blurring contact maps of thousands of proteins: what we can learn by reconstructing 3D structure.
BioData Min., 2011

Divide and Conquer Strategies for Protein Structure Prediction.
Proceedings of the Mathematical Approaches to Polymer Sequence Analysis and Related Problems, 2011

2010
On the undecidability of the limit behavior of Cellular Automata.
Theor. Comput. Sci., 2010

Optimal global alignment of signals by maximization of Pearson correlation.
Inf. Process. Lett., 2010

Fast overlapping of protein contact maps by alignment of eigenvectors.
Bioinform., 2010

2009
On the directional dynamics of additive cellular automata.
Theor. Comput. Sci., 2009

A graph theoretic approach to protein structure selection.
Artif. Intell. Medicine, 2009

On the Reconstruction of Three-dimensional Protein Structures from Contact Maps.
Algorithms, 2009

On the Upper Bound of the Prediction Accuracy of Residue Contacts in Proteins with Correlated Mutations: The Case Study of the Similarity Matrices.
Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

Undecidable Properties of Limit Set Dynamics of Cellular Automata.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008
Reconstruction of 3D Structures From Protein Contact Maps.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008

Computational complexity of dynamical systems: The case of cellular automata.
Inf. Comput., 2008

FT-COMAR: fault tolerant three-dimensional structure reconstruction from protein contact maps.
Bioinform., 2008

Classification of directional dynamics for additive cellular automata.
Proceedings of the First Symposium on Cellular Automata "Journées Automates Cellulaires" (JAC 2008), 2008

A New Protein Representation Based on Fragment Contacts: Towards an Improvement of Contact Maps Predictions.
Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2008

2007
Row Subshifts and Topological Entropy of Cellular Automata.
J. Cell. Autom., 2007

Fault Tolerance for Large Scale Protein 3D Reconstruction from Contact Maps.
Proceedings of the Algorithms in Bioinformatics, 7th International Workshop, 2007

2004
Solution of some conjectures about topological properties of linear cellular automata.
Theor. Comput. Sci., 2004

Perfect Token Distribution on Trees.
Proceedings of the Structural Information and Communication Complexity, 2004

2003
On computing the entropy of cellular automata.
Theor. Comput. Sci., 2003

2002
Chaotic Subshifts and Related Languages Applications to one-dimensional Cellular Automata.
Fundam. Informaticae, 2002

2001
Inversion of circulant matrices over Z<sub>m</sub>.
Math. Comput., 2001

Decidable Properties of Graphs of All-Optical Networks.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Ergodicity, transitivity, and regularity for linear cellular automata over Z<sub>m</sub>.
Theor. Comput. Sci., 2000

Investigating topological chaos by elementary cellular automata dynamics.
Theor. Comput. Sci., 2000

Wavelength Assignment Problem on All-Optical Networks with <i>k</i> Fibres per Link.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm.
Theor. Comput. Sci., 1999

On the Dynamical Behavior of Chaotic Cellular Automata.
Theor. Comput. Sci., 1999

Parallel Complexity of Numerically Accurate Linear System Solvers.
SIAM J. Comput., 1999

Attractors of Linear Cellular Automata.
J. Comput. Syst. Sci., 1999

On Some Topological Properties of Linear Cellular Automata.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

1998
Generalized Sub-Shifts in Elementary Cellular Automata: The "Strange Case" of Chaotic Rule 180.
Theor. Comput. Sci., 1998

Expansivity, Permutivity, and Chaos for Cellular Automata.
Theory Comput. Syst., 1998

Invertible Linear Cellular Automata over Z<sub>m</sub>: Algorithmic and Dynamical Aspects.
J. Comput. Syst. Sci., 1998

Lyapunov Exponents versus Expansivity and Sensitivity in Cellular Automata.
J. Complex., 1998

Attractors of D-dimensional Linear Cellular Automata.
Proceedings of the STACS 98, 1998

Topological Definitions of Chaos Applied to Cellular Automata Dynamics.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
Additive One-Dimensional Cellular Automata are Chaotic According to Devaney's Definition of Chaos.
Theor. Comput. Sci., 1997

Transformations of the One-Dimensional Cellular Automata Rule Space.
Parallel Comput., 1997

On Ergodic Linear Cellular Automata over Z<sub>m</sub>.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

On the Parallel Complexity of Matrix Factorization Algorithms.
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

A Shift-Invariant Metric on S<sup>zz</sup> Inducing a Non-trivial Tolology.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Z<sub>m</sub>.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Topological Chaos for Elementary Cellular Automata.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996
Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP.
INFORMS J. Comput., 1996

Parallel Complexity of Householder QR Factorization.
Proceedings of the Algorithms, 1996

Lyapunov Exponents Vs Expansivity and Sensitivity in Cellular Automata.
Proceedings of the ACRI '96, 1996

Essential Transformations of the One Dimensional Cellular Automata Rule Space and Endomorphisms of Compact Abelian Groups.
Proceedings of the ACRI '96, 1996

1995
Algebraic Techniques in Communication Complexity.
Inf. Process. Lett., 1995

Cellular Automata and Nonperiodic Orbits.
Complex Syst., 1995

1993
Global Strategies for Augmenting the Efficiency of TSP Heuristics.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993


  Loading...