Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Roberto Grossi
@article{DBLP:journals/algorithmica/PunziCGR24,
author = {Giulia Punzi and
Alessio Conte and
Roberto Grossi and
Romeo Rizzi},
title = {Refined Bounds on the Number of Eulerian Tours in Undirected Graphs},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {194--217},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01162-8},
doi = {10.1007/S00453-023-01162-8},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/PunziCGR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/GuerriniCGLRT23,
author = {Veronica Guerrini and
Alessio Conte and
Roberto Grossi and
Gianni Liti and
Giovanna Rosone and
Lorenzo Tattini},
title = {phyBWT2: phylogeny reconstruction via eBWT positional clustering},
journal = {Algorithms Mol. Biol.},
volume = {18},
number = {1},
pages = {11},
year = {2023},
url = {https://doi.org/10.1186/s13015-023-00232-4},
doi = {10.1186/S13015-023-00232-4},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/almob/GuerriniCGLRT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChakrabortyGSS23,
author = {Sankardeep Chakraborty and
Roberto Grossi and
Kunihiko Sadakane and
Srinivasa Rao Satti},
title = {Succinct representation for (non)deterministic finite automata},
journal = {J. Comput. Syst. Sci.},
volume = {131},
pages = {1--12},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2022.07.002},
doi = {10.1016/J.JCSS.2022.07.002},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ChakrabortyGSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/EquiMTG23,
author = {Massimo Equi and
Veli M{\"{a}}kinen and
Alexandru I. Tomescu and
Roberto Grossi},
title = {On the Complexity of String Matching for Graphs},
journal = {{ACM} Trans. Algorithms},
volume = {19},
number = {3},
pages = {21:1--21:25},
year = {2023},
url = {https://doi.org/10.1145/3588334},
doi = {10.1145/3588334},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/EquiMTG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tkde/BernardiniCGGLPPPSS23,
author = {Giulia Bernardini and
Alessio Conte and
Garance Gourdel and
Roberto Grossi and
Grigorios Loukides and
Nadia Pisanti and
Solon P. Pissis and
Giulia Punzi and
Leen Stougie and
Michelle Sweering},
title = {Hide and Mine in Strings: Hardness, Algorithms, and Experiments},
journal = {{IEEE} Trans. Knowl. Data Eng.},
volume = {35},
number = {6},
pages = {5948--5963},
year = {2023},
url = {https://doi.org/10.1109/TKDE.2022.3158063},
doi = {10.1109/TKDE.2022.3158063},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tkde/BernardiniCGGLPPPSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ConteGPU23,
author = {Alessio Conte and
Roberto Grossi and
Giulia Punzi and
Takeaki Uno},
editor = {Satoru Iwata and
Naonori Kakimura},
title = {A Compact {DAG} for Storing and Searching Maximal Common Subsequences},
booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC}
2023, December 3-6, 2023, Kyoto, Japan},
series = {LIPIcs},
volume = {283},
pages = {21:1--21:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.21},
doi = {10.4230/LIPICS.ISAAC.2023.21},
timestamp = {Tue, 28 Nov 2023 13:12:50 +0100},
biburl = {https://dblp.org/rec/conf/isaac/ConteGPU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sdm/PunziCG023,
author = {Giulia Punzi and
Alessio Conte and
Roberto Grossi and
Andrea Marino},
editor = {Shashi Shekhar and
Zhi{-}Hua Zhou and
Yao{-}Yi Chiang and
Gregor Stiglic},
title = {An Efficient Algorithm for Assessing the Number of \emph{st}-Paths
in Large Graphs},
booktitle = {Proceedings of the 2023 {SIAM} International Conference on Data Mining,
{SDM} 2023, Minneapolis-St. Paul Twin Cities, MN, USA, April 27-29,
2023},
pages = {289--297},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977653.ch33},
doi = {10.1137/1.9781611977653.CH33},
timestamp = {Tue, 17 Oct 2023 16:39:08 +0200},
biburl = {https://dblp.org/rec/conf/sdm/PunziCG023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/ConteGR23,
author = {Alessio Conte and
Roberto Grossi and
Davide Rucci},
editor = {Franco Maria Nardini and
Nadia Pisanti and
Rossano Venturini},
title = {{CAGE:} Cache-Aware Graphlet Enumeration},
booktitle = {String Processing and Information Retrieval - 30th International Symposium,
{SPIRE} 2023, Pisa, Italy, September 26-28, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14240},
pages = {129--142},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43980-3\_11},
doi = {10.1007/978-3-031-43980-3\_11},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/ConteGR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/GrossiIJLSZ23,
author = {Roberto Grossi and
Costas S. Iliopoulos and
Jesper Jansson and
Zara Lim and
Wing{-}Kin Sung and
Wiktor Zuba},
editor = {Chun{-}Cheng Lin and
Bertrand M. T. Lin and
Giuseppe Liotta},
title = {Finding the Cyclic Covers of a String},
booktitle = {{WALCOM:} Algorithms and Computation - 17th International Conference
and Workshops, {WALCOM} 2023, Hsinchu, Taiwan, March 22-24, 2023,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13973},
pages = {139--150},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-27051-2\_13},
doi = {10.1007/978-3-031-27051-2\_13},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/GrossiIJLSZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-13695,
author = {Alessio Conte and
Roberto Grossi and
Giulia Punzi and
Takeaki Uno},
title = {A Compact {DAG} for Storing and Searching Maximal Common Subsequences},
journal = {CoRR},
volume = {abs/2307.13695},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.13695},
doi = {10.48550/ARXIV.2307.13695},
eprinttype = {arXiv},
eprint = {2307.13695},
timestamp = {Wed, 02 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-13695.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ConteGPU22,
author = {Alessio Conte and
Roberto Grossi and
Giulia Punzi and
Takeaki Uno},
title = {Enumeration of Maximal Common Subsequences Between Two Strings},
journal = {Algorithmica},
volume = {84},
number = {3},
pages = {757--783},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00898-5},
doi = {10.1007/S00453-021-00898-5},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ConteGPU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ConteGMUV22,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Takeaki Uno and
Luca Versari},
title = {Proximity Search for Maximal Subgraph Enumeration},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {5},
pages = {1580--1625},
year = {2022},
url = {https://doi.org/10.1137/20m1375048},
doi = {10.1137/20M1375048},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ConteGMUV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/0001CGGLPPS22,
author = {Giulia Bernardini and
Alessio Conte and
Est{\'{e}}ban Gabory and
Roberto Grossi and
Grigorios Loukides and
Solon P. Pissis and
Giulia Punzi and
Michelle Sweering},
editor = {Hideo Bannai and
Jan Holub},
title = {On Strings Having the Same Length- k Substrings},
booktitle = {33rd Annual Symposium on Combinatorial Pattern Matching, {CPM} 2022,
June 27-29, 2022, Prague, Czech Republic},
series = {LIPIcs},
volume = {223},
pages = {16:1--16:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.CPM.2022.16},
doi = {10.4230/LIPICS.CPM.2022.16},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/0001CGGLPPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/GuerriniCGLRT22,
author = {Veronica Guerrini and
Alessio Conte and
Roberto Grossi and
Gianni Liti and
Giovanna Rosone and
Lorenzo Tattini},
editor = {Christina Boucher and
Sven Rahmann},
title = {phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering},
booktitle = {22nd International Workshop on Algorithms in Bioinformatics, {WABI}
2022, September 5-7, 2022, Potsdam, Germany},
series = {LIPIcs},
volume = {242},
pages = {23:1--23:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.WABI.2022.23},
doi = {10.4230/LIPICS.WABI.2022.23},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wabi/GuerriniCGLRT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/datamine/BacciuCGLM21,
author = {Davide Bacciu and
Alessio Conte and
Roberto Grossi and
Francesco Landolfi and
Andrea Marino},
title = {K-plex cover pooling for graph neural networks},
journal = {Data Min. Knowl. Discov.},
volume = {35},
number = {5},
pages = {2200--2220},
year = {2021},
url = {https://doi.org/10.1007/s10618-021-00779-z},
doi = {10.1007/S10618-021-00779-Z},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/datamine/BacciuCGLM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tkdd/BernardiniCCGLP21,
author = {Giulia Bernardini and
Huiping Chen and
Alessio Conte and
Roberto Grossi and
Grigorios Loukides and
Nadia Pisanti and
Solon P. Pissis and
Giovanna Rosone and
Michelle Sweering},
title = {Combinatorial Algorithms for String Sanitization},
journal = {{ACM} Trans. Knowl. Discov. Data},
volume = {15},
number = {1},
pages = {8:1--8:34},
year = {2021},
url = {https://doi.org/10.1145/3418683},
doi = {10.1145/3418683},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tkdd/BernardiniCCGLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/ConteGLPPP21,
author = {Alessio Conte and
Roberto Grossi and
Grigorios Loukides and
Nadia Pisanti and
Solon P. Pissis and
Giulia Punzi},
editor = {Evripidis Bampis and
Aris Pagourtzis},
title = {Beyond the {BEST} Theorem: Fast Assessment of Eulerian Trails},
booktitle = {Fundamentals of Computation Theory - 23rd International Symposium,
{FCT} 2021, Athens, Greece, September 12-15, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12867},
pages = {162--175},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86593-1\_11},
doi = {10.1007/978-3-030-86593-1\_11},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/ConteGLPPP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/ChenCGLPS21,
author = {Huiping Chen and
Alessio Conte and
Roberto Grossi and
Grigorios Loukides and
Solon P. Pissis and
Michelle Sweering},
editor = {Feida Zhu and
Beng Chin Ooi and
Chunyan Miao},
title = {On Breaking Truss-Based Communities},
booktitle = {{KDD} '21: The 27th {ACM} {SIGKDD} Conference on Knowledge Discovery
and Data Mining, Virtual Event, Singapore, August 14-18, 2021},
pages = {117--126},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3447548.3467365},
doi = {10.1145/3447548.3467365},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/kdd/ChenCGLPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/ChakrabortyGSS21,
author = {Sankardeep Chakraborty and
Roberto Grossi and
Kunihiko Sadakane and
Srinivasa Rao Satti},
editor = {Alberto Leporati and
Carlos Mart{\'{\i}}n{-}Vide and
Dana Shapira and
Claudio Zandron},
title = {Succinct Representations for (Non)Deterministic Finite Automata},
booktitle = {Language and Automata Theory and Applications - 15th International
Conference, {LATA} 2021, Milan, Italy, March 1-5, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12638},
pages = {55--67},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-68195-1\_5},
doi = {10.1007/978-3-030-68195-1\_5},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lata/ChakrabortyGSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/access/ConteSGMV20,
author = {Alessio Conte and
Daniele De Sensi and
Roberto Grossi and
Andrea Marino and
Luca Versari},
title = {Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection
in Graphs},
journal = {{IEEE} Access},
volume = {8},
pages = {139096--139109},
year = {2020},
url = {https://doi.org/10.1109/ACCESS.2020.3011667},
doi = {10.1109/ACCESS.2020.3011667},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/access/ConteSGMV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/access/VersariCCG20,
author = {Luca Versari and
Iulia{-}Maria Comsa and
Alessio Conte and
Roberto Grossi},
title = {Zuckerli: {A} New Compressed Representation for Graphs},
journal = {{IEEE} Access},
volume = {8},
pages = {219233--219243},
year = {2020},
url = {https://doi.org/10.1109/ACCESS.2020.3040673},
doi = {10.1109/ACCESS.2020.3040673},
timestamp = {Mon, 04 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/access/VersariCCG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AcunaGILRSSS20,
author = {Vicente Acu{\~{n}}a and
Roberto Grossi and
Giuseppe Francesco Italiano and
Leandro Lima and
Romeo Rizzi and
Gustavo Sacomoto and
Marie{-}France Sagot and
Blerina Sinaimeri},
title = {On Bubble Generators in Directed Graphs},
journal = {Algorithmica},
volume = {82},
number = {4},
pages = {898--914},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00619-z},
doi = {10.1007/S00453-019-00619-Z},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AcunaGILRSSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ConteGMV20,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Luca Versari},
title = {Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration
in Graphs},
journal = {Algorithmica},
volume = {82},
number = {6},
pages = {1547--1573},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00656-8},
doi = {10.1007/S00453-019-00656-8},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ConteGMV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/AlzamelABGIPPR20,
author = {Mai Alzamel and
Lorraine A. K. Ayad and
Giulia Bernardini and
Roberto Grossi and
Costas S. Iliopoulos and
Nadia Pisanti and
Solon P. Pissis and
Giovanna Rosone},
title = {Comparing Degenerate Strings},
journal = {Fundam. Informaticae},
volume = {175},
number = {1-4},
pages = {41--58},
year = {2020},
url = {https://doi.org/10.3233/FI-2020-1947},
doi = {10.3233/FI-2020-1947},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fuin/AlzamelABGIPPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ConteGM20,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino},
title = {Large-scale clique cover of real-world networks},
journal = {Inf. Comput.},
volume = {270},
year = {2020},
url = {https://doi.org/10.1016/j.ic.2019.104464},
doi = {10.1016/J.IC.2019.104464},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/ConteGM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/PisantiCG20,
author = {Nadia Pisanti and
Charles J. Colbourn and
Roberto Grossi},
title = {Editorial: Special Issue on International Workshop on Combinatorial
Algorithms {(IWOCA} 2019)},
journal = {Theory Comput. Syst.},
volume = {64},
number = {7},
pages = {1155--1157},
year = {2020},
url = {https://doi.org/10.1007/s00224-020-10015-8},
doi = {10.1007/S00224-020-10015-8},
timestamp = {Tue, 17 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/PisantiCG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AyadBGIPPR20,
author = {Lorraine A. K. Ayad and
Giulia Bernardini and
Roberto Grossi and
Costas S. Iliopoulos and
Nadia Pisanti and
Solon P. Pissis and
Giovanna Rosone},
title = {Longest property-preserved common factor: {A} new string-processing
framework},
journal = {Theor. Comput. Sci.},
volume = {812},
pages = {244--251},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.02.012},
doi = {10.1016/J.TCS.2020.02.012},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AyadBGIPPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asunam/MoghtasediMNGM20,
author = {Shima Moghtasedi and
Cristina Ioana Muntean and
Franco Maria Nardini and
Roberto Grossi and
Andrea Marino},
editor = {Martin Atzm{\"{u}}ller and
Michele Coscia and
Rokia Missaoui},
title = {High-Quality Prediction of Tourist Movements using Temporal Trajectories
in Graphs},
booktitle = {{IEEE/ACM} International Conference on Advances in Social Networks
Analysis and Mining, {ASONAM} 2020, The Hague, Netherlands, December
7-10, 2020},
pages = {348--352},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/ASONAM49781.2020.9381450},
doi = {10.1109/ASONAM49781.2020.9381450},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/asunam/MoghtasediMNGM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/AlzamelCDGIKW20,
author = {Mai Alzamel and
Alessio Conte and
Shuhei Denzumi and
Roberto Grossi and
Costas S. Iliopoulos and
Kazuhiro Kurita and
Kunihiro Wasa},
editor = {Inge Li G{\o}rtz and
Oren Weimann},
title = {Finding the Anticover of a String},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching, {CPM} 2020,
June 17-19, 2020, Copenhagen, Denmark},
series = {LIPIcs},
volume = {161},
pages = {2:1--2:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CPM.2020.2},
doi = {10.4230/LIPICS.CPM.2020.2},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/AlzamelCDGIKW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdm/0001CGGLPPPSS20,
author = {Giulia Bernardini and
Alessio Conte and
Garance Gourdel and
Roberto Grossi and
Grigorios Loukides and
Nadia Pisanti and
Solon P. Pissis and
Giulia Punzi and
Leen Stougie and
Michelle Sweering},
editor = {Claudia Plant and
Haixun Wang and
Alfredo Cuzzocrea and
Carlo Zaniolo and
Xindong Wu},
title = {Hide and Mine in Strings: Hardness and Algorithms},
booktitle = {20th {IEEE} International Conference on Data Mining, {ICDM} 2020,
Sorrento, Italy, November 17-20, 2020},
pages = {924--929},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/ICDM50108.2020.00103},
doi = {10.1109/ICDM50108.2020.00103},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icdm/0001CGGLPPPSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/GrossiMM20,
author = {Roberto Grossi and
Andrea Marino and
Shima Moghtasedi},
editor = {Simone Faro and
Domenico Cantone},
title = {Finding Structurally and Temporally Similar Trajectories in Graphs},
booktitle = {18th International Symposium on Experimental Algorithms, {SEA} 2020,
June 16-18, 2020, Catania, Italy},
series = {LIPIcs},
volume = {160},
pages = {24:1--24:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.SEA.2020.24},
doi = {10.4230/LIPICS.SEA.2020.24},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/GrossiMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-01353,
author = {Luca Versari and
Iulia M. Comsa and
Alessio Conte and
Roberto Grossi},
title = {Zuckerli: {A} New Compressed Representation for Graphs},
journal = {CoRR},
volume = {abs/2009.01353},
year = {2020},
url = {https://arxiv.org/abs/2009.01353},
eprinttype = {arXiv},
eprint = {2009.01353},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-01353.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-00967,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Luca Versari},
title = {Efficient Estimation of Graph Trussness},
journal = {CoRR},
volume = {abs/2010.00967},
year = {2020},
url = {https://arxiv.org/abs/2010.00967},
eprinttype = {arXiv},
eprint = {2010.00967},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-00967.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ConteGMTV19,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Lorenzo Tattini and
Luca Versari},
title = {A fast discovery algorithm for large common connected induced subgraphs},
journal = {Discret. Appl. Math.},
volume = {268},
pages = {210--222},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.02.023},
doi = {10.1016/J.DAM.2019.02.023},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ConteGMTV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ConteGMV19,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Luca Versari},
title = {Listing Maximal Subgraphs Satisfying Strongly Accessible Properties},
journal = {{SIAM} J. Discret. Math.},
volume = {33},
number = {2},
pages = {587--613},
year = {2019},
url = {https://doi.org/10.1137/17M1152206},
doi = {10.1137/17M1152206},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ConteGMV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EquiGMT19,
author = {Massimo Equi and
Roberto Grossi and
Veli M{\"{a}}kinen and
Alexandru I. Tomescu},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {On the Complexity of String Matching for Graphs},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {55:1--55:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.55},
doi = {10.4230/LIPICS.ICALP.2019.55},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/EquiGMT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ConteGKMUW19,
author = {Alessio Conte and
Roberto Grossi and
Mamadou Moustapha Kant{\'{e}} and
Andrea Marino and
Takeaki Uno and
Kunihiro Wasa},
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner
Trees in Graphs},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
pages = {73:1--73:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.73},
doi = {10.4230/LIPICS.MFCS.2019.73},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ConteGKMUW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pkdd/0001CCGLPPR19,
author = {Giulia Bernardini and
Huiping Chen and
Alessio Conte and
Roberto Grossi and
Grigorios Loukides and
Nadia Pisanti and
Solon P. Pissis and
Giovanna Rosone},
editor = {Ulf Brefeld and
{\'{E}}lisa Fromont and
Andreas Hotho and
Arno J. Knobbe and
Marloes H. Maathuis and
C{\'{e}}line Robardet},
title = {String Sanitization: {A} Combinatorial Approach},
booktitle = {Machine Learning and Knowledge Discovery in Databases - European Conference,
{ECML} {PKDD} 2019, W{\"{u}}rzburg, Germany, September 16-20,
2019, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {11906},
pages = {627--644},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-46150-8\_37},
doi = {10.1007/978-3-030-46150-8\_37},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pkdd/0001CCGLPPR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/ConteGPU19,
author = {Alessio Conte and
Roberto Grossi and
Giulia Punzi and
Takeaki Uno},
editor = {Nieves R. Brisaboa and
Simon J. Puglisi},
title = {Polynomial-Delay Enumeration of Maximal Common Subsequences},
booktitle = {String Processing and Information Retrieval - 26th International Symposium,
{SPIRE} 2019, Segovia, Spain, October 7-9, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11811},
pages = {189--202},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-32686-9\_14},
doi = {10.1007/978-3-030-32686-9\_14},
timestamp = {Mon, 07 Oct 2019 12:11:53 +0200},
biburl = {https://dblp.org/rec/conf/spire/ConteGPU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwoca/2019,
editor = {Charles J. Colbourn and
Roberto Grossi and
Nadia Pisanti},
title = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
Pisa, Italy, July 23-25, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11638},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-25005-8},
doi = {10.1007/978-3-030-25005-8},
isbn = {978-3-030-25004-1},
timestamp = {Mon, 15 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-05264,
author = {Massimo Equi and
Roberto Grossi and
Veli M{\"{a}}kinen},
title = {On the Complexity of Exact Pattern Matching in Graphs: Binary Strings
and Bounded Degree},
journal = {CoRR},
volume = {abs/1901.05264},
year = {2019},
url = {http://arxiv.org/abs/1901.05264},
eprinttype = {arXiv},
eprint = {1901.05264},
timestamp = {Fri, 01 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-05264.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-03560,
author = {Massimo Equi and
Roberto Grossi and
Alexandru I. Tomescu and
Veli M{\"{a}}kinen},
title = {On the Complexity of Exact Pattern Matching in Graphs: Determinism
and Zig-Zag Matching},
journal = {CoRR},
volume = {abs/1902.03560},
year = {2019},
url = {http://arxiv.org/abs/1902.03560},
eprinttype = {arXiv},
eprint = {1902.03560},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-03560.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-11030,
author = {Giulia Bernardini and
Huiping Chen and
Alessio Conte and
Roberto Grossi and
Grigorios Loukides and
Nadia Pisanti and
Solon P. Pissis and
Giovanna Rosone},
title = {String Sanitization: {A} Combinatorial Approach},
journal = {CoRR},
volume = {abs/1906.11030},
year = {2019},
url = {http://arxiv.org/abs/1906.11030},
eprinttype = {arXiv},
eprint = {1906.11030},
timestamp = {Thu, 27 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-11030.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-09271,
author = {Sankardeep Chakraborty and
Roberto Grossi and
Kunihiko Sadakane and
Srinivasa Rao Satti},
title = {Succinct Representation for (Non)Deterministic Finite Automata},
journal = {CoRR},
volume = {abs/1907.09271},
year = {2019},
url = {http://arxiv.org/abs/1907.09271},
eprinttype = {arXiv},
eprint = {1907.09271},
timestamp = {Tue, 30 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-09271.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-13446,
author = {Alessio Conte and
Andrea Marino and
Roberto Grossi and
Takeaki Uno and
Luca Versari},
title = {Proximity Search For Maximal Subgraph Enumeration},
journal = {CoRR},
volume = {abs/1912.13446},
year = {2019},
url = {http://arxiv.org/abs/1912.13446},
eprinttype = {arXiv},
eprint = {1912.13446},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-13446.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ConteGMR18,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Romeo Rizzi},
title = {Efficient enumeration of graph orientations with sources},
journal = {Discret. Appl. Math.},
volume = {246},
pages = {22--37},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.08.002},
doi = {10.1016/J.DAM.2017.08.002},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ConteGMR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GrossiMPTV18,
author = {Roberto Grossi and
Giulia Menconi and
Nadia Pisanti and
Roberto Trani and
S{\o}ren Vind},
title = {Motif trie: An efficient text index for pattern discovery with don't
cares},
journal = {Theor. Comput. Sci.},
volume = {710},
pages = {74--87},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.04.012},
doi = {10.1016/J.TCS.2017.04.012},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GrossiMPTV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ConteGMV18,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Luca Versari},
editor = {Lusheng Wang and
Daming Zhu},
title = {Finding Maximal Common Subgraphs via Time-Space Efficient Reverse
Search},
booktitle = {Computing and Combinatorics - 24th International Conference, {COCOON}
2018, Qing Dao, China, July 2-4, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10976},
pages = {328--340},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94776-1\_28},
doi = {10.1007/978-3-319-94776-1\_28},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/ConteGMV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GrossiV18,
author = {Roberto Grossi and
Luca Versari},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Round-Hashing for Data Storage: Distributed Servers and External-Memory
Tables},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {43:1--43:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.43},
doi = {10.4230/LIPICS.ESA.2018.43},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/GrossiV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hpec/ConteSGMV18,
author = {Alessio Conte and
Daniele De Sensi and
Roberto Grossi and
Andrea Marino and
Luca Versari},
title = {Discovering {\textdollar}k{\textdollar}-Trusses in Large-Scale Networks},
booktitle = {2018 {IEEE} High Performance Extreme Computing Conference, {HPEC}
2018, Waltham, MA, USA, September 25-27, 2018},
pages = {1--6},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.1109/HPEC.2018.8547735},
doi = {10.1109/HPEC.2018.8547735},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/hpec/ConteSGMV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/ConteMSGMV18,
author = {Alessio Conte and
Tiziano De Matteis and
Daniele De Sensi and
Roberto Grossi and
Andrea Marino and
Luca Versari},
editor = {Yike Guo and
Faisal Farooq},
title = {{D2K:} Scalable Community Detection in Massive Networks via Small-Diameter
k-Plexes},
booktitle = {Proceedings of the 24th {ACM} {SIGKDD} International Conference on
Knowledge Discovery {\&} Data Mining, {KDD} 2018, London, UK,
August 19-23, 2018},
pages = {1272--1281},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3219819.3220093},
doi = {10.1145/3219819.3220093},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/kdd/ConteMSGMV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/ConteFGMSU18,
author = {Alessio Conte and
Gaspare Ferraro and
Roberto Grossi and
Andrea Marino and
Kunihiko Sadakane and
Takeaki Uno},
editor = {Yike Guo and
Faisal Farooq},
title = {Node Similarity with q -Grams for Real-World Labeled Networks},
booktitle = {Proceedings of the 24th {ACM} {SIGKDD} International Conference on
Knowledge Discovery {\&} Data Mining, {KDD} 2018, London, UK,
August 19-23, 2018},
pages = {1282--1291},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3219819.3220085},
doi = {10.1145/3219819.3220085},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/kdd/ConteFGMSU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GrossiMV18,
author = {Roberto Grossi and
Andrea Marino and
Luca Versari},
editor = {Michael A. Bender and
Martin Farach{-}Colton and
Miguel A. Mosteiro},
title = {Efficient Algorithms for Listing k Disjoint st-Paths in Graphs},
booktitle = {{LATIN} 2018: Theoretical Informatics - 13th Latin American Symposium,
Buenos Aires, Argentina, April 16-19, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10807},
pages = {544--557},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-77404-6\_40},
doi = {10.1007/978-3-319-77404-6\_40},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/GrossiMV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ConteGMRV18,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Romeo Rizzi and
Luca Versari},
editor = {Igor Potapov and
Paul G. Spirakis and
James Worrell},
title = {Listing Subgraphs by Cartesian Decomposition},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
series = {LIPIcs},
volume = {117},
pages = {84:1--84:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.84},
doi = {10.4230/LIPICS.MFCS.2018.84},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ConteGMRV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/AyadBGIPPR18,
author = {Lorraine A. K. Ayad and
Giulia Bernardini and
Roberto Grossi and
Costas S. Iliopoulos and
Nadia Pisanti and
Solon P. Pissis and
Giovanna Rosone},
editor = {Travis Gagie and
Alistair Moffat and
Gonzalo Navarro and
Ernesto Cuadros{-}Vargas},
title = {Longest Property-Preserved Common Factor},
booktitle = {String Processing and Information Retrieval - 25th International Symposium,
{SPIRE} 2018, Lima, Peru, October 9-11, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11147},
pages = {42--49},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00479-8\_4},
doi = {10.1007/978-3-030-00479-8\_4},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/spire/AyadBGIPPR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/BilleEGGR18,
author = {Philip Bille and
Mikko Berggren Ettienne and
Roberto Grossi and
Inge Li G{\o}rtz and
Eva Rotenberg},
editor = {Travis Gagie and
Alistair Moffat and
Gonzalo Navarro and
Ernesto Cuadros{-}Vargas},
title = {Compressed Communication Complexity of Longest Common Prefixes},
booktitle = {String Processing and Information Retrieval - 25th International Symposium,
{SPIRE} 2018, Lima, Peru, October 9-11, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11147},
pages = {74--87},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00479-8\_7},
doi = {10.1007/978-3-030-00479-8\_7},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/BilleEGGR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/AlzamelA0GIPPR18,
author = {Mai Alzamel and
Lorraine A. K. Ayad and
Giulia Bernardini and
Roberto Grossi and
Costas S. Iliopoulos and
Nadia Pisanti and
Solon P. Pissis and
Giovanna Rosone},
editor = {Laxmi Parida and
Esko Ukkonen},
title = {Degenerate String Comparison and Applications},
booktitle = {18th International Workshop on Algorithms in Bioinformatics, {WABI}
2018, August 20-22, 2018, Helsinki, Finland},
series = {LIPIcs},
volume = {113},
pages = {21:1--21:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.WABI.2018.21},
doi = {10.4230/LIPICS.WABI.2018.21},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wabi/AlzamelA0GIPPR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ConteGMRUV18,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Romeo Rizzi and
Takeaki Uno and
Luca Versari},
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
title = {Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts},
booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International
Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11159},
pages = {100--110},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5\_9},
doi = {10.1007/978-3-030-00256-5\_9},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/ConteGMRUV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-03659,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Luca Versari},
title = {Listing Maximal Subgraphs in Strongly Accessible Set Systems},
journal = {CoRR},
volume = {abs/1803.03659},
year = {2018},
url = {http://arxiv.org/abs/1803.03659},
eprinttype = {arXiv},
eprint = {1803.03659},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-03659.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-03158,
author = {Roberto Grossi and
Luca Versari},
title = {Round-Hashing for Data Storage: Distributed Servers and External-Memory
Tables},
journal = {CoRR},
volume = {abs/1805.03158},
year = {2018},
url = {http://arxiv.org/abs/1805.03158},
eprinttype = {arXiv},
eprint = {1805.03158},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-03158.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-03102,
author = {Philip Bille and
Mikko Berggren Ettienne and
Roberto Grossi and
Inge Li G{\o}rtz and
Eva Rotenberg},
title = {Compressed Communication Complexity of Longest Common Prefixes},
journal = {CoRR},
volume = {abs/1806.03102},
year = {2018},
url = {http://arxiv.org/abs/1806.03102},
eprinttype = {arXiv},
eprint = {1806.03102},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-03102.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-02099,
author = {Lorraine A. K. Ayad and
Giulia Bernardini and
Roberto Grossi and
Costas S. Iliopoulos and
Nadia Pisanti and
Solon P. Pissis and
Giovanna Rosone},
title = {Longest Property-Preserved Common Factor},
journal = {CoRR},
volume = {abs/1810.02099},
year = {2018},
url = {http://arxiv.org/abs/1810.02099},
eprinttype = {arXiv},
eprint = {1810.02099},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-02099.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/GrossiINRR17,
author = {Roberto Grossi and
John Iacono and
Gonzalo Navarro and
Rajeev Raman and
S. Srinivasa Rao},
title = {Asymptotically Optimal Encodings of Range Data Structures for Selection
and Top-\emph{k} Queries},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {2},
pages = {28:1--28:31},
year = {2017},
url = {https://doi.org/10.1145/3012939},
doi = {10.1145/3012939},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/GrossiINRR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alcob/ConteGMTV17,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Lorenzo Tattini and
Luca Versari},
editor = {Daniel Figueiredo and
Carlos Mart{\'{\i}}n{-}Vide and
Diogo Pratas and
Miguel A. Vega{-}Rodr{\'{\i}}guez},
title = {A Fast Algorithm for Large Common Connected Induced Subgraphs},
booktitle = {Algorithms for Computational Biology - 4th International Conference,
AlCoB 2017, Aveiro, Portugal, June 5-6, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10252},
pages = {62--74},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-58163-7\_4},
doi = {10.1007/978-3-319-58163-7\_4},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alcob/ConteGMTV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GrossiILPPRRVV17,
author = {Roberto Grossi and
Costas S. Iliopoulos and
Chang Liu and
Nadia Pisanti and
Solon P. Pissis and
Ahmad Retha and
Giovanna Rosone and
Fatima Vayani and
Luca Versari},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jakub Radoszewski and
Wojciech Rytter},
title = {On-Line Pattern Matching on Similar Texts},
booktitle = {28th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2017,
July 4-6, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {78},
pages = {9:1--9:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CPM.2017.9},
doi = {10.4230/LIPICS.CPM.2017.9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GrossiILPPRRVV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/ConteGMUV17,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Takeaki Uno and
Luca Versari},
editor = {Gabriele Fici and
Marinella Sciortino and
Rossano Venturini},
title = {Listing Maximal Independent Sets with Minimal Space and Bounded Delay},
booktitle = {String Processing and Information Retrieval - 24th International Symposium,
{SPIRE} 2017, Palermo, Italy, September 26-29, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10508},
pages = {144--160},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-67428-5\_13},
doi = {10.1007/978-3-319-67428-5\_13},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/ConteGMUV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/AcunaGILRSSS17,
author = {Vicente Acu{\~{n}}a and
Roberto Grossi and
Giuseppe F. Italiano and
Leandro Lima and
Romeo Rizzi and
Gustavo Sacomoto and
Marie{-}France Sagot and
Blerina Sinaimeri},
editor = {Hans L. Bodlaender and
Gerhard J. Woeginger},
title = {On Bubble Generators in Directed Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International
Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10520},
pages = {18--31},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-68705-6\_2},
doi = {10.1007/978-3-319-68705-6\_2},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/AcunaGILRSSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/GrossiIMPPRV16,
author = {Roberto Grossi and
Costas S. Iliopoulos and
Robert Mercas and
Nadia Pisanti and
Solon P. Pissis and
Ahmad Retha and
Fatima Vayani},
title = {Circular sequence comparison: algorithms and applications},
journal = {Algorithms Mol. Biol.},
volume = {11},
pages = {12},
year = {2016},
url = {https://doi.org/10.1186/s13015-016-0076-6},
doi = {10.1186/S13015-016-0076-6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/almob/GrossiIMPPRV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/GrossiIMPPRV16a,
author = {Roberto Grossi and
Costas S. Iliopoulos and
Robert Mercas and
Nadia Pisanti and
Solon P. Pissis and
Ahmad Retha and
Fatima Vayani},
title = {Erratum to: Circular sequence comparison: algorithms and applications},
journal = {Algorithms Mol. Biol.},
volume = {11},
pages = {21},
year = {2016},
url = {https://doi.org/10.1186/s13015-016-0084-6},
doi = {10.1186/S13015-016-0084-6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/almob/GrossiIMPPRV16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CrochemoreEGM16,
author = {Maxime Crochemore and
Chiara Epifanio and
Roberto Grossi and
Filippo Mignosi},
title = {Linear-size suffix tries},
journal = {Theor. Comput. Sci.},
volume = {638},
pages = {171--178},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.04.002},
doi = {10.1016/J.TCS.2016.04.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CrochemoreEGM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ConteGMV16,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Luca Versari},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics:
Maximal Cliques},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {148:1--148:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.148},
doi = {10.4230/LIPICS.ICALP.2016.148},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ConteGMV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/ConteGMRV16,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Romeo Rizzi and
Luca Versari},
editor = {Veli M{\"{a}}kinen and
Simon J. Puglisi and
Leena Salmela},
title = {Directing Road Networks by Listing Strong Orientations},
booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016,
Helsinki, Finland, August 17-19, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9843},
pages = {83--95},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44543-4\_7},
doi = {10.1007/978-3-319-44543-4\_7},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/ConteGMRV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/ConteGMR16,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Romeo Rizzi},
editor = {Evangelos Kranakis and
Gonzalo Navarro and
Edgar Ch{\'{a}}vez},
title = {Listing Acyclic Orientations of Graphs with Single and Multiple Sources},
booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium,
Ensenada, Mexico, April 11-15, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9644},
pages = {319--333},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49529-2\_24},
doi = {10.1007/978-3-662-49529-2\_24},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/latin/ConteGMR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sac/ConteGM16,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino},
editor = {Sascha Ossowski},
title = {Clique covering of large real-world networks},
booktitle = {Proceedings of the 31st Annual {ACM} Symposium on Applied Computing,
Pisa, Italy, April 4-8, 2016},
pages = {1134--1139},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2851613.2851816},
doi = {10.1145/2851613.2851816},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sac/ConteGM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CairoGR16,
author = {Massimo Cairo and
Roberto Grossi and
Romeo Rizzi},
editor = {Robert Krauthgamer},
title = {New Bounds for Approximating Extremal Distances in Undirected Graphs},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {363--376},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch27},
doi = {10.1137/1.9781611974331.CH27},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/CairoGR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cpm/2016,
editor = {Roberto Grossi and
Moshe Lewenstein},
title = {27th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2016,
June 27-29, 2016, Tel Aviv, Israel},
series = {LIPIcs},
volume = {54},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-012-5},
isbn = {978-3-95977-012-5},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Grossi16,
author = {Roberto Grossi},
title = {Enumeration of Paths, Cycles, and Spanning Trees},
booktitle = {Encyclopedia of Algorithms},
pages = {640--645},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_728},
doi = {10.1007/978-1-4939-2864-4\_728},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Grossi16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Grossi16a,
author = {Roberto Grossi},
title = {Wavelet Trees},
booktitle = {Encyclopedia of Algorithms},
pages = {2355--2359},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_642},
doi = {10.1007/978-1-4939-2864-4\_642},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Grossi16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CrochemoreGKL15,
author = {Maxime Crochemore and
Roberto Grossi and
Juha K{\"{a}}rkk{\"{a}}inen and
Gad M. Landau},
title = {Computing the Burrows-Wheeler transform in place and in small space},
journal = {J. Discrete Algorithms},
volume = {32},
pages = {44--52},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2015.01.004},
doi = {10.1016/J.JDA.2015.01.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/CrochemoreGKL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/ConteGMR15,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Romeo Rizzi},
editor = {Zsuzsanna Lipt{\'{a}}k and
William F. Smyth},
title = {Enumerating Cyclic Orientations of a Graph},
booktitle = {Combinatorial Algorithms - 26th International Workshop, {IWOCA} 2015,
Verona, Italy, October 5-7, 2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9538},
pages = {88--99},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-29516-9\_8},
doi = {10.1007/978-3-319-29516-9\_8},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/ConteGMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/GrossiIMPPRV15,
author = {Roberto Grossi and
Costas S. Iliopoulos and
Robert Mercas and
Nadia Pisanti and
Solon P. Pissis and
Ahmad Retha and
Fatima Vayani},
editor = {Mihai Pop and
H{\'{e}}l{\`{e}}ne Touzet},
title = {Circular Sequence Comparison with q-grams},
booktitle = {Algorithms in Bioinformatics - 15th International Workshop, {WABI}
2015, Atlanta, GA, USA, September 10-12, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9289},
pages = {203--216},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48221-6\_15},
doi = {10.1007/978-3-662-48221-6\_15},
timestamp = {Thu, 14 Oct 2021 10:34:16 +0200},
biburl = {https://dblp.org/rec/conf/wabi/GrossiIMPPRV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ConteGMR15,
author = {Alessio Conte and
Roberto Grossi and
Andrea Marino and
Romeo Rizzi},
title = {Enumerating Cyclic Orientations of a Graph},
journal = {CoRR},
volume = {abs/1506.05977},
year = {2015},
url = {http://arxiv.org/abs/1506.05977},
eprinttype = {arXiv},
eprint = {1506.05977},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ConteGMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GrossiO14,
author = {Roberto Grossi and
Giuseppe Ottaviano},
title = {Fast Compressed Tries through Path Decompositions},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2656332},
doi = {10.1145/2656332},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GrossiO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AmirFGKLL14,
author = {Amihood Amir and
Gianni Franceschini and
Roberto Grossi and
Tsvi Kopelowitz and
Moshe Lewenstein and
Noa Lewenstein},
title = {Managing Unbounded-Length Keys in Comparison-Driven Data Structures
with Applications to Online Indexing},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {4},
pages = {1396--1416},
year = {2014},
url = {https://doi.org/10.1137/110836377},
doi = {10.1137/110836377},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AmirFGKLL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ben-KikiBBGGW14,
author = {Oren Ben{-}Kiki and
Philip Bille and
Dany Breslauer and
Leszek Gasieniec and
Roberto Grossi and
Oren Weimann},
title = {Towards optimal packed string matching},
journal = {Theor. Comput. Sci.},
volume = {525},
pages = {111--129},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.06.013},
doi = {10.1016/J.TCS.2013.06.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Ben-KikiBBGGW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FerreiraGRSS14,
author = {Rui A. Ferreira and
Roberto Grossi and
Romeo Rizzi and
Gustavo Sacomoto and
Marie{-}France Sagot},
editor = {Andreas S. Schulz and
Dorothea Wagner},
title = {Amortized {\~{O}}({\(\vert\)}V{\(\vert\)}) -Delay Algorithm for Listing
Chordless Cycles in Undirected Graphs},
booktitle = {Algorithms - {ESA} 2014 - 22th Annual European Symposium, Wroclaw,
Poland, September 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8737},
pages = {418--429},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44777-2\_35},
doi = {10.1007/978-3-662-44777-2\_35},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/FerreiraGRSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GrossiMPTV14,
author = {Roberto Grossi and
Giulia Menconi and
Nadia Pisanti and
Roberto Trani and
S{\o}ren Vind},
editor = {Venkatesh Raman and
S. P. Suresh},
title = {Output-Sensitive Pattern Extraction in Sequences},
booktitle = {34th International Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014,
New Delhi, India},
series = {LIPIcs},
volume = {29},
pages = {303--314},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2014.303},
doi = {10.4230/LIPICS.FSTTCS.2014.303},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/GrossiMPTV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GrossiV14,
author = {Roberto Grossi and
S{\o}ren Vind},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Colored Range Searching in Linear Space},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {229--240},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_20},
doi = {10.1007/978-3-319-08404-6\_20},
timestamp = {Sun, 02 Jun 2019 21:15:18 +0200},
biburl = {https://dblp.org/rec/conf/swat/GrossiV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FerreiraGRSS14,
author = {Rui A. Ferreira and
Roberto Grossi and
Romeo Rizzi and
Gustavo Sacomoto and
Marie{-}France Sagot},
title = {Amortized {\~{O}}({\(\vert\)}V{\(\vert\)})-Delay Algorithm for Listing
Chordless Cycles in Undirected Graphs},
journal = {CoRR},
volume = {abs/1408.1265},
year = {2014},
url = {http://arxiv.org/abs/1408.1265},
eprinttype = {arXiv},
eprint = {1408.1265},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FerreiraGRSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/MenconiBGPM13,
author = {Giulia Menconi and
Giovanni Battaglia and
Roberto Grossi and
Nadia Pisanti and
Roberto Marangoni},
title = {Mobilomics in Saccharomyces cerevisiae strains},
journal = {{BMC} Bioinform.},
volume = {14},
pages = {102},
year = {2013},
url = {https://doi.org/10.1186/1471-2105-14-102},
doi = {10.1186/1471-2105-14-102},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/MenconiBGPM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GrossiSS13,
author = {Roberto Grossi and
Fabrizio Sebastiani and
Fabrizio Silvestri},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {18},
pages = {1--2},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2012.12.008},
doi = {10.1016/J.JDA.2012.12.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GrossiSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BreslauerGM13,
author = {Dany Breslauer and
Roberto Grossi and
Filippo Mignosi},
title = {Simple real-time constant-space string matching},
journal = {Theor. Comput. Sci.},
volume = {483},
pages = {2--9},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.11.040},
doi = {10.1016/J.TCS.2012.11.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BreslauerGM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CrescenziGHLM13,
author = {Pilu Crescenzi and
Roberto Grossi and
Michel Habib and
Leonardo Lanzi and
Andrea Marino},
title = {On computing the diameter of real-world undirected graphs},
journal = {Theor. Comput. Sci.},
volume = {514},
pages = {84--95},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.09.018},
doi = {10.1016/J.TCS.2012.09.018},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CrescenziGHLM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Grossi13,
author = {Roberto Grossi},
editor = {Andrej Brodnik and
Alejandro L{\'{o}}pez{-}Ortiz and
Venkatesh Raman and
Alfredo Viola},
title = {Random Access to High-Order Entropy Compressed Text},
booktitle = {Space-Efficient Data Structures, Streams, and Algorithms - Papers
in Honor of J. Ian Munro on the Occasion of His 66th Birthday},
series = {Lecture Notes in Computer Science},
volume = {8066},
pages = {199--215},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40273-9\_14},
doi = {10.1007/978-3-642-40273-9\_14},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/Grossi13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CrochemoreGKL13,
author = {Maxime Crochemore and
Roberto Grossi and
Juha K{\"{a}}rkk{\"{a}}inen and
Gad M. Landau},
editor = {Johannes Fischer and
Peter Sanders},
title = {A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler
Transform},
booktitle = {Combinatorial Pattern Matching, 24th Annual Symposium, {CPM} 2013,
Bad Herrenalb, Germany, June 17-19, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7922},
pages = {74--82},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38905-4\_9},
doi = {10.1007/978-3-642-38905-4\_9},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/CrochemoreGKL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GrossiINRR13,
author = {Roberto Grossi and
John Iacono and
Gonzalo Navarro and
Rajeev Raman and
Srinivasa Rao Satti},
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {Encodings for Range Selection and Top-k Queries},
booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
pages = {553--564},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4\_47},
doi = {10.1007/978-3-642-40450-4\_47},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/GrossiINRR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GrossiRRV13,
author = {Roberto Grossi and
Rajeev Raman and
Srinivasa Rao Satti and
Rossano Venturini},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Dynamic Compressed Strings with Random Access},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {504--515},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_43},
doi = {10.1007/978-3-642-39206-1\_43},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GrossiRRV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BirmeleFGMPRS13,
author = {Etienne Birmel{\'{e}} and
Rui A. Ferreira and
Roberto Grossi and
Andrea Marino and
Nadia Pisanti and
Romeo Rizzi and
Gustavo Sacomoto},
editor = {Sanjeev Khanna},
title = {Optimal Listing of Cycles and st-Paths in Undirected Graphs},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {1884--1896},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.134},
doi = {10.1137/1.9781611973105.134},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BirmeleFGMPRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/Grossi13,
author = {Roberto Grossi},
editor = {Oren Kurland and
Moshe Lewenstein and
Ely Porat},
title = {Pattern Discovery and Listing in Graphs},
booktitle = {String Processing and Information Retrieval - 20th International Symposium,
{SPIRE} 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8214},
pages = {2},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-02432-5\_2},
doi = {10.1007/978-3-319-02432-5\_2},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/spire/Grossi13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/GrossiO13,
author = {Roberto Grossi and
Giuseppe Ottaviano},
editor = {Vincenzo Bonifaci and
Camil Demetrescu and
Alberto Marchetti{-}Spaccamela},
title = {Design of Practical Succinct Data Structures for Large Data Collections},
booktitle = {Experimental Algorithms, 12th International Symposium, {SEA} 2013,
Rome, Italy, June 5-7, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7933},
pages = {5--17},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38527-8\_3},
doi = {10.1007/978-3-642-38527-8\_3},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/wea/GrossiO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AmirFGKLL13,
author = {Amihood Amir and
Gianni Franceschini and
Roberto Grossi and
Tsvi Kopelowitz and
Moshe Lewenstein and
Noa Lewenstein},
title = {Managing Unbounded-Length Keys in Comparison-Driven Data Structures
with Applications to On-Line Indexing},
journal = {CoRR},
volume = {abs/1306.0406},
year = {2013},
url = {http://arxiv.org/abs/1306.0406},
eprinttype = {arXiv},
eprint = {1306.0406},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AmirFGKLL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BattagliaGS12,
author = {Giovanni Battaglia and
Roberto Grossi and
Noemi Scutell{\`{a}}},
title = {Consecutive ones property and PQ-trees for multisets: Hardness of
counting their orderings},
journal = {Inf. Comput.},
volume = {219},
pages = {58--70},
year = {2012},
url = {https://doi.org/10.1016/j.ic.2012.08.005},
doi = {10.1016/J.IC.2012.08.005},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BattagliaGS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/OttavianoG12,
author = {Giuseppe Ottaviano and
Roberto Grossi},
editor = {David A. Bader and
Petra Mutzel},
title = {Fast Compressed Tries through Path Decompositions},
booktitle = {Proceedings of the 14th Meeting on Algorithm Engineering {\&}
Experiments, {ALENEX} 2012, The Westin Miyako, Kyoto, Japan, January
16, 2012},
pages = {65--74},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972924.7},
doi = {10.1137/1.9781611972924.7},
timestamp = {Tue, 29 Dec 2020 18:28:33 +0100},
biburl = {https://dblp.org/rec/conf/alenex/OttavianoG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/biostec/MenconiBGPM12,
author = {Giulia Menconi and
Giovanni Battaglia and
Roberto Grossi and
Nadia Pisanti and
Roberto Marangoni},
editor = {Jan Schier and
Carlos Manuel B. A. Correia and
Ana L. N. Fred and
Hugo Gamboa},
title = {A Taste of Yeast Mobilomics},
booktitle = {{BIOINFORMATICS} 2012 - Proceedings of the International Conference
on Bioinformatics Models, Methods and Algorithms, Vilamoura, Algarve,
Portugal, 1 - 4 February, 2012},
pages = {271--274},
publisher = {SciTePress},
year = {2012},
timestamp = {Tue, 29 May 2012 10:31:06 +0200},
biburl = {https://dblp.org/rec/conf/biostec/MenconiBGPM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BreslauerGG12,
author = {Dany Breslauer and
Leszek Gasieniec and
Roberto Grossi},
editor = {Juha K{\"{a}}rkk{\"{a}}inen and
Jens Stoye},
title = {Constant-Time Word-Size String Matching},
booktitle = {Combinatorial Pattern Matching - 23rd Annual Symposium, {CPM} 2012,
Helsinki, Finland, July 3-5, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7354},
pages = {83--96},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31265-6\_7},
doi = {10.1007/978-3-642-31265-6\_7},
timestamp = {Tue, 21 Mar 2023 21:02:12 +0100},
biburl = {https://dblp.org/rec/conf/cpm/BreslauerGG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/GrossiO12,
author = {Roberto Grossi and
Giuseppe Ottaviano},
editor = {Michael Benedikt and
Markus Kr{\"{o}}tzsch and
Maurizio Lenzerini},
title = {The wavelet trie: maintaining an indexed sequence of strings in compressed
space},
booktitle = {Proceedings of the 31st {ACM} {SIGMOD-SIGACT-SIGART} Symposium on
Principles of Database Systems, {PODS} 2012, Scottsdale, AZ, USA,
May 20-24, 2012},
pages = {203--214},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213556.2213586},
doi = {10.1145/2213556.2213586},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/GrossiO12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/BirmeleCFGLMPSS12,
author = {Etienne Birmel{\'{e}} and
Pierluigi Crescenzi and
Rui A. Ferreira and
Roberto Grossi and
Vincent Lacroix and
Andrea Marino and
Nadia Pisanti and
Gustavo Akio Tominaga Sacomoto and
Marie{-}France Sagot},
editor = {Liliana Calder{\'{o}}n{-}Benavides and
Cristina N. Gonz{\'{a}}lez{-}Caro and
Edgar Ch{\'{a}}vez and
Nivio Ziviani},
title = {Efficient Bubble Enumeration in Directed Graphs},
booktitle = {String Processing and Information Retrieval - 19th International Symposium,
{SPIRE} 2012, Cartagena de Indias, Colombia, October 21-25, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7608},
pages = {118--129},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34109-0\_13},
doi = {10.1007/978-3-642-34109-0\_13},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/BirmeleCFGLMPSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/CrescenziGLM12,
author = {Pierluigi Crescenzi and
Roberto Grossi and
Leonardo Lanzi and
Andrea Marino},
editor = {Ralf Klasing},
title = {On Computing the Diameter of Real-World Directed (Weighted) Graphs},
booktitle = {Experimental Algorithms - 11th International Symposium, {SEA} 2012,
Bordeaux, France, June 7-9, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7276},
pages = {99--110},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30850-5\_10},
doi = {10.1007/978-3-642-30850-5\_10},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/CrescenziGLM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-3581,
author = {Roberto Grossi and
Giuseppe Ottaviano},
title = {The Wavelet Trie: Maintaining an Indexed Sequence of Strings in Compressed
Space},
journal = {CoRR},
volume = {abs/1204.3581},
year = {2012},
url = {http://arxiv.org/abs/1204.3581},
eprinttype = {arXiv},
eprint = {1204.3581},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-3581.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-2766,
author = {Etienne Birmel{\'{e}} and
Rui A. Ferreira and
Roberto Grossi and
Andrea Marino and
Nadia Pisanti and
Romeo Rizzi and
Gustavo Akio Tominaga Sacomoto and
Marie{-}France Sagot},
title = {Optimal Listing of Cycles and st-Paths in Undirected Graphs},
journal = {CoRR},
volume = {abs/1205.2766},
year = {2012},
url = {http://arxiv.org/abs/1205.2766},
eprinttype = {arXiv},
eprint = {1205.2766},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-2766.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/GrossiPPPUV11,
author = {Roberto Grossi and
Andrea Pietracaprina and
Nadia Pisanti and
Geppino Pucci and
Eli Upfal and
Fabio Vandin},
title = {{MADMX:} {A} Strategy for Maximal Dense Motif Extraction},
journal = {J. Comput. Biol.},
volume = {18},
number = {4},
pages = {535--545},
year = {2011},
url = {https://doi.org/10.1089/cmb.2010.0177},
doi = {10.1089/CMB.2010.0177},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/GrossiPPPUV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Grossi11,
author = {Roberto Grossi},
title = {A quick tour on suffix arrays and compressed suffix arrays},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {27},
pages = {2964--2973},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.036},
doi = {10.1016/J.TCS.2010.12.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Grossi11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/biostec/MenconiBGPM11,
author = {Giulia Menconi and
Giovanni Battaglia and
Roberto Grossi and
Nadia Pisanti and
Roberto Marangoni},
editor = {Marco Pellegrini and
Ana L. N. Fred and
Joaquim Filipe and
Hugo Gamboa},
title = {Inferring Mobile Elements in S. Cerevisiae Strains},
booktitle = {{BIOINFORMATICS} 2011 - Proceedings of the International Conference
on Bioinformatics Models, Methods and Algorithms, Rome, Italy, 26-29
January, 2011},
pages = {131--136},
publisher = {SciTePress},
year = {2011},
timestamp = {Thu, 21 Dec 2017 16:21:33 +0100},
biburl = {https://dblp.org/rec/conf/biostec/MenconiBGPM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ccp/GrossiVX11,
author = {Roberto Grossi and
Jeffrey Scott Vitter and
Bojian Xu},
title = {Wavelet Trees: From Theory to Practice},
booktitle = {First International Conference on Data Compression, Communications
and Processing, {CCP} 2011, Palinuro, Cilento Coast, Italy, June 21-24,
2011},
pages = {210--221},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/CCP.2011.16},
doi = {10.1109/CCP.2011.16},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ccp/GrossiVX11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cikm/OttavianoG11,
author = {Giuseppe Ottaviano and
Roberto Grossi},
editor = {Craig Macdonald and
Iadh Ounis and
Ian Ruthven},
title = {Semi-indexing semi-structured data in tiny space},
booktitle = {Proceedings of the 20th {ACM} Conference on Information and Knowledge
Management, {CIKM} 2011, Glasgow, United Kingdom, October 24-28, 2011},
pages = {1485--1494},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/2063576.2063790},
doi = {10.1145/2063576.2063790},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cikm/OttavianoG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BreslauerGM11,
author = {Dany Breslauer and
Roberto Grossi and
Filippo Mignosi},
editor = {Raffaele Giancarlo and
Giovanni Manzini},
title = {Simple Real-Time Constant-Space String Matching},
booktitle = {Combinatorial Pattern Matching - 22nd Annual Symposium, {CPM} 2011,
Palermo, Italy, June 27-29, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6661},
pages = {173--183},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21458-5\_16},
doi = {10.1007/978-3-642-21458-5\_16},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BreslauerGM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/BattagliaGS11,
author = {Giovanni Battaglia and
Roberto Grossi and
Noemi Scutell{\`{a}}},
editor = {Giancarlo Mauri and
Alberto Leporati},
title = {Counting the Orderings for Multisets in Consecutive Ones Property
and PQ-Trees},
booktitle = {Developments in Language Theory - 15th International Conference, {DLT}
2011, Milan, Italy, July 19-22, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6795},
pages = {58--69},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22321-1\_6},
doi = {10.1007/978-3-642-22321-1\_6},
timestamp = {Sat, 09 Apr 2022 12:37:59 +0200},
biburl = {https://dblp.org/rec/conf/dlt/BattagliaGS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FerreiraGR11,
author = {Rui A. Ferreira and
Roberto Grossi and
Romeo Rizzi},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {275--286},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_24},
doi = {10.1007/978-3-642-23719-5\_24},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/FerreiraGR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Ben-KikiBBGGW11,
author = {Oren Ben{-}Kiki and
Philip Bille and
Dany Breslauer and
Leszek Gasieniec and
Roberto Grossi and
Oren Weimann},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Optimal Packed String Matching},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {423--432},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.423},
doi = {10.4230/LIPICS.FSTTCS.2011.423},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/Ben-KikiBBGGW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tapas/CrescenziGLM11,
author = {Pierluigi Crescenzi and
Roberto Grossi and
Leonardo Lanzi and
Andrea Marino},
editor = {Alberto Marchetti{-}Spaccamela and
Michael Segal},
title = {A Comparison of Three Algorithms for Approximating the Distance Distribution
in Real-World Graphs},
booktitle = {Theory and Practice of Algorithms in (Computer) Systems - First International
{ICST} Conference, {TAPAS} 2011, Rome, Italy, April 18-20, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6595},
pages = {92--103},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-19754-3\_11},
doi = {10.1007/978-3-642-19754-3\_11},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tapas/CrescenziGLM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/spire/2011,
editor = {Roberto Grossi and
Fabrizio Sebastiani and
Fabrizio Silvestri},
title = {String Processing and Information Retrieval, 18th International Symposium,
{SPIRE} 2011, Pisa, Italy, October 17-21, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7024},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-24583-1},
doi = {10.1007/978-3-642-24583-1},
isbn = {978-3-642-24582-4},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spire/2011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-0041,
author = {Giovanni Battaglia and
Roberto Grossi and
Noemi Scutell{\`{a}}},
title = {Consecutive Ones Property and PQ-Trees for Multisets: Hardness of
Counting Their Orderings},
journal = {CoRR},
volume = {abs/1102.0041},
year = {2011},
url = {http://arxiv.org/abs/1102.0041},
eprinttype = {arXiv},
eprint = {1102.0041},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-0041.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-3381,
author = {Gianni Franceschini and
Roberto Grossi and
S. Muthukrishnan},
title = {Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection},
journal = {CoRR},
volume = {abs/1110.3381},
year = {2011},
url = {http://arxiv.org/abs/1110.3381},
eprinttype = {arXiv},
eprint = {1110.3381},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-3381.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-5220,
author = {Roberto Grossi and
Giuseppe Ottaviano},
title = {Fast Compressed Tries through Path Decompositions},
journal = {CoRR},
volume = {abs/1111.5220},
year = {2011},
url = {http://arxiv.org/abs/1111.5220},
eprinttype = {arXiv},
eprint = {1111.5220},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-5220.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CrescenziGILM10,
author = {Pierluigi Crescenzi and
Roberto Grossi and
Claudio Imbrenda and
Leonardo Lanzi and
Andrea Marino},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Finding the Diameter in Real-World Graphs - Experimentally Turning
a Lower Bound into an Upper Bound},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6346},
pages = {302--313},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_26},
doi = {10.1007/978-3-642-15775-2\_26},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/CrescenziGILM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/GrossiOO10,
author = {Roberto Grossi and
Alessio Orlandi and
Giuseppe Ottaviano},
editor = {Paolo Boldi and
Luisa Gargano},
title = {Fun with Olympiad in Algorithmics},
booktitle = {Fun with Algorithms, 5th International Conference, {FUN} 2010, Ischia,
Italy, June 2-4, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6099},
pages = {1--2},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13122-6\_1},
doi = {10.1007/978-3-642-13122-6\_1},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/GrossiOO10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GrossiOR10,
author = {Roberto Grossi and
Alessio Orlandi and
Rajeev Raman},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {Optimal Trade-Offs for Succinct String Indexes},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6198},
pages = {678--689},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14165-2\_57},
doi = {10.1007/978-3-642-14165-2\_57},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GrossiOR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1002-0874,
author = {Roberto Grossi and
Andrea Pietracaprina and
Nadia Pisanti and
Geppino Pucci and
Eli Upfal and
Fabio Vandin},
title = {{MADMX:} {A} Novel Strategy for Maximal Dense Motif Extraction},
journal = {CoRR},
volume = {abs/1002.0874},
year = {2010},
url = {http://arxiv.org/abs/1002.0874},
eprinttype = {arXiv},
eprint = {1002.0874},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1002-0874.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1006-5354,
author = {Roberto Grossi and
Alessio Orlandi and
Rajeev Raman},
title = {Optimal Trade-Off for Succinct String Indexes},
journal = {CoRR},
volume = {abs/1006.5354},
year = {2010},
url = {http://arxiv.org/abs/1006.5354},
eprinttype = {arXiv},
eprint = {1006.5354},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1006-5354.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BattagliaCGP09,
author = {Giovanni Battaglia and
Davide Cangelosi and
Roberto Grossi and
Nadia Pisanti},
title = {Masking patterns in sequences: {A} new class of motif discovery with
don't cares},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {43},
pages = {4327--4340},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.07.014},
doi = {10.1016/J.TCS.2009.07.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BattagliaCGP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Grossi09,
author = {Roberto Grossi},
editor = {Gregory Kucherov and
Esko Ukkonen},
title = {Text Indexing, Suffix Sorting, and Data Compression: Common Problems
and Techniques},
booktitle = {Combinatorial Pattern Matching, 20th Annual Symposium, {CPM} 2009,
Lille, France, June 22-24, 2009, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5577},
pages = {39--40},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02441-2\_4},
doi = {10.1007/978-3-642-02441-2\_4},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Grossi09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dexaw/BattagliaGMP09,
author = {Giovanni Battaglia and
Roberto Grossi and
Roberto Marangoni and
Nadia Pisanti},
editor = {A Min Tjoa and
Roland R. Wagner},
title = {Mining Biological Sequences with Masks},
booktitle = {Database and Expert Systems Applications, DEXA, International Workshops,
Linz, Austria, August 31-September 4, 2009, Proceedings},
pages = {193--197},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/DEXA.2009.47},
doi = {10.1109/DEXA.2009.47},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dexaw/BattagliaGMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FranceschiniGM09,
author = {Gianni Franceschini and
Roberto Grossi and
S. Muthukrishnan},
editor = {Susanne Albers and
Jean{-}Yves Marion},
title = {Optimal Cache-Aware Suffix Selection},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings},
series = {LIPIcs},
volume = {3},
pages = {457--468},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.STACS.2009.1845},
doi = {10.4230/LIPICS.STACS.2009.1845},
timestamp = {Tue, 22 Jun 2021 15:43:57 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FranceschiniGM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GrossiORR09,
author = {Roberto Grossi and
Alessio Orlandi and
Rajeev Raman and
S. Srinivasa Rao},
editor = {Susanne Albers and
Jean{-}Yves Marion},
title = {More Haste, Less Waste: Lowering the Redundancy in Fully Indexable
Dictionaries},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings},
series = {LIPIcs},
volume = {3},
pages = {517--528},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.STACS.2009.1847},
doi = {10.4230/LIPICS.STACS.2009.1847},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GrossiORR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/GrossiPPPUV09,
author = {Roberto Grossi and
Andrea Pietracaprina and
Nadia Pisanti and
Geppino Pucci and
Eli Upfal and
Fabio Vandin},
editor = {Steven Salzberg and
Tandy J. Warnow},
title = {{MADMX:} {A} Novel Strategy for Maximal Dense Motif Extraction},
booktitle = {Algorithms in Bioinformatics, 9th International Workshop, {WABI} 2009,
Philadelphia, PA, USA, September 12-13, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5724},
pages = {362--374},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04241-6\_30},
doi = {10.1007/978-3-642-04241-6\_30},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wabi/GrossiPPPUV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-1737,
author = {Gianni Franceschini and
Roberto Grossi and
S. Muthukrishnan},
title = {Optimal cache-aware suffix selection},
journal = {CoRR},
volume = {abs/0902.1737},
year = {2009},
url = {http://arxiv.org/abs/0902.1737},
eprinttype = {arXiv},
eprint = {0902.1737},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-1737.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-2648,
author = {Roberto Grossi and
Alessio Orlandi and
Rajeev Raman and
S. Srinivasa Rao},
title = {More Haste, Less Waste: Lowering the Redundancy in Fully Indexable
Dictionaries},
journal = {CoRR},
volume = {abs/0902.2648},
year = {2009},
url = {http://arxiv.org/abs/0902.2648},
eprinttype = {arXiv},
eprint = {0902.2648},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-2648.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FranceschiniG08,
author = {Gianni Franceschini and
Roberto Grossi},
title = {No sorting? better searching!},
journal = {{ACM} Trans. Algorithms},
volume = {4},
number = {1},
pages = {2:1--2:13},
year = {2008},
url = {https://doi.org/10.1145/1328911.1328913},
doi = {10.1145/1328911.1328913},
timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/FranceschiniG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/GuptaGV08,
author = {Ankur Gupta and
Roberto Grossi and
Jeffrey Scott Vitter},
editor = {Robert Sedgewick and
Wojciech Szpankowski},
title = {Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler
Transform},
booktitle = {Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2008, San Francisco, California, USA, January 19, 2008},
pages = {191--202},
publisher = {{SIAM}},
year = {2008},
url = {https://doi.org/10.1137/1.9781611972986.3},
doi = {10.1137/1.9781611972986.3},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/GuptaGV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/FerraginaGGSV08,
author = {Paolo Ferragina and
Roberto Grossi and
Ankur Gupta and
Rahul Shah and
Jeffrey Scott Vitter},
editor = {Maurizio Lenzerini and
Domenico Lembo},
title = {On searching compressed string collections cache-obliviously},
booktitle = {Proceedings of the Twenty-Seventh {ACM} {SIGMOD-SIGACT-SIGART} Symposium
on Principles of Database Systems, {PODS} 2008, June 9-11, 2008, Vancouver,
BC, Canada},
pages = {181--190},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1376916.1376943},
doi = {10.1145/1376916.1376943},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/FerraginaGGSV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GolynskiGGRR07,
author = {Alexander Golynski and
Roberto Grossi and
Ankur Gupta and
Rajeev Raman and
S. Srinivasa Rao},
editor = {Lars Arge and
Michael Hoffmann and
Emo Welzl},
title = {On the Size of Succinct Indices},
booktitle = {Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel,
October 8-10, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4698},
pages = {371--382},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-75520-3\_34},
doi = {10.1007/978-3-540-75520-3\_34},
timestamp = {Thu, 29 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/GolynskiGGRR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FranceschiniG06,
author = {Gianni Franceschini and
Roberto Grossi},
title = {Optimal Implicit Dictionaries over Unbounded Universes},
journal = {Theory Comput. Syst.},
volume = {39},
number = {2},
pages = {321--345},
year = {2006},
url = {https://doi.org/10.1007/s00224-005-1167-9},
doi = {10.1007/S00224-005-1167-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FranceschiniG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FerraginaGL06,
author = {Paolo Ferragina and
Roberto Grossi and
Fabrizio Luccio},
title = {Foreword},
journal = {Theory Comput. Syst.},
volume = {39},
number = {3},
pages = {389},
year = {2006},
url = {https://doi.org/10.1007/s00224-005-3903-6},
doi = {10.1007/S00224-005-3903-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/FerraginaGL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/FoschiniGGV06,
author = {Luca Foschini and
Roberto Grossi and
Ankur Gupta and
Jeffrey Scott Vitter},
title = {When indexing equals compression: Experiments with compressing suffix
arrays and applications},
journal = {{ACM} Trans. Algorithms},
volume = {2},
number = {4},
pages = {611--639},
year = {2006},
url = {https://doi.org/10.1145/1198513.1198521},
doi = {10.1145/1198513.1198521},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/FoschiniGGV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SadakaneG06,
author = {Kunihiko Sadakane and
Roberto Grossi},
title = {Squeezing succinct data structures into entropy bounds},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {1230--1239},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109693},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/SadakaneG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Bialynicka-BirulaG06,
author = {Iwona Bialynicka{-}Birula and
Roberto Grossi},
editor = {Bruno Durand and
Wolfgang Thomas},
title = {Amortized Rigidness in Dynamic Cartesian Trees},
booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
Science, Marseille, France, February 23-25, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3884},
pages = {80--91},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11672142\_5},
doi = {10.1007/11672142\_5},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Bialynicka-BirulaG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GrossiV05,
author = {Roberto Grossi and
Jeffrey Scott Vitter},
title = {Compressed Suffix Arrays and Suffix Trees with Applications to Text
Indexing and String Matching},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {2},
pages = {378--407},
year = {2005},
url = {https://doi.org/10.1137/S0097539702402354},
doi = {10.1137/S0097539702402354},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GrossiV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/PisantiCGS05,
author = {Nadia Pisanti and
Maxime Crochemore and
Roberto Grossi and
Marie{-}France Sagot},
title = {Bases of Motifs for Generating Repeated Patterns with Wild Cards},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {2},
number = {1},
pages = {40--50},
year = {2005},
url = {https://doi.org/10.1109/TCBB.2005.5},
doi = {10.1109/TCBB.2005.5},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/PisantiCGS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FranceschiniG05,
author = {Gianni Franceschini and
Roberto Grossi},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {Optimal In-place Sorting of Vectors and Records},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {90--102},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_8},
doi = {10.1007/11523468\_8},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FranceschiniG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spire/Bialynicka-BirulaG05,
author = {Iwona Bialynicka{-}Birula and
Roberto Grossi},
editor = {Mariano P. Consens and
Gonzalo Navarro},
title = {Rank-Sensitive Data Structures},
booktitle = {String Processing and Information Retrieval, 12th International Conference,
{SPIRE} 2005, Buenos Aires, Argentina, November 2-4, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3772},
pages = {79--90},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11575832\_10},
doi = {10.1007/11575832\_10},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/spire/Bialynicka-BirulaG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/GeraciG05,
author = {Filippo Geraci and
Roberto Grossi},
editor = {Sotiris E. Nikoletseas},
title = {Distilling Router Data Analysis for Faster and Simpler Dynamic {IP}
Lookup Algorithms},
booktitle = {Experimental and Efficient Algorithms, 4th InternationalWorkshop,
{WEA} 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3503},
pages = {580--592},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11427186\_50},
doi = {10.1007/11427186\_50},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/GeraciG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FranceschiniGMP04,
author = {Gianni Franceschini and
Roberto Grossi and
J. Ian Munro and
Linda Pagli},
title = {Implicit \emph{B}-trees: a new data structure for the dictionary problem},
journal = {J. Comput. Syst. Sci.},
volume = {68},
number = {4},
pages = {788--807},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2003.11.003},
doi = {10.1016/J.JCSS.2003.11.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FranceschiniGMP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/CrochemoreEGM04,
author = {Maxime Crochemore and
Chiara Epifanio and
Roberto Grossi and
Filippo Mignosi},
editor = {S{\"{u}}leyman Cenk Sahinalp and
S. Muthukrishnan and
Ugur Dogrus{\"{o}}z},
title = {A Trie-Based Approach for Compacting Automata},
booktitle = {Combinatorial Pattern Matching, 15th Annual Symposium, {CPM} 2004,
Istanbul,Turkey, July 5-7, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3109},
pages = {145--158},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27801-6\_11},
doi = {10.1007/978-3-540-27801-6\_11},
timestamp = {Fri, 07 May 2021 12:57:04 +0200},
biburl = {https://dblp.org/rec/conf/cpm/CrochemoreEGM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/FoschiniGGV04,
author = {Luca Foschini and
Roberto Grossi and
Ankur Gupta and
Jeffrey Scott Vitter},
title = {Fast Compression with a Static Model in High-Order Entropy},
booktitle = {2004 Data Compression Conference {(DCC} 2004), 23-25 March 2004, Snowbird,
UT, {USA}},
pages = {62--71},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/DCC.2004.1281451},
doi = {10.1109/DCC.2004.1281451},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/FoschiniGGV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FranceschiniG04,
author = {Gianni Franceschini and
Roberto Grossi},
title = {No Sorting? Better Searching!},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {491--498},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.43},
doi = {10.1109/FOCS.2004.43},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FranceschiniG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FranceschiniG04,
author = {Gianni Franceschini and
Roberto Grossi},
editor = {Josep D{\'{\i}}az and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Donald Sannella},
title = {A General Technique for Managing Strings in Comparison-Driven Data
Structures},
booktitle = {Automata, Languages and Programming: 31st International Colloquium,
{ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3142},
pages = {606--617},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27836-8\_52},
doi = {10.1007/978-3-540-27836-8\_52},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FranceschiniG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GrossiGV04,
author = {Roberto Grossi and
Ankur Gupta and
Jeffrey Scott Vitter},
editor = {J. Ian Munro},
title = {When indexing equals compression: experiments with compressing suffix
arrays and applications},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {636--645},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982888},
timestamp = {Fri, 02 Dec 2016 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GrossiGV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CrescenziLGLPR03,
author = {Pierluigi Crescenzi and
Alberto Del Lungo and
Roberto Grossi and
Elena Lodi and
Linda Pagli and
Gianluca Rossi},
title = {Text sparsification via local maxima},
journal = {Theor. Comput. Sci.},
volume = {304},
number = {1-3},
pages = {341--364},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00142-7},
doi = {10.1016/S0304-3975(03)00142-7},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CrescenziLGLPR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FranceschiniG03,
author = {Gianni Franceschini and
Roberto Grossi},
editor = {Jos C. M. Baeten and
Jan Karel Lenstra and
Joachim Parrow and
Gerhard J. Woeginger},
title = {Optimal Cache-Oblivious Implicit Dictionaries},
booktitle = {Automata, Languages and Programming, 30th International Colloquium,
{ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2719},
pages = {316--331},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45061-0\_27},
doi = {10.1007/3-540-45061-0\_27},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FranceschiniG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/PisantiCGS03,
author = {Nadia Pisanti and
Maxime Crochemore and
Roberto Grossi and
Marie{-}France Sagot},
editor = {Branislav Rovan and
Peter Vojt{\'{a}}s},
title = {A Basis of Tiling Motifs for Generating Repeated Patterns and Its
Complexity for Higher Quorum},
booktitle = {Mathematical Foundations of Computer Science 2003, 28th International
Symposium, {MFCS} 2003, Bratislava, Slovakia, August 25-29, 2003,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2747},
pages = {622--631},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45138-9\_56},
doi = {10.1007/978-3-540-45138-9\_56},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/PisantiCGS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FranceschiniG03,
author = {Gianni Franceschini and
Roberto Grossi},
title = {Implicit dictionaries supporting searches and amortized updates in
O(log n log log n) time},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {670--678},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644218},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/FranceschiniG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GrossiGV03,
author = {Roberto Grossi and
Ankur Gupta and
Jeffrey Scott Vitter},
title = {High-order entropy-compressed text indexes},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {841--850},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644250},
timestamp = {Fri, 02 Dec 2016 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/GrossiGV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/FranceschiniG03,
author = {Gianni Franceschini and
Roberto Grossi},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Michiel H. M. Smid},
title = {Optimal Worst-Case Operations for Implicit Cache-Oblivious Search
Trees},
booktitle = {Algorithms and Data Structures, 8th International Workshop, {WADS}
2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2748},
pages = {114--126},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45078-8\_11},
doi = {10.1007/978-3-540-45078-8\_11},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/FranceschiniG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/CrescenziGI03,
author = {Pierluigi Crescenzi and
Roberto Grossi and
Giuseppe F. Italiano},
editor = {Klaus Jansen and
Marian Margraf and
Monaldo Mastrolilli and
Jos{\'{e}} D. P. Rolim},
title = {Search Data Structures for Skewed Strings},
booktitle = {Experimental and Efficient Algorithms, Second International Workshop,
{WEA} 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2647},
pages = {81--96},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44867-5\_7},
doi = {10.1007/3-540-44867-5\_7},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wea/CrescenziGI03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GrossiPP02,
author = {Roberto Grossi and
Andrea Pietracaprina and
Geppino Pucci},
title = {Optimal Deterministic Protocols for Mobile Robots on a Grid},
journal = {Inf. Comput.},
volume = {173},
number = {2},
pages = {132--142},
year = {2002},
url = {https://doi.org/10.1006/inco.2000.3004},
doi = {10.1006/INCO.2000.3004},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GrossiPP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FranceschiniGMP02,
author = {Gianni Franceschini and
Roberto Grossi and
J. Ian Munro and
Linda Pagli},
title = {Implicit B-Trees: New Results for the Dictionary Problem},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {145--154},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1181891},
doi = {10.1109/SFCS.2002.1181891},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FranceschiniGMP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcis/VitterG02,
author = {Jeffrey Scott Vitter and
Roberto Grossi},
editor = {H. John Caulfield and
Shu{-}Heng Chen and
Heng{-}Da Cheng and
Richard J. Duro and
Vasant G. Honavar and
Etienne E. Kerre and
Mi Lu and
Manuel Gra{\~{n}}a Romay and
Timothy K. Shih and
Dan Ventura and
Paul P. Wang and
Yuanyuan Yang},
title = {Compressed Indexes for Fast Search in Sequences},
booktitle = {Proceedings of the 6th Joint Conference on Information Science, March
8-13, 2002, Research Triangle Park, North Carolina, {USA}},
pages = {44--48},
publisher = {{JCIS} / Association for Intelligent Machinery, Inc.},
year = {2002},
timestamp = {Mon, 13 Nov 2017 18:15:11 +0100},
biburl = {https://dblp.org/rec/conf/jcis/VitterG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/CrescenziLGLPR00,
author = {Pierluigi Crescenzi and
Alberto Del Lungo and
Roberto Grossi and
Elena Lodi and
Linda Pagli and
Gianluca Rossi},
editor = {Sanjiv Kapoor and
Sanjiva Prasad},
title = {Text Sparsification via Local Maxima},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
20th Conference, {FST} {TCS} 2000 New Delhi, India, December 13-15,
2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1974},
pages = {290--301},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44450-5\_23},
doi = {10.1007/3-540-44450-5\_23},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/CrescenziLGLPR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GrossiV00,
author = {Roberto Grossi and
Jeffrey Scott Vitter},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Compressed suffix arrays and suffix trees with applications to text
indexing and string matching (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {397--406},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335351},
doi = {10.1145/335305.335351},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GrossiV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GrossiI99,
author = {Roberto Grossi and
Giuseppe F. Italiano},
title = {Efficient Splitting and Merging Algorithms for Order Decomposable
Problems},
journal = {Inf. Comput.},
volume = {154},
number = {1},
pages = {1--33},
year = {1999},
url = {https://doi.org/10.1006/inco.1999.2811},
doi = {10.1006/INCO.1999.2811},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GrossiI99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FerraginaG99,
author = {Paolo Ferragina and
Roberto Grossi},
title = {The String B-tree: {A} New Data Structure for String Search in External
Memory and Its Applications},
journal = {J. {ACM}},
volume = {46},
number = {2},
pages = {236--280},
year = {1999},
url = {https://doi.org/10.1145/301970.301973},
doi = {10.1145/301970.301973},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FerraginaG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FerraginaG99,
author = {Paolo Ferragina and
Roberto Grossi},
title = {Improved Dynamic Text Indexing},
journal = {J. Algorithms},
volume = {31},
number = {2},
pages = {291--319},
year = {1999},
url = {https://doi.org/10.1006/jagm.1998.0999},
doi = {10.1006/JAGM.1998.0999},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/FerraginaG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/GiancarloG99,
author = {Raffaele Giancarlo and
Roberto Grossi},
title = {Parallel Construction and Query of Index Data Structures for Pattern
Matching on Square Matrices},
journal = {J. Complex.},
volume = {15},
number = {1},
pages = {30--71},
year = {1999},
url = {https://doi.org/10.1006/jcom.1998.0496},
doi = {10.1006/JCOM.1998.0496},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/GiancarloG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CrescenziDG99,
author = {Pierluigi Crescenzi and
Leandro Dardini and
Roberto Grossi},
editor = {Jaroslav Nesetril},
title = {{IP} Address Lookup Made Fast and Simple},
booktitle = {Algorithms - {ESA} '99, 7th Annual European Symposium, Prague, Czech
Republic, July 16-18, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1643},
pages = {65--76},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48481-7\_7},
doi = {10.1007/3-540-48481-7\_7},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/CrescenziDG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GrossiI99,
author = {Roberto Grossi and
Giuseppe F. Italiano},
editor = {Jir{\'{\i}} Wiedermann and
Peter van Emde Boas and
Mogens Nielsen},
title = {Efficient Techniques for Maintaining Multidimensional Keys in Linked
Data Structures},
booktitle = {Automata, Languages and Programming, 26th International Colloquium,
ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1644},
pages = {372--381},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48523-6\_34},
doi = {10.1007/3-540-48523-6\_34},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GrossiI99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icmcs/BelliniLGGG99,
author = {Alessandro Bellini and
Alberto Del Lungo and
Fabio Gori and
Roberto Grossi and
Marco Guarducci},
title = {A Fast {H.261} Software Codec for High Quality Videoconferencing on
PCs},
booktitle = {{IEEE} International Conference on Multimedia Computing and Systems,
{ICMCS} 1999, Florence, Italy, June 7-11, 1999. Volume {II}},
pages = {1007--1008},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/MMCS.1999.778636},
doi = {10.1109/MMCS.1999.778636},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icmcs/BelliniLGGG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GrossiL98,
author = {Roberto Grossi and
Elena Lodi},
title = {Simple Planar Graph Partition into Three Forests},
journal = {Discret. Appl. Math.},
volume = {84},
number = {1-3},
pages = {121--132},
year = {1998},
url = {https://doi.org/10.1016/S0166-218X(98)00007-9},
doi = {10.1016/S0166-218X(98)00007-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GrossiL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FerraginaG98,
author = {Paolo Ferragina and
Roberto Grossi},
title = {Optimal On-Line Search and Sublinear Time Update in String Matching},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {3},
pages = {713--736},
year = {1998},
url = {https://doi.org/10.1137/S0097539795286119},
doi = {10.1137/S0097539795286119},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FerraginaG98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FerraginaGM98,
author = {Paolo Ferragina and
Roberto Grossi and
Manuela Montangero},
title = {On Updating Suffix Tree Labels},
journal = {Theor. Comput. Sci.},
volume = {201},
number = {1-2},
pages = {249--262},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00243-0},
doi = {10.1016/S0304-3975(97)00243-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FerraginaGM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/GrossiI98,
author = {Roberto Grossi and
Giuseppe F. Italiano},
editor = {James M. Abello and
Jeffrey Scott Vitter},
title = {Efficient cross-trees for external memory},
booktitle = {External Memory Algorithms, Proceedings of a {DIMACS} Workshop, New
Brunswick, New Jersey, USA, May 20-22, 1998},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {50},
pages = {87--106},
publisher = {{DIMACS/AMS}},
year = {1998},
url = {https://doi.org/10.1090/dimacs/050/04},
doi = {10.1090/DIMACS/050/04},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/GrossiI98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GrossiPP98,
author = {Roberto Grossi and
Andrea Pietracaprina and
Geppino Pucci},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Optimal Deterministic Protocols for Mobile Robots on a Grid},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {181--192},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054366},
doi = {10.1007/BFB0054366},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/GrossiPP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GiancarloG97,
author = {Raffaele Giancarlo and
Roberto Grossi},
title = {Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data
Structures and Optimal On-Line Search Algorithms},
journal = {J. Algorithms},
volume = {24},
number = {2},
pages = {223--265},
year = {1997},
url = {https://doi.org/10.1006/jagm.1996.0844},
doi = {10.1006/JAGM.1996.0844},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/GiancarloG97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/FerraginaGM97,
author = {Paolo Ferragina and
Roberto Grossi and
Manuela Montangero},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {A Note on Updating Suffix Tree Labels},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {181--192},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_71},
doi = {10.1007/3-540-62592-5\_71},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/FerraginaGM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GrossiI97,
author = {Roberto Grossi and
Giuseppe F. Italiano},
editor = {Pierpaolo Degano and
Roberto Gorrieri and
Alberto Marchetti{-}Spaccamela},
title = {Efficient Splitting and Merging Algorithms for Order Decomposable
Problems (Extended Abstract)},
booktitle = {Automata, Languages and Programming, 24th International Colloquium,
ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1256},
pages = {605--615},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63165-8\_215},
doi = {10.1007/3-540-63165-8\_215},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GrossiI97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sequences/ArgeFGV97,
author = {Lars Arge and
Paolo Ferragina and
Roberto Grossi and
Jeffrey Scott Vitter},
editor = {Bruno Carpentieri and
Alfredo De Santis and
Ugo Vaccaro and
James A. Storer},
title = {Sequence sorting in secondary storage},
booktitle = {Compression and Complexity of {SEQUENCES} 1997, Positano, Amalfitan
Coast, Salerno, Italy, June 11-13, 1997, Proceedings},
pages = {329--346},
publisher = {{IEEE}},
year = {1997},
url = {https://doi.org/10.1109/SEQUEN.1997.666927},
doi = {10.1109/SEQUEN.1997.666927},
timestamp = {Wed, 16 Oct 2019 14:14:56 +0200},
biburl = {https://dblp.org/rec/conf/sequences/ArgeFGV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ArgeFGV97,
author = {Lars Arge and
Paolo Ferragina and
Roberto Grossi and
Jeffrey Scott Vitter},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {On Sorting Strings in External Memory (Extended Abstract)},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {540--548},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258647},
doi = {10.1145/258533.258647},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ArgeFGV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/ox/p/GiancarloG97,
author = {Raffaele Giancarlo and
Roberto Grossi},
editor = {Alberto Apostolico and
Zvi Galil},
title = {Suffix tree data structures for matrices},
booktitle = {Pattern Matching Algorithms},
pages = {293--340},
publisher = {Oxford University Press},
year = {1997},
timestamp = {Thu, 12 Jan 2017 08:03:38 +0100},
biburl = {https://dblp.org/rec/books/ox/p/GiancarloG97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GiancarloG96,
author = {Raffaele Giancarlo and
Roberto Grossi},
title = {On the Construction of Classes of Suffix Trees for Square Matrices:
Algorithms and Applications},
journal = {Inf. Comput.},
volume = {130},
number = {2},
pages = {151--182},
year = {1996},
url = {https://doi.org/10.1006/inco.1996.0087},
doi = {10.1006/INCO.1996.0087},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GiancarloG96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FerraginaG96,
author = {Paolo Ferragina and
Roberto Grossi},
editor = {{\'{E}}va Tardos},
title = {Fast String Searching in Secondary Storage: Theoretical Developments
And Experimental Results},
booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
pages = {373--382},
publisher = {{ACM/SIAM}},
year = {1996},
url = {http://dl.acm.org/citation.cfm?id=313852.314086},
timestamp = {Thu, 05 Jul 2018 07:29:31 +0200},
biburl = {https://dblp.org/rec/conf/soda/FerraginaG96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/GiancarloG95,
author = {Raffaele Giancarlo and
Roberto Grossi},
editor = {Zvi Galil and
Esko Ukkonen},
title = {Multi-Dimensional Pattern Matching with Dimensional Wildcards},
booktitle = {Combinatorial Pattern Matching, 6th Annual Symposium, {CPM} 95, Espoo,
Finland, July 5-7, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {937},
pages = {90--101},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60044-2\_37},
doi = {10.1007/3-540-60044-2\_37},
timestamp = {Thu, 29 Aug 2019 15:20:22 +0200},
biburl = {https://dblp.org/rec/conf/cpm/GiancarloG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FerraginaG95,
author = {Paolo Ferragina and
Roberto Grossi},
title = {Optimal On-Line Search and Sublinear Time Update in String Matching},
booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
Wisconsin, USA, 23-25 October 1995},
pages = {604--612},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SFCS.1995.492590},
doi = {10.1109/SFCS.1995.492590},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FerraginaG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GiancarloG95,
author = {Raffaele Giancarlo and
Roberto Grossi},
editor = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Ferenc G{\'{e}}cseg},
title = {On the Construction of Classes of Suffix Trees for Square Matrices:
Algorithms and Applications},
booktitle = {Automata, Languages and Programming, 22nd International Colloquium,
ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {944},
pages = {111--122},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60084-1\_67},
doi = {10.1007/3-540-60084-1\_67},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GiancarloG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FerraginaG95,
author = {Paolo Ferragina and
Roberto Grossi},
editor = {Kenneth L. Clarkson},
title = {Fast Incremental Text Editing},
booktitle = {Proceedings of the Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
22-24 January 1995. San Francisco, California, {USA}},
pages = {531--540},
publisher = {{ACM/SIAM}},
year = {1995},
url = {http://dl.acm.org/citation.cfm?id=313651.313815},
timestamp = {Thu, 05 Jul 2018 07:29:25 +0200},
biburl = {https://dblp.org/rec/conf/soda/FerraginaG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FerraginaG95,
author = {Paolo Ferragina and
Roberto Grossi},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {A fully-dynamic data structure for external substring search (Extended
Abstract)},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {693--702},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225287},
doi = {10.1145/225058.225287},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FerraginaG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Grossi93,
author = {Roberto Grossi},
title = {On Finding Commong Subtrees},
journal = {Theor. Comput. Sci.},
volume = {108},
number = {2},
pages = {345--356},
year = {1993},
url = {https://doi.org/10.1016/0304-3975(93)90198-3},
doi = {10.1016/0304-3975(93)90198-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Grossi93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/GiancarloG93,
author = {Raffaele Giancarlo and
Roberto Grossi},
editor = {Lawrence Snyder},
title = {Parallel Construction and Query of Suffix Trees for Two-Dimensional
Matrices},
booktitle = {Proceedings of the 5th Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '93, Velen, Germany, June 30 - July 2, 1993},
pages = {86--97},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/165231.165243},
doi = {10.1145/165231.165243},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/GiancarloG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/integration/Grossi92,
author = {Roberto Grossi},
title = {A fast {VLSI} solution for approximate string matching},
journal = {Integr.},
volume = {13},
number = {2},
pages = {195--206},
year = {1992},
url = {https://doi.org/10.1016/0167-9260(92)90005-J},
doi = {10.1016/0167-9260(92)90005-J},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/integration/Grossi92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Grossi91,
author = {Roberto Grossi},
title = {A Note on the Subtree Isomorphism for Ordered Trees and Related Problems},
journal = {Inf. Process. Lett.},
volume = {39},
number = {2},
pages = {81--84},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90159-F},
doi = {10.1016/0020-0190(91)90159-F},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Grossi91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Grossi91a,
author = {Roberto Grossi},
title = {Further Comments on the Subtree Isomorphism for Ordered Trees},
journal = {Inf. Process. Lett.},
volume = {40},
number = {5},
pages = {255--256},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90119-3},
doi = {10.1016/0020-0190(91)90119-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Grossi91a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrossiL89,
author = {Roberto Grossi and
Fabrizio Luccio},
title = {Simple and Efficient String Matching with k Mismatches},
journal = {Inf. Process. Lett.},
volume = {33},
number = {3},
pages = {113--120},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90188-9},
doi = {10.1016/0020-0190(89)90188-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrossiL89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:53 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:
