2008 |
15 | EE | O'Neil Delpratt,
Rajeev Raman,
Naila Rahman:
Engineering succinct DOM.
EDBT 2008: 49-60 |
14 | EE | Naila Rahman:
Analyzing Cache Misses.
Encyclopedia of Algorithms 2008 |
13 | EE | Naila Rahman,
Rajeev Raman:
Rank and Select Operations on Binary Strings.
Encyclopedia of Algorithms 2008 |
2007 |
12 | EE | O'Neil Delpratt,
Naila Rahman,
Rajeev Raman:
Compressed Prefix Sums.
SOFSEM (1) 2007: 235-247 |
11 | EE | Naila Rahman,
Rajeev Raman:
Cache Analysis of Non-uniform Distribution Sorting Algorithms
CoRR abs/0706.2839: (2007) |
2006 |
10 | EE | O'Neil Delpratt,
Naila Rahman,
Rajeev Raman:
Engineering the LOUDS Succinct Tree Representation.
WEA 2006: 134-145 |
9 | EE | Richard F. Geary,
Naila Rahman,
Rajeev Raman,
Venkatesh Raman:
A simple optimal representation for balanced parentheses.
Theor. Comput. Sci. 368(3): 231-246 (2006) |
2004 |
8 | EE | Richard F. Geary,
Naila Rahman,
Rajeev Raman,
Venkatesh Raman:
A Simple Optimal Representation for Balanced Parentheses.
CPM 2004: 159-172 |
2002 |
7 | EE | Naila Rahman:
Algorithms for Hardware Caches and TLB.
Algorithms for Memory Hierarchies 2002: 171-192 |
2001 |
6 | EE | Naila Rahman,
Richard Cole,
Rajeev Raman:
Optimised Predecessor Data Structures for Internal Memory.
Algorithm Engineering 2001: 67-78 |
5 | | Naila Rahman,
Rajeev Raman:
Adapting Radix Sort to the Memory Hierarchy.
ACM Journal of Experimental Algorithmics 6: 7 (2001) |
2000 |
4 | | Naila Rahman,
Rajeev Raman:
Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms.
ESA 2000: 380-391 |
3 | EE | Naila Rahman,
Rajeev Raman:
Analysing Cache Effects in Distribution Sorting.
ACM Journal of Experimental Algorithmics 5: 14 (2000) |
1999 |
2 | EE | Naila Rahman,
Rajeev Raman:
Analysing Cache Effects in Distribution Sorting.
Algorithm Engineering 1999: 183-197 |
1998 |
1 | | Naila Rahman,
Rajeev Raman:
An Experimental Study of Word-level Parallelism in Some Sorting Algorithms.
Algorithm Engineering 1998: 193-203 |