Roberto Grossi

According to our database1, Roberto Grossi authored at least 161 papers between 1989 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties.
SIAM J. Discrete Math., 2019

Succinct Representation for (Non)Deterministic Finite Automata.
CoRR, 2019

String Sanitization: A Combinatorial Approach.
CoRR, 2019

On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching.
CoRR, 2019

On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree.
CoRR, 2019

Polynomial-Delay Enumeration of Maximal Common Subsequences.
Proceedings of the String Processing and Information Retrieval, 2019

Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

On the Complexity of String Matching for Graphs.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Motif trie: An efficient text index for pattern discovery with don't cares.
Theor. Comput. Sci., 2018

Efficient enumeration of graph orientations with sources.
Discrete Applied Mathematics, 2018

Longest Property-Preserved Common Factor.
CoRR, 2018

Compressed Communication Complexity of Longest Common Prefixes.
CoRR, 2018

Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables.
CoRR, 2018

Listing Maximal Subgraphs in Strongly Accessible Set Systems.
CoRR, 2018

Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Degenerate String Comparison and Applications.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Compressed Communication Complexity of Longest Common Prefixes.
Proceedings of the String Processing and Information Retrieval, 2018

Longest Property-Preserved Common Factor.
Proceedings of the String Processing and Information Retrieval, 2018

Listing Subgraphs by Cartesian Decomposition.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Efficient Algorithms for Listing k Disjoint st-Paths in Graphs.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Node Similarity with q -Grams for Real-World Labeled Networks.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Discovering $k$-Trusses in Large-Scale Networks.
Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018

Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries.
ACM Trans. Algorithms, 2017

On Bubble Generators in Directed Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Listing Maximal Independent Sets with Minimal Space and Bounded Delay.
Proceedings of the String Processing and Information Retrieval, 2017

On-Line Pattern Matching on Similar Texts.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

A Fast Algorithm for Large Common Connected Induced Subgraphs.
Proceedings of the Algorithms for Computational Biology, 2017

2016
Wavelet Trees.
Encyclopedia of Algorithms, 2016

Enumeration of Paths, Cycles, and Spanning Trees.
Encyclopedia of Algorithms, 2016

Linear-size suffix tries.
Theor. Comput. Sci., 2016

Erratum to: Circular sequence comparison: algorithms and applications.
Algorithms for Molecular Biology, 2016

Circular sequence comparison: algorithms and applications.
Algorithms for Molecular Biology, 2016

New Bounds for Approximating Extremal Distances in Undirected Graphs.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Clique covering of large real-world networks.
Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016

Listing Acyclic Orientations of Graphs with Single and Multiple Sources.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Directing Road Networks by Listing Strong Orientations.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Computing the Burrows-Wheeler transform in place and in small space.
J. Discrete Algorithms, 2015

Enumerating Cyclic Orientations of a Graph.
CoRR, 2015

Circular Sequence Comparison with q-grams.
Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

Enumerating Cyclic Orientations of a Graph.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014
Towards optimal packed string matching.
Theor. Comput. Sci., 2014

Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing.
SIAM J. Comput., 2014

Fast Compressed Tries through Path Decompositions.
ACM Journal of Experimental Algorithmics, 2014

Amortized Õ(|V|)-Delay Algorithm for Listing Chordless Cycles in Undirected Graphs.
CoRR, 2014

Colored Range Searching in Linear Space.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

Output-Sensitive Pattern Extraction in Sequences.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs.
Proceedings of the Algorithms - ESA 2014, 2014

2013
On computing the diameter of real-world undirected graphs.
Theor. Comput. Sci., 2013

Simple real-time constant-space string matching.
Theor. Comput. Sci., 2013

Editorial.
J. Discrete Algorithms, 2013

Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing.
CoRR, 2013

Mobilomics in Saccharomyces cerevisiae strains.
BMC Bioinformatics, 2013

Design of Practical Succinct Data Structures for Large Data Collections.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Pattern Discovery and Listing in Graphs.
Proceedings of the String Processing and Information Retrieval, 2013

Optimal Listing of Cycles and st-Paths in Undirected Graphs.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Dynamic Compressed Strings with Random Access.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Encodings for Range Selection and Top-k Queries.
Proceedings of the Algorithms - ESA 2013, 2013

A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

Random Access to High-Order Entropy Compressed Text.
Proceedings of the Space-Efficient Data Structures, 2013

2012
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings.
Inf. Comput., 2012

Optimal Listing of Cycles and st-Paths in Undirected Graphs
CoRR, 2012

The Wavelet Trie: Maintaining an Indexed Sequence of Strings in Compressed Space
CoRR, 2012

On Computing the Diameter of Real-World Directed (Weighted) Graphs.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Efficient Bubble Enumeration in Directed Graphs.
Proceedings of the String Processing and Information Retrieval, 2012

The wavelet trie: maintaining an indexed sequence of strings in compressed space.
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

Constant-Time Word-Size String Matching.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

A Taste of Yeast Mobilomics.
Proceedings of the BIOINFORMATICS 2012 - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms, Vilamoura, Algarve, Portugal, 1, 2012

Fast Compressed Tries through Path Decompositions.
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2011
A quick tour on suffix arrays and compressed suffix arrays.
Theor. Comput. Sci., 2011

MADMX: A Strategy for Maximal Dense Motif Extraction.
Journal of Computational Biology, 2011

Fast Compressed Tries through Path Decompositions
CoRR, 2011

Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection
CoRR, 2011

Consecutive Ones Property and PQ-Trees for Multisets: Hardness of Counting Their Orderings
CoRR, 2011

