| 2009 |
|---|
| 66 | EE | Roberto Grossi,
Alessio Orlandi,
Rajeev Raman,
S. Srinivasa Rao:
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries.
STACS 2009: 517-528 |
| 65 | EE | Roberto Grossi,
Alessio Orlandi,
Rajeev Raman,
S. Srinivasa Rao:
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
CoRR abs/0902.2648: (2009) |
| 2008 |
|---|
| 64 | EE | O'Neil Delpratt,
Rajeev Raman,
Naila Rahman:
Engineering succinct DOM.
EDBT 2008: 49-60 |
| 63 | EE | Michael Hoffmann,
Thomas Erlebach,
Danny Krizanc,
Matús Mihalák,
Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty.
STACS 2008: 277-288 |
| 62 | EE | Alexander Golynski,
Rajeev Raman,
S. Srinivasa Rao:
On the Redundancy of Succinct Data Structures.
SWAT 2008: 148-159 |
| 61 | EE | Naila Rahman,
Rajeev Raman:
Rank and Select Operations on Binary Strings.
Encyclopedia of Algorithms 2008 |
| 60 | EE | Rajeev Raman,
Matt Stallmann:
Preface.
ACM Journal of Experimental Algorithmics 13: (2008) |
| 59 | EE | Thomas Erlebach,
Michael Hoffmann,
Danny Krizanc,
Matús Mihalák,
Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty
CoRR abs/0802.2855: (2008) |
| 58 | EE | Rajeev Raman,
David S. Wise:
Converting to and from Dilated Integers.
IEEE Trans. Computers 57(4): 567-573 (2008) |
| 2007 |
|---|
| 57 | EE | Alexander Golynski,
Roberto Grossi,
Ankur Gupta,
Rajeev Raman,
S. Srinivasa Rao:
On the Size of Succinct Indices.
ESA 2007: 371-382 |
| 56 | EE | Michael Hoffmann,
S. Muthukrishnan,
Rajeev Raman:
Streaming Algorithms for Data in Motion.
ESCAPE 2007: 294-304 |
| 55 | EE | O'Neil Delpratt,
Naila Rahman,
Rajeev Raman:
Compressed Prefix Sums.
SOFSEM (1) 2007: 235-247 |
| 54 | EE | Rajeev Raman,
Venkatesh Raman,
Srinivasa Rao Satti:
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets.
ACM Transactions on Algorithms 3(4): (2007) |
| 53 | EE | Rajeev Raman,
Venkatesh Raman,
Srinivasa Rao Satti:
Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
CoRR abs/0705.0552: (2007) |
| 52 | EE | Naila Rahman,
Rajeev Raman:
Cache Analysis of Non-uniform Distribution Sorting Algorithms
CoRR abs/0706.2839: (2007) |
| 2006 |
|---|
| 51 | EE | O'Neil Delpratt,
Naila Rahman,
Rajeev Raman:
Engineering the LOUDS Succinct Tree Representation.
WEA 2006: 134-145 |
| 50 | EE | Richard F. Geary,
Rajeev Raman,
Venkatesh Raman:
Succinct ordinal trees with level-ancestor queries.
ACM Transactions on Algorithms 2(4): 510-534 (2006) |
| 49 | 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) |
| 2005 |
|---|
| 48 | EE | Rolf H. Möhring,
Rajeev Raman:
Preface.
Algorithmica 42(3-4): 199-201 (2005) |
| 47 | EE | David Benoit,
Erik D. Demaine,
J. Ian Munro,
Rajeev Raman,
Venkatesh Raman,
S. Srinivasa Rao:
Representing Trees of Higher Degree.
Algorithmica 43(4): 275-292 (2005) |
| 46 | EE | Richard Bruce,
Michael Hoffmann,
Danny Krizanc,
Rajeev Raman:
Efficient Update Strategies for Geometric Computing with Uncertainty.
Theory Comput. Syst. 38(4): 411-423 (2005) |
| 2004 |
|---|
| 45 | EE | Richard F. Geary,
Naila Rahman,
Rajeev Raman,
Venkatesh Raman:
A Simple Optimal Representation for Balanced Parentheses.
CPM 2004: 159-172 |
| 44 | EE | Richard F. Geary,
Rajeev Raman,
Venkatesh Raman:
Succinct ordinal trees with level-ancestor queries.
SODA 2004: 1-10 |
| 43 | EE | Danny Krizanc,
Flaminia L. Luccio,
Rajeev Raman:
Compact Routing Schemes for Dynamic Ring Networks.
Theory Comput. Syst. 37(5): 585-607 (2004) |
| 2003 |
|---|
| 42 | EE | Richard Bruce,
Michael Hoffmann,
Danny Krizanc,
Rajeev Raman:
Efficient Update Strategies for Geometric Computing with Uncertainty.
CIAC 2003: 12-23 |
| 41 | EE | J. Ian Munro,
Rajeev Raman,
Venkatesh Raman,
S. Srinivasa Rao:
Succinct Representations of Permutations.
ICALP 2003: 345-356 |
| 40 | EE | Rajeev Raman,
S. Srinivasa Rao:
Succinct Dynamic Dictionaries and Trees.
ICALP 2003: 357-368 |
| 2002 |
|---|
| 39 | | Rolf H. Möhring,
Rajeev Raman:
Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings
Springer 2002 |
| 38 | EE | Michael A. Bender,
Richard Cole,
Rajeev Raman:
Exponential Structures for Efficient Cache-Oblivious Algorithms.
ICALP 2002: 195-207 |
| 37 | EE | Rajeev Raman,
Venkatesh Raman,
S. Srinivasa Rao:
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets.
SODA 2002: 233-242 |
| 36 | EE | Torben Hagerup,
Rajeev Raman:
An Efficient Quasidictionary.
SWAT 2002: 1-18 |
| 2001 |
|---|
| 35 | EE | Naila Rahman,
Richard Cole,
Rajeev Raman:
Optimised Predecessor Data Structures for Internal Memory.
Algorithm Engineering 2001: 67-78 |
| 34 | EE | Rajeev Raman,
Venkatesh Raman,
S. Srinivasa Rao:
Succinct Dynamic Data Structures.
WADS 2001: 426-437 |
| 33 | | Naila Rahman,
Rajeev Raman:
Adapting Radix Sort to the Memory Hierarchy.
ACM Journal of Experimental Algorithmics 6: 7 (2001) |
| 2000 |
|---|
| 32 | | Naila Rahman,
Rajeev Raman:
Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms.
ESA 2000: 380-391 |
| 31 | EE | Naila Rahman,
Rajeev Raman:
Analysing Cache Effects in Distribution Sorting.
ACM Journal of Experimental Algorithmics 5: 14 (2000) |
| 1999 |
|---|
| 30 | EE | Naila Rahman,
Rajeev Raman:
Analysing Cache Effects in Distribution Sorting.
Algorithm Engineering 1999: 183-197 |
| 29 | EE | Maureen Korda,
Rajeev Raman:
An Experimental Evaluation of Hybrid Data Structures for Searching.
Algorithm Engineering 1999: 214-228 |
| 28 | EE | Danny Krizanc,
Flaminia L. Luccio,
Rajeev Raman:
Dynamic Interval Routing on Asynchronous Rings.
IPPS/SPDP 1999: 225-232 |
| 27 | | Paul F. Dietz,
Rajeev Raman:
Small-Rank Selection in Parallel, with Applications to Heap Construction.
J. Algorithms 30(1): 33-51 (1999) |
| 1998 |
|---|
| 26 | | Naila Rahman,
Rajeev Raman:
An Experimental Study of Word-level Parallelism in Some Sorting Algorithms.
Algorithm Engineering 1998: 193-203 |
| 25 | | Rajeev Raman:
Random Sampling Techniques in Parallel Computation.
IPPS/SPDP Workshops 1998: 351-360 |
| 24 | | Arne Andersson,
Torben Hagerup,
Stefan Nilsson,
Rajeev Raman:
Sorting in Linear Time?
J. Comput. Syst. Sci. 57(1): 74-93 (1998) |
| 23 | EE | Mordecai J. Golin,
Rajeev Raman,
Christian Schwarz,
Michiel H. M. Smid:
Randomized Data Structures for the Dynamic Closest-Pair Problem.
SIAM J. Comput. 27(4): 1036-1072 (1998) |
| 1997 |
|---|
| 22 | | Michael Kaufmann,
Rajeev Raman,
Jop F. Sibeyn:
Routing on Meshes with Buses.
Algorithmica 18(3): 417-444 (1997) |
| 1996 |
|---|
| 21 | | Rajeev Raman:
Priority Queues: Small, Monotone and Trans-dichotomous.
ESA 1996: 121-137 |
| 20 | | Danny Krizanc,
Lata Narayanan,
Rajeev Raman:
Fast Deterministic Selection on Mesh-Connected Processor Arrays.
Algorithmica 15(4): 319-331 (1996) |
| 1995 |
|---|
| 19 | EE | Rajeev Raman,
Uzi Vishkin:
Parallel algorithms for database operations and a database operation for parallel algorithms.
IPPS 1995: 173- |
| 18 | EE | Arne Andersson,
Torben Hagerup,
Stefan Nilsson,
Rajeev Raman:
Sorting in linear time?
STOC 1995: 427-436 |
| 17 | | Paul F. Dietz,
Kurt Mehlhorn,
Rajeev Raman,
Christian Uhrig:
Lower Bounds for Set Intersection Queries.
Algorithmica 14(2): 154-168 (1995) |
| 16 | | Mordecai J. Golin,
Rajeev Raman,
Christian Schwarz,
Michiel H. M. Smid:
Simple Randomized Algorithms for Closest Pair Problems.
Nord. J. Comput. 2(1): 3-27 (1995) |
| 1994 |
|---|
| 15 | | Rajeev Raman,
Uzi Vishkin:
Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix.
SODA 1994: 613-621 |
| 14 | | Paul F. Dietz,
Rajeev Raman:
A Constant Update Time Finger Search Tree.
Inf. Process. Lett. 52(3): 147-154 (1994) |
| 1993 |
|---|
| 13 | | Mordecai J. Golin,
Rajeev Raman,
Christian Schwarz,
Michiel H. M. Smid:
Simple Randomized Algorithms for Closest Pair Problems.
CCCG 1993: 246-251 |
| 12 | | Jop F. Sibeyn,
Michael Kaufmann,
Rajeev Raman:
Randomized Routing on Meshes with Buses.
ESA 1993: 333-344 |
| 11 | | Shiva Chaudhuri,
Torben Hagerup,
Rajeev Raman:
Approximate and Exact Deterministic Parallel Selection.
MFCS 1993: 352-361 |
| 10 | | Paul F. Dietz,
Kurt Mehlhorn,
Rajeev Raman,
Christian Uhrig:
Lower Bounds for Set Intersection Queries.
SODA 1993: 194-201 |
| 9 | | Mordecai J. Golin,
Rajeev Raman,
Christian Schwarz,
Michiel H. M. Smid:
Randomized Data Structures for the Dynamic Closest-Pair Problem.
SODA 1993: 301-310 |
| 8 | EE | Torben Hagerup,
Rajeev Raman:
Fast Deterministic Approximate and Exact Parallel Sorting.
SPAA 1993: 346-355 |
| 7 | | Paul F. Dietz,
Rajeev Raman:
Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract).
WADS 1993: 289-301 |
| 1992 |
|---|
| 6 | | Torben Hagerup,
Rajeev Raman:
Waste Makes Haste: Tight Bounds for Loose Parallel Sorting
FOCS 1992: 628-637 |
| 1991 |
|---|
| 5 | | Danny Krizanc,
Lata Narayanan,
Rajeev Raman:
Fast Deterministic Selection on Mesh-Connected Processor Arrays.
FSTTCS 1991: 336-346 |
| 4 | | Rajeev Raman:
Generating Random Graphs Efficiently.
ICCI 1991: 149-160 |
| 3 | | Paul F. Dietz,
Rajeev Raman:
Persistence, Amortization and Randomization.
SODA 1991: 78-88 |
| 1990 |
|---|
| 2 | | Rajeev Raman:
The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting.
FSTTCS 1990: 161-175 |
| 1 | | Paul F. Dietz,
Rajeev Raman:
A Constant Update Time Finger Search Tree.
ICCI 1990: 100-109 |
