| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Arash Farzan, J. Ian Munro, Rajeev Raman |
Succinct Indices for Range Queries with applications to Orthogonal Range Maxima  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao |
Encoding 2-D Range Maximum Queries |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao |
Optimal Indexes for Sparse Bit Vectors |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
Succinct Representations of Permutations and Functions |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann |
Random Access to grammar-Compressed Strings. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Muhammad Muzammal, Rajeev Raman |
Mining Sequential Patterns from Probabilistic Databases. |
PAKDD |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stelios Joannou, Rajeev Raman |
An Empirical Evaluation of Extendible Arrays. |
SEA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao |
Encoding 2D Range Maximum Queries. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Alessio Orlandi, Rajeev Raman |
Optimal Trade-Off for Succinct String Indexes |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Muhammad Muzammal, Rajeev Raman |
Uncertainty in Sequential Pattern Mining. |
BNCOD |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Alessio Orlandi, Rajeev Raman |
Optimal Trade-Offs for Succinct String Indexes. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Muhammad Muzammal, Rajeev Raman |
On Probabilistic Models for Uncertain Sequential Pattern Mining. |
ADMA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao |
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Arash Farzan, Rajeev Raman, S. Srinivasa Rao |
Universal Succinct Representations of Trees? |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao |
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Raman, David S. Wise |
Converting to and from Dilated Integers. |
IEEE Trans. Computers |
2008 |
DBLP DOI BibTeX RDF |
Data Structures: Arrays, Programming Techniques: General, Memory Structures: Design Styles, Analysis of Algorithms and Problem Complexity: Numerical algorithms, problems: computations on matrices |
| 1 | Thomas Erlebach, Michael Hoffmann 0002, Danny Krizanc, Matús Mihalák, Rajeev Raman |
Computing Minimum Spanning Trees with Uncertainty |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Rajeev Raman, Matt Stallmann |
Preface. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Naila Rahman, Rajeev Raman |
Rank and Select Operations on Binary Strings. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Hoffmann 0002, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman |
Computing Minimum Spanning Trees with Uncertainty. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | O'Neil Delpratt, Rajeev Raman, Naila Rahman |
Engineering succinct DOM. |
EDBT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Golynski, Rajeev Raman, S. Srinivasa Rao |
On the Redundancy of Succinct Data Structures. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP DOI BibTeX RDF |
Dictionaries, sets, perfect hashing, multisets, prefix sums, tries, succinct data structures |
| 1 | Naila Rahman, Rajeev Raman |
Cache Analysis of Non-uniform Distribution Sorting Algorithms |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti |
Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao |
On the Size of Succinct Indices. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Hoffmann 0002, S. Muthukrishnan, Rajeev Raman |
Streaming Algorithms for Data in Motion. |
ESCAPE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | O'Neil Delpratt, Naila Rahman, Rajeev Raman |
Compressed Prefix Sums. |
SOFSEM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman |
A simple optimal representation for balanced parentheses. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard F. Geary, Rajeev Raman, Venkatesh Raman |
Succinct ordinal trees with level-ancestor queries. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
XML document representation, Succinct data structures |
| 1 | O'Neil Delpratt, Naila Rahman, Rajeev Raman |
Engineering the LOUDS Succinct Tree Representation. |
WEA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
Representing Trees of Higher Degree. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Cardinal trees, Ordinal trees, Digital search trees, Data structures, Data compression, Information theory, Hashing, Analysis of algorithms, Dictionary, Tries, Succinct data structures |
| 1 | Rolf H. Möhring, Rajeev Raman |
Preface. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Bruce, Michael Hoffmann 0002, Danny Krizanc, Rajeev Raman |
Efficient Update Strategies for Geometric Computing with Uncertainty. |
Theory Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Krizanc, Flaminia L. Luccio, Rajeev Raman |
Compact Routing Schemes for Dynamic Ring Networks. |
Theory Comput. Syst. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard F. Geary, Rajeev Raman, Venkatesh Raman |
Succinct ordinal trees with level-ancestor queries. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman |
A Simple Optimal Representation for Balanced Parentheses. |
CPM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Raman, S. Srinivasa Rao |
Succinct Dynamic Dictionaries and Trees. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
Succinct Representations of Permutations. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Bruce, Michael Hoffmann 0002, Danny Krizanc, Rajeev Raman |
Efficient Update Strategies for Geometric Computing with Uncertainty. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf H. Möhring, Rajeev Raman (eds.) |
Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings |
ESA |
2002 |
DBLP BibTeX RDF |
|
| 1 | Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Richard Cole, Rajeev Raman |
Exponential Structures for Efficient Cache-Oblivious Algorithms. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Torben Hagerup, Rajeev Raman |
An Efficient Quasidictionary. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Naila Rahman, Rajeev Raman |
Adapting Radix Sort to the Memory Hierarchy. |
ACM Journal of Experimental Algorithmics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao |
Succinct Dynamic Data Structures. |
WADS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Naila Rahman, Richard Cole, Rajeev Raman |
Optimised Predecessor Data Structures for Internal Memory. |
Algorithm Engineering |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Naila Rahman, Rajeev Raman |
Analysing Cache Effects in Distribution Sorting. |
ACM Journal of Experimental Algorithmics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Naila Rahman, Rajeev Raman |
Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms. |
ESA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul F. Dietz, Rajeev Raman |
Small-Rank Selection in Parallel, with Applications to Heap Construction. |
J. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Krizanc, Flaminia L. Luccio, Rajeev Raman |
Dynamic Interval Routing on Asynchronous Rings. (PDF / PS) |
IPPS/SPDP |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Naila Rahman, Rajeev Raman |
Analysing Cache Effects in Distribution Sorting. |
Algorithm Engineering |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Maureen Korda, Rajeev Raman |
An Experimental Evaluation of Hybrid Data Structures for Searching. |
Algorithm Engineering |
1999 |
DBLP BibTeX RDF |
|
| 1 | Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman |
Sorting in Linear Time? |
J. Comput. Syst. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid |
Randomized Data Structures for the Dynamic Closest-Pair Problem. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Raman |
Random Sampling Techniques in Parallel Computation. |
IPPS/SPDP Workshops |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Naila Rahman, Rajeev Raman |
An Experimental Study of Word-level Parallelism in Some Sorting Algorithms. |
Algorithm Engineering |
1998 |
DBLP BibTeX RDF |
|
| 1 | Michael Kaufmann, Rajeev Raman, Jop F. Sibeyn |
Routing on Meshes with Buses. |
Algorithmica |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Raman |
Recent results on the single-source shortest paths problem. |
SIGACT News |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Krizanc, Lata Narayanan, Rajeev Raman |
Fast Deterministic Selection on Mesh-Connected Processor Arrays. |
Algorithmica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Raman |
Priority Queues: Small, Monotone and Trans-dichotomous. |
ESA |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig |
Lower Bounds for Set Intersection Queries. |
Algorithmica |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid |
Simple Randomized Algorithms for Closest Pair Problems. |
Nord. J. Comput. |
1995 |
DBLP BibTeX RDF |
|
| 1 | Rajeev Raman, Uzi Vishkin |
Parallel algorithms for database operations and a database operation for parallel algorithms. (PDF / PS) |
IPPS |
1995 |
DBLP DOI BibTeX RDF |
relational parallel database systems, parallel algorithms, parallel algorithms, parallel algorithm, relational databases, efficiency, database theory, JOIN operation, database operations |
| 1 | Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman |
Sorting in linear time? |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul F. Dietz, Rajeev Raman |
A Constant Update Time Finger Search Tree. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Raman |
A simpler analysis of algorithm 65 (find). |
SIGACT News |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Raman, Uzi Vishkin |
Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix. |
SODA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman |
Randomized Routing on Meshes with Buses. |
ESA |
1993 |
DBLP DOI BibTeX RDF |
algorithms, parallel computation, lower bounds, meshes, coloring, randomization, packet routing, buses |
| 1 | Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid |
Randomized Data Structures for the Dynamic Closest-Pair Problem. |
SODA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig |
Lower Bounds for Set Intersection Queries. |
SODA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiva Chaudhuri, Torben Hagerup, Rajeev Raman |
Approximate and Exact Deterministic Parallel Selection. |
MFCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid |
Simple Randomized Algorithms for Closest Pair Problems. |
CCCG |
1993 |
DBLP BibTeX RDF |
|
| 1 | Paul F. Dietz, Rajeev Raman |
Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract). |
WADS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Torben Hagerup, Rajeev Raman |
Fast Deterministic Approximate and Exact Parallel Sorting. |
SPAA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Torben Hagerup, Rajeev Raman |
Waste Makes Haste: Tight Bounds for Loose Parallel Sorting |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
approximate prefix summation problems, loose parallel sorting, input keys, padded sorting, fast randomised CRCW PRAM algorithms, nonstandard OR PRAM, time complexity, random numbers, integer sorting |
| 1 | Paul F. Dietz, Rajeev Raman |
Persistence, Amortization and Randomization. |
SODA |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Raman |
Generating Random Graphs Efficiently. |
ICCI |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Krizanc, Lata Narayanan, Rajeev Raman |
Fast Deterministic Selection on Mesh-Connected Processor Arrays. |
FSTTCS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul F. Dietz, Rajeev Raman |
A Constant Update Time Finger Search Tree. |
ICCI |
1990 |
DBLP DOI BibTeX RDF |
Real-Time Algorithm, Search Tree, Fingers |
| 1 | Rajeev Raman |
The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting. |
FSTTCS |
1990 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")