dblp.uni-trier.dewww.uni-trier.de

Sebastiano Vigna

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
65EEDjamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna: Theory and Practise of Monotone Minimal Perfect Hashing. ALENEX 2009: 132-144
64EEDjamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna: Monotone minimal perfect hashing: searching a sorted table with O(1) accesses. SODA 2009: 785-794
63EEPaolo Boldi, Massimo Santini, Sebastiano Vigna: Permuting Web Graphs. WAW 2009: 116-126
2008
62EEPaolo Boldi, Francesco Bonchi, Carlos Castillo, Debora Donato, Aristides Gionis, Sebastiano Vigna: The query-flow graph: model and applications. CIKM 2008: 609-618
61EEIlaria Bordino, Paolo Boldi, Debora Donato, Massimo Santini, Sebastiano Vigna: Temporal Evolution of the UK Web. ICDM Workshops 2008: 909-918
60EESebastiano Vigna: Broadword Implementation of Rank/Select Queries. WEA 2008: 154-168
2007
59EEPaolo Boldi, Flavio Chierichetti, Sebastiano Vigna: Pictures from Mongolia - Partial Sorting in a Partial World. FUN 2007: 66-77
58EEPaolo 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
57EESebastiano Vigna: Stanford Matrix Considered Harmful. Web Information Retrieval and Linear Algebra Algorithms 2007
56EESebastiano Vigna, Paolo Boldi: Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics CoRR abs/0710.1525: (2007)
55EESebastiano Vigna: Stanford Matrix Considered Harmful CoRR abs/0710.1962: (2007)
2006
54EEPaolo Boldi, Sebastiano Vigna: Efficient Lazy Algorithms for Minimal-Interval Semantics. SPIRE 2006: 134-149
53EEPaolo Boldi, Sebastiano Vigna: MG4J at TREC 2006. TREC 2006
52EEPaolo Boldi, Roberto Posenato, Massimo Santini, Sebastiano Vigna: Traps and Pitfalls of Topic-Biased PageRank. WAW 2006: 107-116
51EECarlos 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
50EEPaolo Boldi, Sebastiano Vigna: Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups. SPIRE 2005: 25-28
49EEPaolo Boldi, Massimo Santini, Sebastiano Vigna: PageRank as a function of the damping factor. WWW 2005: 557-566
48EESebastiano Vigna: TruRank: taking PageRank to the limit. WWW (Special interest tracks and posters) 2005: 976-977
47EEYoshiki 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)
44EEPaolo Boldi, Sebastiano Vigna: Mutable strings in Java: design, implementation and lightweight text-search algorithms. Sci. Comput. Program. 54(1): 3-23 (2005)
2004
43EEPaolo Boldi, Sebastiano Vigna: The WebGraph Framework II: Codes For The World-Wide Web. Data Compression Conference 2004: 528
42EESebastiano Vigna: Reachability Problems in Entity-Relationship Schema Instances. ER 2004: 96-109
41EEPaolo Boldi, Sebastiano Vigna: WebGraph: things you thought you could not do with Java™. PPPJ 2004: 1-8
40EEPaolo Boldi, Massimo Santini, Sebastiano Vigna: Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations. WAW 2004: 168-180
39EEPaolo Boldi, Sebastiano Vigna: The webgraph framework I: compression techniques. WWW 2004: 595-602
38EEPaolo Boldi, Bruno Codenotti, Massimo Santini, Sebastiano Vigna: UbiCrawler: a scalable fully distributed Web crawler. Softw., Pract. Exper. 34(8): 711-726 (2004)
2003
37EESebastiano Vigna: Automatic Generation of Content Management Systems from EER-Based Specifications. ASE 2003: 259-262
36EEPaolo Boldi, Sebastiano Vigna: Rethinking Java strings. PPPJ 2003: 27-30
35EEPaolo Boldi, Sebastiano Vigna: Compact Approximation of Lattice Functions with Applications to Large-Alphabet Text Search CoRR cs.DS/0306046: (2003)
34EESebastiano Vigna: Distributive Computability CoRR cs.OH/0306136: (2003)
33EEPaolo Boldi, Sebastiano Vigna: Lower bounds for sense of direction in regular graphs. Distributed Computing 16(4): 279-286 (2003)
32EEPaolo Boldi, Sebastiano Vigna: Lower bounds for weak sense of direction. J. Discrete Algorithms 1(2): 119-128 (2003)
2002
31EESebastiano Vigna: Multirelational Semantics for ExtendedEntity-Relationship Schemata with Applications. ER 2002: 35-49
30EEPaolo Boldi, Sebastiano Vigna: Holographic Trees. LATIN 2002: 465-478
29EEPaolo Boldi, Sebastiano Vigna: Fibrations of graphs. Discrete Mathematics 243(1-3): 21-66 (2002)
28EEPaolo Boldi, Sebastiano Vigna: Universal dynamic synchronous self-stabilization. Distributed Computing 15(3): 137-153 (2002)
27EEPaolo Boldi, Massimo Santini, Sebastiano Vigna: Measuring with jugs. Theor. Comput. Sci. 282(2): 259-270 (2002)
2001
26EEPaolo Boldi, Sebastiano Vigna: An Effective Characterization of Computability in Anonymous Networks. DISC 2001: 33-47
25EEPaolo Boldi, Bruno Codenotti, Massimo Santini, Sebastiano Vigna: Trovatore: Towards a Highly Scalable Distributed Web Crawler. WWW Posters 2001
2000
24EECharles Meyssonnier, Paolo Boldi, Sebastiano Vigna: delta-Approximable Functions. CCA 2000: 187-199
23EEPaolo 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
21EEPaolo Boldi, Sebastiano Vigna: Coverings that preserve sense of direction. Inf. Process. Lett. 75(4): 175-180 (2000)
20EEPaolo Boldi, Sebastiano Vigna: The Turing closure of an Archimedean field. Theor. Comput. Sci. 231(2): 143-156 (2000)
1999
19EEPaolo 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)
17EEPaolo 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
15EEPaolo 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)
10EEPaolo 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)
6EESebastiano 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

Coauthor Index

1Irwan Nizan Ayob [47]
2Luca Becchetti [51]
3Djamal Belazzougui [64] [65]
4Paolo Boldi [5] [8] [9] [10] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] [32] [33] [35] [36] [38] [39] [40] [41] [43] [44] [45] [46] [47] [49] [50] [51] [52] [53] [54] [56] [58] [59] [61] [62] [63] [64] [65]
5Francesco Bonchi [62]
6Ilaria Bordino [61]
7Carlos Castillo [51] [62]
8Flavio Chierichetti [59]
9Bruno Codenotti [9] [25] [38]
10Pierpaolo Degano [2] [3]
11Debora Donato [51] [61] [62]
12Peter Gemmell [9]
13Aristides Gionis [62]
14Roberto Gorrieri [3]
15Stefano Kasangian [1] [2] [11]
16Stefano Leonardi [51]
17Tomohide Maki [47]
18Charles Meyssonnier [24]
19Yoshiki Mikami [47]
20Rasmus Pagh [64] [65]
21Roberto Posenato [52]
22Mohd Zaidi Abd Rozan [47]
23Nicoletta Sabadini [4] [7]
24Massimo Santini [25] [27] [38] [40] [46] [47] [49] [51] [52] [58] [61] [63]
25Shella Shammah [9]
26Janos Simon [9]
27Izumi Suzuki [47]
28Masayuki Takahashi [47]
29Robert F. C. Walters [4] [7]
30Pavol Zavarsky [47]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)