Sebastiano Vigna spends much of his time researching Theoretical computer science, Graph, World Wide Web, Discrete mathematics and Information retrieval. His Theoretical computer science research is multidisciplinary, incorporating elements of Webgraph, Data structure and Complex network. Sebastiano Vigna combines subjects such as Query expansion, Web query classification, Applied mathematics, Query optimization and Function with his study of Graph.
His Metadata study in the realm of World Wide Web interacts with subjects such as Friendship, Milgram experiment and Probabilistic analysis of algorithms. His Discrete mathematics research focuses on Combinatorics and how it relates to Social network analysis. His work in Information retrieval addresses issues such as Graph, which are connected to fields such as Control flow graph, Query language, Search engine and Web search query.
His primary scientific interests are in Theoretical computer science, Discrete mathematics, Combinatorics, Algorithm and Graph. His Theoretical computer science research includes elements of Computation and Social network. His work carried out in the field of Discrete mathematics brings together such families of science as Class, Trie, Arithmetic and Turing machine.
His study on Cayley graph, Degree and Graph theory is often connected to Sense of direction and Regular graph as part of broader study in Combinatorics. His Algorithm research is multidisciplinary, relying on both Simple, String, Set and Data structure. Sebastiano Vigna studies Webgraph which is a part of Graph.
Sebastiano Vigna mainly investigates Algorithm, Data structure, Perfect hash function, Pseudorandom number generator and Combinatorics. His Algorithm research includes themes of Linear system and Set. His Pseudorandom number generator study combines topics in areas such as Discrete mathematics, Multiplication, Arithmetic and State space.
His work in Combinatorics covers topics such as Monotonic function which are related to areas like Monotone polygon. His studies in Fenwick tree integrate themes in fields like Ranking and Theoretical computer science. His work deals with themes such as Social graph and Antichain, which intersect with Theoretical computer science.
His primary areas of investigation include World Wide Web, Crawling, Web crawler, Graph and Statistical hypothesis testing. Sebastiano Vigna interconnects Open source, Data science and Code in the investigation of issues within World Wide Web. The Graph study combines topics in areas such as Strongly connected component, Heavy-tailed distribution, Web page and Giant component.
His Heavy-tailed distribution research integrates issues from Ranking, Theoretical computer science and Web mining. His study in Set extends to Theoretical computer science with its themes. His Statistical hypothesis testing research is multidisciplinary, relying on both State space, Xorshift, Pseudorandom number generator, Constant and Multiplication.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
The webgraph framework I: compression techniques
P. Boldi;S. Vigna.
the web conference (2004)
UbiCrawler: a scalable fully distributed web crawler
Paolo Boldi;Bruno Codenotti;Massimo Santini;Sebastiano Vigna.
Software - Practice and Experience (2004)
Four degrees of separation
Lars Backstrom;Paolo Boldi;Marco Rosa;Johan Ugander.
web science (2012)
Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks
Paolo Boldi;Marco Rosa;Massimo Santini;Sebastiano Vigna.
the web conference (2011)
The query-flow graph: model and applications
Paolo Boldi;Francesco Bonchi;Carlos Castillo;Debora Donato.
conference on information and knowledge management (2008)
Axioms for Centrality
Paolo Boldi;Sebastiano Vigna.
Internet Mathematics (2014)
A reference collection for web spam
Carlos Castillo;Debora Donato;Luca Becchetti;Paolo Boldi.
international acm sigir conference on research and development in information retrieval (2006)
PageRank as a function of the damping factor
Paolo Boldi;Massimo Santini;Sebastiano Vigna.
the web conference (2005)
Query suggestions using query-flow graphs
Paolo Boldi;Francesco Bonchi;Carlos Castillo;Debora Donato.
Proceedings of the 2009 workshop on Web Search Click Data (2009)
Effective and efficient entity search in RDF data
Roi Blanco;Peter Mika;Sebastiano Vigna.
international semantic web conference (2011)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
University of Milan
Pompeu Fabra University
Institute for Scientific Interchange
University of Copenhagen
University of Mannheim
University of Bologna
Columbia University
Carnegie Mellon University
The University of Texas at Dallas
University of Glasgow
French Institute for Research in Computer Science and Automation - INRIA
Publications: 17
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: