Rajeev Raman - RankMe

142 papers A* 13A 12B 20C 8Misc 1Journal 56Unranked 28

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	An Evolutionary Attention-Based Network for Medical Image Classification. Int. J. Neural Syst. Hengde Zhu, Jian Wang, Shui-Hua Wang, Rajeev Raman, Juan Manuel Górriz, Yudong Zhang
2022	J	`jnl`	Adaptive Succinctness. Algorithmica Diego Arroyuelo, Rajeev Raman
2022	J	`jnl`	Fast and Simple Compact Hashing via Bucketing. Algorithmica Dominik Köppl, Simon J. Puglisi, Rajeev Raman
2022	B	`conf`	On Dynamic Bitvector Implementations. DCC Saska Dönges, Simon J. Puglisi, Rajeev Raman
2021	J	`jnl`	Engineering Practical Lempel-Ziv Tries. ACM J. Exp. Algorithmics Diego Arroyuelo, Rodrigo Cánovas, Johannes Fischer, Dominik Köppl, Marvin Löbel, Gonzalo Navarro, Rajeev Raman
2021	B	`conf`	On Elias-Fano for Rank Queries in FM-Indexes. DCC Danyang Ma, Simon J. Puglisi, Rajeev Raman, Bella Zhukova
2021	B	`conf`	Weighted Ancestors in Suffix Trees Revisited. CPM Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman
2021	J	`jnl`	Weighted Ancestors in Suffix Trees Revisited. CoRR Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman
2020	B	`conf`	Compressing and Randomly Accessing Sequences (note). DCC Laith Ali Abdusahib, Diego Arroyuelo, Rajeev Raman
2020	B	`conf`	Fast and Simple Compact Hashing via Bucketing. SEA Dominik Köppl, Simon J. Puglisi, Rajeev Raman
2020	J	`jnl`	Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. CoRR Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada
2020	J	`jnl`	Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. Theor. Comput. Sci. Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada
2019	C	`conf`	Adaptive Succinctness. SPIRE Diego Arroyuelo, Rajeev Raman
2019	—	`conf`	Succinct BWT-Based Sequence Prediction. DEXA (2) Rafael Ktistakis, Philippe Fournier-Viger, Simon J. Puglisi, Rajeev Raman
2018	J	`jnl`	Encoding nearest larger values. Theor. Comput. Sci. Michael Hoffmann, John Iacono, Patrick K. Nicholson, Rajeev Raman
2018	—	`conf`	Frequent Itemset Mining on Correlated Probabilistic Databases. DEXA (2) Yasemin Asan Kalaz, Rajeev Raman
2018	A*	`conf`	In-memory Representations of Databases via Succinct Data Structures: Tutorial Abstract. PODS Rajeev Raman
2018	J	`jnl`	m-Bonsai: A Practical Compact Dynamic Trie. Int. J. Found. Comput. Sci. Andreas Poyias, Simon J. Puglisi, Rajeev Raman
2017	B	`ed.`	16th International Symposium on Experimental Algorithms, SEA 2017, London, UK, June 21-23, 2017 SEA Costas S. Iliopoulos, Solon P. Pissis, Simon J. Puglisi, Rajeev Raman
2017	J	`jnl`	Asymptotically Optimal Encodings of Range Data Structures for Selection and Top- ACM Trans. Algorithms Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao
2017	A	`conf`	Compact Dynamic Rewritable (CDRW) Arrays. ALENEX Andreas Poyias, Simon J. Puglisi, Rajeev Raman
2017	J	`jnl`	Compressed Bit vectors Based on Variable-to-Fixed Encodings. Comput. J. Seungbum Jo, Stelios Joannou, Daisuke Okanohara, Rajeev Raman, Srinivasa Rao Satti
2017	C	`conf`	LZ78 Compression in Low Main Memory Space. SPIRE Diego Arroyuelo, Rodrigo Cánovas, Gonzalo Navarro, Rajeev Raman
2017	J	`jnl`	On Succinct Representations of Binary Trees. Math. Comput. Sci. Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti
2017	J	`jnl`	m-Bonsai: a Practical Compact Dynamic Trie. CoRR Andreas Poyias, Simon J. Puglisi, Rajeev Raman
2016	J	`jnl`	Encoding 2D range maximum queries. Theor. Comput. Sci. Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, Srinivasa Rao Satti, Sunil M. Shende
2016	—	`ch.`	Rank and Select Operations on Bit Strings. Encyclopedia of Algorithms Rajeev Raman
2016	J	`jnl`	Space efficient data structures for nearest larger neighbor. J. Discrete Algorithms Varunkumar Jayapaul, Seungbum Jo, Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
2016	J	`jnl`	Two dimensional range minimum queries and Fibonacci lattices. Theor. Comput. Sci. Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, Srinivasa Rao Satti
2015	—	`conf`	CPT+: Decreasing the Time/Space Complexity of the Compact Prediction Tree. PAKDD (2) Ted Gueniche, Philippe Fournier-Viger, Rajeev Raman, Vincent S. Tseng
2015	B	`conf`	Compact Encodings and Indexes for the Nearest Larger Neighbor Problem. WALCOM Seungbum Jo, Rajeev Raman, Srinivasa Rao Satti
2015	B	`conf`	Encoding Data Structures. WALCOM Rajeev Raman
2015	B	`conf`	Encoding Nearest Larger Values. CPM Patrick K. Nicholson, Rajeev Raman
2015	C	`conf`	Improved Practical Compact Dynamic Tries. SPIRE Andreas Poyias, Rajeev Raman
2015	J	`jnl`	Mining sequential patterns from probabilistic databases. Knowl. Inf. Syst. Muhammad Muzammal, Rajeev Raman
2015	J	`jnl`	Random Access to Grammar-Compressed Strings and Trees. SIAM J. Comput. Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
2015	A	`conf`	SEPIA: Search for Proofs Using Inferred Automata. CADE Thomas Gransden, Neil Walkinshaw, Rajeev Raman
2015	J	`jnl`	SEPIA: Search for Proofs Using Inferred Automata. CoRR Thomas Gransden, Neil Walkinshaw, Rajeev Raman
2015	B	`conf`	Tree Compression with Top Trees Revisited. SEA Lorenz Hübschle-Schneider, Rajeev Raman
2015	J	`jnl`	Tree Compression with Top Trees Revisited. CoRR Lorenz Hübschle-Schneider, Rajeev Raman
2014	—	`conf`	Asymptotically Optimal Encodings for Range Selection. FSTTCS Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti
2014	B	`conf`	Compressed Bit Vectors Based on Variable-to-Fixed Encodings. DCC Seungbum Jo, Stelios Joannou, Daisuke Okanohara, Rajeev Raman, Srinivasa Rao Satti
2014	C	`conf`	Mining State-Based Models from Proof Corpora. CICM Thomas Gransden, Neil Walkinshaw, Rajeev Raman
2014	J	`jnl`	Mining State-Based Models from Proof Corpora. CoRR Thomas Gransden, Neil Walkinshaw, Rajeev Raman
2014	J	`jnl`	On Succinct Representations of Binary Trees. CoRR Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti
2014	J	`jnl`	Optimal Indexes for Sparse Bit Vectors. Algorithmica Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
2013	—	`conf`	Dynamic Compressed Strings with Random Access. ICALP (1) Roberto Grossi, Rajeev Raman, Srinivasa Rao Satti, Rossano Venturini
2013	J	`jnl`	Encoding Range Minimum Queries. CoRR Pooya Davoodi, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao
2013	A	`conf`	Encodings for Range Selection and Top-k Queries. ESA Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti
2013	—	`conf`	Succinct Representations of Ordinal Trees. Space-Efficient Data Structures, Streams, and Algorithms Rajeev Raman, S. Srinivasa Rao
2012	B	`conf`	Dynamizing Succinct Tree Representations. SEA Stelios Joannou, Rajeev Raman
2012	J	`jnl`	Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism. J. Discrete Algorithms Yusaku Kaneta, Hiroki Arimura, Rajeev Raman
2012	C	`conf`	Range Extremum Queries. IWOCA Rajeev Raman
2012	—	`conf`	Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima. ICALP (1) Arash Farzan, J. Ian Munro, Rajeev Raman
2012	J	`jnl`	Succinct Indices for Range Queries with applications to Orthogonal Range Maxima CoRR Arash Farzan, J. Ian Munro, Rajeev Raman
2012	Misc	`conf`	Succinct Representations of Binary Trees for Range Minimum Queries. COCOON Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti
2012	J	`jnl`	Succinct representations of permutations and functions. Theor. Comput. Sci. J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2012	A	`conf`	Two Dimensional Range Minimum Queries and Fibonacci Lattices. ESA Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao
2011	B	`conf`	An Empirical Evaluation of Extendible Arrays. SEA Stelios Joannou, Rajeev Raman
2011	J	`jnl`	Encoding 2-D Range Maximum Queries CoRR Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao
2011	B	`conf`	Encoding 2D Range Maximum Queries. ISAAC Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao
2011	—	`conf`	Mining Sequential Patterns from Probabilistic Databases. PAKDD (2) Muhammad Muzammal, Rajeev Raman
2011	J	`jnl`	Optimal Indexes for Sparse Bit Vectors CoRR Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
2011	A*	`conf`	Random Access to grammar-Compressed Strings. SODA Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
2011	J	`jnl`	Succinct Representations of Permutations and Functions CoRR J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2010	—	`conf`	On Probabilistic Models for Uncertain Sequential Pattern Mining. ADMA (1) Muhammad Muzammal, Rajeev Raman
2010	J	`jnl`	Optimal Trade-Off for Succinct String Indexes CoRR Roberto Grossi, Alessio Orlandi, Rajeev Raman
2010	—	`conf`	Optimal Trade-Offs for Succinct String Indexes. ICALP (1) Roberto Grossi, Alessio Orlandi, Rajeev Raman
2010	—	`conf`	Uncertainty in Sequential Pattern Mining. BNCOD Muhammad Muzammal, Rajeev Raman
2009	J	`jnl`	More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries CoRR Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
2009	A	`conf`	More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. STACS Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
2009	—	`conf`	Universal Succinct Representations of Trees? ICALP (1) Arash Farzan, Rajeev Raman, S. Srinivasa Rao
2008	J	`jnl`	Computing Minimum Spanning Trees with Uncertainty CoRR Thomas Erlebach, Michael Hoffmann, Danny Krizanc, Matús Mihalák, Rajeev Raman
2008	A	`conf`	Computing Minimum Spanning Trees with Uncertainty. STACS Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman
2008	J	`jnl`	Converting to and from Dilated Integers. IEEE Trans. Computers Rajeev Raman, David S. Wise
2008	B	`conf`	Engineering succinct DOM. EDBT O'Neil Delpratt, Rajeev Raman, Naila Rahman
2008	—	`conf`	On the Redundancy of Succinct Data Structures. SWAT Alexander Golynski, Rajeev Raman, S. Srinivasa Rao
2008	J	`jnl`	Preface. ACM J. Exp. Algorithmics Rajeev Raman, Matthias F. Stallmann
2008	—	`ch.`	Rank and Select Operations on Binary Strings. Encyclopedia of Algorithms Naila Rahman, Rajeev Raman
2007	J	`jnl`	Cache Analysis of Non-uniform Distribution Sorting Algorithms CoRR Naila Rahman, Rajeev Raman
2007	—	`conf`	Compressed Prefix Sums. SOFSEM (1) O'Neil Delpratt, Naila Rahman, Rajeev Raman
2007	A	`conf`	On the Size of Succinct Indices. ESA Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao
2007	—	`conf`	Streaming Algorithms for Data in Motion. ESCAPE Michael Hoffmann, S. Muthukrishnan, Rajeev Raman
2007	J	`jnl`	Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets CoRR Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
2007	J	`jnl`	Succinct indexable dictionaries with applications to encoding ACM Trans. Algorithms Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
2006	J	`jnl`	A simple optimal representation for balanced parentheses. Theor. Comput. Sci. Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman
2006	—	`conf`	Engineering the LOUDS Succinct Tree Representation. WEA O'Neil Delpratt, Naila Rahman, Rajeev Raman
2006	A	`ed.`	Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, ALENEX 2006, Miami, Florida, USA, January 21, 2006 ALENEX Rajeev Raman, Matthias F. Stallmann
2006	J	`jnl`	Succinct ordinal trees with level-ancestor queries. ACM Trans. Algorithms Richard F. Geary, Rajeev Raman, Venkatesh Raman
2005	J	`jnl`	Efficient Update Strategies for Geometric Computing with Uncertainty. Theory Comput. Syst. Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman
2005	J	`jnl`	Preface. Algorithmica Rolf H. Möhring, Rajeev Raman
2005	J	`jnl`	Representing Trees of Higher Degree. Algorithmica David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2004	B	`conf`	A Simple Optimal Representation for Balanced Parentheses. CPM Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman
2004	J	`jnl`	Compact Routing Schemes for Dynamic Ring Networks. Theory Comput. Syst. Danny Krizanc, Flaminia L. Luccio, Rajeev Raman
2004	—	`ch.`	Data Structures for Sets. Handbook of Data Structures and Applications Rajeev Raman
2004	A*	`conf`	Succinct ordinal trees with level-ancestor queries. SODA Richard F. Geary, Rajeev Raman, Venkatesh Raman
2003	C	`conf`	Efficient Update Strategies for Geometric Computing with Uncertainty. CIAC Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman
2003	A*	`conf`	Succinct Dynamic Dictionaries and Trees. ICALP Rajeev Raman, S. Srinivasa Rao
2003	A*	`conf`	Succinct Representations of Permutations. ICALP J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2002	A	`ed.`	Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings ESA Rolf H. Möhring, Rajeev Raman
2002	—	`conf`	An Efficient Quasidictionary. SWAT Torben Hagerup, Rajeev Raman
2002	A*	`conf`	Exponential Structures for Efficient Cache-Oblivious Algorithms. ICALP Michael A. Bender, Richard Cole, Rajeev Raman
2002	A*	`conf`	Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. SODA Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2001	J	`jnl`	Adapting Radix Sort to the Memory Hierarchy. ACM J. Exp. Algorithmics Naila Rahman, Rajeev Raman
2001	—	`conf`	Optimised Predecessor Data Structures for Internal Memory. WAE Naila Rahman, Richard Cole, Rajeev Raman
2001	B	`conf`	Succinct Dynamic Data Structures. WADS Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2000	J	`jnl`	Analysing Cache Effects in Distribution Sorting. ACM J. Exp. Algorithmics Naila Rahman, Rajeev Raman
2000	A	`conf`	Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms. ESA Naila Rahman, Rajeev Raman
1999	—	`conf`	An Experimental Evaluation of Hybrid Data Structures for Searching. WAE Maureen Korda, Rajeev Raman
1999	—	`conf`	Analysing Cache Effects in Distribution Sorting. WAE Naila Rahman, Rajeev Raman
1999	—	`conf`	Dynamic Interval Routing on Asynchronous Rings. IPPS/SPDP Danny Krizanc, Flaminia L. Luccio, Rajeev Raman
1999	J	`jnl`	Small-Rank Selection in Parallel, with Applications to Heap Construction. J. Algorithms Paul F. Dietz, Rajeev Raman
1999	—	`ch.`	Topics in Data Structures. Algorithms and Theory of Computation Handbook Giuseppe F. Italiano, Rajeev Raman
1998	—	`conf`	An Experimental Study of Word-level Parallelism in Some Sorting Algorithms. WAE Naila Rahman, Rajeev Raman
1998	—	`conf`	Random Sampling Techniques in Parallel Computation. IPPS/SPDP Workshops Rajeev Raman
1998	J	`jnl`	Randomized Data Structures for the Dynamic Closest-Pair Problem. SIAM J. Comput. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1998	J	`jnl`	Sorting in Linear Time? J. Comput. Syst. Sci. Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman
1997	J	`jnl`	Recent results on the single-source shortest paths problem. SIGACT News Rajeev Raman
1997	J	`jnl`	Routing on Meshes with Buses. Algorithmica Michael Kaufmann, Rajeev Raman, Jop F. Sibeyn
1996	J	`jnl`	Fast Deterministic Selection on Mesh-Connected Processor Arrays. Algorithmica Danny Krizanc, Lata Narayanan, Rajeev Raman
1996	A	`conf`	Priority Queues: Small, Monotone and Trans-dichotomous. ESA Rajeev Raman
1995	J	`jnl`	Lower Bounds for Set Intersection Queries. Algorithmica Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig
1995	—	`conf`	Parallel algorithms for database operations and a database operation for parallel algorithms. IPPS Rajeev Raman, Uzi Vishkin
1995	J	`jnl`	Simple Randomized Algorithms for Closest Pair Problems. Nord. J. Comput. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1995	A*	`conf`	Sorting in linear time? STOC Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman
1994	J	`jnl`	A Constant Update Time Finger Search Tree. Inf. Process. Lett. Paul F. Dietz, Rajeev Raman
1994	J	`jnl`	A simpler analysis of algorithm 65 (find). SIGACT News Rajeev Raman
1994	A*	`conf`	Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix. SODA Rajeev Raman, Uzi Vishkin
1994	—	`conf`	Very fast optimal parallel algorithms for heap construction. SPDP Paul F. Dietz, Rajeev Raman
1993	B	`conf`	Approximate and Exact Deterministic Parallel Selection. MFCS Shiva Chaudhuri, Torben Hagerup, Rajeev Raman
1993	B	`conf`	Fast Deterministic Approximate and Exact Parallel Sorting. SPAA Torben Hagerup, Rajeev Raman
1993	A*	`conf`	Lower Bounds for Set Intersection Queries. SODA Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig
1993	B	`conf`	Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract). WADS Paul F. Dietz, Rajeev Raman
1993	A*	`conf`	Randomized Data Structures for the Dynamic Closest-Pair Problem. SODA Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1993	A	`conf`	Randomized Routing on Meshes with Buses. ESA Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman
1993	—	`conf`	Simple Randomized Algorithms for Closest Pair Problems. CCCG Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1992	A*	`conf`	Waste Makes Haste: Tight Bounds for Loose Parallel Sorting FOCS Torben Hagerup, Rajeev Raman
1991	—	`conf`	Fast Deterministic Selection on Mesh-Connected Processor Arrays. FSTTCS Danny Krizanc, Lata Narayanan, Rajeev Raman
1991	C	`conf`	Generating Random Graphs Efficiently. ICCI Rajeev Raman
1991	A*	`conf`	Persistence, Amortization and Randomization. SODA Paul F. Dietz, Rajeev Raman
1990	C	`conf`	A Constant Update Time Finger Search Tree. ICCI Paul F. Dietz, Rajeev Raman
1990	—	`conf`	The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting. FSTTCS Rajeev Raman