The following pages link to Paolo Boldi (Q234283):
Displaying 45 items.
- Minimal sense of direction and decision problems for Cayley graphs (Q293153) (← links)
- Efficient optimally lazy algorithms for minimal-interval semantics (Q313957) (← links)
- The number of convex permutominoes (Q948075) (← links)
- \(\delta\)-uniform BSS machines (Q1271171) (← links)
- Equality is a jump (Q1292397) (← links)
- The Turing closure of an Archimedean field (Q1575915) (← links)
- Measuring with jugs (Q1603714) (← links)
- Coverings that preserve sense of direction (Q1607063) (← links)
- A network model characterized by a latent attribute structure with competition (Q1615727) (← links)
- Lower bounds for weak sense of direction (Q1827281) (← links)
- \(E=I+T\): the internal extent formula for compacted tries (Q1944889) (← links)
- Spectral rank monotonicity on undirected networks (Q2086592) (← links)
- Pictures from Mongolia. Extracting the top elements from a partially ordered set (Q2272193) (← links)
- (Q2766878) (← links)
- Computing anonymously with arbitrary knowledge (Q2942761) (← links)
- Minimal and Monotone Minimal Perfect Hash Functions (Q2946321) (← links)
- (Q3044348) (← links)
- Kings, Name Days, Lazy Servants and Magic (Q3305728) (← links)
- Estimating latent feature-feature interactions in large feature-rich graphs (Q3389688) (← links)
- Graph fibrations, graph isomorphism, and PageRank (Q3431437) (← links)
- Generic Damping Functions for Propagating Importance in Link-Based Ranking (Q3519886) (← links)
- Traps and Pitfalls of Topic-Biased PageRank (Q3520034) (← links)
- Fast Prefix Search in Little Space, with Applications (Q3586483) (← links)
- Permuting Web Graphs (Q3601174) (← links)
- (Q4288285) (← links)
- Universal homogeneous graph-like structures and domains (Q4331081) (← links)
- (Q4436038) (← links)
- (Q4531990) (← links)
- TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT (Q4549836) (← links)
- (Q4633891) (← links)
- (Q4874649) (← links)
- Complexity of Deciding Sense of Direction (Q4943845) (← links)
- Axioms for Centrality (Q4985356) (← links)
- Quasifibrations of graphs to find symmetries and reconstruct biological networks (Q5055404) (← links)
- Universal dynamic synchronous self-stabilization (Q5138377) (← links)
- Lower bounds for sense of direction in regular graphs (Q5138498) (← links)
- Theory and Practise of Monotone Minimal Perfect Hashing (Q5233572) (← links)
- Algorithms and Models for the Web-Graph (Q5311168) (← links)
- Permuting Web and Social Graphs (Q5388287) (← links)
- Theory and practice of monotone minimal perfect hashing (Q5406248) (← links)
- Pictures from Mongolia – Partial Sorting in a Partial World (Q5426016) (← links)
- Paradoxical Effects in PageRank Incremental Computations (Q5474655) (← links)
- Codes for the World Wide Web (Q5491967) (← links)
- Fibrations of graphs (Q5957696) (← links)
- Quasifibrations of Graphs to Find Symmetries in Biological Networks (Q6382933) (← links)