Showing cs.DSShow all
2 papers · 1 filter
cs.DS2015
A Non-Oblivious Reduction of Counting Ones to Multiplication
Holger Petersen
An algorithm counting the number of ones in a binary word is presented running in time where is the number of ones. The operations available include bit-wise lo…
cs.DS2015
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…