Rajeev Raman

According to our database, Rajeev Raman authored at least 112 papers between 1990 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

An Evolutionary Attention-Based Network for Medical Image Classification.

Hengde Zhu, Jian Wang, Shui-Hua Wang, Rajeev Raman, Juan Manuel Górriz, Yudong Zhang

Int. J. Neural Syst., March, 2023

2022

Fast and Simple Compact Hashing via Bucketing.

Dominik Köppl, Simon J. Puglisi, Rajeev Raman

Algorithmica, 2022

Adaptive Succinctness.

Diego Arroyuelo, Rajeev Raman

Algorithmica, 2022

On Dynamic Bitvector Implementations.

Saska Dönges, Simon J. Puglisi, Rajeev Raman

Proceedings of the Data Compression Conference, 2022

2021

Engineering Practical Lempel-Ziv Tries.

Diego Arroyuelo, Rodrigo Cánovas, Johannes Fischer, Dominik Köppl, Marvin Löbel, Gonzalo Navarro, Rajeev Raman

ACM J. Exp. Algorithmics, 2021

On Elias-Fano for Rank Queries in FM-Indexes.

Danyang Ma, Simon J. Puglisi, Rajeev Raman, Bella Zhukova

Proceedings of the 31st Data Compression Conference, 2021

Weighted Ancestors in Suffix Trees Revisited.

Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word.

Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada

Theor. Comput. Sci., 2020

Compressing and Randomly Accessing Sequences (note).

Laith Ali Abdusahib, Diego Arroyuelo, Rajeev Raman

Proceedings of the Data Compression Conference, 2020

2019

Succinct BWT-Based Sequence Prediction.

Rafael Ktistakis, Philippe Fournier-Viger, Simon J. Puglisi, Rajeev Raman

Proceedings of the Database and Expert Systems Applications, 2019

2018

Encoding nearest larger values.

Michael Hoffmann, John Iacono, Patrick K. Nicholson, Rajeev Raman

Theor. Comput. Sci., 2018

m-Bonsai: A Practical Compact Dynamic Trie.

Andreas Poyias, Simon J. Puglisi, Rajeev Raman

Int. J. Found. Comput. Sci., 2018

In-memory Representations of Databases via Succinct Data Structures: Tutorial Abstract.

Rajeev Raman

Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

Frequent Itemset Mining on Correlated Probabilistic Databases.

Yasemin Asan Kalaz, Rajeev Raman

Proceedings of the Database and Expert Systems Applications, 2018

2017

Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-<i>k</i> Queries.

Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao

ACM Trans. Algorithms, 2017

On Succinct Representations of Binary Trees.

Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti

Math. Comput. Sci., 2017

Compressed Bit vectors Based on Variable-to-Fixed Encodings.

Seungbum Jo, Stelios Joannou, Daisuke Okanohara, Rajeev Raman, Srinivasa Rao Satti

Comput. J., 2017

LZ78 Compression in Low Main Memory Space.

Diego Arroyuelo, Rodrigo Cánovas, Gonzalo Navarro, Rajeev Raman

Proceedings of the String Processing and Information Retrieval, 2017

Compact Dynamic Rewritable (CDRW) Arrays.

Andreas Poyias, Simon J. Puglisi, Rajeev Raman

Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016

Rank and Select Operations on Bit Strings.

Rajeev Raman

Encyclopedia of Algorithms, 2016

Encoding 2D range maximum queries.

Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, Srinivasa Rao Satti, Sunil M. Shende

Theor. Comput. Sci., 2016

Two dimensional range minimum queries and Fibonacci lattices.

Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, Srinivasa Rao Satti

Theor. Comput. Sci., 2016

Space efficient data structures for nearest larger neighbor.

Varunkumar Jayapaul, Seungbum Jo, Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti

J. Discrete Algorithms, 2016

2015

Random Access to Grammar-Compressed Strings and Trees.

Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann

SIAM J. Comput., 2015

Mining sequential patterns from probabilistic databases.

Muhammad Muzammal, Rajeev Raman

Knowl. Inf. Syst., 2015

Tree Compression with Top Trees Revisited.

Lorenz Hübschle-Schneider, Rajeev Raman

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Encoding Data Structures.

Rajeev Raman

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Compact Encodings and Indexes for the Nearest Larger Neighbor Problem.

Seungbum Jo, Rajeev Raman, Srinivasa Rao Satti

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Improved Practical Compact Dynamic Tries.

Andreas Poyias, Rajeev Raman

Proceedings of the String Processing and Information Retrieval, 2015

CPT+: Decreasing the Time/Space Complexity of the Compact Prediction Tree.

Ted Gueniche, Philippe Fournier-Viger, Rajeev Raman, Vincent S. Tseng

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2015

Encoding Nearest Larger Values.

Patrick K. Nicholson, Rajeev Raman

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

SEPIA: Search for Proofs Using Inferred Automata.

Thomas Gransden, Neil Walkinshaw, Rajeev Raman

Proceedings of the Automated Deduction - CADE-25, 2015

2014

Optimal Indexes for Sparse Bit Vectors.

Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao

Algorithmica, 2014

Mining State-Based Models from Proof Corpora.

Thomas Gransden, Neil Walkinshaw, Rajeev Raman

Proceedings of the Intelligent Computer Mathematics - International Conference, 2014

Asymptotically Optimal Encodings for Range Selection.

Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

Encoding Range Minimum Queries.

Pooya Davoodi, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao

CoRR, 2013

Dynamic Compressed Strings with Random Access.

Roberto Grossi, Rajeev Raman, Srinivasa Rao Satti, Rossano Venturini

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Encodings for Range Selection and Top-k Queries.

Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti

Proceedings of the Algorithms - ESA 2013, 2013

Succinct Representations of Ordinal Trees.

Rajeev Raman, S. Srinivasa Rao

Proceedings of the Space-Efficient Data Structures, 2013

2012

Succinct representations of permutations and functions.

J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao

Theor. Comput. Sci., 2012

Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism.

Yusaku Kaneta, Hiroki Arimura, Rajeev Raman

J. Discrete Algorithms, 2012

Dynamizing Succinct Tree Representations.

Stelios Joannou, Rajeev Raman

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Range Extremum Queries.

Rajeev Raman

Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima.

Arash Farzan, J. Ian Munro, Rajeev Raman

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Succinct Representations of Binary Trees for Range Minimum Queries.

Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011

Encoding 2-D Range Maximum Queries

Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao

CoRR, 2011

An Empirical Evaluation of Extendible Arrays.

Stelios Joannou, Rajeev Raman

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Random Access to grammar-Compressed Strings.

Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Encoding 2D Range Maximum Queries.

Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

Optimal Trade-Off for Succinct String Indexes

Roberto Grossi, Alessio Orlandi, Rajeev Raman

CoRR, 2010

Optimal Trade-Offs for Succinct String Indexes.

Roberto Grossi, Alessio Orlandi, Rajeev Raman

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Uncertainty in Sequential Pattern Mining.

Muhammad Muzammal, Rajeev Raman

Proceedings of the Data Security and Security Data, 2010

On Probabilistic Models for Uncertain Sequential Pattern Mining.

Muhammad Muzammal, Rajeev Raman

Proceedings of the Advanced Data Mining and Applications - 6th International Conference, 2010

2009

More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries.

Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Universal Succinct Representations of Trees?

Arash Farzan, Rajeev Raman, S. Srinivasa Rao

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

Rank and Select Operations on Binary Strings.

Naila Rahman, Rajeev Raman

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Converting to and from Dilated Integers.

Rajeev Raman, David S. Wise

IEEE Trans. Computers, 2008

Preface.

Rajeev Raman, Matthias F. Stallmann

ACM J. Exp. Algorithmics, 2008

On the Redundancy of Succinct Data Structures.

Alexander Golynski, Rajeev Raman, S. Srinivasa Rao

Proceedings of the Algorithm Theory, 2008

Computing Minimum Spanning Trees with Uncertainty.

Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman

Proceedings of the STACS 2008, 2008

Engineering succinct DOM.

O'Neil Delpratt, Rajeev Raman, Naila Rahman

Proceedings of the EDBT 2008, 2008

2007

Succinct indexable dictionaries with applications to encoding <i>k</i>-ary trees, prefix sums and multisets.

Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti

ACM Trans. Algorithms, 2007

Cache Analysis of Non-uniform Distribution Sorting Algorithms

Naila Rahman, Rajeev Raman

CoRR, 2007

Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets

Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti

CoRR, 2007

Compressed Prefix Sums.

O'Neil Delpratt, Naila Rahman, Rajeev Raman

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Streaming Algorithms for Data in Motion.

Michael Hoffmann, S. Muthukrishnan, Rajeev Raman

Proceedings of the Combinatorics, 2007

On the Size of Succinct Indices.

Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao

Proceedings of the Algorithms, 2007

2006

A simple optimal representation for balanced parentheses.

Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman

Theor. Comput. Sci., 2006

Succinct ordinal trees with level-ancestor queries.

Richard F. Geary, Rajeev Raman, Venkatesh Raman

ACM Trans. Algorithms, 2006

Engineering the LOUDS Succinct Tree Representation.

O'Neil Delpratt, Naila Rahman, Rajeev Raman

Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

2005

Efficient Update Strategies for Geometric Computing with Uncertainty.

Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman

Theory Comput. Syst., 2005

