16 citations · 56 across the 25 of their papers we have counts for
26 papers
Longest Common Substring and Longest Palindromic Substring in Time
Domenico Cantone, Simone Faro, Arianna Pavone +1
The Longest Common Substring (LCS) and Longest Palindromic Substring (LPS) are classical problems in computer science, representing fundamental challenges in string processing. Bot…
Quantum Circuits for Fixed Substring Matching Problems
Domenico Cantone, Simone Faro, Arianna Pavone +1
Quantum computation represents a computational paradigm whose distinctive attributes confer the ability to devise algorithms with asymptotic performance levels significantly superi…
The Ontology for Agents, Systems and Integration of Services: OASIS version 2
Giampaolo Bella, Domenico Cantone, Carmelo Fabio Longo +2
Semantic representation is a key enabler for several application domains, and the multi-agent systems realm makes no exception. Among the methods for semantically representing agen…
The Many Qualities of a New Directly Accessible Compression Scheme
Domenico Cantone, Simone Faro
We present a new variable-length computation-friendly encoding scheme, named SFDC (Succinct Format with Direct aCcesibility), that supports direct and fast accessibility to any ele…
Blockchains through ontologies: the case study of the Ethereum ERC721 standard in OASIS (Extended Version)
Giampaolo Bella, Domenico Cantone, Cristiano Longo +2
Blockchains are gaining momentum due to the interest of industries and people in \emph{decentralized applications} (Dapps), particularly in those for trading assets through digital…
Resolutions of Convex Geometries
Domenico Cantone, Jean-Paul Doignon, Alfio Giarlotta +1
Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to union-closed antimatroids or learning spaces. We define an operation of resolution for con…