default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArianna Pavone
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Arianna Pavone
, Caterina Viola:
The Quantum Cyclic Rotation Gate. SN Comput. Sci. 5(7): 830 (2024)- [c18]Matteo Tolloso, Silvia Giulia Galfrè, Arianna Pavone, Marco Podda, Alina Sîrbu, Corrado Priami:
How Much Do DNA and Protein Deep Embeddings Preserve Biological Information? CMSB 2024: 209-225 - [c17]Simone Faro, Francesco Pio Marino, Antonino Andrea Moschetto, Arianna Pavone, Antonio Scardace:
The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples. FUN 2024: 13:1-13:17 - [c16]Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola:
Quantum Circuit Based Longest Common Substring. ICTCS 2024: 1-15 - [c15]Simone Faro, Arianna Pavone, Caterina Viola:
Families of Constant-Depth Quantum Circuits for Rotations and Permutations. ICTCS 2024: 29-41 - [c14]Simone Faro, Thierry Lecroq, Francesco Pio Marino, Arianna Pavone, Stefano Scafiti:
Improving Sampled Matching through Character Context Sampling. ICTCS 2024: 300-312 - [c13]Simone Faro, Arianna Pavone, Caterina Viola:
Quantum Path Parallelism: A Circuit-Based Approach to Text Searching. TAMC 2024: 247-259 - [e1]Arianna Pavone, Caterina Viola:
Proceedings of the 2024 Workshop on Quantum Search and Information Retrieval, QUASAR 2024, Pisa, Italy, 3 June 2024. ACM 2024, ISBN 979-8-4007-0646-2 [contents] - 2023
- [j6]Simone Faro, Francesco Pio Marino, Arianna Pavone:
Improved characters distance sampling for online and offline text searching. Theor. Comput. Sci. 946: 113684 (2023) - [c12]Arianna Pavone, Caterina Viola:
The Quantum Cyclic Rotation Gate. ICTCS 2023: 206-218 - [c11]Domenico Cantone, Simone Faro, Arianna Pavone:
Quantum String Matching Unfolded and Extended. RC 2023: 117-133 - [i8]Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola:
Quantum Circuits for Fixed Substring Matching Problems. CoRR abs/2308.11758 (2023) - [i7]Domenico Cantone, Simone Faro, Arianna Pavone, Caterina Viola:
Longest Common Substring and Longest Palindromic Substring in Õ(√n) Time. CoRR abs/2309.01250 (2023) - 2022
- [j5]Arianna Pavone, Alessio Plebe:
Resolving Linguistic Ambiguities by Visual Context. SN Comput. Sci. 3(5): 413 (2022) - 2021
- [j4]Arianna Pavone, Alessio Plebe:
How Neurons in Deep Models Relate with Neurons in the Brain. Algorithms 14(9): 272 (2021) - [c10]Simone Faro, Francesco Pio Marino, Arianna Pavone:
Enhancing Characters Distance Text Sampling by Condensed Alphabets. ICTCS 2021: 1-15 - [c9]Arianna Pavone, Alessio Plebe:
Revising Conceptual Similarity by Neural Networks. IJCCI 2021: 236-245 - [c8]Simone Faro, Francesco Pio Marino, Arianna Pavone, Antonio Scardace:
Towards an Efficient Text Sampling Approach for Exact and Approximate Matching. Stringology 2021: 75-89 - [i6]Domenico Cantone, Simone Faro, Arianna Pavone:
Text Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations. CoRR abs/2101.00718 (2021) - 2020
- [j3]Simone Faro, Francesco Pio Marino, Arianna Pavone:
Efficient Online String Matching Based on Characters Distance Text Sampling. Algorithmica 82(11): 3390-3412 (2020) - [c7]Alessio Plebe, Arianna Pavone:
Neural Semantic Pointers in Context. IJCCI 2020: 447-454 - [c6]Domenico Cantone, Simone Faro, Arianna Pavone:
Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations. WABI 2020: 19:1-19:14
2010 – 2019
- 2019
- [j2]Domenico Cantone, Simone Faro, Arianna Pavone:
Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition. ACM J. Exp. Algorithmics 24(1): 1.8:1-1.8:20 (2019) - [c5]Simone Faro, Arianna Pavone:
Alignment of Sequences Allowing for Non-overlapping Unbalanced Translocations of Adjacent Factors. IWBBIO (1) 2019: 120-131 - [c4]Simone Faro, Arianna Pavone:
Flexible and Efficient Algorithms for Abelian Matching in Genome Sequence. IWBBIO (1) 2019: 307-318 - [i5]Simone Faro, Arianna Pavone, Francesco Pio Marino:
Efficient Online String Matching Based on Characters Distance Text Sampling. CoRR abs/1908.05930 (2019) - 2018
- [j1]Simone Faro, Arianna Pavone:
An Efficient Skip-Search Approach to Swap Matching. Comput. J. 61(9): 1351-1360 (2018) - [i4]Simone Faro, Arianna Pavone:
Flexible and Efficient Algorithms for Abelian Matching in Strings. CoRR abs/1803.02807 (2018) - [i3]Domenico Cantone, Simone Faro, Arianna Pavone:
Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations. CoRR abs/1812.00421 (2018) - 2017
- [c3]Domenico Cantone, Simone Faro, Arianna Pavone:
Speeding Up String Matching by Weak Factor Recognition. Stringology 2017: 42-50 - [i2]Domenico Cantone, Simone Faro, Arianna Pavone:
Speeding Up String Matching by Weak Factor Recognition. CoRR abs/1707.00469 (2017) - 2015
- [c2]Simone Faro, Arianna Pavone:
Refined Tagging of Complex Verbal Phrases for the Italian Language. Stringology 2015: 132-145 - [i1]Valeria Borzì, Simone Faro, Arianna Pavone, Sabrina Sansone:
Prior Polarity Lexical Resources for the Italian Language. CoRR abs/1507.00133 (2015) - 2014
- [c1]Valeria Borzì, Simone Faro, Arianna Pavone:
Automatic Extraction of Semantic Relations by Using Web Statistical Information. ICCS 2014: 174-187
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
