9 citations · 10 across the 4 of their papers we have counts for
5 papers
Distance labeling schemes for trees
Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen +1
We consider distance labeling schemes for trees: given a tree with nodes, label the nodes with binary strings such that, given the labels of any two nodes, one can determine, b…
Simpler, faster and shorter labels for distances in graphs
Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen +1
We consider how to assign labels to any undirected graph with n nodes such that, given the labels of two nodes and no other information regarding the graph, it is possible to deter…
Near-optimal labeling schemes for nearest common ancestors
Stephen Alstrup, Esben Bistrup Halvorsen, Kasper Green Larsen
We consider NCA labeling schemes: given a rooted tree , label the nodes of with binary strings such that, given the labels of any two nodes, one can determine, by looking on…
Dualities and intersection multiplicities
Anders J. Frankild, Esben Bistrup Halvorsen
Let R be a commutative, noetherian, local ring. Topological Q-vector spaces modelled on full subcategories of the derived category of R are constructed in order to study intersecti…
Diagonalizing the Frobenius
Esben Bistrup Halvorsen
Over a Noetherian, local ring R of prime characteristic p, the Frobenius functor F induces a diagonalizable map on certain quotients of rational Grothendieck groups. This leads to…