Rajeev Raman

ORCID

Publication Activity (10 Years)

Years Active: 1990-2023
Publications (10 Years): 38

Top Venues

Publications

Hengde Zhu, Jian Wang, Shui-Hua Wang, Rajeev Raman, Juan Manuel Górriz, Yu-Dong Zhang
An Evolutionary Attention-Based Network for Medical Image Classification. Int. J. Neural Syst. 33 (3) (2023)
Diego Arroyuelo, Rajeev Raman
Adaptive Succinctness. Algorithmica 84 (3) (2022)
Saska Dönges, Simon J. Puglisi, Rajeev Raman
On Dynamic Bitvector Implementations. DCC (2022)
Dominik Köppl, Simon J. Puglisi, Rajeev Raman
Fast and Simple Compact Hashing via Bucketing. Algorithmica 84 (9) (2022)
Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman
Weighted Ancestors in Suffix Trees Revisited. CoRR (2021)
Danyang Ma, Simon J. Puglisi, Rajeev Raman, Bella Zhukova
On Elias-Fano for Rank Queries in FM-Indexes. DCC (2021)
Diego Arroyuelo, Rodrigo Cánovas, Johannes Fischer, Dominik Köppl, Marvin Löbel, Gonzalo Navarro, Rajeev Raman
Engineering Practical Lempel-Ziv Tries. ACM J. Exp. Algorithmics 26 (2021)
Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman
Weighted Ancestors in Suffix Trees Revisited. CPM (2021)
Laith Ali Abdusahib, Diego Arroyuelo, Rajeev Raman
Compressing and Randomly Accessing Sequences (note). DCC (2020)
Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. Theor. Comput. Sci. 842 (2020)
Dominik Köppl, Simon J. Puglisi, Rajeev Raman
Fast and Simple Compact Hashing via Bucketing. SEA (2020)
Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. CoRR (2020)
Rafael Ktistakis, Philippe Fournier-Viger, Simon J. Puglisi, Rajeev Raman
Succinct BWT-Based Sequence Prediction. DEXA (2) (2019)
Diego Arroyuelo, Rajeev Raman
Adaptive Succinctness. SPIRE (2019)
Rajeev Raman
In-memory Representations of Databases via Succinct Data Structures: Tutorial Abstract. PODS (2018)
Andreas Poyias, Simon J. Puglisi, Rajeev Raman
m-Bonsai: A Practical Compact Dynamic Trie. Int. J. Found. Comput. Sci. 29 (8) (2018)
Yasemin Asan Kalaz, Rajeev Raman
Frequent Itemset Mining on Correlated Probabilistic Databases. DEXA (2) (2018)
Michael Hoffmann, John Iacono, Patrick K. Nicholson, Rajeev Raman
Encoding nearest larger values. Theor. Comput. Sci. 710 (2018)
Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti
On Succinct Representations of Binary Trees. Math. Comput. Sci. 11 (2) (2017)
Andreas Poyias, Simon J. Puglisi, Rajeev Raman
Compact Dynamic Rewritable (CDRW) Arrays. ALENEX (2017)
Seungbum Jo, Stelios Joannou, Daisuke Okanohara, Rajeev Raman, Srinivasa Rao Satti
Compressed Bit vectors Based on Variable-to-Fixed Encodings. Comput. J. 60 (5) (2017)
Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao
Queries. ACM Trans. Algorithms 13 (2) (2017)
Diego Arroyuelo, Rodrigo Cánovas, Gonzalo Navarro, Rajeev Raman
LZ78 Compression in Low Main Memory Space. SPIRE (2017)
Andreas Poyias, Simon J. Puglisi, Rajeev Raman
m-Bonsai: a Practical Compact Dynamic Trie. CoRR (2017)
Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, Srinivasa Rao Satti, Sunil M. Shende
Encoding 2D range maximum queries. Theor. Comput. Sci. 609 (2016)
Varunkumar Jayapaul, Seungbum Jo, Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
Space efficient data structures for nearest larger neighbor. J. Discrete Algorithms 36 (2016)
Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, Srinivasa Rao Satti
Two dimensional range minimum queries and Fibonacci lattices. Theor. Comput. Sci. 638 (2016)
Lorenz Hübschle-Schneider, Rajeev Raman
Tree Compression with Top Trees Revisited. SEA (2015)
Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
Random Access to Grammar-Compressed Strings and Trees. SIAM J. Comput. 44 (3) (2015)
Thomas Gransden, Neil Walkinshaw, Rajeev Raman
SEPIA: Search for Proofs Using Inferred Automata. CoRR (2015)
Rajeev Raman
Encoding Data Structures. WALCOM (2015)
Seungbum Jo, Rajeev Raman, Srinivasa Rao Satti
Compact Encodings and Indexes for the Nearest Larger Neighbor Problem. WALCOM (2015)
Thomas Gransden, Neil Walkinshaw, Rajeev Raman
SEPIA: Search for Proofs Using Inferred Automata. CADE (2015)
Lorenz Hübschle-Schneider, Rajeev Raman
Tree Compression with Top Trees Revisited. CoRR (2015)
Patrick K. Nicholson, Rajeev Raman
Encoding Nearest Larger Values. CPM (2015)
Muhammad Muzammal, Rajeev Raman
Mining sequential patterns from probabilistic databases. Knowl. Inf. Syst. 44 (2) (2015)
Andreas Poyias, Rajeev Raman
Improved Practical Compact Dynamic Tries. SPIRE (2015)
Ted Gueniche, Philippe Fournier-Viger, Rajeev Raman, Vincent S. Tseng
CPT+: Decreasing the Time/Space Complexity of the Compact Prediction Tree. PAKDD (2) (2015)
Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti
Asymptotically Optimal Encodings for Range Selection. FSTTCS (2014)
Thomas Gransden, Neil Walkinshaw, Rajeev Raman
Mining State-Based Models from Proof Corpora. CICM (2014)
Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
Optimal Indexes for Sparse Bit Vectors. Algorithmica 69 (4) (2014)
Thomas Gransden, Neil Walkinshaw, Rajeev Raman
Mining State-Based Models from Proof Corpora. CoRR (2014)
Seungbum Jo, Stelios Joannou, Daisuke Okanohara, Rajeev Raman, Srinivasa Rao Satti
Compressed Bit Vectors Based on Variable-to-Fixed Encodings. DCC (2014)
Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti
On Succinct Representations of Binary Trees. CoRR (2014)
Roberto Grossi, Rajeev Raman, Srinivasa Rao Satti, Rossano Venturini
Dynamic Compressed Strings with Random Access. ICALP (1) (2013)
Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti
Encodings for Range Selection and Top-k Queries. ESA (2013)
Rajeev Raman, S. Srinivasa Rao
Succinct Representations of Ordinal Trees. Space-Efficient Data Structures, Streams, and Algorithms (2013)
Pooya Davoodi, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao
Encoding Range Minimum Queries. CoRR (2013)
Arash Farzan, J. Ian Munro, Rajeev Raman
Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima. ICALP (1) (2012)
Rajeev Raman
Range Extremum Queries. IWOCA (2012)
J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
Succinct representations of permutations and functions. Theor. Comput. Sci. 438 (2012)
Yusaku Kaneta, Hiroki Arimura, Rajeev Raman
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism. J. Discrete Algorithms 14 (2012)
Stelios Joannou, Rajeev Raman
Dynamizing Succinct Tree Representations. SEA (2012)
Arash Farzan, J. Ian Munro, Rajeev Raman
Succinct Indices for Range Queries with applications to Orthogonal Range Maxima CoRR (2012)
Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao
Two Dimensional Range Minimum Queries and Fibonacci Lattices. ESA (2012)
Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti
Succinct Representations of Binary Trees for Range Minimum Queries. COCOON (2012)
Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao
Encoding 2D Range Maximum Queries. ISAAC (2011)
Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
Optimal Indexes for Sparse Bit Vectors CoRR (2011)
Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao
Encoding 2-D Range Maximum Queries CoRR (2011)
Muhammad Muzammal, Rajeev Raman
Mining Sequential Patterns from Probabilistic Databases. PAKDD (2) (2011)
J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
Succinct Representations of Permutations and Functions CoRR (2011)
Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
Random Access to grammar-Compressed Strings. SODA (2011)
Stelios Joannou, Rajeev Raman
An Empirical Evaluation of Extendible Arrays. SEA (2011)
Muhammad Muzammal, Rajeev Raman
On Probabilistic Models for Uncertain Sequential Pattern Mining. ADMA (1) (2010)
Muhammad Muzammal, Rajeev Raman
Uncertainty in Sequential Pattern Mining. BNCOD (2010)
Roberto Grossi, Alessio Orlandi, Rajeev Raman
Optimal Trade-Offs for Succinct String Indexes. ICALP (1) (2010)
Roberto Grossi, Alessio Orlandi, Rajeev Raman
Optimal Trade-Off for Succinct String Indexes CoRR (2010)
Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. STACS (2009)
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
Universal Succinct Representations of Trees? ICALP (1) (2009)
Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries CoRR (2009)
Rajeev Raman, David S. Wise
Converting to and from Dilated Integers. IEEE Trans. Computers 57 (4) (2008)
Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman
Computing Minimum Spanning Trees with Uncertainty. STACS (2008)
Alexander Golynski, Rajeev Raman, S. Srinivasa Rao
On the Redundancy of Succinct Data Structures. SWAT (2008)
Rajeev Raman, Matthias F. Stallmann
Preface. ACM J. Exp. Algorithmics 13 (2008)
O'Neil Delpratt, Rajeev Raman, Naila Rahman
Engineering succinct DOM. EDBT (2008)
Thomas Erlebach, Michael Hoffmann, Danny Krizanc, Matús Mihalák, Rajeev Raman
Computing Minimum Spanning Trees with Uncertainty CoRR (2008)
Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3 (4) (2007)
Michael Hoffmann, S. Muthukrishnan, Rajeev Raman
Streaming Algorithms for Data in Motion. ESCAPE (2007)
Naila Rahman, Rajeev Raman
Cache Analysis of Non-uniform Distribution Sorting Algorithms CoRR (2007)
Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao
On the Size of Succinct Indices. ESA (2007)
O'Neil Delpratt, Naila Rahman, Rajeev Raman
Compressed Prefix Sums. SOFSEM (1) (2007)
Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets CoRR (2007)
Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman
A simple optimal representation for balanced parentheses. Theor. Comput. Sci. 368 (3) (2006)
O'Neil Delpratt, Naila Rahman, Rajeev Raman
Engineering the LOUDS Succinct Tree Representation. WEA (2006)
Richard F. Geary, Rajeev Raman, Venkatesh Raman
Succinct ordinal trees with level-ancestor queries. ACM Trans. Algorithms 2 (4) (2006)
David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
Representing Trees of Higher Degree. Algorithmica 43 (4) (2005)
Rolf H. Möhring, Rajeev Raman
Preface. Algorithmica 42 (3-4) (2005)
Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman
Efficient Update Strategies for Geometric Computing with Uncertainty. Theory Comput. Syst. 38 (4) (2005)
Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman
A Simple Optimal Representation for Balanced Parentheses. CPM (2004)
Danny Krizanc, Flaminia L. Luccio, Rajeev Raman
Compact Routing Schemes for Dynamic Ring Networks. Theory Comput. Syst. 37 (5) (2004)
Richard F. Geary, Rajeev Raman, Venkatesh Raman
Succinct ordinal trees with level-ancestor queries. SODA (2004)
Rajeev Raman, S. Srinivasa Rao
Succinct Dynamic Dictionaries and Trees. ICALP (2003)
J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
Succinct Representations of Permutations. ICALP (2003)
Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman
Efficient Update Strategies for Geometric Computing with Uncertainty. CIAC (2003)
Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. SODA (2002)
Torben Hagerup, Rajeev Raman
An Efficient Quasidictionary. SWAT (2002)
Michael A. Bender, Richard Cole, Rajeev Raman
Exponential Structures for Efficient Cache-Oblivious Algorithms. ICALP (2002)
Naila Rahman, Rajeev Raman
Adapting Radix Sort to the Memory Hierarchy. ACM J. Exp. Algorithmics 6 (2001)
Naila Rahman, Richard Cole, Rajeev Raman
Optimised Predecessor Data Structures for Internal Memory. WAE (2001)
Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
Succinct Dynamic Data Structures. WADS (2001)

Rajeev Raman.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Rajeev Raman