| 2009 | ||
|---|---|---|
| 63 | Ricardo A. Baeza-Yates, Paolo Boldi, Berthier A. Ribeiro-Neto, Berkant Barla Cambazoglu: Proceedings of the Second International Conference on Web Search and Web Data Mining, WSDM 2009, Barcelona, Spain, February 9-11, 2009 ACM 2009 | |
| 62 | Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna: Theory and Practise of Monotone Minimal Perfect Hashing. ALENEX 2009: 132-144 | |
| 61 | Paolo Boldi, Francesco Bonchi, Carlos Castillo, Sebastiano Vigna: Voting in social networks. CIKM 2009: 777-786 | |
| 60 | Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna: Monotone minimal perfect hashing: searching a sorted table with O(1) accesses. SODA 2009: 785-794 | |
| 59 | Paolo Boldi, Massimo Santini, Sebastiano Vigna: Permuting Web Graphs. WAW 2009: 116-126 | |
| 58 | Paolo Boldi, Francesco Bonchi, Carlos Castillo, Sebastiano Vigna: From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns. Web Intelligence 2009: 183-190 | |
| 2008 | ||
| 57 | Paolo Boldi, Francesco Bonchi, Carlos Castillo, Debora Donato, Aristides Gionis, Sebastiano Vigna: The query-flow graph: model and applications. CIKM 2008: 609-618 | |
| 56 | Ilaria Bordino, Paolo Boldi, Debora Donato, Massimo Santini, Sebastiano Vigna: Temporal Evolution of the UK Web. ICDM Workshops 2008: 909-918 | |
| 55 | Luca Becchetti, Paolo Boldi, Carlos Castillo, Aristides Gionis: Efficient semi-streaming algorithms for local triangle counting in massive graphs. KDD 2008: 16-24 | |
| 54 | Paolo Boldi, Violetta Lonati, Roberto Radicioni, Massimo Santini: The number of convex permutominoes. Inf. Comput. 206(9-10): 1074-1083 (2008) | |
| 53 | Paolo Boldi, Massimo Santini, Sebastiano Vigna: A large time-aware web graph. SIGIR Forum 42(2): 33-38 (2008) | |
| 2007 | ||
| 52 | Paolo Boldi, Flavio Chierichetti, Sebastiano Vigna: Pictures from Mongolia - Partial Sorting in a Partial World. FUN 2007: 66-77 | |
| 51 | Paolo Boldi, Massimo Santini, Sebastiano Vigna: A Deeper Investigation of PageRank as a Function of the Damping Factor. Web Information Retrieval and Linear Algebra Algorithms 2007 | |
| 50 | Sebastiano Vigna, Paolo Boldi: Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics CoRR abs/0710.1525: (2007) | |
| 49 | Ricardo A. Baeza-Yates, Paolo Boldi, Carlos Castillo: Generic Damping Functions for Propagating Importance in Link-Based Ranking. Internet Mathematics 3(4): 445-478 (2007) | |
| 2006 | ||
| 48 | Ricardo A. Baeza-Yates, Paolo Boldi, Carlos Castillo: Generalizing PageRank: damping functions for link-based ranking algorithms. SIGIR 2006: 308-315 | |
| 47 | Paolo Boldi, Sebastiano Vigna: Efficient Lazy Algorithms for Minimal-Interval Semantics. SPIRE 2006: 134-149 | |
| 46 | Paolo Boldi, Sebastiano Vigna: MG4J at TREC 2006. TREC 2006 | |
| 45 | Paolo Boldi, Roberto Posenato, Massimo Santini, Sebastiano Vigna: Traps and Pitfalls of Topic-Biased PageRank. WAW 2006: 107-116 | |
| 44 | Paolo Boldi, Violetta Lonati, Massimo Santini, Sebastiano Vigna: Graph fibrations, graph isomorphism, and PageRank. ITA 40(2): 227-253 (2006) | |
| 43 | Carlos Castillo, Debora Donato, Luca Becchetti, Paolo Boldi, Stefano Leonardi, Massimo Santini, Sebastiano Vigna: A reference collection for web spam. SIGIR Forum 40(2): 11-24 (2006) | |
| 2005 | ||
| 42 | Paolo Boldi, Sebastiano Vigna: Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups. SPIRE 2005: 25-28 | |
| 41 | Paolo Boldi, Sebastiano Vigna: MG4J at TREC 2005. TREC 2005 | |
| 40 | Paolo Boldi, Massimo Santini, Sebastiano Vigna: PageRank as a function of the damping factor. WWW 2005: 557-566 | |
| 39 | Paolo Boldi: TotalRank: ranking without damping. WWW (Special interest tracks and posters) 2005: 898-899 | |
| 38 | Yoshiki Mikami, Pavol Zavarsky, Mohd Zaidi Abd Rozan, Izumi Suzuki, Masayuki Takahashi, Tomohide Maki, Irwan Nizan Ayob, Paolo Boldi, Massimo Santini, Sebastiano Vigna: The language observatory project (LOP). WWW (Special interest tracks and posters) 2005: 990-991 | |
| 37 | Paolo Boldi, Massimo Santini, Sebastiano Vigna: Paradoxical Effects in PageRank Incremental Computations. Internet Mathematics 2(3): (2005) | |
| 36 | Paolo Boldi, Sebastiano Vigna: Codes for the World Wide Web. Internet Mathematics 2(4): (2005) | |
| 35 | Paolo Boldi, Sebastiano Vigna: Mutable strings in Java: design, implementation and lightweight text-search algorithms. Sci. Comput. Program. 54(1): 3-23 (2005) | |
| 2004 | ||
| 34 | Paolo Boldi, Sebastiano Vigna: The WebGraph Framework II: Codes For The World-Wide Web. Data Compression Conference 2004: 528 | |
| 33 | Paolo Boldi, Sebastiano Vigna: WebGraph: things you thought you could not do with Java™. PPPJ 2004: 1-8 | |
| 32 | Paolo Boldi, Massimo Santini, Sebastiano Vigna: Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations. WAW 2004: 168-180 | |
| 31 | Paolo Boldi, Sebastiano Vigna: The webgraph framework I: compression techniques. WWW 2004: 595-602 | |
| 30 | Paolo Boldi, Bruno Codenotti, Massimo Santini, Sebastiano Vigna: UbiCrawler: a scalable fully distributed Web crawler. Softw., Pract. Exper. 34(8): 711-726 (2004) | |
| 2003 | ||
| 29 | Paolo Boldi, Sebastiano Vigna: Rethinking Java strings. PPPJ 2003: 27-30 | |
| 28 | Paolo Boldi, Sebastiano Vigna: Compact Approximation of Lattice Functions with Applications to Large-Alphabet Text Search CoRR cs.DS/0306046: (2003) | |
| 27 | Paolo Boldi, Sebastiano Vigna: Lower bounds for sense of direction in regular graphs. Distributed Computing 16(4): 279-286 (2003) | |
| 26 | Paolo Boldi, Sebastiano Vigna: Lower bounds for weak sense of direction. J. Discrete Algorithms 1(2): 119-128 (2003) | |
| 2002 | ||
| 25 | Paolo Boldi, Sebastiano Vigna: Holographic Trees. LATIN 2002: 465-478 | |
| 24 | Paolo Boldi, Sebastiano Vigna: Fibrations of graphs. Discrete Mathematics 243(1-3): 21-66 (2002) | |
| 23 | Paolo Boldi, Sebastiano Vigna: Universal dynamic synchronous self-stabilization. Distributed Computing 15(3): 137-153 (2002) | |
| 22 | Paolo Boldi, Felice Cardone, Manfred Droste: Universal Homogeneous Graph-Like Structures And Domains. Mathematical Structures in Computer Science 12(1): 91-109 (2002) | |
| 21 | Paolo Boldi, Massimo Santini, Sebastiano Vigna: Measuring with jugs. Theor. Comput. Sci. 282(2): 259-270 (2002) | |
| 2001 | ||
| 20 | Paolo Boldi, Sebastiano Vigna: An Effective Characterization of Computability in Anonymous Networks. DISC 2001: 33-47 | |
| 19 | Paolo Boldi, Bruno Codenotti, Massimo Santini, Sebastiano Vigna: Trovatore: Towards a Highly Scalable Distributed Web Crawler. WWW Posters 2001 | |
| 2000 | ||
| 18 | Charles Meyssonnier, Paolo Boldi, Sebastiano Vigna: delta-Approximable Functions. CCA 2000: 187-199 | |
| 17 | Paolo Boldi, Sebastiano Vigna: More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs. DISC 2000: 238-252 | |
| 16 | Paolo Boldi, Sebastiano Vigna: Lower bounds for (weak) sense of direction. SIROCCO 2000: 37-46 | |
| 15 | Paolo Boldi, Sebastiano Vigna: Coverings that preserve sense of direction. Inf. Process. Lett. 75(4): 175-180 (2000) | |
| 14 | Paolo Boldi, Sebastiano Vigna: The Turing closure of an Archimedean field. Theor. Comput. Sci. 231(2): 143-156 (2000) | |
| 1999 | ||
| 13 | Paolo Boldi, Sebastiano Vigna: Computing Anonymously with Arbitrary Knowledge. PODC 1999: 181-188 | |
| 12 | Paolo Boldi, Sebastiano Vigna: Complexity of Deciding Sense of Direction. SIAM J. Comput. 29(3): 779-789 (1999) | |
| 11 | Paolo Boldi, Sebastiano Vigna: Equality is a Jump. Theor. Comput. Sci. 219(1-2): 49-64 (1999) | |
| 1998 | ||
| 10 | Paolo Boldi, Sebastiano Vigna: The Turing Closure of an Archimedean Field. MCU (2) 1998: 134-150 | |
| 9 | Paolo Boldi, Sebastiano Vigna: delta-Uniform BSS Machines. J. Complexity 14(2): 234-256 (1998) | |
| 1997 | ||
| 8 | Paolo Boldi, Sebastiano Vigna: Computing Vector Functions on Anonymous Networks. PODC 1997: 277 | |
| 7 | Paolo Boldi, Sebastiano Vigna: Computing Vector Functions on Anonymous Networks. SIROCCO 1997: 201-214 | |
| 6 | Paolo Boldi, Sebastiano Vigna: Self-stabilizing universal algorithms. WSS 1997: 141-156 | |
| 5 | Paolo Boldi, Sebastiano Vigna: Minimal Sense of Direction and Decision Problems for Cayley Graphs. Inf. Process. Lett. 64(6): 299-303 (1997) | |
| 1996 | ||
| 4 | Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon: Symmetry Breaking in Anonymous Networks: Characterizations. ISTCS 1996: 16-26 | |
| 3 | Paolo Boldi, Sebastiano Vigna: Good Fibrations and Other Construction Which Preserve Sense of Direction. SIROCCO 1996: 47-58 | |
| 2 | Paolo Boldi: Maximal Chains and Antichains in Strongly Noetherian Semiorders. Fundam. Inform. 26(1): 59-80 (1996) | |
| 1995 | ||
| 1 | Paolo Boldi, Sebastiano Vigna: On the Complexity of Deciding Sense of Direction. SIROCCO 1995: 39-51 | |