The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paolo Ferragina: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. Paolo Ferragina, Roberto Grossi, Manuela Montangero
    A Note on Updating Suffix Tree Labels. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:181-192 [Conf]
  6. Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos
    Randomized External-Memory Algorithms for Some Geometric Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:259-268 [Conf]
  7. Andreas Crauser, Paolo Ferragina
    On Constructing Suffix Arrays in External Memory. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:224-235 [Conf]
  8. Sajal K. Das, Paolo Ferragina
    An o(n) Work EREW Parallel Algorithm for Updating MST. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:331-342 [Conf]
  9. Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro
    Cache-Oblivious Comparison-Based Algorithms on Multisets. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:305-316 [Conf]
  10. Paolo Ferragina
    Incremental Text Editing: A New Data Structure. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:495-507 [Conf]
  11. Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini
    The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:756-767 [Conf]
  12. Paolo Ferragina, Fabrizio Luccio
    On the Parallel Dynamic Dictionary Matching Problem: New Results with Applications. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:261-275 [Conf]
  13. Paolo Ferragina, S. Muthukrishnan
    Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:107-120 [Conf]
  14. Giovanni Manzini, Paolo Ferragina
    Engineering a Lightweight Suffix Array Construction Algorithm. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:698-710 [Conf]
  15. Paolo Ferragina
    A Simple Parallel Dictionary Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:781-788 [Conf]
  16. Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio, S. Muthukrishnan
    Static Optimality Theorem for External Memory String Access. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:219-227 [Conf]
  17. Martin Farach, Paolo Ferragina, S. Muthukrishnan
    Overcoming the Memory Bottleneck in Suffix Tree Construction. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:174-185 [Conf]
  18. 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]
  19. Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan
    Structuring labeled trees for optimal succinctness, and beyond. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:184-196 [Conf]
  20. Paolo Ferragina, Giovanni Manzini
    Opportunistic Data Structures with Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:390-398 [Conf]
  21. Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini
    The Myriad Virtues of Wavelet Trees. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:560-571 [Conf]
  22. Paolo Ferragina, Antonio Gulli
    The Anatomy of a Hierarchical Clustering Engine for Web-page, News and Book Snippets. [Citation Graph (0, 0)][DBLP]
    ICDM, 2004, pp:395-398 [Conf]
  23. Paolo Ferragina
    An EREW PRAM fully-dynamic algorithm for MST. [Citation Graph (0, 0)][DBLP]
    IPPS, 1995, pp:93-100 [Conf]
  24. Paolo Ferragina, Fabrizio Luccio
    Batch Dynamic Algorithms for Two Graph Problems. [Citation Graph (0, 0)][DBLP]
    PARLE, 1994, pp:713-724 [Conf]
  25. Paolo Ferragina, Antonio Gulli
    The Anatomy of SnakeT: A Hierarchical Clustering Engine for Web-Page Snippets. [Citation Graph (0, 0)][DBLP]
    PKDD, 2004, pp:506-508 [Conf]
  26. Paolo Ferragina, Antonio Gulli
    Experimenting SnakeT: A Hierarchical Clustering Engine for Web-Page Snippets. [Citation Graph (0, 0)][DBLP]
    PKDD, 2004, pp:543-545 [Conf]
  27. Paolo Ferragina, Nick Koudas, S. Muthukrishnan, Divesh Srivastava
    Two-dimensional Substring Indexing. [Citation Graph (0, 0)][DBLP]
    PODS, 2001, pp:- [Conf]
  28. Stefan Burkhardt, Andreas Crauser, Paolo Ferragina, Hans-Peter Lenhof, Eric Rivals, Martin Vingron
    q-gram based database searching using a suffix array (QUASAR). [Citation Graph (0, 0)][DBLP]
    RECOMB, 1999, pp:77-83 [Conf]
  29. Paolo Ferragina, Angelo Monti, Alessandro Roncato
    Trade-off Between Computational Power and Common Knowledge in Anonymous Rings. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1994, pp:35-48 [Conf]
  30. Paolo Ferragina, Roberto Grossi
    Fast Incremental Text Editing. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:531-540 [Conf]
  31. Paolo Ferragina, Giovanni Manzini
    An experimental study of an opportunistic index. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:269-278 [Conf]
  32. Paolo Ferragina, Giovanni Manzini
    Compression boosting in optimal linear time using the Burrows-Wheeler Transform. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:655-663 [Conf]
  33. Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, Gonzalo Navarro
    An Alphabet-Friendly FM-Index. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:150-160 [Conf]
  34. Paolo Ferragina, S. Muthukrishnan, Mark de Berg
    Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:483-491 [Conf]
  35. Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer
    An Experimental Study of Priority Queues in External Memory. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:346-360 [Conf]
  36. Paolo Ferragina, Antonio Gulli
    A personalized search engine based on web-snippet hierarchical clustering. [Citation Graph (0, 0)][DBLP]
    WWW (Special interest tracks and posters), 2005, pp:801-810 [Conf]
  37. Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan
    Compressing and searching XML data via two zips. [Citation Graph (0, 0)][DBLP]
    WWW, 2006, pp:751-760 [Conf]
  38. Andreas Crauser, Paolo Ferragina
    A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:1, pp:1-35 [Journal]
  39. Paolo Ferragina, Fabrizio Luccio
    String Search in Coarse-Grained Parallel Computers. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:3-4, pp:177-194 [Journal]
  40. Giovanni Manzini, Paolo Ferragina
    Engineering a Lightweight Suffix Array Construction Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:1, pp:33-50 [Journal]
  41. Paolo Ferragina, Fabrizio Luccio
    Dynamic Dictionary Matching in External Memory. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:146, n:2, pp:85-99 [Journal]
  42. Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos
    Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:3, pp:305-337 [Journal]
  43. Neil Burgess, Silvano Di Zenzo, Paolo Ferragina, Mario Notturno Granieri
    The Generalization of a Constructive Algorithm in Pattern Classification Problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Neural Syst., 1992, v:3, n:Supplement, pp:65-70 [Journal]
  44. Paolo Ferragina
    Static and Dynamic Parallel Computation of Connected Components. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:2, pp:63-68 [Journal]
  45. Paolo Ferragina, Giovanni Manzini
    An experimental study of a compressed index. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2001, v:135, n:1-2, pp:13-28 [Journal]
  46. Martin Farach-Colton, Paolo Ferragina, S. Muthukrishnan
    On the sorting-complexity of suffix tree construction. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:6, pp:987-1011 [Journal]
  47. Paolo Ferragina, Raffaele Giancarlo, Giovanni Manzini, Marinella Sciortino
    Boosting textual compression in optimal linear time. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:4, pp:688-713 [Journal]
  48. Paolo Ferragina, Giovanni Manzini
    Indexing compressed text. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:4, pp:552-581 [Journal]
  49. Paolo Ferragina
    Dynamic Text Indexing under String Updates. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:2, pp:296-328 [Journal]
  50. Paolo Ferragina, Roberto Grossi
    Improved Dynamic Text Indexing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:31, n:2, pp:291-319 [Journal]
  51. Nadia Pisanti, Roberto Marangoni, Paolo Ferragina, Antonio Frangioni, A. Savona, C. Pisanelli, Fabrizio Luccio
    PaTre: A Method for Paralogy Trees Construction. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2003, v:10, n:5, pp:791-802 [Journal]
  52. Paolo Ferragina, Nick Koudas, S. Muthukrishnan, Divesh Srivastava
    Two-dimensional substring indexing. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:4, pp:763-774 [Journal]
  53. Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer
    An Experimental Study of Priority Queues in External Memory. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2000, v:5, n:, pp:17- [Journal]
  54. Paolo Ferragina
    A Technique to Speed Up Parallel Fully Dynamic Algorithms for MST. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:31, n:2, pp:181-189 [Journal]
  55. Paolo Ferragina, Roberto Grossi, Fabrizio Luccio
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:3, pp:389- [Journal]
  56. Sajal K. Das, Paolo Ferragina
    An EREW PRAM Algorithm for Updating Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:1, pp:111-122 [Journal]
  57. Silvano Di Zenzo, Neil Burgess, Paolo Ferragina, Mario Notturno Granieri
    Recognition by constructive neural algorithms. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1993, v:14, n:12, pp:997-1007 [Journal]
  58. 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]
  59. Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio, S. Muthukrishnan
    A data structure for a sequence of string accesses in external memory. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  60. 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]
  61. Paolo Ferragina, Rossano Venturini
    A simple storage scheme for strings achieving entropy bounds. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:372, n:1, pp:115-121 [Journal]
  62. Paolo Ferragina, Johannes Fischer
    Suffix Arrays on Words. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:328-339 [Conf]
  63. Paolo Ferragina, Rossano Venturini
    Compressed permuterm index. [Citation Graph (0, 0)][DBLP]
    SIGIR, 2007, pp:535-542 [Conf]
  64. Paolo Ferragina, Rossano Venturini
    A simple storage scheme for strings achieving entropy bounds. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:690-696 [Conf]
  65. Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, Gonzalo Navarro
    Compressed representations of sequences and full-text indexes. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]

  66. On Optimally Partitioning a Text to Improve Its Compression. [Citation Graph (, )][DBLP]


  67. Data Structures: Time, I/Os, Entropy, Joules! [Citation Graph (, )][DBLP]


  68. Lightweight Data Indexing and Compression in External Memory. [Citation Graph (, )][DBLP]


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


  70. On the bit-complexity of Lempel-Ziv compression. [Citation Graph (, )][DBLP]


  71. Query-log mining for detecting spam. [Citation Graph (, )][DBLP]


  72. On compressing the textual web. [Citation Graph (, )][DBLP]


  73. Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment. [Citation Graph (, )][DBLP]


  74. The BioPrompt-box: an ontology-based clustering tool for searching in biological databases. [Citation Graph (, )][DBLP]


  75. Compressed Text Indexes:From Theory to Practice! [Citation Graph (, )][DBLP]


  76. String algorithms and data structures [Citation Graph (, )][DBLP]


  77. Bit-Optimal Lempel-Ziv compression [Citation Graph (, )][DBLP]


  78. On optimally partitioning a text to improve its compression [Citation Graph (, )][DBLP]


  79. Lightweight Data Indexing and Compression in External Memory [Citation Graph (, )][DBLP]


  80. TAGME: on-the-fly annotation of short text fragments (by Wikipedia entities) [Citation Graph (, )][DBLP]


Search in 0.010secs, Finished in 0.012secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002