Preface.

Rolf H. Möhring, Rajeev Raman

Algorithmica, 2005

Representing Trees of Higher Degree.

David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao

Algorithmica, 2005

2004

Data Structures for Sets.

Rajeev Raman

Proceedings of the Handbook of Data Structures and Applications., 2004

Compact Routing Schemes for Dynamic Ring Networks.

Danny Krizanc, Flaminia L. Luccio, Rajeev Raman

Theory Comput. Syst., 2004

2003

Succinct Dynamic Dictionaries and Trees.

Rajeev Raman, S. Srinivasa Rao

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Succinct Representations of Permutations.

J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

An Efficient Quasidictionary.

Torben Hagerup, Rajeev Raman

Proceedings of the Algorithm Theory, 2002

Succinct indexable dictionaries with applications to encoding k-ary trees and multisets.

Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Exponential Structures for Efficient Cache-Oblivious Algorithms.

Michael A. Bender, Richard Cole, Rajeev Raman

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

Adapting Radix Sort to the Memory Hierarchy.

Naila Rahman, Rajeev Raman

ACM J. Exp. Algorithmics, 2001

Optimised Predecessor Data Structures for Internal Memory.

Naila Rahman, Richard Cole, Rajeev Raman

Proceedings of the Algorithm Engineering, 2001

Succinct Dynamic Data Structures.

Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao

Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

2000

Analysing Cache Effects in Distribution Sorting.

Naila Rahman, Rajeev Raman

ACM J. Exp. Algorithmics, 2000

Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms.

Naila Rahman, Rajeev Raman

Proceedings of the Algorithms, 2000

1999

Small-Rank Selection in Parallel, with Applications to Heap Construction.

Paul F. Dietz, Rajeev Raman

J. Algorithms, 1999

An Experimental Evaluation of Hybrid Data Structures for Searching.

Maureen Korda, Rajeev Raman

Proceedings of the Algorithm Engineering, 1999

Dynamic Interval Routing on Asynchronous Rings.

Danny Krizanc, Flaminia L. Luccio, Rajeev Raman

Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999

Topics in Data Structures.

Giuseppe F. Italiano, Rajeev Raman

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Randomized Data Structures for the Dynamic Closest-Pair Problem.

Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid

SIAM J. Comput., 1998

Sorting in Linear Time?

Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman

J. Comput. Syst. Sci., 1998

An Experimental Study of Word-level Parallelism in Some Sorting Algorithms.

Naila Rahman, Rajeev Raman

Proceedings of the Algorithm Engineering, 2nd International Workshop, 1998

Random Sampling Techniques in Parallel Computation.

Rajeev Raman

Proceedings of the Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30, 1998

1997

Recent results on the single-source shortest paths problem.

Rajeev Raman

SIGACT News, 1997

Routing on Meshes with Buses.

Michael Kaufmann, Rajeev Raman, Jop F. Sibeyn

Algorithmica, 1997

1996

Fast Deterministic Selection on Mesh-Connected Processor Arrays.

Danny Krizanc, Lata Narayanan, Rajeev Raman

Algorithmica, 1996

Priority Queues: Small, Monotone and Trans-dichotomous.

Rajeev Raman

Proceedings of the Algorithms, 1996

1995

Simple Randomized Algorithms for Closest Pair Problems.

Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid

Nord. J. Comput., 1995

Lower Bounds for Set Intersection Queries.

Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig

Algorithmica, 1995

Parallel algorithms for database operations and a database operation for parallel algorithms.

Rajeev Raman, Uzi Vishkin

Proceedings of IPPS '95, 1995

1994

A simpler analysis of algorithm 65 (find).

Rajeev Raman

SIGACT News, 1994

A Constant Update Time Finger Search Tree.

Paul F. Dietz, Rajeev Raman

Inf. Process. Lett., 1994

Very fast optimal parallel algorithms for heap construction.

Paul F. Dietz, Rajeev Raman

Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix.

Rajeev Raman, Uzi Vishkin

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract).

Paul F. Dietz, Rajeev Raman

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Fast Deterministic Approximate and Exact Parallel Sorting.

Torben Hagerup, Rajeev Raman

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

Approximate and Exact Deterministic Parallel Selection.

Shiva Chaudhuri, Torben Hagerup, Rajeev Raman

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Randomized Routing on Meshes with Buses.

Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992

Waste Makes Haste: Tight Bounds for Loose Parallel Sorting

Torben Hagerup, Rajeev Raman

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Persistence, Amortization and Randomization.

Paul F. Dietz, Rajeev Raman

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Generating Random Graphs Efficiently.

Rajeev Raman

Proceedings of the Advances in Computing and Information, 1991

1990

The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting.

Rajeev Raman

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990