Arianna Pavone

Orcid: 0000-0002-8840-6157

According to our database1, Arianna Pavone authored at least 23 papers between 2014 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
Improved characters distance sampling for online and offline text searching.
Theor. Comput. Sci., February, 2023

Longest Common Substring and Longest Palindromic Substring in Õ(√n) Time.
CoRR, 2023

Quantum Circuits for Fixed Substring Matching Problems.
CoRR, 2023

Quantum String Matching Unfolded and Extended.
Proceedings of the Reversible Computation - 15th International Conference, 2023

The Quantum Cyclic Rotation Gate.
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

2022
Resolving Linguistic Ambiguities by Visual Context.
SN Comput. Sci., 2022

2021
Text Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations.
CoRR, 2021

How Neurons in Deep Models Relate with Neurons in the Brain.
Algorithms, 2021

Towards an Efficient Text Sampling Approach for Exact and Approximate Matching.
Proceedings of the Prague Stringology Conference 2021, 2021

Revising Conceptual Similarity by Neural Networks.
Proceedings of the 13th International Joint Conference on Computational Intelligence, 2021

Enhancing Characters Distance Text Sampling by Condensed Alphabets.
Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

2020
Efficient Online String Matching Based on Characters Distance Text Sampling.
Algorithmica, 2020

Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations.
Proceedings of the 20th International Workshop on Algorithms in Bioinformatics, 2020

Neural Semantic Pointers in Context.
Proceedings of the 12th International Joint Conference on Computational Intelligence, 2020

2019
Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition.
ACM J. Exp. Algorithmics, 2019

Flexible and Efficient Algorithms for Abelian Matching in Genome Sequence.
Proceedings of the Bioinformatics and Biomedical Engineering, 2019

Alignment of Sequences Allowing for Non-overlapping Unbalanced Translocations of Adjacent Factors.
Proceedings of the Bioinformatics and Biomedical Engineering, 2019

2018
Flexible and Efficient Algorithms for Abelian Matching in Strings.
CoRR, 2018

An Efficient Skip-Search Approach to Swap Matching.
Comput. J., 2018

2017
Speeding Up String Matching by Weak Factor Recognition.
Proceedings of the Prague Stringology Conference 2017, 2017

2015
Prior Polarity Lexical Resources for the Italian Language.
CoRR, 2015

Refined Tagging of Complex Verbal Phrases for the Italian Language.
Proceedings of the Prague Stringology Conference 2015, 2015

2014
Automatic Extraction of Semantic Relations by Using Web Statistical Information.
Proceedings of the Graph-Based Representation and Reasoning, 2014


  Loading...