Search the dblp DataBase
Sebastiano Vigna :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Nicoletta Sabadini , Sebastiano Vigna , Robert F. C. Walters A Notion of Refinement for Automata. [Citation Graph (0, 0)][DBLP ] AMAST, 1993, pp:325-332 [Conf ] Charles Meyssonnier , Paolo Boldi , Sebastiano Vigna delta-Approximable Functions. [Citation Graph (0, 0)][DBLP ] CCA, 2000, pp:187-199 [Conf ] Pierpaolo Degano , Stefano Kasangian , Sebastiano Vigna Applications of the Calculus of Trees to Process Description Languages. [Citation Graph (0, 0)][DBLP ] Category Theory and Computer Science, 1991, pp:282-301 [Conf ] Paolo Boldi , Sebastiano Vigna The WebGraph Framework II: Codes For The World-Wide Web. [Citation Graph (0, 0)][DBLP ] Data Compression Conference, 2004, pp:528- [Conf ] Sebastiano Vigna Multirelational Semantics for ExtendedEntity-Relationship Schemata with Applications. [Citation Graph (0, 0)][DBLP ] ER, 2002, pp:35-49 [Conf ] Sebastiano Vigna Reachability Problems in Entity-Relationship Schema Instances. [Citation Graph (0, 0)][DBLP ] ER, 2004, pp:96-109 [Conf ] Paolo Boldi , Shella Shammah , Sebastiano Vigna , Bruno Codenotti , Peter Gemmell , Janos Simon Symmetry Breaking in Anonymous Networks: Characterizations. [Citation Graph (0, 0)][DBLP ] ISTCS, 1996, pp:16-26 [Conf ] Sebastiano Vigna Automatic Generation of Content Management Systems from EER-Based Specifications. [Citation Graph (0, 0)][DBLP ] ASE, 2003, pp:259-262 [Conf ] Paolo Boldi , Sebastiano Vigna Holographic Trees. [Citation Graph (0, 0)][DBLP ] LATIN, 2002, pp:465-478 [Conf ] Paolo Boldi , Sebastiano Vigna The Turing Closure of an Archimedean Field. [Citation Graph (0, 0)][DBLP ] MCU (2), 1998, pp:134-150 [Conf ] Paolo Boldi , Sebastiano Vigna Computing Vector Functions on Anonymous Networks. [Citation Graph (0, 0)][DBLP ] PODC, 1997, pp:277- [Conf ] Paolo Boldi , Sebastiano Vigna Computing Anonymously with Arbitrary Knowledge. [Citation Graph (0, 0)][DBLP ] PODC, 1999, pp:181-188 [Conf ] Paolo Boldi , Sebastiano Vigna Lower bounds for (weak) sense of direction. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2000, pp:37-46 [Conf ] Paolo Boldi , Sebastiano Vigna On the Complexity of Deciding Sense of Direction. [Citation Graph (0, 0)][DBLP ] SIROCCO, 1995, pp:39-51 [Conf ] Paolo Boldi , Sebastiano Vigna Good Fibrations and Other Construction Which Preserve Sense of Direction. [Citation Graph (0, 0)][DBLP ] SIROCCO, 1996, pp:47-58 [Conf ] Paolo Boldi , Sebastiano Vigna Computing Vector Functions on Anonymous Networks. [Citation Graph (0, 0)][DBLP ] SIROCCO, 1997, pp:201-214 [Conf ] Paolo Boldi , Sebastiano Vigna Efficient Lazy Algorithms for Minimal-Interval Semantics. [Citation Graph (0, 0)][DBLP ] SPIRE, 2006, pp:134-149 [Conf ] Paolo Boldi , Sebastiano Vigna Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups. [Citation Graph (0, 0)][DBLP ] SPIRE, 2005, pp:25-28 [Conf ] Pierpaolo Degano , Roberto Gorrieri , Sebastiano Vigna On Relating Some Models for Concurrency. [Citation Graph (0, 0)][DBLP ] TAPSOFT, 1993, pp:15-30 [Conf ] Stefano Kasangian , Sebastiano Vigna Introducing a Calculus of Trees. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1991, pp:215-240 [Conf ] Paolo Boldi , Massimo Santini , Sebastiano Vigna Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations. [Citation Graph (0, 0)][DBLP ] WAW, 2004, pp:168-180 [Conf ] Paolo Boldi , Sebastiano Vigna More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs. [Citation Graph (0, 0)][DBLP ] DISC, 2000, pp:238-252 [Conf ] Paolo Boldi , Sebastiano Vigna An Effective Characterization of Computability in Anonymous Networks. [Citation Graph (0, 0)][DBLP ] DISC, 2001, pp:33-47 [Conf ] Paolo Boldi , Sebastiano Vigna Self-stabilizing universal algorithms. [Citation Graph (0, 0)][DBLP ] WSS, 1997, pp:141-156 [Conf ] Paolo Boldi , Bruno Codenotti , Massimo Santini , Sebastiano Vigna Trovatore: Towards a Highly Scalable Distributed Web Crawler. [Citation Graph (0, 0)][DBLP ] WWW Posters, 2001, pp:- [Conf ] Paolo Boldi , Massimo Santini , Sebastiano Vigna PageRank as a function of the damping factor. [Citation Graph (0, 0)][DBLP ] WWW, 2005, pp:557-566 [Conf ] Paolo Boldi , Sebastiano Vigna The webgraph framework I: compression techniques. [Citation Graph (0, 0)][DBLP ] WWW, 2004, pp:595-602 [Conf ] 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). [Citation Graph (0, 0)][DBLP ] WWW (Special interest tracks and posters), 2005, pp:990-991 [Conf ] Sebastiano Vigna TruRank: taking PageRank to the limit. [Citation Graph (0, 0)][DBLP ] WWW (Special interest tracks and posters), 2005, pp:976-977 [Conf ] Paolo Boldi , Sebastiano Vigna Compact Approximation of Lattice Functions with Applications to Large-Alphabet Text Search [Citation Graph (0, 0)][DBLP ] CoRR, 2003, v:0, n:, pp:- [Journal ] Sebastiano Vigna Distributive Computability [Citation Graph (0, 0)][DBLP ] CoRR, 2003, v:0, n:, pp:- [Journal ] Paolo Boldi , Sebastiano Vigna Universal dynamic synchronous self-stabilization. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 2002, v:15, n:3, pp:137-153 [Journal ] Paolo Boldi , Sebastiano Vigna Lower bounds for sense of direction in regular graphs. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 2003, v:16, n:4, pp:279-286 [Journal ] Paolo Boldi , Sebastiano Vigna Fibrations of graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:243, n:1-3, pp:21-66 [Journal ] Stefano Kasangian , Sebastiano Vigna The Topos of Labelled Trees: A Categorical Semantics for SCCS. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 1997, v:32, n:1, pp:27-45 [Journal ] Paolo Boldi , Sebastiano Vigna Coverings that preserve sense of direction. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:75, n:4, pp:175-180 [Journal ] Paolo Boldi , Sebastiano Vigna Minimal Sense of Direction and Decision Problems for Cayley Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1997, v:64, n:6, pp:299-303 [Journal ] Paolo Boldi , Sebastiano Vigna delta-Uniform BSS Machines. [Citation Graph (0, 0)][DBLP ] J. Complexity, 1998, v:14, n:2, pp:234-256 [Journal ] Paolo Boldi , Sebastiano Vigna Lower bounds for weak sense of direction. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2003, v:1, n:2, pp:119-128 [Journal ] Nicoletta Sabadini , Sebastiano Vigna , Robert F. C. Walters A Note on Recursive Functions. [Citation Graph (0, 0)][DBLP ] Mathematical Structures in Computer Science, 1996, v:6, n:2, pp:127-139 [Journal ] Paolo Boldi , Sebastiano Vigna Mutable strings in Java: design, implementation and lightweight text-search algorithms. [Citation Graph (0, 0)][DBLP ] Sci. Comput. Program., 2005, v:54, n:1, pp:3-23 [Journal ] Paolo Boldi , Sebastiano Vigna Complexity of Deciding Sense of Direction. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1999, v:29, n:3, pp:779-789 [Journal ] Carlos Castillo , Debora Donato , Luca Becchetti , Paolo Boldi , Stefano Leonardi , Massimo Santini , Sebastiano Vigna A reference collection for web spam. [Citation Graph (0, 0)][DBLP ] SIGIR Forum, 2006, v:40, n:2, pp:11-24 [Journal ] Paolo Boldi , Bruno Codenotti , Massimo Santini , Sebastiano Vigna UbiCrawler: a scalable fully distributed Web crawler. [Citation Graph (0, 0)][DBLP ] Softw., Pract. Exper., 2004, v:34, n:8, pp:711-726 [Journal ] Paolo Boldi , Massimo Santini , Sebastiano Vigna Measuring with jugs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:282, n:2, pp:259-270 [Journal ] Paolo Boldi , Sebastiano Vigna The Turing closure of an Archimedean field. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2000, v:231, n:2, pp:143-156 [Journal ] Paolo Boldi , Sebastiano Vigna Equality is a Jump. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1999, v:219, n:1-2, pp:49-64 [Journal ] Sebastiano Vigna On the Relations between Distributive Computability and the BSS Model. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1996, v:162, n:1, pp:5-21 [Journal ] Paolo Boldi , Massimo Santini , Sebastiano Vigna A Deeper Investigation of PageRank as a Function of the Damping Factor. [Citation Graph (0, 0)][DBLP ] Web Information Retrieval and Linear Algebra Algorithms, 2007, pp:- [Conf ] Sebastiano Vigna Stanford Matrix Considered Harmful. [Citation Graph (0, 0)][DBLP ] Web Information Retrieval and Linear Algebra Algorithms, 2007, pp:- [Conf ] Paolo Boldi , Flavio Chierichetti , Sebastiano Vigna Pictures from Mongolia - Partial Sorting in a Partial World. [Citation Graph (0, 0)][DBLP ] FUN, 2007, pp:66-77 [Conf ] Paolo Boldi , Sebastiano Vigna WebGraph: things you thought you could not do with Java™. [Citation Graph (0, 0)][DBLP ] PPPJ, 2004, pp:1-8 [Conf ] Paolo Boldi , Sebastiano Vigna Rethinking Java strings. [Citation Graph (0, 0)][DBLP ] PPPJ, 2003, pp:27-30 [Conf ] Sebastiano Vigna , Paolo Boldi Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Sebastiano Vigna Stanford Matrix Considered Harmful [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Theory and Practise of Monotone Minimal Perfect Hashing. [Citation Graph (, )][DBLP ] The query-flow graph: model and applications. [Citation Graph (, )][DBLP ] Voting in social networks. [Citation Graph (, )][DBLP ] Fast Prefix Search in Little Space, with Applications. [Citation Graph (, )][DBLP ] Temporal Evolution of the UK Web. [Citation Graph (, )][DBLP ] Monotone minimal perfect hashing: searching a sorted table with O (1) accesses. [Citation Graph (, )][DBLP ] MG4J at TREC 2006. [Citation Graph (, )][DBLP ] MG4J at TREC 2005. [Citation Graph (, )][DBLP ] Traps and Pitfalls of Topic-Biased PageRank. [Citation Graph (, )][DBLP ] Permuting Web Graphs. [Citation Graph (, )][DBLP ] Broadword Implementation of Rank/Select Queries. [Citation Graph (, )][DBLP ] From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns. [Citation Graph (, )][DBLP ] Spectral Ranking [Citation Graph (, )][DBLP ] Search in 0.008secs, Finished in 0.011secs