The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Roberto Grossi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Roberto Grossi, Giuseppe F. Italiano
    Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract). [Citation Graph (2, 0)][DBLP]
    ICALP, 1997, pp:605-615 [Conf]
  2. Paolo Ferragina, Roberto Grossi
    A fully-dynamic data structure for external substring search (Extended Abstract). [Citation Graph (2, 0)][DBLP]
    STOC, 1995, pp:693-702 [Conf]
  3. Paolo Ferragina, Roberto Grossi
    Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results. [Citation Graph (1, 0)][DBLP]
    SODA, 1996, pp:373-382 [Conf]
  4. Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter
    On Sorting Strings in External Memory (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    STOC, 1997, pp:540-548 [Conf]
  5. Raffaele Giancarlo, Roberto Grossi
    On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications. [Citation Graph (1, 0)][DBLP]
    Inf. Comput., 1996, v:130, n:2, pp:151-182 [Journal]
  6. Paolo Ferragina, Roberto Grossi
    The String B-tree: A New Data Structure for String Search in External Memory and Its Applications. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1999, v:46, n:2, pp:236-280 [Journal]
  7. Paolo Ferragina, Roberto Grossi, Manuela Montangero
    A Note on Updating Suffix Tree Labels. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:181-192 [Conf]
  8. Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi
    A Trie-Based Approach for Compacting Automata. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:145-158 [Conf]
  9. Raffaele Giancarlo, Roberto Grossi
    Multi-Dimensional Pattern Matching with Dimensional Wildcards. [Citation Graph (0, 0)][DBLP]
    CPM, 1995, pp:90-101 [Conf]
  10. Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter
    Fast Compression with a Static Model in High-Order Entropy. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2004, pp:62-71 [Conf]
  11. Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi
    IP Address Lookup Made Fast and Simple. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:65-76 [Conf]
  12. Gianni Franceschini, Roberto Grossi
    No Sorting? Better Searching! [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:491-498 [Conf]
  13. Paolo Ferragina, Roberto Grossi
    Optimal On-Line Search and Sublinear Time Update in String Matching. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:604-612 [Conf]
  14. Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
    Implicit B-Trees: New Results for the Dictionary Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:145-154 [Conf]
  15. Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
    Text Sparsification via Local Maxima. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:290-301 [Conf]
  16. Gianni Franceschini, Roberto Grossi
    Optimal Cache-Oblivious Implicit Dictionaries. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:316-331 [Conf]
  17. Gianni Franceschini, Roberto Grossi
    A General Technique for Managing Strings in Comparison-Driven Data Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:606-617 [Conf]
  18. Gianni Franceschini, Roberto Grossi
    Optimal In-place Sorting of Vectors and Records. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:90-102 [Conf]
  19. Raffaele Giancarlo, Roberto Grossi
    On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:111-122 [Conf]
  20. Roberto Grossi, Giuseppe F. Italiano
    Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:372-381 [Conf]
  21. Alessandro Bellini, Alberto Del Lungo, Fabio Gori, Roberto Grossi, Marco Guarducci
    A Fast H.261 Software Codec for High Quality Videoconferencing on PCs. [Citation Graph (0, 0)][DBLP]
    ICMCS, Vol. 2, 1999, pp:1007-1008 [Conf]
  22. Jeffrey Scott Vitter, Roberto Grossi
    Compressed Indexes for Fast Search in Sequences. [Citation Graph (0, 0)][DBLP]
    JCIS, 2002, pp:44-48 [Conf]
  23. Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot
    A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:622-631 [Conf]
  24. Paolo Ferragina, Roberto Grossi
    Fast Incremental Text Editing. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:531-540 [Conf]
  25. Gianni Franceschini, Roberto Grossi
    Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:670-678 [Conf]
  26. Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter
    High-order entropy-compressed text indexes. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:841-850 [Conf]
  27. Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter
    When indexing equals compression: experiments with compressing suffix arrays and applications. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:636-645 [Conf]
  28. Kunihiko Sadakane, Roberto Grossi
    Squeezing succinct data structures into entropy bounds. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1230-1239 [Conf]
  29. Raffaele Giancarlo, Roberto Grossi
    Parallel Construction and Query of Suffix Trees for Two-Dimensional Matrices. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:86-97 [Conf]
  30. Iwona Bialynicka-Birula, Roberto Grossi
    Rank-Sensitive Data Structures. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:79-90 [Conf]
  31. Iwona Bialynicka-Birula, Roberto Grossi
    Amortized Rigidness in Dynamic Cartesian Trees. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:80-91 [Conf]
  32. Roberto Grossi, Jeffrey Scott Vitter
    Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:397-406 [Conf]
  33. Roberto Grossi, Andrea Pietracaprina, Geppino Pucci
    Optimal Deterministic Protocols for Mobile Robots on a Grid. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:181-192 [Conf]
  34. Gianni Franceschini, Roberto Grossi
    Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:114-126 [Conf]
  35. Filippo Geraci, Roberto Grossi
    Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:580-592 [Conf]
  36. Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano
    Search Data Structures for Skewed Strings. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:81-96 [Conf]
  37. Roberto Grossi, Elena Lodi
    Simple Planar Graph Partition into Three Forests. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:84, n:1-3, pp:121-132 [Journal]
  38. Roberto Grossi, Giuseppe F. Italiano
    Efficient Splitting and Merging Algorithms for Order Decomposable Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:154, n:1, pp:1-33 [Journal]
  39. Roberto Grossi, Andrea Pietracaprina, Geppino Pucci
    Optimal Deterministic Protocols for Mobile Robots on a Grid. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:173, n:2, pp:132-142 [Journal]
  40. Roberto Grossi
    A Note on the Subtree Isomorphism for Ordered Trees and Related Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:2, pp:81-84 [Journal]
  41. Roberto Grossi
    Further Comments on the Subtree Isomorphism for Ordered Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:5, pp:255-256 [Journal]
  42. Roberto Grossi, Fabrizio Luccio
    Simple and Efficient String Matching with k Mismatches. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:33, n:3, pp:113-120 [Journal]
  43. Paolo Ferragina, Roberto Grossi
    Improved Dynamic Text Indexing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:31, n:2, pp:291-319 [Journal]
  44. Raffaele Giancarlo, Roberto Grossi
    Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:2, pp:223-265 [Journal]
  45. Raffaele Giancarlo, Roberto Grossi
    Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1999, v:15, n:1, pp:30-71 [Journal]
  46. Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli
    Implicit B-trees: a new data structure for the dictionary problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:4, pp:788-807 [Journal]
  47. Paolo Ferragina, Roberto Grossi, Fabrizio Luccio
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:3, pp:389- [Journal]
  48. Gianni Franceschini, Roberto Grossi
    Optimal Implicit Dictionaries over Unbounded Universes. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:2, pp:321-345 [Journal]
  49. Paolo Ferragina, Roberto Grossi
    Optimal On-Line Search and Sublinear Time Update in String Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:713-736 [Journal]
  50. Roberto Grossi, Jeffrey Scott Vitter
    Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:2, pp:378-407 [Journal]
  51. Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter
    When indexing equals compression: Experiments with compressing suffix arrays and applications. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:611-639 [Journal]
  52. Nadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot
    Bases of Motifs for Generating Repeated Patterns with Wild Cards. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2005, v:2, n:1, pp:40-50 [Journal]
  53. Pierluigi Crescenzi, Alberto Del Lungo, Roberto Grossi, Elena Lodi, Linda Pagli, Gianluca Rossi
    Text sparsification via local maxima. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:341-364 [Journal]
  54. Paolo Ferragina, Roberto Grossi, Manuela Montangero
    On Updating Suffix Tree Labels. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:201, n:1-2, pp:249-262 [Journal]
  55. Roberto Grossi
    On Finding Commong Subtrees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:108, n:2, pp:345-356 [Journal]
  56. Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao
    On the Size of Succinct Indices. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:371-382 [Conf]

  57. Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques. [Citation Graph (, )][DBLP]


  58. Mining Biological Sequences with Masks. [Citation Graph (, )][DBLP]


  59. Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound. [Citation Graph (, )][DBLP]


  60. Optimal Trade-Offs for Succinct String Indexes. [Citation Graph (, )][DBLP]


  61. On searching compressed string collections cache-obliviously. [Citation Graph (, )][DBLP]


  62. More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. [Citation Graph (, )][DBLP]


  63. Optimal Cache-Aware Suffix Selection. [Citation Graph (, )][DBLP]


  64. MADMX: A Novel Strategy for Maximal Dense Motif Extraction. [Citation Graph (, )][DBLP]


  65. Fun with Olympiad in Algorithmics. [Citation Graph (, )][DBLP]


  66. Optimal cache-aware suffix selection [Citation Graph (, )][DBLP]


  67. More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries [Citation Graph (, )][DBLP]


  68. MADMX: A Novel Strategy for Maximal Dense Motif Extraction [Citation Graph (, )][DBLP]


  69. Optimal Trade-Off for Succinct String Indexes [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.459secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002