Paolo Boldi

According to our database1, Paolo Boldi authored at least 110 papers between 1995 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
(Web/Social) Graph Compression.
Proceedings of the Encyclopedia of Big Data Technologies., 2019

Graph Invariants.
Proceedings of the Encyclopedia of Big Data Technologies., 2019

Rank monotonicity in centrality measures - Corrigendum.
Network Science, 2019

2018
On the Lattice of Antichains of Finite Intervals.
Order, 2018

Correction to: Evaluating the impact of topological protein features on the negative examples selection.
BMC Bioinformatics, 2018

Evaluating the impact of topological protein features on the negative examples selection.
BMC Bioinformatics, 2018

Kings, Name Days, Lazy Servants and Magic.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017
Rank monotonicity in centrality measures.
Network Science, 2017

Estimating latent feature-feature interactions in large feature-rich graphs.
Internet Mathematics, 2017

The Ethics of Doing Web Science Research: Panel Abstract.
Proceedings of the 2017 ACM on Web Science Conference, 2017

2016
Monotone Minimal Perfect Hash Functions.
Encyclopedia of Algorithms, 2016

Minimal Perfect Hash Functions.
Encyclopedia of Algorithms, 2016

Efficient optimally lazy algorithms for minimal-interval semantics.
Theor. Comput. Sci., 2016

Using graph distances for named-entity linking.
Sci. Comput. Program., 2016

A network model characterized by a latent attribute structure with competition.
Inf. Sci., 2016

Cleansing Wikipedia Categories using Centrality.
Proceedings of the 25th International Conference on World Wide Web, 2016

LlamaFur: learning latent category matrix to find unexpected relations in Wikipedia.
Proceedings of the 8th ACM Conference on Web Science, 2016

2015
Large-scale Network Analytics: Diffusion-based Computation of Distances and Geometric Centralities.
Proceedings of the 24th International Conference on World Wide Web Companion, 2015

Essential Web Pages Are Easy to Find.
Proceedings of the 24th International Conference on World Wide Web, 2015

Local Ranking Problem on the BrowseGraph.
Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2015

Minimal and Monotone Minimal Perfect Hash Functions.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Liquid FM: Recommending Music through Viscous Democracy.
Proceedings of the 6th Italian Information Retrieval Workshop, 2015

2014
Web and Social Graph Mining.
IEEE Internet Computing, 2014

Axioms for Centrality.
Internet Mathematics, 2014

Entity-Linking via Graph-Distance Minimization.
Proceedings of the Proceedings 3rd Workshop on GRAPH Inspection and Traversal Engineering, 2014

BUbiNG: massive crawling for the masses.
Proceedings of the 23rd International World Wide Web Conference, 2014

Algorithmic Gems in the Data Miner's Cave.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Cache-Oblivious Peeling of Random Hypergraphs.
Proceedings of the Data Compression Conference, 2014

2013
Robustness of social and web graphs to node removal.
Social Netw. Analys. Mining, 2013

In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond.
Proceedings of the 13th IEEE International Conference on Data Mining Workshops, 2013

2012
Injecting Uncertainty in Graphs for Identity Obfuscation.
PVLDB, 2012

Special Issue on Fun with Algorithms.
Theory Comput. Syst., 2012

Four degrees of separation.
Proceedings of the Web Science 2012, 2012

Extending BM25 with multiple query operators.
Proceedings of the 35th International ACM SIGIR conference on research and development in Information Retrieval, 2012

Arc-Community Detection via Triangular Random Walks.
Proceedings of the Eighth Latin American Web Congress, 2012

Four Degrees of Separation, Really.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

2011
Theory and practice of monotone minimal perfect hashing.
ACM Journal of Experimental Algorithmics, 2011

Query reformulation mining: models, patterns, and applications.
Inf. Retr., 2011

E=I+T: The internal extent formula for compacted tries.
Inf. Process. Lett., 2011

Viscous democracy for social networks.
Commun. ACM, 2011

HyperANF: approximating the neighbourhood function of very large graphs on a budget.
Proceedings of the 20th International Conference on World Wide Web, 2011

Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks.
Proceedings of the 20th International Conference on World Wide Web, 2011

Robustness of Social Networks: Comparative Results Based on Distance Distributions.
Proceedings of the Social Informatics - Third International Conference, SocInfo 2011, 2011

2010
Efficient algorithms for large-scale local triangle counting.
TKDD, 2010

Dynamic Z-Fast Tries.
Proceedings of the String Processing and Information Retrieval, 2010

Trends in Search Interaction.
Proceedings of the Search Computing, 2010

Fast Prefix Search in Little Space, with Applications.
Proceedings of the Algorithms, 2010

2009
PageRank: Functional dependencies.
ACM Trans. Inf. Syst., 2009

Pictures from Mongolia. Extracting the Top Elements from a Partially Ordered Set.
Theory Comput. Syst., 2009

Permuting Web and Social Graphs.
Internet Mathematics, 2009

Query suggestions using query-flow graphs.
Proceedings of the 2009 workshop on Web Search Click Data, 2009

From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns.
Proceedings of the 2009 IEEE/WIC/ACM International Conference on Web Intelligence, 2009

Permuting Web Graphs.
Proceedings of the Algorithms and Models for the Web-Graph, 6th International Workshop, 2009

Monotone minimal perfect hashing: searching a sorted table with O(1) accesses.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Voting in social networks.
Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

Theory and Practise of Monotone Minimal Perfect Hashing.
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008
A large time-aware web graph.
SIGIR Forum, 2008

Efficient semi-streaming algorithms for local triangle counting in massive graphs.
Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008

Temporal Evolution of the UK Web.
Proceedings of the Workshops Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

The query-flow graph: model and applications.
Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

2007
Generic Damping Functions for Propagating Importance in Link-Based Ranking.
Internet Mathematics, 2007

The Number of Convex Permutominoes.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Pictures from Mongolia - Partial Sorting in a Partial World.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

A Deeper Investigation of PageRank as a Function of the Damping Factor.
Proceedings of the Web Information Retrieval and Linear Algebra Algorithms, 11.02., 2007

2006
A reference collection for web spam.
SIGIR Forum, 2006

Graph fibrations, graph isomorphism, and PageRank.
ITA, 2006

Traps and Pitfalls of Topic-Biased PageRank.
Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006

MG4J at TREC 2006.
Proceedings of the Fifteenth Text REtrieval Conference, 2006

Efficient Lazy Algorithms for Minimal-Interval Semantics.
Proceedings of the String Processing and Information Retrieval, 2006

Generalizing PageRank: damping functions for link-based ranking algorithms.
Proceedings of the SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2006

2005
Mutable strings in Java: design, implementation and lightweight text-search algorithms.
Sci. Comput. Program., 2005

Codes for the World Wide Web.
Internet Mathematics, 2005

Paradoxical Effects in PageRank Incremental Computations.
Internet Mathematics, 2005

The language observatory project (LOP).
Proceedings of the 14th international conference on World Wide Web, 2005

PageRank as a function of the damping factor.
Proceedings of the 14th international conference on World Wide Web, 2005

TotalRank: ranking without damping.
Proceedings of the 14th international conference on World Wide Web, 2005

MG4J at TREC 2005.
Proceedings of the Fourteenth Text REtrieval Conference, 2005

Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups.
Proceedings of the String Processing and Information Retrieval, 2005

2004
UbiCrawler: a scalable fully distributed Web crawler.
Softw., Pract. Exper., 2004

The webgraph framework I: compression techniques.
Proceedings of the 13th international conference on World Wide Web, 2004

Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations.
Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004

WebGraph: things you thought you could not do with Java™.
Proceedings of the 3rd International Symposium on Principles and Practice of Programming in Java, 2004

The WebGraph Framework II: Codes For The World-Wide Web.
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003
Lower bounds for weak sense of direction.
J. Discrete Algorithms, 2003

Lower bounds for sense of direction in regular graphs.
Distributed Computing, 2003

Rethinking Java strings.
Proceedings of the 2nd International Symposium on Principles and Practice of Programming in Java, 2003

2002
Measuring with jugs.
Theor. Comput. Sci., 2002

Universal Homogeneous Graph-Like Structures And Domains.
Mathematical Structures in Computer Science, 2002

Fibrations of graphs.
Discrete Mathematics, 2002

Universal dynamic synchronous self-stabilization.
Distributed Computing, 2002

Holographic Trees.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001
Trovatore: Towards a Highly Scalable Distributed Web Crawler.
Proceedings of the Poster Proceedings of the Tenth International World Wide Web Conference, 2001

An Effective Characterization of Computability in Anonymous Networks.
Proceedings of the Distributed Computing, 15th International Conference, 2001

2000
Coverings that preserve sense of direction.
Inf. Process. Lett., 2000

More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs.
Proceedings of the Distributed Computing, 14th International Conference, 2000

Lower bounds for (weak) sense of direction.
Proceedings of the SIROCCO 7, 2000

delta-Approximable Functions.
Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999
Equality is a Jump.
Theor. Comput. Sci., 1999

Complexity of Deciding Sense of Direction.
SIAM J. Comput., 1999

Computing Anonymously with Arbitrary Knowledge.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998
delta-Uniform BSS Machines.
J. Complexity, 1998

The Turing Closure of an Archimedean Field.
Proceedings of the International Colloquium Universal Machines and Computations, 1998

1997
Minimal Sense of Direction and Decision Problems for Cayley Graphs.
Inf. Process. Lett., 1997

Self-stabilizing universal algorithms.
Proceedings of the 3rd Workshop on Self-stabilizing Systems, 1997

Computing Vector Functions on Anonymous Networks.
Proceedings of the SIROCCO'97, 1997

Computing Vector Functions on Anonymous Networks.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

1996
Maximal Chains and Antichains in Strongly Noetherian Semiorders.
Fundam. Inform., 1996

Good Fibrations and Other Construction Which Preserve Sense of Direction.
Proceedings of the SIROCCO'96, 1996

Symmetry Breaking in Anonymous Networks: Characterizations.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995
On the Complexity of Deciding Sense of Direction.
Proceedings of the Structure, Information and Communication Complexity, 1995


  Loading...