 | 2009 |
|---|
| 71 |       | Djamal Belazzougui,
Paolo Boldi,
Rasmus Pagh,
Sebastiano Vigna:
Theory and Practise of Monotone Minimal Perfect Hashing.
ALENEX 2009: 132-144 |
| 70 | | Paolo Boldi,
Francesco Bonchi,
Carlos Castillo,
Sebastiano Vigna:
Voting in social networks.
CIKM 2009: 777-786 |
| 69 | | Djamal Belazzougui,
Paolo Boldi,
Rasmus Pagh,
Sebastiano Vigna:
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses.
SODA 2009: 785-794 |
| 68 | | Paolo Boldi,
Massimo Santini,
Sebastiano Vigna:
Permuting Web Graphs.
WAW 2009: 116-126 |
| 67 | | Paolo Boldi,
Francesco Bonchi,
Carlos Castillo,
Sebastiano Vigna:
From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns.
Web Intelligence 2009: 183-190 |
| 2008 |
|---|
| 66 | | Paolo Boldi,
Francesco Bonchi,
Carlos Castillo,
Debora Donato,
Aristides Gionis,
Sebastiano Vigna:
The query-flow graph: model and applications.
CIKM 2008: 609-618 |
| 65 | | Ilaria Bordino,
Paolo Boldi,
Debora Donato,
Massimo Santini,
Sebastiano Vigna:
Temporal Evolution of the UK Web.
ICDM Workshops 2008: 909-918 |
| 64 | | Sebastiano Vigna:
Broadword Implementation of Rank/Select Queries.
WEA 2008: 154-168 |
| 63 | | Paolo Boldi,
Massimo Santini,
Sebastiano Vigna:
A large time-aware web graph.
SIGIR Forum 42(2): 33-38 (2008) |
| 62 | | Alessio Orlandi,
Sebastiano Vigna:
Compressed collections for simulated crawling.
SIGIR Forum 42(2): 39-44 (2008) |
| 2007 |
|---|
| 61 | | Paolo Boldi,
Flavio Chierichetti,
Sebastiano Vigna:
Pictures from Mongolia - Partial Sorting in a Partial World.
FUN 2007: 66-77 |
| 60 | | 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 |
| 59 | | Sebastiano Vigna:
Stanford Matrix Considered Harmful.
Web Information Retrieval and Linear Algebra Algorithms 2007 |
| 58 | | Sebastiano Vigna,
Paolo Boldi:
Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics
CoRR abs/0710.1525: (2007) |
| 57 | | Sebastiano Vigna:
Stanford Matrix Considered Harmful
CoRR abs/0710.1962: (2007) |
| 2006 |
|---|
| 56 | | Paolo Boldi,
Sebastiano Vigna:
Efficient Lazy Algorithms for Minimal-Interval Semantics.
SPIRE 2006: 134-149 |
| 55 | | Paolo Boldi,
Sebastiano Vigna:
MG4J at TREC 2006.
TREC 2006 |
| 54 | | Paolo Boldi,
Roberto Posenato,
Massimo Santini,
Sebastiano Vigna:
Traps and Pitfalls of Topic-Biased PageRank.
WAW 2006: 107-116 |
| 53 | | Paolo Boldi,
Violetta Lonati,
Massimo Santini,
Sebastiano Vigna:
Graph fibrations, graph isomorphism, and PageRank.
ITA 40(2): 227-253 (2006) |
| 52 | | 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 |
|---|
| 51 | | Paolo Boldi,
Sebastiano Vigna:
Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups.
SPIRE 2005: 25-28 |
| 50 | | Paolo Boldi,
Sebastiano Vigna:
MG4J at TREC 2005.
TREC 2005 |
| 49 | | Paolo Boldi,
Massimo Santini,
Sebastiano Vigna:
PageRank as a function of the damping factor.
WWW 2005: 557-566 |
| 48 | | Sebastiano Vigna:
TruRank: taking PageRank to the limit.
WWW (Special interest tracks and posters) 2005: 976-977 |
| 47 | | 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 |
| 46 |  | Paolo Boldi,
Massimo Santini,
Sebastiano Vigna:
Paradoxical Effects in PageRank Incremental Computations.
Internet Mathematics 2(3): (2005) |
| 45 | | Paolo Boldi,
Sebastiano Vigna:
Codes for the World Wide Web.
Internet Mathematics 2(4): (2005) |
| 44 | | Paolo Boldi,
Sebastiano Vigna:
Mutable strings in Java: design, implementation and lightweight text-search algorithms.
Sci. Comput. Program. 54(1): 3-23 (2005) |
| 2004 |
|---|
| 43 | | Paolo Boldi,
Sebastiano Vigna:
The WebGraph Framework II: Codes For The World-Wide Web.
Data Compression Conference 2004: 528 |
| 42 | | Sebastiano Vigna:
Reachability Problems in Entity-Relationship Schema Instances.
ER 2004: 96-109 |
| 41 | | Paolo Boldi,
Sebastiano Vigna:
WebGraph: things you thought you could not do with Java™.
PPPJ 2004: 1-8 |
| 40 | | Paolo Boldi,
Massimo Santini,
Sebastiano Vigna:
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations.
WAW 2004: 168-180 |
| 39 | | Paolo Boldi,
Sebastiano Vigna:
The webgraph framework I: compression techniques.
WWW 2004: 595-602 |
| 38 | | Paolo Boldi,
Bruno Codenotti,
Massimo Santini,
Sebastiano Vigna:
UbiCrawler: a scalable fully distributed Web crawler.
Softw., Pract. Exper. 34(8): 711-726 (2004) |
| 2003 |
|---|
| 37 | | Sebastiano Vigna:
Automatic Generation of Content Management Systems from EER-Based Specifications.
ASE 2003: 259-262 |
| 36 | | Paolo Boldi,
Sebastiano Vigna:
Rethinking Java strings.
PPPJ 2003: 27-30 |
| 35 | | Paolo Boldi,
Sebastiano Vigna:
Compact Approximation of Lattice Functions with Applications to Large-Alphabet Text Search
CoRR cs.DS/0306046: (2003) |
| 34 | | Sebastiano Vigna:
Distributive Computability
CoRR cs.OH/0306136: (2003) |
| 33 | | Paolo Boldi,
Sebastiano Vigna:
Lower bounds for sense of direction in regular graphs.
Distributed Computing 16(4): 279-286 (2003) |
| 32 | | Paolo Boldi,
Sebastiano Vigna:
Lower bounds for weak sense of direction.
J. Discrete Algorithms 1(2): 119-128 (2003) |
| 2002 |
|---|
| 31 | | Sebastiano Vigna:
Multirelational Semantics for ExtendedEntity-Relationship Schemata with Applications.
ER 2002: 35-49 |
| 30 | | Paolo Boldi,
Sebastiano Vigna:
Holographic Trees.
LATIN 2002: 465-478 |
| 29 | | Paolo Boldi,
Sebastiano Vigna:
Fibrations of graphs.
Discrete Mathematics 243(1-3): 21-66 (2002) |
| 28 | | Paolo Boldi,
Sebastiano Vigna:
Universal dynamic synchronous self-stabilization.
Distributed Computing 15(3): 137-153 (2002) |
| 27 | | Paolo Boldi,
Massimo Santini,
Sebastiano Vigna:
Measuring with jugs.
Theor. Comput. Sci. 282(2): 259-270 (2002) |
| 2001 |
|---|
| 26 | | Paolo Boldi,
Sebastiano Vigna:
An Effective Characterization of Computability in Anonymous Networks.
DISC 2001: 33-47 |
| 25 | | Paolo Boldi,
Bruno Codenotti,
Massimo Santini,
Sebastiano Vigna:
Trovatore: Towards a Highly Scalable Distributed Web Crawler.
WWW Posters 2001 |
| 2000 |
|---|
| 24 | | Charles Meyssonnier,
Paolo Boldi,
Sebastiano Vigna:
delta-Approximable Functions.
CCA 2000: 187-199 |
| 23 | | Paolo Boldi,
Sebastiano Vigna:
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs.
DISC 2000: 238-252 |
| 22 | | Paolo Boldi,
Sebastiano Vigna:
Lower bounds for (weak) sense of direction.
SIROCCO 2000: 37-46 |
| 21 | | Paolo Boldi,
Sebastiano Vigna:
Coverings that preserve sense of direction.
Inf. Process. Lett. 75(4): 175-180 (2000) |
| 20 | | Paolo Boldi,
Sebastiano Vigna:
The Turing closure of an Archimedean field.
Theor. Comput. Sci. 231(2): 143-156 (2000) |
| 1999 |
|---|
| 19 | | Paolo Boldi,
Sebastiano Vigna:
Computing Anonymously with Arbitrary Knowledge.
PODC 1999: 181-188 |
| 18 | | Paolo Boldi,
Sebastiano Vigna:
Complexity of Deciding Sense of Direction.
SIAM J. Comput. 29(3): 779-789 (1999) |
| 17 | | Paolo Boldi,
Sebastiano Vigna:
Equality is a Jump.
Theor. Comput. Sci. 219(1-2): 49-64 (1999) |
| 1998 |
|---|
| 16 | | Paolo Boldi,
Sebastiano Vigna:
The Turing Closure of an Archimedean Field.
MCU (2) 1998: 134-150 |
| 15 | | Paolo Boldi,
Sebastiano Vigna:
delta-Uniform BSS Machines.
J. Complexity 14(2): 234-256 (1998) |
| 1997 |
|---|
| 14 | | Paolo Boldi,
Sebastiano Vigna:
Computing Vector Functions on Anonymous Networks.
PODC 1997: 277 |
| 13 | | Paolo Boldi,
Sebastiano Vigna:
Computing Vector Functions on Anonymous Networks.
SIROCCO 1997: 201-214 |
| 12 | | Paolo Boldi,
Sebastiano Vigna:
Self-stabilizing universal algorithms.
WSS 1997: 141-156 |
| 11 | | Stefano Kasangian,
Sebastiano Vigna:
The Topos of Labelled Trees: A Categorical Semantics for SCCS.
Fundam. Inform. 32(1): 27-45 (1997) |
| 10 | | Paolo Boldi,
Sebastiano Vigna:
Minimal Sense of Direction and Decision Problems for Cayley Graphs.
Inf. Process. Lett. 64(6): 299-303 (1997) |
| 1996 |
|---|
| 9 | | Paolo Boldi,
Shella Shammah,
Sebastiano Vigna,
Bruno Codenotti,
Peter Gemmell,
Janos Simon:
Symmetry Breaking in Anonymous Networks: Characterizations.
ISTCS 1996: 16-26 |
| 8 | | Paolo Boldi,
Sebastiano Vigna:
Good Fibrations and Other Construction Which Preserve Sense of Direction.
SIROCCO 1996: 47-58 |
| 7 | | Nicoletta Sabadini,
Sebastiano Vigna,
Robert F. C. Walters:
A Note on Recursive Functions.
Mathematical Structures in Computer Science 6(2): 127-139 (1996) |
| 6 | | Sebastiano Vigna:
On the Relations between Distributive Computability and the BSS Model.
Theor. Comput. Sci. 162(1): 5-21 (1996) |
| 1995 |
|---|
| 5 | | Paolo Boldi,
Sebastiano Vigna:
On the Complexity of Deciding Sense of Direction.
SIROCCO 1995: 39-51 |
| 1993 |
|---|
| 4 | | Nicoletta Sabadini,
Sebastiano Vigna,
Robert F. C. Walters:
A Notion of Refinement for Automata.
AMAST 1993: 325-332 |
| 3 | | Pierpaolo Degano,
Roberto Gorrieri,
Sebastiano Vigna:
On Relating Some Models for Concurrency.
TAPSOFT 1993: 15-30 |
| 1991 |
|---|
| 2 | | Pierpaolo Degano,
Stefano Kasangian,
Sebastiano Vigna:
Applications of the Calculus of Trees to Process Description Languages.
Category Theory and Computer Science 1991: 282-301 |
| 1 | | Stefano Kasangian,
Sebastiano Vigna:
Introducing a Calculus of Trees.
TAPSOFT, Vol.1 1991: 215-240 |
