Stefano Bilotta
According to our database^{1},
Stefano Bilotta
authored at least 21 papers
between 2011 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at orcid.org
On csauthors.net:
Bibliography
2019
Recurrence relations, succession rules and the positivity problem.
J. Comput. Syst. Sci., 2019
2018
A 2D nonoverlapping code over a qary alphabet.
Cryptography and Communications, 2018
WiP: Traffic Flow Reconstruction from Scattered Data.
Proceedings of the 2018 IEEE International Conference on Smart Computing, 2018
RealTime Traffic Estimation of Unmonitored Roads.
Proceedings of the 2018 IEEE 16th Intl Conf on Dependable, 2018
Knowledge Modeling and Management for Mobility and Transport Applications.
Proceedings of the 4th IEEE International Conference on Collaboration and Internet Computing, 2018
2017
VariableLength NonOverlapping Codes.
IEEE Trans. Information Theory, 2017
Crossbifixfree sets in two dimensions.
Theor. Comput. Sci., 2017
Nonoverlapping matrices.
Theor. Comput. Sci., 2017
A Gray code for crossbifixfree sets.
Mathematical Structures in Computer Science, 2017
Pattern Avoiding Languages and Recurrence Relations Interpretation.
Fundam. Inform., 2017
2016
Crossbifixfree sets generation via Motzkin paths.
RAIRO  Theor. Inf. and Applic., 2016
2015
Gray code orders for qary words avoiding a given factor.
Acta Inf., 2015
Recurrence Relations, Succession Rules, and the Positivity Problem.
Proceedings of the Language and Automata Theory and Applications, 2015
2014
Prefix partitioned gray codes for particular crossbifixfree sets.
Cryptography and Communications, 2014
Discrete Tomography Reconstruction Algorithms for Images with a Blocking Component.
Proceedings of the Discrete Geometry for Computer Imagery, 2014
2013
Catalan structures and Catalan pairs.
Theor. Comput. Sci., 2013
Polygons Drawn from Permutations.
Fundam. Inform., 2013
Avoiding crossbifixfree binary words.
Acta Inf., 2013
2012
A New Approach to CrossBifixFree Sets.
IEEE Trans. Information Theory, 2012
Pattern 1^{j+1}0^{j} Avoiding Binary Words.
Fundam. Inform., 2012
2011
Pattern 1^j0^i avoiding binary words
Proceedings of the Proceedings 8th International Conference Words 2011, 2011