Salvatore Cristofaro

Orcid: 0000-0001-7188-389X

According to our database1, Salvatore Cristofaro authored at least 18 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Bellini Digital Correspondence: A Model for Making Collaborative Digital Scholarly Editions.
Proceedings of the 7th IEEE Congress on Information Science and Technology, 2023

2021
An ontology proposal for a corpus of letters of Vincenzo Bellini: formal properties of physical structure and the case of rotated texts.
Int. J. Metadata Semant. Ontologies, 2021

Towards the Representation of Claims in Ontologies for the Digital Humanities.
Proceedings of the International Joint Workshop on Semantic Web and Ontology Design for Cultural Heritage co-located with the Bolzano Summer of Knowledge 2021 (BOSK 2021), 2021

2020
OntoBelliniLetters: A Formal Ontology for a Corpus of Letters of Vincenzo Bellini.
Proceedings of the Metadata and Semantic Research - 14th International Conference, 2020

2019
OntoBellini: Towards an RDA Based Ontology for Vincenzo Bellini's Cultural Heritage.
Proceedings of the Joint Ontology Workshops 2019 Episode V: The Styrian Autumn of Ontology, 2019

2016
A Variant of Turing Machines with no Control States and its Connection to Bounded Temporal Memory.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

2015
Computing Efficiently the Closeness of Word Sets in Natural Language Texts.
Int. J. Comput. Linguistics Appl., 2015

2013
Efficient string-matching allowing for non-overlapping inversions.
Theor. Comput. Sci., 2013

2011
Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010
A Space-Efficient Implementation of the Good-Suffix Heuristic.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

2009
New Efficient Bit-Parallel Algorithms for the (delta, alpha)-Matching Problem with Applications in Music Information Retrieval.
Int. J. Found. Comput. Sci., 2009

2008
On Some Combinatorial Problems Concerning the Harmonic Structure of Musical Chord Sequences.
Int. J. Found. Comput. Sci., 2008

New Efficient Bit-Parallel Algorithms for the delta-Matching Problem with alpha-Bounded Gaps in Musical Sequences.
Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Finite State Models for the Generation of Large Corpora of Natural Language Texts.
Proceedings of the Finite-State Methods and Natural Language Processing, 2008

2005
An Efficient Algorithm for alpha-Approximate Matching with <i>delta</i>-Bounded Gaps in Musical Sequences.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Solving the (\delta, \alpha)-Approximate Matching Problem Under Transposition Invariance in Musical Sequences.
Proceedings of the ISMIR 2005, 2005

On Tuning the (\delta, \alpha)-Sequential-Sampling Algorithm for \delta-Approximate Matching with Alpha-Bounded Gaps in Musical Sequences.
Proceedings of the ISMIR 2005, 2005

2004
Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences.
Proceedings of the Prague Stringology Conference 2004, Prague, Czech Republic, August 30, 2004


  Loading...