default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlessio Langiu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c7]Laura La Gattuta, Alessio Langiu, Luca Sabatucci, Vincenzo Suraci, Mario Sprovieri:
Affordable Remote Terminal for Sensor Observation Service. ICAART (1) 2020: 272-278
2010 – 2019
- 2018
- [j11]Salvatore Aronica, Alessio Langiu
, Francesca Marzi, Salvatore Mazzola, Filippo Mignosi:
On optimal parsing for LZ78-like compressors. Theor. Comput. Sci. 710: 19-28 (2018) - 2017
- [j10]Costas S. Iliopoulos, Alessio Langiu:
Foreword. Math. Comput. Sci. 11(2): 111-112 (2017) - [j9]Maxime Crochemore, Costas S. Iliopoulos, Alessio Langiu, Filippo Mignosi:
The longest common substring problem. Math. Struct. Comput. Sci. 27(2): 277-295 (2017) - 2016
- [j8]Ali Alatabbi, Costas S. Iliopoulos, Alessio Langiu, M. Sohel Rahman:
Algorithms for Longest Common Abelian Factors. Int. J. Found. Comput. Sci. 27(5): 529-544 (2016) - [j7]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Jarkko Peltomäki, Élise Prieur-Gaston:
Abelian powers and repetitions in Sturmian words. Theor. Comput. Sci. 635: 16-34 (2016) - [j6]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-preserving indexing. Theor. Comput. Sci. 638: 122-135 (2016) - 2015
- [j5]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
A note on the longest common compatible prefix problem for partial words. J. Discrete Algorithms 34: 49-53 (2015) - [c6]Salvatore Aronica, Alessio Langiu, Francesca Marzi, Salvatore Mazzola, Filippo Mignosi, Giulio Nazzicone:
Compressing Big Data: When the Rate of Convergence to the Entropy Matters. MACIS 2015: 285-289 - [i7]Ali Alatabbi, Costas S. Iliopoulos, Alessio Langiu, M. Sohel Rahman:
Algorithms for Longest Common Abelian Factors. CoRR abs/1503.00049 (2015) - [i6]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston:
Abelian Powers and Repetitions in Sturmian Words. CoRR abs/1506.02797 (2015) - 2014
- [j4]Maxime Crochemore, Alessio Langiu, Filippo Mignosi:
Note on the greedy parsing optimality for dictionary-based text compression. Theor. Comput. Sci. 525: 55-59 (2014) - [e1]Costas S. Iliopoulos, Alessio Langiu:
Proceedings of the 2nd International Conference on Algorithms for Big Data , Palermo, Italy, April 07-09, 2014. CEUR Workshop Proceedings 1146, CEUR-WS.org 2014 [contents] - 2013
- [j3]Alessio Langiu:
On parsing optimality for dictionary-based text compression - the Zip case. J. Discrete Algorithms 20: 65-70 (2013) - [c5]Maxime Crochemore, Alessio Langiu, Filippo Mignosi:
The Rightmost Equal-Cost Position Problem. DCC 2013: 421-430 - [c4]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston:
Abelian Repetitions in Sturmian Words. Developments in Language Theory 2013: 227-238 - [c3]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE 2013: 84-95 - [i5]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-Preserving Suffix Trees and Their Algorithmic Applications. CoRR abs/1303.6872 (2013) - [i4]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
A Note on the Longest Common Compatible Prefix Problem for Partial Words. CoRR abs/1312.2381 (2013) - 2012
- [b1]Alessio Langiu:
Optimal Parsing for dictionary text compression. (Parsing optimal pour la compression du texte par dictionnaire). University of Paris-Est, France, 2012 - [j2]Maxime Crochemore, Laura Giambruno, Alessio Langiu:
On-Line Construction of a Small Automaton for a Finite Set of Words. Int. J. Found. Comput. Sci. 23(2): 281-301 (2012) - [j1]Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo:
Dictionary-symbolwise flexible parsing. J. Discrete Algorithms 14: 74-90 (2012) - [i3]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston:
Abelian Repetitions in Sturmian Words. CoRR abs/1209.6013 (2012) - [i2]Maxime Crochemore, Alessio Langiu, Filippo Mignosi:
The Rightmost Equal-Cost Position Problem. CoRR abs/1211.5108 (2012) - [i1]Maxime Crochemore, Alessio Langiu, Filippo Mignosi:
Note on the Greedy Parsing Optimality for Dictionary-Based Text Compression. CoRR abs/1211.5350 (2012) - 2010
- [c2]Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo:
Dictionary-Symbolwise Flexible Parsing. IWOCA 2010: 390-403 - [c1]Salvatore Aronica, Francesco Benvegna, Massimo Cossentino, Salvatore Gaglio, Alessio Langiu, Carmelo Lodato, Salvatore Lopes, Umberto Maniscalco, Pierluca Sangiorgi:
An Agent-based System for Maritime Search and Rescue Operations. WOA 2010
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:
