| 2012 | ||
|---|---|---|
| j32 | Paolo Boldi, Luisa Gargano: Special Issue on Fun with Algorithms. Theory Comput. Syst. 50(1): 1-2 (2012) | |
| j31 | Paolo Boldi, Francesco Bonchi, Aristides Gionis, Tamir Tassa: Injecting Uncertainty in Graphs for Identity Obfuscation. PVLDB 5(11): 1376-1387 (2012) | |
| c49 | ||
| c48 | ||
| c47 | ||
| c46 | Lars Backstrom, Paolo Boldi, Marco Rosa, Johan Ugander, Sebastiano Vigna: Four degrees of separation. WebSci 2012: 33-42 | |
| i11 | ||
| i10 | Paolo Boldi, Francesco Bonchi, Aristides Gionis, Tamir Tassa: Injecting Uncertainty in Graphs for Identity Obfuscation. CoRR abs/1208.4145 (2012) | |
| i9 | Djamal Belazzougui, Paolo Boldi, Sebastiano Vigna: Predecessor search with distance-sensitive query time. CoRR abs/1209.5441 (2012) | |
| 2011 | ||
| j30 | Paolo Boldi, Francesco Bonchi, Carlos Castillo, Sebastiano Vigna: Viscous democracy for social networks. Commun. ACM 54(6): 129-137 (2011) | |
| j29 | Paolo Boldi, Sebastiano Vigna: E=I+T: The internal extent formula for compacted tries. Inf. Process. Lett. 111(7): 310-313 (2011) | |
| j28 | Paolo Boldi, Francesco Bonchi, Carlos Castillo, Sebastiano Vigna: Query reformulation mining: models, patterns, and applications. Inf. Retr. 14(3): 257-289 (2011) | |
| j27 | Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna: Theory and practice of monotone minimal perfect hashing. ACM Journal of Experimental Algorithmics 16 (2011) | |
| c45 | Paolo Boldi, Marco Rosa, Sebastiano Vigna: Robustness of Social Networks: Comparative Results Based on Distance Distributions. SocInfo 2011: 8-21 | |
| c44 | Paolo Boldi, Marco Rosa, Massimo Santini, Sebastiano Vigna: Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. WWW 2011: 587-596 | |
| c43 | Paolo Boldi, Marco Rosa, Sebastiano Vigna: HyperANF: approximating the neighbourhood function of very large graphs on a budget. WWW 2011: 625-634 | |
| i8 | ||
| i7 | Paolo Boldi, Marco Rosa, Sebastiano Vigna: Robustness of Social Networks: Comparative Results Based on Distance Distributions. CoRR abs/1110.4474 (2011) | |
| i6 | Lars Backstrom, Paolo Boldi, Marco Rosa, Johan Ugander, Sebastiano Vigna: Four Degrees of Separation. CoRR abs/1111.4570 (2011) | |
| 2010 | ||
| j26 | Luca Becchetti, Paolo Boldi, Carlos Castillo, Aristides Gionis: Efficient algorithms for large-scale local triangle counting. TKDD 4(3) (2010) | |
| c42 | Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna: Fast Prefix Search in Little Space, with Applications. ESA (1) 2010: 427-438 | |
| c41 | Ricardo A. Baeza-Yates, Paolo Boldi, Alessandro Bozzon, Marco Brambilla, Stefano Ceri, Gabriella Pasi: Trends in Search Interaction. SeCO Workshop 2010: 26-32 | |
| c40 | ||
| e2 | Paolo Boldi, Luisa Gargano (Eds.): Fun with Algorithms, 5th International Conference, FUN 2010, Ischia, Italy, June 2-4, 2010. Proceedings. Lecture Notes in Computer Science 6099, Springer 2010, isbn 978-3-642-13121-9 | |
| i5 | Paolo Boldi, Marco Rosa, Massimo Santini, Sebastiano Vigna: Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks. CoRR abs/1011.5425 (2010) | |
| i4 | Paolo Boldi, Marco Rosa, Sebastiano Vigna: HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget. CoRR abs/1011.5599 (2010) | |
| i3 | Paolo Boldi, Sebastiano Vigna: E = I + T: The internal extent formula for compacted tries. CoRR abs/1012.3024 (2010) | |
| 2009 | ||
| j25 | Paolo Boldi, Massimo Santini, Sebastiano Vigna: Permuting Web and Social Graphs. Internet Mathematics 6(3): 257-283 (2009) | |
| j24 | Paolo Boldi, Flavio Chierichetti, Sebastiano Vigna: Pictures from Mongolia. Extracting the Top Elements from a Partially Ordered Set. Theory Comput. Syst. 44(2): 269-288 (2009) | |
| j23 | Paolo Boldi, Massimo Santini, Sebastiano Vigna: PageRank: Functional dependencies. ACM Trans. Inf. Syst. 27(4) (2009) | |
| c39 | Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna: Theory and Practise of Monotone Minimal Perfect Hashing. ALENEX 2009: 132-144 | |
| c38 | Paolo Boldi, Francesco Bonchi, Carlos Castillo, Sebastiano Vigna: Voting in social networks. CIKM 2009: 777-786 | |
| c37 | Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna: Monotone minimal perfect hashing: searching a sorted table with O(1) accesses. SODA 2009: 785-794 | |
| c36 | ||
| c35 | Paolo Boldi, Francesco Bonchi, Carlos Castillo, Sebastiano Vigna: From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns. Web Intelligence 2009: 183-190 | |
| e1 | Ricardo A. Baeza-Yates, Paolo Boldi, Berthier A. Ribeiro-Neto, Berkant Barla Cambazoglu (Eds.): Proceedings of the Second International Conference on Web Search and Web Data Mining, WSDM 2009, Barcelona, Spain, February 9-11, 2009. ACM 2009, isbn 978-1-60558-390-7 | |
| 2008 | ||
| j22 | Paolo Boldi, Violetta Lonati, Roberto Radicioni, Massimo Santini: The number of convex permutominoes. Inf. Comput. 206(9-10): 1074-1083 (2008) | |
| j21 | Paolo Boldi, Massimo Santini, Sebastiano Vigna: A large time-aware web graph. SIGIR Forum 42(2): 33-38 (2008) | |
| c34 | Paolo Boldi, Francesco Bonchi, Carlos Castillo, Debora Donato, Aristides Gionis, Sebastiano Vigna: The query-flow graph: model and applications. CIKM 2008: 609-618 | |
| c33 | Ilaria Bordino, Paolo Boldi, Debora Donato, Massimo Santini, Sebastiano Vigna: Temporal Evolution of the UK Web. ICDM Workshops 2008: 909-918 | |
| c32 | Luca Becchetti, Paolo Boldi, Carlos Castillo, Aristides Gionis: Efficient semi-streaming algorithms for local triangle counting in massive graphs. KDD 2008: 16-24 | |
| 2007 | ||
| j20 | 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) | |
| c31 | 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 | |
| c30 | Paolo Boldi, Flavio Chierichetti, Sebastiano Vigna: Pictures from Mongolia - Partial Sorting in a Partial World. FUN 2007: 66-77 | |
| c29 | Paolo Boldi, Violetta Lonati, Roberto Radicioni, Massimo Santini: The Number of Convex Permutominoes. LATA 2007: 151-162 | |
| i2 | Sebastiano Vigna, Paolo Boldi: Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics. CoRR abs/0710.1525 (2007) | |
| 2006 | ||
| j19 | Paolo Boldi, Violetta Lonati, Massimo Santini, Sebastiano Vigna: Graph fibrations, graph isomorphism, and PageRank. ITA 40(2): 227-253 (2006) | |
| j18 | 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) | |
| c28 | Ricardo A. Baeza-Yates, Paolo Boldi, Carlos Castillo: Generalizing PageRank: damping functions for link-based ranking algorithms. SIGIR 2006: 308-315 | |
| c27 | Paolo Boldi, Sebastiano Vigna: Efficient Lazy Algorithms for Minimal-Interval Semantics. SPIRE 2006: 134-149 | |
| c26 | ||
| c25 | Paolo Boldi, Roberto Posenato, Massimo Santini, Sebastiano Vigna: Traps and Pitfalls of Topic-Biased PageRank. WAW 2006: 107-116 | |
| 2005 | ||
| j17 | Paolo Boldi, Massimo Santini, Sebastiano Vigna: Paradoxical Effects in PageRank Incremental Computations. Internet Mathematics 2(3): 387-404 (2005) | |
| j16 | Paolo Boldi, Sebastiano Vigna: Codes for the World Wide Web. Internet Mathematics 2(4): 407-429 (2005) | |
| j15 | Paolo Boldi, Sebastiano Vigna: Mutable strings in Java: design, implementation and lightweight text-search algorithms. Sci. Comput. Program. 54(1): 3-23 (2005) | |
| c24 | Paolo Boldi, Sebastiano Vigna: Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups. SPIRE 2005: 25-28 | |
| c23 | ||
| c22 | Paolo Boldi, Massimo Santini, Sebastiano Vigna: PageRank as a function of the damping factor. WWW 2005: 557-566 | |
| c21 | Paolo Boldi: TotalRank: ranking without damping. WWW (Special interest tracks and posters) 2005: 898-899 | |
| c20 | 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 | |
| 2004 | ||
| j14 | Paolo Boldi, Bruno Codenotti, Massimo Santini, Sebastiano Vigna: UbiCrawler: a scalable fully distributed Web crawler. Softw., Pract. Exper. 34(8): 711-726 (2004) | |
| c19 | Paolo Boldi, Sebastiano Vigna: The WebGraph Framework II: Codes For The World-Wide Web. Data Compression Conference 2004: 528 | |
| c18 | Paolo Boldi, Sebastiano Vigna: WebGraph: things you thought you could not do with Java™. PPPJ 2004: 1-8 | |
| c17 | Paolo Boldi, Massimo Santini, Sebastiano Vigna: Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations. WAW 2004: 168-180 | |
| c16 | ||
| 2003 | ||
| j13 | Paolo Boldi, Sebastiano Vigna: Lower bounds for sense of direction in regular graphs. Distributed Computing 16(4): 279-286 (2003) | |
| j12 | Paolo Boldi, Sebastiano Vigna: Lower bounds for weak sense of direction. J. Discrete Algorithms 1(2): 119-128 (2003) | |
| c15 | ||
| i1 | Paolo Boldi, Sebastiano Vigna: Compact Approximation of Lattice Functions with Applications to Large-Alphabet Text Search. CoRR cs.DS/0306046 (2003) | |
| 2002 | ||
| j11 | Paolo Boldi, Sebastiano Vigna: Universal dynamic synchronous self-stabilization. Distributed Computing 15(3): 137-153 (2002) | |
| j10 | ||
| j9 | Paolo Boldi, Felice Cardone, Manfred Droste: Universal Homogeneous Graph-Like Structures And Domains. Mathematical Structures in Computer Science 12(1): 91-109 (2002) | |
| j8 | Paolo Boldi, Massimo Santini, Sebastiano Vigna: Measuring with jugs. Theor. Comput. Sci. 282(2): 259-270 (2002) | |
| c14 | ||
| 2001 | ||
| c13 | Paolo Boldi, Sebastiano Vigna: An Effective Characterization of Computability in Anonymous Networks. DISC 2001: 33-47 | |
| c12 | Paolo Boldi, Bruno Codenotti, Massimo Santini, Sebastiano Vigna: Trovatore: Towards a Highly Scalable Distributed Web Crawler. WWW Posters 2001 | |
| 2000 | ||
| j7 | Paolo Boldi, Sebastiano Vigna: Coverings that preserve sense of direction. Inf. Process. Lett. 75(4): 175-180 (2000) | |
| j6 | Paolo Boldi, Sebastiano Vigna: The Turing closure of an Archimedean field. Theor. Comput. Sci. 231(2): 143-156 (2000) | |
| c11 | ||
| c10 | ||
| c9 | Paolo Boldi, Sebastiano Vigna: More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs. DISC 2000: 238-252 | |
| 1999 | ||
| j5 | Paolo Boldi, Sebastiano Vigna: Complexity of Deciding Sense of Direction. SIAM J. Comput. 29(3): 779-789 (1999) | |
| j4 | ||
| c8 | ||
| 1998 | ||
| j3 | ||
| c7 | ||
| 1997 | ||
| j2 | Paolo Boldi, Sebastiano Vigna: Minimal Sense of Direction and Decision Problems for Cayley Graphs. Inf. Process. Lett. 64(6): 299-303 (1997) | |
| c6 | ||
| c5 | Paolo Boldi, Sebastiano Vigna: Computing Vector Functions on Anonymous Networks. SIROCCO 1997: 201-214 | |
| c4 | ||
| 1996 | ||
| j1 | Paolo Boldi: Maximal Chains and Antichains in Strongly Noetherian Semiorders. Fundam. Inform. 26(1): 59-80 (1996) | |
| c3 | Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon: Symmetry Breaking in Anonymous Networks: Characterizations. ISTCS 1996: 16-26 | |
| c2 | Paolo Boldi, Sebastiano Vigna: Good Fibrations and Other Construction Which Preserve Sense of Direction. SIROCCO 1996: 47-58 | |
| 1995 | ||
| c1 | Paolo Boldi, Sebastiano Vigna: On the Complexity of Deciding Sense of Direction. SIROCCO 1995: 39-51 | |
Colors in the list of coauthors
Last update Mon May 20 05:44:05 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page