12 citations · 13 across the 2 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2009★ 12 cited
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
Roberto Grossi, Alessio Orlandi, Rajeev Raman +1
We consider the problem of representing, in a compressed format, a bit-vector of bits with 1s, supporting the following operations, where : $rank_b(S,i…
cs.DS2008
Computing Minimum Spanning Trees with Uncertainty
Thomas Erlebach, Michael Hoffmann, Danny Krizanc +2
We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge of the graph only…
cs.DS2007★ 1 cited
Cache Analysis of Non-uniform Distribution Sorting Algorithms
Naila Rahman, Rajeev Raman
We analyse the average-case cache performance of distribution sorting algorithms in the case when keys are independently but not necessarily uniformly distributed. The analysis is…