21 citations · 22 across the 2 of their papers we have counts for
3 papers
math.CT2003★ 21 cited
A Guided Tour in the Topos of Graphs
Sebastiano Vigna
In this paper we survey the fundamental constructions of a presheaf topos in the case of the elementary topos of graphs. We prove that the transition graphs of nondeterministic aut…
cs.DS2003★ 1 cited
Compact Approximation of Lattice Functions with Applications to Large-Alphabet Text Search
Paolo Boldi, Sebastiano Vigna
We propose a very simple randomised data structure that stores an approximation from above of a lattice-valued function. Computing the function value requires a constant number of…
math.GT2001
Towards an implementation of the B-H algorithm for recognizing the unknot
J. S. Birman, P. Boldi, M. Rampichini +1
In their paper `A new algorithm for recognizing the unknot', in Geometry and Topology', 2 (1998) n. 9, 175-220, the first author and Michael Hirsch presented a then new algorithm f…