A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

Optimal Packed String Matching.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs.
Proceedings of the Algorithms - ESA 2011, 2011

Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Simple Real-Time Constant-Space String Matching.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

Semi-indexing semi-structured data in tiny space.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

Wavelet Trees: From Theory to Practice.
Proceedings of the First International Conference on Data Compression, 2011

Inferring Mobile Elements in S. Cerevisiae Strains.
Proceedings of the BIOINFORMATICS 2011, 2011

2010
Optimal Trade-Off for Succinct String Indexes
CoRR, 2010

MADMX: A Novel Strategy for Maximal Dense Motif Extraction
CoRR, 2010

Optimal Trade-Offs for Succinct String Indexes.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Fun with Olympiad in Algorithmics.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound.
Proceedings of the Algorithms, 2010

2009
Masking patterns in sequences: A new class of motif discovery with don't cares.
Theor. Comput. Sci., 2009

More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
CoRR, 2009

Optimal cache-aware suffix selection
CoRR, 2009

MADMX: A Novel Strategy for Maximal Dense Motif Extraction.
Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Optimal Cache-Aware Suffix Selection.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Mining Biological Sequences with Masks.
Proceedings of the Database and Expert Systems Applications, 2009

Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008
No sorting? better searching!.
ACM Trans. Algorithms, 2008

On searching compressed string collections cache-obliviously.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform.
Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, 2008

2007
On the Size of Succinct Indices.
Proceedings of the Algorithms, 2007

2006
When indexing equals compression: Experiments with compressing suffix arrays and applications.
ACM Trans. Algorithms, 2006

Optimal Implicit Dictionaries over Unbounded Universes.
Theory Comput. Syst., 2006

Foreword.
Theory Comput. Syst., 2006

Amortized Rigidness in Dynamic Cartesian Trees.
Proceedings of the STACS 2006, 2006

Squeezing succinct data structures into entropy bounds.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Bases of Motifs for Generating Repeated Patterns with Wild Cards.
IEEE/ACM Trans. Comput. Biology Bioinform., 2005

Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching.
SIAM J. Comput., 2005

Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Rank-Sensitive Data Structures.
Proceedings of the String Processing and Information Retrieval, 2005

Optimal In-place Sorting of Vectors and Records.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
Implicit B-trees: a new data structure for the dictionary problem.
J. Comput. Syst. Sci., 2004

When indexing equals compression: experiments with compressing suffix arrays and applications.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

A General Technique for Managing Strings in Comparison-Driven Data Structures.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

No Sorting? Better Searching!
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

Fast Compression with a Static Model in High-Order Entropy.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

A Trie-Based Approach for Compacting Automata.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003
Text sparsification via local maxima.
Theor. Comput. Sci., 2003

Search Data Structures for Skewed Strings.
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

High-order entropy-compressed text indexes.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Optimal Cache-Oblivious Implicit Dictionaries.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Optimal Deterministic Protocols for Mobile Robots on a Grid.
Inf. Comput., 2002

Compressed Indexes for Fast Search in Sequences.
Proceedings of the 6th Joint Conference on Information Science, 2002

Implicit B-Trees: New Results for the Dictionary Problem.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2000
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Text Sparsification via Local Maxima.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999
Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices.
J. Complexity, 1999

Improved Dynamic Text Indexing.
J. Algorithms, 1999

The String B-tree: A New Data Structure for String Search in External Memory and Its Applications.
J. ACM, 1999

Efficient Splitting and Merging Algorithms for Order Decomposable Problems.
Inf. Comput., 1999

A Fast H.261 Software Codec for High Quality Videoconferencing on PCs.
Proceedings of the IEEE International Conference on Multimedia Computing and Systems, 1999

Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures.
Proceedings of the Automata, 1999

IP Address Lookup Made Fast and Simple.
Proceedings of the Algorithms, 1999

1998
On Updating Suffix Tree Labels.
Theor. Comput. Sci., 1998

Optimal On-Line Search and Sublinear Time Update in String Matching.
SIAM J. Comput., 1998

Simple Planar Graph Partition into Three Forests.
Discrete Applied Mathematics, 1998

Optimal Deterministic Protocols for Mobile Robots on a Grid.
Proceedings of the Algorithm Theory, 1998

Efficient cross-trees for external memory.
Proceedings of the External Memory Algorithms, 1998

1997
Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms.
J. Algorithms, 1997

On Sorting Strings in External Memory (Extended Abstract).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Sequence sorting in secondary storage.
Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

A Note on Updating Suffix Tree Labels.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

Suffix tree data structures for matrices.
Proceedings of the Pattern Matching Algorithms, 1997

1996
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications.
Inf. Comput., 1996

Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995
A fully-dynamic data structure for external substring search (Extended Abstract).
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Fast Incremental Text Editing.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Optimal On-Line Search and Sublinear Time Update in String Matching.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Multi-Dimensional Pattern Matching with Dimensional Wildcards.
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

1993
On Finding Commong Subtrees.
Theor. Comput. Sci., 1993

Parallel Construction and Query of Suffix Trees for Two-Dimensional Matrices.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

1992
A fast VLSI solution for approximate string matching.
Integration, 1992

1991
Further Comments on the Subtree Isomorphism for Ordered Trees.
Inf. Process. Lett., 1991

A Note on the Subtree Isomorphism for Ordered Trees and Related Problems.
Inf. Process. Lett., 1991

1989
Simple and Efficient String Matching with k Mismatches.
Inf. Process. Lett., 1989


  Loading...