default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmanuele Giaquinta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j17]Sukhpal Singh Ghuman, Emanuele Giaquinta, Jorma Tarhio
:
Lyndon Factorization Algorithms for Small Alphabets and Run-Length Encoded Strings. Algorithms 12(6): 124 (2019)- [j16]Georgios Zacharopoulos, Lorenzo Ferretti, Emanuele Giaquinta, Giovanni Ansaloni, Laura Pozzi:
RegionSeeker: Automatically Identifying and Selecting Accelerators From Application Source Code. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 38(4): 741-754 (2019) - 2017
- [j15]Jorma Tarhio, Jan Holub, Emanuele Giaquinta:
Technology beats algorithms (in exact string matching). Softw. Pract. Exp. 47(12): 1877-1885 (2017) - 2016
- [i10]Jorma Tarhio, Jan Holub, Emanuele Giaquinta:
Technology Beats Algorithms (in Exact String Matching). CoRR abs/1612.01506 (2016) - 2015
- [j14]Tomás Flouri, Emanuele Giaquinta, Kassian Kobert, Esko Ukkonen:
Longest common substrings with k mismatches. Inf. Process. Lett. 115(6-8): 643-647 (2015) - [j13]Emanuele Giaquinta, Anadi Mishra, Laura Pozzi:
Maximum Convex Subgraphs Under I/O Constraint for Automatic Identification of Custom Instructions. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 34(3): 483-494 (2015) - [c11]Tamanna Chhabra, Emanuele Giaquinta, Jorma Tarhio:
Filtration Algorithms for Approximate Order-Preserving Matching. SPIRE 2015: 177-187 - [c10]Emanuele Giaquinta:
Run-Length Encoded Nondeterministic KMP and Suffix Automata. CIAA 2015: 102-113 - 2014
- [j12]Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Text searching allowing for inversions and translocations of factors. Discret. Appl. Math. 163: 247-257 (2014) - [j11]Kimmo Fredriksson, Emanuele Giaquinta:
On a compact encoding of the swap automaton. Inf. Process. Lett. 114(7): 392-396 (2014) - [j10]Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen:
Motif matching using gapped patterns. Theor. Comput. Sci. 548: 1-13 (2014) - [c9]Sukhpal Singh Ghuman, Emanuele Giaquinta, Jorma Tarhio:
Alternative Algorithms for Lyndon Factorization. Stringology 2014: 169-178 - [i9]Sukhpal Singh Ghuman, Emanuele Giaquinta, Jorma Tarhio:
Alternative Algorithms for Lyndon Factorization. CoRR abs/1405.4892 (2014) - [i8]Tomás Flouri, Emanuele Giaquinta, Kassian Kobert, Esko Ukkonen:
Longest common substrings with k mismatches. CoRR abs/1409.1694 (2014) - [i7]Emanuele Giaquinta:
Run-Length Encoded Nondeterministic KMP and Suffix Automata. CoRR abs/1412.3688 (2014) - 2013
- [j9]Emanuele Giaquinta, Szymon Grabowski:
New algorithms for binary jumbled pattern matching. Inf. Process. Lett. 113(14-16): 538-542 (2013) - [j8]Emanuele Giaquinta, Szymon Grabowski, Kimmo Fredriksson:
Approximate pattern matching with k-mismatches in packed text. Inf. Process. Lett. 113(19-21): 693-697 (2013) - [j7]Emanuele Giaquinta, Laura Pozzi:
An Effective Exact Algorithm and a New Upper Bound for the Number of Contacts in the Hydrophobic-Polar Two-Dimensional Lattice Model. J. Comput. Biol. 20(8): 593-609 (2013) - [j6]Emanuele Giaquinta, Szymon Grabowski, Esko Ukkonen:
Fast Matching of Transcription Factor Motifs Using Generalized Position Weight Matrix Models. J. Comput. Biol. 20(9): 621-630 (2013) - [c8]Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Esko Ukkonen:
Motif Matching Using Gapped Patterns. IWOCA 2013: 448-452 - [c7]Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu:
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. SPIRE 2013: 56-63 - [i6]Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu:
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. CoRR abs/1304.5560 (2013) - [i5]Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen:
Motif matching using gapped patterns. CoRR abs/1306.2483 (2013) - [i4]Kimmo Fredriksson, Emanuele Giaquinta:
On a compact encoding of the swap automaton. CoRR abs/1307.0099 (2013) - 2012
- [j5]Domenico Cantone, Simone Faro, Emanuele Giaquinta:
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach. Inf. Comput. 213: 3-12 (2012) - [j4]Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Pattern Matching with Swaps in Practice. Int. J. Found. Comput. Sci. 23(2): 323-342 (2012) - [j3]Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Adapting Boyer-Moore-like Algorithms for Searching Huffman Encoded Texts. Int. J. Found. Comput. Sci. 23(2): 343-356 (2012) - [j2]Domenico Cantone, Simone Faro, Emanuele Giaquinta:
On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns. J. Discrete Algorithms 11: 25-36 (2012) - [i3]Emanuele Giaquinta, Szymon Grabowski:
New algorithms for binary jumbled pattern matching. CoRR abs/1210.6176 (2012) - [i2]Emanuele Giaquinta, Szymon Grabowski, Kimmo Fredriksson:
Approximate pattern matching with k-mismatches in packed text. CoRR abs/1211.5433 (2012) - 2011
- [j1]Szymon Grabowski, Simone Faro, Emanuele Giaquinta:
String matching with inversions and translocations in linear average time (most of the time). Inf. Process. Lett. 111(11): 516-520 (2011) - 2010
- [c6]Domenico Cantone, Simone Faro, Emanuele Giaquinta:
A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach. CPM 2010: 288-298 - [c5]Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Bit-(Parallelism)2: Getting to the Next Level of Parallelism. FUN 2010: 166-177 - [c4]Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Approximate String Matching Allowing for Inversions and Translocations. Stringology 2010: 37-51 - [i1]Szymon Grabowski, Simone Faro, Emanuele Giaquinta:
String Matching with Inversions and Translocations in Linear Average Time (Most of the Time). CoRR abs/1012.0280 (2010)
2000 – 2009
- 2009
- [c3]Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts. Stringology 2009: 29-39 - [c2]Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta:
An Efficient Algorithm for Approximate Pattern Matching with Swaps. Stringology 2009: 90-104 - 2008
- [c1]Domenico Cantone, Salvatore Cristofaro, Simone Faro, Emanuele Giaquinta:
Finite State Models for the Generation of Large Corpora of Natural Language Texts. FSMNLP 2008: 175-182
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-05-02 20:59 CEST 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:
