default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoberto Grossi
Person information
- affiliation: University of Pisa, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j61]Giulia Punzi, Alessio Conte, Roberto Grossi, Romeo Rizzi:
Refined Bounds on the Number of Eulerian Tours in Undirected Graphs. Algorithmica 86(1): 194-217 (2024)- [j60]Huiping Chen
, Alessio Conte, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Michelle Sweering:
On Breaking Truss-based and Core-based Communities. ACM Trans. Knowl. Discov. Data 18(6): 135:1-135:43 (2024) - [c113]Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Veronica Guerrini, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis:
Utility-Oriented String Mining. SDM 2024: 190-198 - [c112]Rocco Ascone, Giulia Bernardini, Alessio Conte, Massimo Equi, Estéban Gabory, Roberto Grossi, Nadia Pisanti:
A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs. WABI 2024: 14:1-14:21 - [c111]Giovanni Buzzega, Alessio Conte, Roberto Grossi, Giulia Punzi:
McDag: Indexing Maximal Common Subsequences in Practice. WABI 2024: 21:1-21:18 - [i25]Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa:
Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. CoRR abs/2405.13613 (2024) - 2023
- [j59]Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone, Lorenzo Tattini:
phyBWT2: phylogeny reconstruction via eBWT positional clustering. Algorithms Mol. Biol. 18(1): 11 (2023) - [j58]Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct representation for (non)deterministic finite automata. J. Comput. Syst. Sci. 131: 1-12 (2023) - [j57]Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu, Roberto Grossi:
On the Complexity of String Matching for Graphs. ACM Trans. Algorithms 19(3): 21:1-21:25 (2023) - [j56]Giulia Bernardini, Alessio Conte, Garance Gourdel, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi, Leen Stougie, Michelle Sweering:
Hide and Mine in Strings: Hardness, Algorithms, and Experiments. IEEE Trans. Knowl. Data Eng. 35(6): 5948-5963 (2023) - [c110]Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno:
A Compact DAG for Storing and Searching Maximal Common Subsequences. ISAAC 2023: 21:1-21:15 - [c109]Giulia Punzi, Alessio Conte, Roberto Grossi, Andrea Marino:
An Efficient Algorithm for Assessing the Number of st-Paths in Large Graphs. SDM 2023: 289-297 - [c108]Alessio Conte, Roberto Grossi, Davide Rucci:
CAGE: Cache-Aware Graphlet Enumeration. SPIRE 2023: 129-142 - [c107]Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba:
Finding the Cyclic Covers of a String. WALCOM 2023: 139-150 - [i24]Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno:
A Compact DAG for Storing and Searching Maximal Common Subsequences. CoRR abs/2307.13695 (2023) - 2022
- [j55]Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno:
Enumeration of Maximal Common Subsequences Between Two Strings. Algorithmica 84(3): 757-783 (2022) - [j54]Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari:
Proximity Search for Maximal Subgraph Enumeration. SIAM J. Comput. 51(5): 1580-1625 (2022) - [c106]Giulia Bernardini, Alessio Conte, Estéban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, Michelle Sweering:
On Strings Having the Same Length- k Substrings. CPM 2022: 16:1-16:17 - [c105]Veronica Guerrini, Alessio Conte, Roberto Grossi, Gianni Liti, Giovanna Rosone, Lorenzo Tattini:
phyBWT: Alignment-Free Phylogeny via eBWT Positional Clustering. WABI 2022: 23:1-23:19 - 2021
- [j53]Davide Bacciu, Alessio Conte, Roberto Grossi, Francesco Landolfi, Andrea Marino:
K-plex cover pooling for graph neural networks. Data Min. Knowl. Discov. 35(5): 2200-2220 (2021) - [j52]Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone, Michelle Sweering:
Combinatorial Algorithms for String Sanitization. ACM Trans. Knowl. Discov. Data 15(1): 8:1-8:34 (2021) - [c104]Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi:
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails. FCT 2021: 162-175 - [c103]Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Michelle Sweering:
On Breaking Truss-Based Communities. KDD 2021: 117-126 - [c102]Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Representations for (Non)Deterministic Finite Automata. LATA 2021: 55-67 - 2020
- [j51]Alessio Conte, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari:
Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs. IEEE Access 8: 139096-139109 (2020) - [j50]Luca Versari, Iulia-Maria Comsa, Alessio Conte, Roberto Grossi:
Zuckerli: A New Compressed Representation for Graphs. IEEE Access 8: 219233-219243 (2020) - [j49]Vicente Acuña, Roberto Grossi, Giuseppe Francesco Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri:
On Bubble Generators in Directed Graphs. Algorithmica 82(4): 898-914 (2020) - [j48]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs. Algorithmica 82(6): 1547-1573 (2020) - [j47]Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Comparing Degenerate Strings. Fundam. Informaticae 175(1-4): 41-58 (2020) - [j46]Alessio Conte, Roberto Grossi, Andrea Marino:
Large-scale clique cover of real-world networks. Inf. Comput. 270 (2020) - [j45]Nadia Pisanti, Charles J. Colbourn, Roberto Grossi:
Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019). Theory Comput. Syst. 64(7): 1155-1157 (2020) - [j44]Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest property-preserved common factor: A new string-processing framework. Theor. Comput. Sci. 812: 244-251 (2020) - [c101]Shima Moghtasedi, Cristina Ioana Muntean, Franco Maria Nardini, Roberto Grossi, Andrea Marino:
High-Quality Prediction of Tourist Movements using Temporal Trajectories in Graphs. ASONAM 2020: 348-352 - [c100]Mai Alzamel, Alessio Conte, Shuhei Denzumi, Roberto Grossi, Costas S. Iliopoulos, Kazuhiro Kurita, Kunihiro Wasa:
Finding the Anticover of a String. CPM 2020: 2:1-2:11 - [c99]Giulia Bernardini, Alessio Conte, Garance Gourdel, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi, Leen Stougie, Michelle Sweering:
Hide and Mine in Strings: Hardness and Algorithms. ICDM 2020: 924-929 - [c98]Roberto Grossi, Andrea Marino, Shima Moghtasedi:
Finding Structurally and Temporally Similar Trajectories in Graphs. SEA 2020: 24:1-24:13 - [i23]Luca Versari, Iulia M. Comsa, Alessio Conte, Roberto Grossi:
Zuckerli: A New Compressed Representation for Graphs. CoRR abs/2009.01353 (2020) - [i22]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Efficient Estimation of Graph Trussness. CoRR abs/2010.00967 (2020)
2010 – 2019
- 2019
- [j43]Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari:
A fast discovery algorithm for large common connected induced subgraphs. Discret. Appl. Math. 268: 210-222 (2019) - [j42]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties. SIAM J. Discret. Math. 33(2): 587-613 (2019) - [c97]Massimo Equi, Roberto Grossi, Veli Mäkinen, Alexandru I. Tomescu:
On the Complexity of String Matching for Graphs. ICALP 2019: 55:1-55:15 - [c96]Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa:
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs. MFCS 2019: 73:1-73:14 - [c95]Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
String Sanitization: A Combinatorial Approach. ECML/PKDD (1) 2019: 627-644 - [c94]Alessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno:
Polynomial-Delay Enumeration of Maximal Common Subsequences. SPIRE 2019: 189-202 - [e3]Charles J. Colbourn, Roberto Grossi, Nadia Pisanti:
Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings. Lecture Notes in Computer Science 11638, Springer 2019, ISBN 978-3-030-25004-1 [contents] - [i21]Massimo Equi, Roberto Grossi, Veli Mäkinen:
On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree. CoRR abs/1901.05264 (2019) - [i20]Massimo Equi, Roberto Grossi, Alexandru I. Tomescu, Veli Mäkinen:
On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching. CoRR abs/1902.03560 (2019) - [i19]Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
String Sanitization: A Combinatorial Approach. CoRR abs/1906.11030 (2019) - [i18]Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Representation for (Non)Deterministic Finite Automata. CoRR abs/1907.09271 (2019) - [i17]Alessio Conte, Andrea Marino, Roberto Grossi, Takeaki Uno, Luca Versari:
Proximity Search For Maximal Subgraph Enumeration. CoRR abs/1912.13446 (2019) - 2018
- [j41]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi:
Efficient enumeration of graph orientations with sources. Discret. Appl. Math. 246: 22-37 (2018) - [j40]Roberto Grossi, Giulia Menconi, Nadia Pisanti, Roberto Trani, Søren Vind:
Motif trie: An efficient text index for pattern discovery with don't cares. Theor. Comput. Sci. 710: 74-87 (2018) - [c93]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search. COCOON 2018: 328-340 - [c92]Roberto Grossi, Luca Versari:
Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables. ESA 2018: 43:1-43:14 - [c91]Alessio Conte, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari:
Discovering $k$-Trusses in Large-Scale Networks. HPEC 2018: 1-6 - [c90]Alessio Conte, Tiziano De Matteis, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari:
D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes. KDD 2018: 1272-1281 - [c89]Alessio Conte, Gaspare Ferraro, Roberto Grossi, Andrea Marino, Kunihiko Sadakane, Takeaki Uno:
Node Similarity with q -Grams for Real-World Labeled Networks. KDD 2018: 1282-1291 - [c88]Roberto Grossi, Andrea Marino, Luca Versari:
Efficient Algorithms for Listing k Disjoint st-Paths in Graphs. LATIN 2018: 544-557 - [c87]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari:
Listing Subgraphs by Cartesian Decomposition. MFCS 2018: 84:1-84:16 - [c86]Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest Property-Preserved Common Factor. SPIRE 2018: 42-49 - [c85]Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg:
Compressed Communication Complexity of Longest Common Prefixes. SPIRE 2018: 74-87 - [c84]Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Degenerate String Comparison and Applications. WABI 2018: 21:1-21:14 - [c83]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Takeaki Uno, Luca Versari:
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts. WG 2018: 100-110 - [i16]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Listing Maximal Subgraphs in Strongly Accessible Set Systems. CoRR abs/1803.03659 (2018) - [i15]Roberto Grossi, Luca Versari:
Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables. CoRR abs/1805.03158 (2018) - [i14]Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg:
Compressed Communication Complexity of Longest Common Prefixes. CoRR abs/1806.03102 (2018) - [i13]Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest Property-Preserved Common Factor. CoRR abs/1810.02099 (2018) - 2017
- [j39]Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao:
Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries. ACM Trans. Algorithms 13(2): 28:1-28:31 (2017) - [c82]Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari:
A Fast Algorithm for Large Common Connected Induced Subgraphs. AlCoB 2017: 62-74 - [c81]Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari:
On-Line Pattern Matching on Similar Texts. CPM 2017: 9:1-9:14 - [c80]Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari:
Listing Maximal Independent Sets with Minimal Space and Bounded Delay. SPIRE 2017: 144-160 - [c79]Vicente Acuña, Roberto Grossi, Giuseppe F. Italiano, Leandro Lima, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Blerina Sinaimeri:
On Bubble Generators in Directed Graphs. WG 2017: 18-31 - 2016
- [j38]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11: 12 (2016) - [j37]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Erratum to: Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11: 21 (2016) - [j36]Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi:
Linear-size suffix tries. Theor. Comput. Sci. 638: 171-178 (2016) - [c78]Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari:
Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques. ICALP 2016: 148:1-148:15 - [c77]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari:
Directing Road Networks by Listing Strong Orientations. IWOCA 2016: 83-95 - [c76]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi:
Listing Acyclic Orientations of Graphs with Single and Multiple Sources. LATIN 2016: 319-333 - [c75]Alessio Conte, Roberto Grossi, Andrea Marino:
Clique covering of large real-world networks. SAC 2016: 1134-1139 - [c74]Massimo Cairo, Roberto Grossi, Romeo Rizzi:
New Bounds for Approximating Extremal Distances in Undirected Graphs. SODA 2016: 363-376 - [e2]Roberto Grossi, Moshe Lewenstein:
27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, June 27-29, 2016, Tel Aviv, Israel. LIPIcs 54, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-012-5 [contents] - [r2]Roberto Grossi:
Enumeration of Paths, Cycles, and Spanning Trees. Encyclopedia of Algorithms 2016: 640-645 - [r1]Roberto Grossi:
Wavelet Trees. Encyclopedia of Algorithms 2016: 2355-2359 - 2015
- [j35]Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau:
Computing the Burrows-Wheeler transform in place and in small space. J. Discrete Algorithms 32: 44-52 (2015) - [c73]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi:
Enumerating Cyclic Orientations of a Graph. IWOCA 2015: 88-99 - [c72]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Circular Sequence Comparison with q-grams. WABI 2015: 203-216 - [i12]Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi:
Enumerating Cyclic Orientations of a Graph. CoRR abs/1506.05977 (2015) - 2014
- [j34]Roberto Grossi, Giuseppe Ottaviano:
Fast Compressed Tries through Path Decompositions. ACM J. Exp. Algorithmics 19(1) (2014) - [j33]Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing. SIAM J. Comput. 43(4): 1396-1416 (2014) - [j32]Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann:
Towards optimal packed string matching. Theor. Comput. Sci. 525: 111-129 (2014) - [c71]Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot:
Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. ESA 2014: 418-429 - [c70]Roberto Grossi, Giulia Menconi, Nadia Pisanti, Roberto Trani, Søren Vind:
Output-Sensitive Pattern Extraction in Sequences. FSTTCS 2014: 303-314 - [c69]Roberto Grossi, Søren Vind:
Colored Range Searching in Linear Space. SWAT 2014: 229-240 - [i11]Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot:
Amortized Õ(|V|)-Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. CoRR abs/1408.1265 (2014) - 2013
- [j31]Giulia Menconi, Giovanni Battaglia, Roberto Grossi, Nadia Pisanti, Roberto Marangoni:
Mobilomics in Saccharomyces cerevisiae strains. BMC Bioinform. 14: 102 (2013) - [j30]Roberto Grossi, Fabrizio Sebastiani, Fabrizio Silvestri:
Editorial. J. Discrete Algorithms 18: 1-2 (2013) - [j29]Dany Breslauer, Roberto Grossi, Filippo Mignosi:
Simple real-time constant-space string matching. Theor. Comput. Sci. 483: 2-9 (2013) - [j28]Pilu Crescenzi, Roberto Grossi, Michel Habib, Leonardo Lanzi, Andrea Marino:
On computing the diameter of real-world undirected graphs. Theor. Comput. Sci. 514: 84-95 (2013) - [c68]Roberto Grossi:
Random Access to High-Order Entropy Compressed Text. Space-Efficient Data Structures, Streams, and Algorithms 2013: 199-215 - [c67]Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau:
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform. CPM 2013: 74-82 - [c66]Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti:
Encodings for Range Selection and Top-k Queries. ESA 2013: 553-564 - [c65]Roberto Grossi, Rajeev Raman, Srinivasa Rao Satti, Rossano Venturini:
Dynamic Compressed Strings with Random Access. ICALP (1) 2013: 504-515 - [c64]Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Sacomoto:
Optimal Listing of Cycles and st-Paths in Undirected Graphs. SODA 2013: 1884-1896 - [c63]Roberto Grossi:
Pattern Discovery and Listing in Graphs. SPIRE 2013: 2 - [c62]Roberto Grossi, Giuseppe Ottaviano:
Design of Practical Succinct Data Structures for Large Data Collections. SEA 2013: 5-17 - [i10]Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing. CoRR abs/1306.0406 (2013) - 2012
- [j27]Giovanni Battaglia, Roberto Grossi, Noemi Scutellà:
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings. Inf. Comput. 219: 58-70 (2012) - [c61]Giuseppe Ottaviano, Roberto Grossi:
Fast Compressed Tries through Path Decompositions. ALENEX 2012: 65-74 - [c60]Giulia Menconi, Giovanni Battaglia, Roberto Grossi, Nadia Pisanti, Roberto Marangoni:
A Taste of Yeast Mobilomics. BIOINFORMATICS 2012: 271-274 - [c59]Dany Breslauer, Leszek Gasieniec, Roberto Grossi:
Constant-Time Word-Size String Matching. CPM 2012: 83-96 - [c58]Roberto Grossi, Giuseppe Ottaviano:
The wavelet trie: maintaining an indexed sequence of strings in compressed space. PODS 2012: 203-214 - [c57]Etienne Birmelé, Pierluigi Crescenzi, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot:
Efficient Bubble Enumeration in Directed Graphs. SPIRE 2012: 118-129 - [c56]Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino:
On Computing the Diameter of Real-World Directed (Weighted) Graphs. SEA 2012: 99-110 - [i9]Roberto Grossi, Giuseppe Ottaviano:
The Wavelet Trie: Maintaining an Indexed Sequence of Strings in Compressed Space. CoRR abs/1204.3581 (2012) - [i8]Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot:
Optimal Listing of Cycles and st-Paths in Undirected Graphs. CoRR abs/1205.2766 (2012) - 2011
- [j26]Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin:
MADMX: A Strategy for Maximal Dense Motif Extraction. J. Comput. Biol. 18(4): 535-545 (2011) - [j25]Roberto Grossi:
A quick tour on suffix arrays and compressed suffix arrays. Theor. Comput. Sci. 412(27): 2964-2973 (2011) - [c55]Giulia Menconi, Giovanni Battaglia, Roberto Grossi, Nadia Pisanti, Roberto Marangoni:
Inferring Mobile Elements in S. Cerevisiae Strains. BIOINFORMATICS 2011: 131-136 - [c54]Roberto Grossi, Jeffrey Scott Vitter, Bojian Xu:
Wavelet Trees: From Theory to Practice. CCP 2011: 210-221 - [c53]Giuseppe Ottaviano, Roberto Grossi:
Semi-indexing semi-structured data in tiny space. CIKM 2011: 1485-1494 - [c52]Dany Breslauer, Roberto Grossi, Filippo Mignosi:
Simple Real-Time Constant-Space String Matching. CPM 2011: 173-183 - [c51]Giovanni Battaglia, Roberto Grossi, Noemi Scutellà:
Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees. Developments in Language Theory 2011: 58-69 - [c50]Rui A. Ferreira, Roberto Grossi, Romeo Rizzi:
Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs. ESA 2011: 275-286 - [c49]Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann:
Optimal Packed String Matching. FSTTCS 2011: 423-432 - [c48]Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi, Andrea Marino:
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs. TAPAS 2011: 92-103 - [e1]Roberto Grossi, Fabrizio Sebastiani, Fabrizio Silvestri:
String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings. Lecture Notes in Computer Science 7024, Springer 2011, ISBN 978-3-642-24582-4 [contents] - [i7]Giovanni Battaglia, Roberto Grossi, Noemi Scutellà:
Consecutive Ones Property and PQ-Trees for Multisets: Hardness of Counting Their Orderings. CoRR abs/1102.0041 (2011) - [i6]Gianni Franceschini, Roberto Grossi, S. Muthukrishnan:
Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection. CoRR abs/1110.3381 (2011) - [i5]Roberto Grossi, Giuseppe Ottaviano:
Fast Compressed Tries through Path Decompositions. CoRR abs/1111.5220 (2011) - 2010
- [c47]Pierluigi Crescenzi, Roberto Grossi, Claudio Imbrenda, Leonardo Lanzi, Andrea Marino:
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound. ESA (1) 2010: 302-313 - [c46]Roberto Grossi, Alessio Orlandi, Giuseppe Ottaviano:
Fun with Olympiad in Algorithmics. FUN 2010: 1-2 - [c45]Roberto Grossi, Alessio Orlandi, Rajeev Raman:
Optimal Trade-Offs for Succinct String Indexes. ICALP (1) 2010: 678-689 - [i4]Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin:
MADMX: A Novel Strategy for Maximal Dense Motif Extraction. CoRR abs/1002.0874 (2010) - [i3]Roberto Grossi, Alessio Orlandi, Rajeev Raman:
Optimal Trade-Off for Succinct String Indexes. CoRR abs/1006.5354 (2010)
2000 – 2009
- 2009
- [j24]Giovanni Battaglia, Davide Cangelosi, Roberto Grossi, Nadia Pisanti:
Masking patterns in sequences: A new class of motif discovery with don't cares. Theor. Comput. Sci. 410(43): 4327-4340 (2009) - [c44]Roberto Grossi:
Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques. CPM 2009: 39-40 - [c43]Giovanni Battaglia, Roberto Grossi, Roberto Marangoni, Nadia Pisanti:
Mining Biological Sequences with Masks. DEXA Workshops 2009: 193-197 - [c42]Gianni Franceschini, Roberto Grossi, S. Muthukrishnan:
Optimal Cache-Aware Suffix Selection. STACS 2009: 457-468 - [c41]Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao:
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. STACS 2009: 517-528 - [c40]Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin:
MADMX: A Novel Strategy for Maximal Dense Motif Extraction. WABI 2009: 362-374 - [i2]Gianni Franceschini, Roberto Grossi, S. Muthukrishnan:
Optimal cache-aware suffix selection. CoRR abs/0902.1737 (2009) - [i1]Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao:
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. CoRR abs/0902.2648 (2009) - 2008
- [j23]Gianni Franceschini, Roberto Grossi:
No sorting? better searching! ACM Trans. Algorithms 4(1): 2:1-2:13 (2008) - [c39]Ankur Gupta, Roberto Grossi, Jeffrey Scott Vitter:
Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform. ANALCO 2008: 191-202 - [c38]Paolo Ferragina, Roberto Grossi, Ankur Gupta, Rahul Shah, Jeffrey Scott Vitter:
On searching compressed string collections cache-obliviously. PODS 2008: 181-190 - 2007
- [c37]Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao:
On the Size of Succinct Indices. ESA 2007: 371-382 - 2006
- [j22]Gianni Franceschini, Roberto Grossi:
Optimal Implicit Dictionaries over Unbounded Universes. Theory Comput. Syst. 39(2): 321-345 (2006) - [j21]Paolo Ferragina, Roberto Grossi, Fabrizio Luccio:
Foreword. Theory Comput. Syst. 39(3): 389 (2006) - [j20]Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter:
When indexing equals compression: Experiments with compressing suffix arrays and applications. ACM Trans. Algorithms 2(4): 611-639 (2006) - [c36]Kunihiko Sadakane, Roberto Grossi:
Squeezing succinct data structures into entropy bounds. SODA 2006: 1230-1239 - [c35]Iwona Bialynicka-Birula, Roberto Grossi:
Amortized Rigidness in Dynamic Cartesian Trees. STACS 2006: 80-91 - 2005
- [j19]Roberto Grossi, Jeffrey Scott Vitter:
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. SIAM J. Comput. 35(2): 378-407 (2005) - [j18]Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot:
Bases of Motifs for Generating Repeated Patterns with Wild Cards. IEEE ACM Trans. Comput. Biol. Bioinform. 2(1): 40-50 (2005) - [c34]Gianni Franceschini, Roberto Grossi:
Optimal In-place Sorting of Vectors and Records. ICALP 2005: 90-102 - [c33]Iwona Bialynicka-Birula, Roberto Grossi:
Rank-Sensitive Data Structures. SPIRE 2005: 79-90 - [c32]Filippo Geraci, Roberto Grossi:
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms. WEA 2005: 580-592 - 2004
- [j17]Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli:
Implicit B-trees: a new data structure for the dictionary problem. J. Comput. Syst. Sci. 68(4): 788-807 (2004) - [c31]Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi:
A Trie-Based Approach for Compacting Automata. CPM 2004: 145-158 - [c30]Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter:
Fast Compression with a Static Model in High-Order Entropy. Data Compression Conference 2004: 62-71 - [c29]Gianni Franceschini, Roberto Grossi:
No Sorting? Better Searching! FOCS 2004: 491-498 - [c28]Gianni Franceschini, Roberto Grossi:
A General Technique for Managing Strings in Comparison-Driven Data Structures. ICALP 2004: 606-617 - [c27]Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter:
When indexing equals compression: experiments with compressing suffix arrays and applications. SODA 2004: 636-645 - 2003
- [j16]Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi:
Text sparsification via local maxima. Theor. Comput. Sci. 304(1-3): 341-364 (2003) - [c26]Gianni Franceschini, Roberto Grossi:
Optimal Cache-Oblivious Implicit Dictionaries. ICALP 2003: 316-331 - [c25]Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot:
A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum. MFCS 2003: 622-631 - [c24]Gianni Franceschini, Roberto Grossi:
Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time. SODA 2003: 670-678 - [c23]Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter:
High-order entropy-compressed text indexes. SODA 2003: 841-850 - [c22]Gianni Franceschini, Roberto Grossi:
Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees. WADS 2003: 114-126 - [c21]Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano:
Search Data Structures for Skewed Strings. WEA 2003: 81-96 - 2002
- [j15]Roberto Grossi, Andrea Pietracaprina, Geppino Pucci:
Optimal Deterministic Protocols for Mobile Robots on a Grid. Inf. Comput. 173(2): 132-142 (2002) - [c20]Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli:
Implicit B-Trees: New Results for the Dictionary Problem. FOCS 2002: 145-154 - [c19]Jeffrey Scott Vitter, Roberto Grossi:
Compressed Indexes for Fast Search in Sequences. JCIS 2002: 44-48 - 2000
- [c18]Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi:
Text Sparsification via Local Maxima. FSTTCS 2000: 290-301 - [c17]Roberto Grossi, Jeffrey Scott Vitter:
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract). STOC 2000: 397-406
1990 – 1999
- 1999
- [j14]Roberto Grossi, Giuseppe F. Italiano:
Efficient Splitting and Merging Algorithms for Order Decomposable Problems. Inf. Comput. 154(1): 1-33 (1999) - [j13]Paolo Ferragina, Roberto Grossi:
The String B-tree: A New Data Structure for String Search in External Memory and Its Applications. J. ACM 46(2): 236-280 (1999) - [j12]Paolo Ferragina, Roberto Grossi:
Improved Dynamic Text Indexing. J. Algorithms 31(2): 291-319 (1999) - [j11]Raffaele Giancarlo, Roberto Grossi:
Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices. J. Complex. 15(1): 30-71 (1999) - [c16]Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi:
IP Address Lookup Made Fast and Simple. ESA 1999: 65-76 - [c15]Roberto Grossi, Giuseppe F. Italiano:
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures. ICALP 1999: 372-381 - [c14]Alessandro Bellini, Alberto Del Lungo, Fabio Gori, Roberto Grossi, Marco Guarducci:
A Fast H.261 Software Codec for High Quality Videoconferencing on PCs. ICMCS, Vol. 2 1999: 1007-1008 - 1998
- [j10]Roberto Grossi, Elena Lodi:
Simple Planar Graph Partition into Three Forests. Discret. Appl. Math. 84(1-3): 121-132 (1998) - [j9]Paolo Ferragina, Roberto Grossi:
Optimal On-Line Search and Sublinear Time Update in String Matching. SIAM J. Comput. 27(3): 713-736 (1998) - [j8]Paolo Ferragina, Roberto Grossi, Manuela Montangero:
On Updating Suffix Tree Labels. Theor. Comput. Sci. 201(1-2): 249-262 (1998) - [c13]Roberto Grossi, Giuseppe F. Italiano:
Efficient cross-trees for external memory. External Memory Algorithms 1998: 87-106 - [c12]Roberto Grossi, Andrea Pietracaprina, Geppino Pucci:
Optimal Deterministic Protocols for Mobile Robots on a Grid. SWAT 1998: 181-192 - 1997
- [j7]Raffaele Giancarlo, Roberto Grossi:
Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms. J. Algorithms 24(2): 223-265 (1997) - [c11]Paolo Ferragina, Roberto Grossi, Manuela Montangero:
A Note on Updating Suffix Tree Labels. CIAC 1997: 181-192 - [c10]Roberto Grossi, Giuseppe F. Italiano:
Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract). ICALP 1997: 605-615 - [c9]Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter:
Sequence sorting in secondary storage. SEQUENCES 1997: 329-346 - [c8]Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter:
On Sorting Strings in External Memory (Extended Abstract). STOC 1997: 540-548 - [p1]Raffaele Giancarlo, Roberto Grossi:
Suffix tree data structures for matrices. Pattern Matching Algorithms 1997: 293-340 - 1996
- [j6]Raffaele Giancarlo, Roberto Grossi:
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications. Inf. Comput. 130(2): 151-182 (1996) - [c7]Paolo Ferragina, Roberto Grossi:
Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results. SODA 1996: 373-382 - 1995
- [c6]Raffaele Giancarlo, Roberto Grossi:
Multi-Dimensional Pattern Matching with Dimensional Wildcards. CPM 1995: 90-101 - [c5]Paolo Ferragina, Roberto Grossi:
Optimal On-Line Search and Sublinear Time Update in String Matching. FOCS 1995: 604-612 - [c4]Raffaele Giancarlo, Roberto Grossi:
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications. ICALP 1995: 111-122 - [c3]Paolo Ferragina, Roberto Grossi:
Fast Incremental Text Editing. SODA 1995: 531-540 - [c2]Paolo Ferragina, Roberto Grossi:
A fully-dynamic data structure for external substring search (Extended Abstract). STOC 1995: 693-702 - 1993
- [j5]Roberto Grossi:
On Finding Commong Subtrees. Theor. Comput. Sci. 108(2): 345-356 (1993) - [c1]Raffaele Giancarlo, Roberto Grossi:
Parallel Construction and Query of Suffix Trees for Two-Dimensional Matrices. SPAA 1993: 86-97 - 1992
- [j4]Roberto Grossi:
A fast VLSI solution for approximate string matching. Integr. 13(2): 195-206 (1992) - 1991
- [j3]Roberto Grossi:
A Note on the Subtree Isomorphism for Ordered Trees and Related Problems. Inf. Process. Lett. 39(2): 81-84 (1991) - [j2]Roberto Grossi:
Further Comments on the Subtree Isomorphism for Ordered Trees. Inf. Process. Lett. 40(5): 255-256 (1991)
1980 – 1989
- 1989
- [j1]Roberto Grossi, Fabrizio Luccio:
Simple and Efficient String Matching with k Mismatches. Inf. Process. Lett. 33(3): 113-120 (1989)
Coauthor Index
[j61] [j60] [c113] [c112] [c111] [i25] [j59] [j56] [c110] [c109] [c108] [i24] [j55] [j54] [c106] [c105] [j53] [j52] [c104] [c103] [j51] [j50] [j48] [j46] [c100] [c99] [i23] [i22] [j43] [j42] [c96] [c95] [c94] [i19] [i17] [j41] [c93] [c91] [c90] [c89] [c87] [c83] [i16] [c82] [c80] [c78] [c77] [c76] [c75] [c73] [i12]
S. Srinivasa Rao 0001
aka: Srinivasa Rao Satti
aka: Srinivasa Rao Satti
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 22:00 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:
