default search action
Paolo Boldi
Person information
- affiliation: University of Milan, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j48]Paolo Boldi, Davide D'Ascenzo, Flavio Furia, Sebastiano Vigna:
Score and rank semi-monotonicity for closeness, betweenness, and distance-decay centralities. Soc. Netw. Anal. Min. 14(1): 183 (2024) - [c73]Paolo Boldi, Stefano Marchini, Sebastiano Vigna:
Engineering Zuffix Arrays. SEA 2024: 2:1-2:18 - [c72]Xian Gong
, Paul X. McCarthy
Harmony in the Australian Domain Space. WebSci 2024: 92-102 - [i29]Osvaldo Matías Velarde, Lucas C. Parra, Paolo Boldi, Hernán A. Makse:
The Role of Fibration Symmetries in Geometric Deep Learning. CoRR abs/2408.15894 (2024) - 2023
- [j47]Paolo Boldi, Flavio Furia, Sebastiano Vigna
Monotonicity in undirected networks. Netw. Sci. 11(3): 351-373 (2023) - [c71]Mohsen Koohi Esfahani
On Overcoming HPC Challenges of Trillion-Scale Real-World Graph Datasets. IEEE Big Data 2023: 215-220 - [c70]Paolo Boldi:
The Emergence of Hypergraphs in Complex System Analysis. CIC 2023: 1-7 - [c69]Paolo Boldi, Davide D'Ascenzo, Flavio Furia, Sebastiano Vigna:
Score and Rank Semi-monotonicity for Closeness, Betweenness and Harmonic Centrality. COMPLEX NETWORKS (3) 2023: 102-113 - [c68]Mohsen Koohi Esfahani
Dataset Announcement: MS-BioGraphs, Trillion-Scale Public Real-World Sequence Similarity Graphs. IISWC 2023: 193-195 - [i28]Mohsen Koohi Esfahani
MS-BioGraphs: Sequence Similarity Graph Datasets. CoRR abs/2308.16744 (2023) - [i27]Paolo Boldi, Davide D'Ascenzo, Flavio Furia, Sebastiano Vigna:
Score and Rank Semi-Monotonicity for Closeness, Betweenness and Harmonic Centrality. CoRR abs/2309.00519 (2023) - 2022
- [i26]Paolo Boldi, Flavio Furia, Sebastiano Vigna:
Spectral Rank Monotonicity on Undirected Networks. CoRR abs/2202.01044 (2022) - [i25]Paolo Boldi, Flavio Furia, Sebastiano Vigna:
Monotonicity in Undirected Networks. CoRR abs/2207.06218 (2022) - 2021
- [j46]Paolo Boldi, Georgios Gousios:
Fine-Grained Network Analysis for Modern Software Ecosystems. ACM Trans. Internet Techn. 21(1): 1:1-1:14 (2021) - [c67]Paolo Boldi, Flavio Furia, Sebastiano Vigna:
Spectral Rank Monotonicity on Undirected Networks. COMPLEX NETWORKS 2021: 234-246 - [i24]Paolo Boldi, Ian Leifer, Hernán A. Makse:
Quasifibrations of Graphs to Find Symmetries in Biological Networks. CoRR abs/2111.06999 (2021) - 2020
- [c66]Paolo Boldi, Antoine Pietri, Sebastiano Vigna, Stefano Zacchiroli:
Ultra-Large-Scale Repository Analysis via Graph Compression. SANER 2020: 184-194 - [i23]Paolo Boldi, Georgios Gousios:
Fine-Grained Network Analysis for Modern Software Ecosystems. CoRR abs/2012.04760 (2020)
2010 – 2019
- 2019
- [j45]Paolo Boldi
Rank monotonicity in centrality measures - Corrigendum. Netw. Sci. 7(2): 265-268 (2019) - [c65]Paolo Boldi:
How Network Analysis Can Improve the Reliability of Modern Software Ecosystems. CogMI 2019: 168-172 - [c64]Paolo Boldi, Sebastiano Vigna:
The Case for Kendall's Assortativity. COMPLEX NETWORKS (2) 2019: 291-302 - [e6]Paolo Boldi, Brooke Foucault Welles, Katharina Kinder-Kurlanda, Christo Wilson, Isabella Peters, Wagner Meira Jr.:
Proceedings of the 11th ACM Conference on Web Science, WebSci 2019, Boston, MA, USA, June 30 - July 03, 2019. ACM 2019, ISBN 978-1-4503-6202-3 [contents] - [e5]Paolo Boldi, Brooke Foucault Welles, Katharina Kinder-Kurlanda, Christo Wilson, Isabella Peters, Wagner Meira Jr.:
Companion Publication of the 10th ACM Conference on Web Science, WebSci 2019, Boston, MA, USA, June 30 - July 03, 2019. . ACM 2019, ISBN 978-1-4503-6174-3 [contents] - [r4]Paolo Boldi:
Graph Invariants. Encyclopedia of Big Data Technologies 2019 - [r3]Paolo Boldi, Sebastiano Vigna:
(Web/Social) Graph Compression. Encyclopedia of Big Data Technologies 2019 - 2018
- [j44]Paolo Boldi, Marco Frasca
Correction to: Evaluating the impact of topological protein features on the negative examples selection. BMC Bioinform. 19(1): 530:1 (2018) - [j43]Paolo Boldi, Marco Frasca
Evaluating the impact of topological protein features on the negative examples selection. BMC Bioinform. 19-S(14): 115-126 (2018) - [j42]Paolo Boldi
On the Lattice of Antichains of Finite Intervals. Order 35(1): 57-81 (2018) - [j41]Paolo Boldi, Andrea Marino, Massimo Santini, Sebastiano Vigna
BUbiNG: Massive Crawling for the Masses. ACM Trans. Web 12(2): 12:1-12:26 (2018) - [c63]Paolo Boldi, Sebastiano Vigna:
Kings, Name Days, Lazy Servants and Magic. FUN 2018: 10:1-10:13 - [i22]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna:
Fast Prefix Search in Little Space, with Applications. CoRR abs/1804.04720 (2018) - 2017
- [j40]Corrado Monti, Paolo Boldi:
Estimating latent feature-feature interactions in large feature-rich graphs. Internet Math. 2017 (2017) - [j39]Paolo Boldi
Rank monotonicity in centrality measures. Netw. Sci. 5(4): 529-550 (2017) - [c62]Katharina Kinder-Kurlanda
The Ethics of Doing Web Science Research: Panel Abstract. WebSci 2017: 1 - [e4]Peter Fox, Deborah L. McGuinness, Lindsay Poirier, Paolo Boldi, Katharina Kinder-Kurlanda:
Proceedings of the 2017 ACM on Web Science Conference, WebSci 2017, Troy, NY, USA, June 25 - 28, 2017. ACM 2017, ISBN 978-1-4503-4896-6 [contents] - 2016
- [j38]Paolo Boldi
A network model characterized by a latent attribute structure with competition. Inf. Sci. 354: 236-256 (2016) - [j37]Roi Blanco, Paolo Boldi
Using graph distances for named-entity linking. Sci. Comput. Program. 130: 24-36 (2016) - [j36]Paolo Boldi
Efficient optimally lazy algorithms for minimal-interval semantics. Theor. Comput. Sci. 648: 8-25 (2016) - [c61]Paolo Boldi
LlamaFur: learning latent category matrix to find unexpected relations in Wikipedia. WebSci 2016: 218-222 - [c60]Paolo Boldi, Corrado Monti:
Cleansing Wikipedia Categories using Centrality. WWW (Companion Volume) 2016: 969-974 - [r2]Paolo Boldi, Sebastiano Vigna:
Minimal Perfect Hash Functions. Encyclopedia of Algorithms 2016: 1291-1294 - [r1]Paolo Boldi, Sebastiano Vigna:
Monotone Minimal Perfect Hash Functions. Encyclopedia of Algorithms 2016: 1349-1352 - [i21]Paolo Boldi, Andrea Marino, Massimo Santini, Sebastiano Vigna:
BUbiNG: Massive Crawling for the Masses. CoRR abs/1601.06919 (2016) - [i20]Paolo Boldi, Corrado Monti:
LlamaFur: Learning Latent Category Matrix to Find Unexpected Relations in Wikipedia (Long version). CoRR abs/1603.09540 (2016) - [i19]Corrado Monti, Paolo Boldi:
Estimating latent feature-feature interactions in large feature-rich graphs. CoRR abs/1612.00984 (2016) - 2015
- [c59]Paolo Boldi, Corrado Monti, Massimo Santini, Sebastiano Vigna:
Liquid FM: Recommending Music through Viscous Democracy. IIR 2015 - [c58]Paolo Boldi
Minimal and Monotone Minimal Perfect Hash Functions. MFCS (1) 2015: 3-17 - [c57]Michele Trevisiol, Luca Maria Aiello
Local Ranking Problem on the BrowseGraph. SIGIR 2015: 173-182 - [c56]Ricardo Baeza-Yates
Essential Web Pages Are Easy to Find. WWW 2015: 97-107 - [c55]Paolo Boldi:
Large-scale Network Analytics: Diffusion-based Computation of Distances and Geometric Centralities. WWW (Companion Volume) 2015: 1313 - [e3]Paolo Boldi, Raffaele Perego, Fabrizio Sebastiani:
Proceedings of the 6th Italian Information Retrieval Workshop, Cagliari, Italy, May 25-26, 2015. CEUR Workshop Proceedings 1404, CEUR-WS.org 2015 [contents] - [i18]Paolo Boldi, Corrado Monti, Massimo Santini, Sebastiano Vigna:
Liquid FM: Recommending Music through Viscous Democracy. CoRR abs/1503.08604 (2015) - [i17]Michele Trevisiol, Luca Maria Aiello, Paolo Boldi, Roi Blanco:
Local Ranking Problem on the BrowseGraph. CoRR abs/1505.06386 (2015) - 2014
- [j35]Paolo Boldi
Axioms for Centrality. Internet Math. 10(3-4): 222-262 (2014) - [j34]Paolo Boldi
Web and Social Graph Mining. IEEE Internet Comput. 18(5): 9-10 (2014) - [c54]Djamal Belazzougui, Paolo Boldi
Cache-Oblivious Peeling of Random Hypergraphs. DCC 2014: 352-361 - [c53]Paolo Boldi
Algorithmic Gems in the Data Miner's Cave. FUN 2014: 1-15 - [c52]Paolo Boldi
BUbiNG: massive crawling for the masses. WWW (Companion Volume) 2014: 227-228 - [c51]Roi Blanco, Paolo Boldi
Entity-Linking via Graph-Distance Minimization. GRAPHITE 2014: 30-43 - [i16]Paolo Boldi, Irene Crimaldi, Corrado Monti:
A Network Model characterized by a Latent Attribute Structure with Competition. CoRR abs/1407.7729 (2014) - 2013
- [j33]Paolo Boldi
Robustness of social and web graphs to node removal. Soc. Netw. Anal. Min. 3(4): 829-842 (2013) - [c50]Paolo Boldi
In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond. ICDM Workshops 2013: 621-628 - [i15]Paolo Boldi, Sebastiano Vigna:
Axioms for Centrality. CoRR abs/1308.2140 (2013) - [i14]Paolo Boldi, Sebastiano Vigna:
In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond. CoRR abs/1308.2144 (2013) - [i13]Djamal Belazzougui, Paolo Boldi, Giuseppe Ottaviano, Rossano Venturini, Sebastiano Vigna:
Cache-Oblivious Peeling of Random Hypergraphs. CoRR abs/1312.0526 (2013) - 2012
- [j32]Paolo Boldi
Special Issue on Fun with Algorithms. Theory Comput. Syst. 50(1): 1-2 (2012) - [j31]Paolo Boldi, Francesco Bonchi, Aristides Gionis, Tamir Tassa:
Injecting Uncertainty in Graphs for Identity Obfuscation. Proc. VLDB Endow. 5(11): 1376-1387 (2012) - [c49]Paolo Boldi
Four Degrees of Separation, Really. ASONAM 2012: 1222-1227 - [c48]Paolo Boldi
Arc-Community Detection via Triangular Random Walks. LA-WEB 2012: 48-56 - [c47]Roi Blanco, Paolo Boldi
Extending BM25 with multiple query operators. SIGIR 2012: 921-930 - [c46]Lars Backstrom, Paolo Boldi
Four degrees of separation. WebSci 2012: 33-42 - [i12]Paolo Boldi, Sebastiano Vigna:
Four Degrees of Separation, Really. CoRR abs/1205.5509 (2012) - [i11]Paolo Boldi, Francesco Bonchi, Aristides Gionis, Tamir Tassa:
Injecting Uncertainty in Graphs for Identity Obfuscation. CoRR abs/1208.4145 (2012) - [i10]Djamal Belazzougui, Paolo Boldi, Sebastiano Vigna:
Predecessor search with distance-sensitive query time. CoRR abs/1209.5441 (2012) - 2011
- [j30]Paolo Boldi
Viscous democracy for social networks. Commun. ACM 54(6): 129-137 (2011) - [j29]Paolo Boldi
E=I+T: The internal extent formula for compacted tries. Inf. Process. Lett. 111(7): 310-313 (2011) - [j28]Paolo Boldi
Query reformulation mining: models, patterns, and applications. Inf. Retr. 14(3): 257-289 (2011) - [j27]Djamal Belazzougui, Paolo Boldi
Theory and practice of monotone minimal perfect hashing. ACM J. Exp. Algorithmics 16 (2011) - [c45]Paolo Boldi
Robustness of Social Networks: Comparative Results Based on Distance Distributions. SocInfo 2011: 8-21 - [c44]Paolo Boldi
Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. WWW 2011: 587-596 - [c43]Paolo Boldi
HyperANF: approximating the neighbourhood function of very large graphs on a budget. WWW 2011: 625-634 - [i9]Paolo Boldi, Sebastiano Vigna:
The Push Algorithm for Spectral Ranking. CoRR abs/1109.4680 (2011) - [i8]Paolo Boldi, Marco Rosa, Sebastiano Vigna:
Robustness of Social Networks: Comparative Results Based on Distance Distributions. CoRR abs/1110.4474 (2011) - [i7]Lars Backstrom, Paolo Boldi, Marco Rosa, Johan Ugander, Sebastiano Vigna:
Four Degrees of Separation. CoRR abs/1111.4570 (2011) - 2010
- [j26]Luca Becchetti
Efficient algorithms for large-scale local triangle counting. ACM Trans. Knowl. Discov. Data 4(3): 13:1-13:28 (2010) - [c42]Djamal Belazzougui, Paolo Boldi
Fast Prefix Search in Little Space, with Applications. ESA (1) 2010: 427-438 - [c41]Ricardo Baeza-Yates
Trends in Search Interaction. SeCO Workshop 2010: 26-32 - [c40]Djamal Belazzougui, Paolo Boldi
Dynamic Z-Fast Tries. SPIRE 2010: 159-172 - [e2]Paolo Boldi, Luisa Gargano:
Fun with Algorithms, 5th International Conference, FUN 2010, Ischia, Italy, June 2-4, 2010. Proceedings. Lecture Notes in Computer Science 6099, Springer 2010, ISBN 978-3-642-13121-9 [contents] - [i6]Paolo Boldi, Marco Rosa, Massimo Santini, Sebastiano Vigna:
Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks. CoRR abs/1011.5425 (2010) - [i5]Paolo Boldi, Marco Rosa, Sebastiano Vigna:
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget. CoRR abs/1011.5599 (2010) - [i4]Paolo Boldi, Sebastiano Vigna:
E = I + T: The internal extent formula for compacted tries. CoRR abs/1012.3024 (2010)
2000 – 2009
- 2009
- [j25]Paolo Boldi
Permuting Web and Social Graphs. Internet Math. 6(3): 257-283 (2009) - [j24]Paolo Boldi
Pictures from Mongolia. Extracting the Top Elements from a Partially Ordered Set. Theory Comput. Syst. 44(2): 269-288 (2009) - [j23]Paolo Boldi
PageRank: Functional dependencies. ACM Trans. Inf. Syst. 27(4): 19:1-19:23 (2009) - [c39]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna:
Theory and Practise of Monotone Minimal Perfect Hashing. ALENEX 2009: 132-144 - [c38]Paolo Boldi
Voting in social networks. CIKM 2009: 777-786 - [c37]Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna:
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses. SODA 2009: 785-794 - [c36]Paolo Boldi
Permuting Web Graphs. WAW 2009: 116-126 - [c35]Paolo Boldi
From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns. Web Intelligence 2009: 183-190 - [c34]Paolo Boldi
Query suggestions using query-flow graphs. WSCD@WSDM 2009: 56-63 - [e1]Ricardo Baeza-Yates, Paolo Boldi, Berthier A. Ribeiro-Neto, Berkant Barla Cambazoglu:
Proceedings of the Second International Conference on Web Search and Web Data Mining, WSDM 2009, Barcelona, Spain, February 9-11, 2009. ACM 2009, ISBN 978-1-60558-390-7 [contents] - 2008
- [j22]Paolo Boldi
The number of convex permutominoes. Inf. Comput. 206(9-10): 1074-1083 (2008) - [j21]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
A large time-aware web graph. SIGIR Forum 42(2): 33-38 (2008) - [c33]Paolo Boldi
The query-flow graph: model and applications. CIKM 2008: 609-618 - [c32]Ilaria Bordino, Paolo Boldi
Temporal Evolution of the UK Web. ICDM Workshops 2008: 909-918 - [c31]Luca Becchetti
Efficient semi-streaming algorithms for local triangle counting in massive graphs. KDD 2008: 16-24 - 2007
- [j20]Ricardo A. Baeza-Yates
Generic Damping Functions for Propagating Importance in Link-Based Ranking. Internet Math. 3(4): 445-478 (2007) - [c30]Paolo Boldi, Flavio Chierichetti, Sebastiano Vigna:
Pictures from Mongolia - Partial Sorting in a Partial World. FUN 2007: 66-77 - [c29]Paolo Boldi, Violetta Lonati, Roberto Radicioni, Massimo Santini:
The Number of Convex Permutominoes. LATA 2007: 151-162 - [i3]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 - [i2]Sebastiano Vigna, Paolo Boldi:
Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics. CoRR abs/0710.1525 (2007) - 2006
- [j19]Paolo Boldi
Graph fibrations, graph isomorphism, and PageRank. RAIRO Theor. Informatics Appl. 40(2): 227-253 (2006) - [j18]Carlos Castillo, Debora Donato, Luca Becchetti
A reference collection for web spam. SIGIR Forum 40(2): 11-24 (2006) - [c28]Ricardo A. Baeza-Yates, Paolo Boldi, Carlos Castillo:
Generalizing PageRank: damping functions for link-based ranking algorithms. SIGIR 2006: 308-315 - [c27]Paolo Boldi, Sebastiano Vigna:
Efficient Lazy Algorithms for Minimal-Interval Semantics. SPIRE 2006: 134-149 - [c26]Paolo Boldi, Sebastiano Vigna:
MG4J at TREC 2006. TREC 2006 - [c25]Paolo Boldi
Traps and Pitfalls of Topic-Biased PageRank. WAW 2006: 107-116 - 2005
- [j17]Paolo Boldi
Paradoxical Effects in PageRank Incremental Computations. Internet Math. 2(3): 387-404 (2005) - [j16]Paolo Boldi
Codes for the World Wide Web. Internet Math. 2(4): 407-429 (2005) - [j15]Paolo Boldi
Mutable strings in Java: design, implementation and lightweight text-search algorithms. Sci. Comput. Program. 54(1): 3-23 (2005) - [c24]Paolo Boldi
Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups. SPIRE 2005: 25-28 - [c23]Paolo Boldi, Sebastiano Vigna:
MG4J at TREC 2005. TREC 2005 - [c22]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
PageRank as a function of the damping factor. WWW 2005: 557-566 - [c21]Paolo Boldi
TotalRank: ranking without damping. WWW (Special interest tracks and posters) 2005: 898-899 - [c20]Yoshiki Mikami, Pavol Zavarsky, Mohd Zaidi Abd Rozan
The language observatory project (LOP). WWW (Special interest tracks and posters) 2005: 990-991 - 2004
- [j14]Paolo Boldi
UbiCrawler: a scalable fully distributed Web crawler. Softw. Pract. Exp. 34(8): 711-726 (2004) - [c19]Paolo Boldi, Sebastiano Vigna:
The WebGraph Framework II: Codes For The World-Wide Web. Data Compression Conference 2004: 528 - [c18]Paolo Boldi, Sebastiano Vigna:
WebGraph: things you thought you could not do with Java™. PPPJ 2004: 1-8 - [c17]Paolo Boldi, Massimo Santini, Sebastiano Vigna:
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations. WAW 2004: 168-180 - [c16]Paolo Boldi, Sebastiano Vigna:
The webgraph framework I: compression techniques. WWW 2004: 595-602 - 2003
- [j13]Paolo Boldi
Lower bounds for sense of direction in regular graphs. Distributed Comput. 16(4): 279-286 (2003) - [j12]Paolo Boldi
Lower bounds for weak sense of direction. J. Discrete Algorithms 1(2): 119-128 (2003) - [c15]Paolo Boldi, Sebastiano Vigna:
Rethinking Java strings. PPPJ 2003: 27-30 - [i1]Paolo Boldi, Sebastiano Vigna:
Compact Approximation of Lattice Functions with Applications to Large-Alphabet Text Search. CoRR cs.DS/0306046 (2003) - 2002
- [j11]Paolo Boldi
Universal dynamic synchronous self-stabilization. Distributed Comput. 15(3): 137-153 (2002) - [j10]Paolo Boldi
Fibrations of graphs. Discret. Math. 243(1-3): 21-66 (2002) - [j9]Paolo Boldi
Universal Homogeneous Graph-Like Structures And Domains. Math. Struct. Comput. Sci. 12(1): 91-109 (2002) - [j8]Paolo Boldi
Measuring with jugs. Theor. Comput. Sci. 282(2): 259-270 (2002) - [c14]Paolo Boldi, Sebastiano Vigna:
Holographic Trees. LATIN 2002: 465-478 - 2001
- [c13]Paolo Boldi, Sebastiano Vigna:
An Effective Characterization of Computability in Anonymous Networks. DISC 2001: 33-47 - [c12]Paolo Boldi, Bruno Codenotti, Massimo Santini, Sebastiano Vigna:
Trovatore: Towards a Highly Scalable Distributed Web Crawler. WWW Posters 2001 - 2000
- [j7]Paolo Boldi
Coverings that preserve sense of direction. Inf. Process. Lett. 75(4): 175-180 (2000) - [j6]Paolo Boldi, Sebastiano Vigna:
The Turing closure of an Archimedean field. Theor. Comput. Sci. 231(2): 143-156 (2000) - [c11]Charles Meyssonnier, Paolo Boldi, Sebastiano Vigna:
delta-Approximable Functions. CCA 2000: 187-199 - [c10]Paolo Boldi, Sebastiano Vigna:
Lower bounds for (weak) sense of direction. SIROCCO 2000: 37-46 - [c9]Paolo Boldi
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs. DISC 2000: 238-252
1990 – 1999
- 1999
- [j5]Paolo Boldi, Sebastiano Vigna:
Complexity of Deciding Sense of Direction. SIAM J. Comput. 29(3): 779-789 (1999) - [j4]Paolo Boldi, Sebastiano Vigna:
Equality is a Jump. Theor. Comput. Sci. 219(1-2): 49-64 (1999) - [c8]Paolo Boldi, Sebastiano Vigna:
Computing Anonymously with Arbitrary Knowledge. PODC 1999: 181-188 - 1998
- [j3]Paolo Boldi
delta-Uniform BSS Machines. J. Complex. 14(2): 234-256 (1998) - [c7]Paolo Boldi, Sebastiano Vigna:
The Turing Closure of an Archimedean Field. MCU (2) 1998: 134-150 - 1997
- [j2]Paolo Boldi, Sebastiano Vigna:
Minimal Sense of Direction and Decision Problems for Cayley Graphs. Inf. Process. Lett. 64(6): 299-303 (1997) - [c6]Paolo Boldi, Sebastiano Vigna:
Computing Vector Functions on Anonymous Networks. PODC 1997: 277 - [c5]Paolo Boldi, Sebastiano Vigna:
Computing Vector Functions on Anonymous Networks. SIROCCO 1997: 201-214 - [c4]Paolo Boldi, Sebastiano Vigna:
Self-stabilizing universal algorithms. WSS 1997: 141-156 - 1996
- [j1]Paolo Boldi:
Maximal Chains and Antichains in Strongly Noetherian Semiorders. Fundam. Informaticae 26(1): 59-80 (1996) - [c3]Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon:
Symmetry Breaking in Anonymous Networks: Characterizations. ISTCS 1996: 16-26 - [c2]Paolo Boldi, Sebastiano Vigna:
Good Fibrations and Other Construction Which Preserve Sense of Direction. SIROCCO 1996: 47-58 - 1995
- [c1]Paolo Boldi, Sebastiano Vigna:
On the Complexity of Deciding Sense of Direction. SIROCCO 1995: 39-51
Coauthor Index
[j48] [c73] [j47] [c71] [c69] [c68] [i28] [i27] [i26] [i25] [c67] [c66] [j45] [c64] [r3] [j42] [j41] [c63] [i22] [j39] [j36] [r2] [r1] [i21] [c59] [i18] [j35] [c54] [c52] [j33] [c50] [i15] [i14] [i13] [c49] [c46] [i12] [i10] [j30] [j29] [j28] [j27] [c45] [c44] [c43] [i9] [i8] [i7] [c42] [c40] [i6] [i5] [i4] [j25] [j24] [j23] [c39] [c38] [c37] [c36] [c35] [c34] [j21] [c33] [c32] [c30] [i3] [i2] [j19] [j18] [c27] [c26] [c25] [j17] [j16] [j15] [c24] [c23] [c22] [c20] [j14] [c19] [c18] [c17] [c16] [j13] [j12] [c15] [i1] [j11] [j10] [j8] [c14] [c13] [c12] [j7] [j6] [c11] [c10] [c9] [j5] [j4] [c8] [j3] [c7] [j2] [c6] [c5] [c4] [c3] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 00:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: