Rajeev Raman

发表

The SiXML Project: SiXDOM 1.2

O'Neil Delpratt, Stelios Joannou, Naila Rahman, 2013 .

Data Structures for Sets

Rajeev Raman, 2004, Handbook of Data Structures and Applications.

Encodings for Range Selection and Top-k Queries

Rajeev Raman, Gonzalo Navarro, Roberto Grossi, 2013, ESA.

Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries

Rajeev Raman, Gonzalo Navarro, Roberto Grossi, 2017, ACM Trans. Algorithms.

Generating Random Graphs Efficiently

Rajeev Raman, 1991, ICCI.

On the Redundancy of Succinct Data Structures

Rajeev Raman, S. Srinivasa Rao, Alexander Golynski, 2008, SWAT.

Mining sequential patterns from probabilistic databases

Rajeev Raman, Muhammad Muzammal, R. Raman, 2011, Knowledge and Information Systems.

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

Hiroki Arimura, Rajeev Raman, Yusaku Kaneta, 2012, J. Discrete Algorithms.

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

Rajeev Raman, J. Ian Munro, Arash Farzan, 2012, ICALP.

Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms

Naila Rahman, Rajeev Raman, R. Raman, 2000, ESA.

Rank and Select Operations on Bit Strings

Rajeev Raman, 2016, Encyclopedia of Algorithms.

Image processing data flow in digital cameras

Rajeev Raman, 1998, Electronic Imaging.

An Efficient Quasidictionary

Rajeev Raman, Torben Hagerup, T. Hagerup, 2002, SWAT.

Priority Queues: Small, Monotone and Trans-dichotomous

Rajeev Raman, R. Raman, 1996, ESA.

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

Rajeev Raman, R. Raman, 1990, FSTTCS.

Mining State-Based Models from Proof Corpora

Rajeev Raman, Neil Walkinshaw, Thomas Gransden, 2014, CICM.

Two dimensional range minimum queries and Fibonacci lattices

Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao, 2012, Theor. Comput. Sci..

Multimedia content publishing on multiple platforms

Rajeev Raman, Daniel G. Zuck, 2013 .

Rank and Select Operations on Binary Strings

Naila Rahman, Rajeev Raman, R. Raman, 2016, Encyclopedia of Algorithms.

Succinct Dynamic Data Structures

Rajeev Raman, S. Srinivasa Rao, Venkatesh Raman, 2001, WADS.

Two dimensional range minimum queries and Fibonacci lattices

Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao, 2016, Theor. Comput. Sci..

Data Structures for Sets

Rajeev Raman, 2004 .

Randomized data structures for the dynamic closest-pair problem

Michiel H. M. Smid, Rajeev Raman, Mordecai J. Golin, 1998, SODA '93.

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

Rajeev Raman, Paul F. Dietz, R. Raman, 1999, J. Algorithms.

Succinct ordinal trees with level-ancestor queries

Rajeev Raman, Venkatesh Raman, Richard F. Geary, 2004, SODA '04.

Efficient Update Strategies for Geometric Computing with Uncertainty

Rajeev Raman, Danny Krizanc, Michael Hoffmann, 2003, Theory of Computing Systems.

Exponential Structures for Efficient Cache-Oblivious Algorithms

Richard Cole, Rajeev Raman, Michael A. Bender, 2002, ICALP.

Compressed Bit vectors Based on Variable-to-Fixed Encodings

Stelios Joannou, Rajeev Raman, S. Srinivasa Rao, 2017, Comput. J..

Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers

Rajeev Raman, Costas S. Iliopoulos, Solon P. Pissis, 2017, SEA.

Succinct representations of permutations and functions

Rajeev Raman, S. Srinivasa Rao, Venkatesh Raman, 2011, Theor. Comput. Sci..

Space efficient data structures for nearest larger neighbor

Rajeev Raman, S. Srinivasa Rao, Venkatesh Raman, 2016, J. Discrete Algorithms.

m-Bonsai: a Practical Compact Dynamic Trie pdf

Rajeev Raman, Simon J. Puglisi, Andreas Poyias, 2018, Int. J. Found. Comput. Sci..

Succinct Representations of Binary Trees for Range Minimum Queries

Rajeev Raman, S. Srinivasa Rao, Pooya Davoodi, 2012, COCOON.

Random Sampling Techniques in Parallel Computation

Rajeev Raman, R. Raman, 1998, IPPS/SPDP Workshops.

Fast deterministic selection on mesh-connected processor arrays

Rajeev Raman, Lata Narayanan, Danny Krizanc, 2005, Algorithmica.

An Empirical Evaluation of Extendible Arrays

Stelios Joannou, Rajeev Raman, R. Raman, 2011, SEA.

Compact Routing Schemes for Dynamic Ring Networks

Rajeev Raman, Flaminia L. Luccio, Danny Krizanc, 2004, Theory of Computing Systems.

Optimal randomized parallel algorithms for computing the row maxima of a totally monotone matrix

Rajeev Raman, Uzi Vishkin, 1994, SODA '94.

Adapting Radix Sort to the Memory Hierarchy

Naila Rahman, Rajeev Raman, R. Raman, 2001, JEAL.

On Probabilistic Models for Uncertain Sequential Pattern Mining

Rajeev Raman, Muhammad Muzammal, R. Raman, 2010, ADMA.

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

Naila Rahman, Rajeev Raman, R. Raman, 1998, WAE.

A simpler analysis of algorithm 65 (find)

Rajeev Raman, 1994, SIGA.

Analysing cache effects in distribution sorting

Naila Rahman, Rajeev Raman, R. Raman, 1999, JEAL.

Succinct Representations of Permutations

Rajeev Raman, S. Srinivasa Rao, Venkatesh Raman, 2003, ICALP.

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

Rajeev Raman, Roberto Grossi, S. Srinivasa Rao, 2009, STACS.

Optimal Trade-Offs for Succinct String Indexes

Rajeev Raman, Roberto Grossi, Alessio Orlandi, 2010, ICALP.

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

Rajeev Raman, Uzi Vishkin, 1995, Proceedings of 9th International Parallel Processing Symposium.

Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets

Rajeev Raman, S. Srinivasa Rao, Venkatesh Raman, 2007, ACM Trans. Algorithms.

Algorithms - ESA 2002 : 10th Annual European Symposium, Rome, Italy, September 17-21, 2002 : proceedings

Rajeev Raman, Rolf H. Möhring, 2002 .

Compressed Bit Vectors Based on Variable-to-Fixed Encodings

Stelios Joannou, Rajeev Raman, S. Srinivasa Rao, 2014, 2014 Data Compression Conference.

Routing on Meshes with Buses

Rajeev Raman, Michael Kaufmann, Jop F. Sibeyn, 1997, Algorithmica.

2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX)

Rajeev Raman, Matthias F. Stallmann, 2006 .

Encoding Range Minimum Queries pdf

Rajeev Raman, Gonzalo Navarro, S. Srinivasa Rao, 2013, ArXiv.

An Experimental Evaluation of Hybrid Data Structures for Searching

Rajeev Raman, Maureen Korda, R. Raman, 1999, WAE.

A Constant Update Time Finger Search Tree

Rajeev Raman, Paul F. Dietz, R. Raman, 1990, Inf. Process. Lett..

On the Size of Succinct Indices

Rajeev Raman, Roberto Grossi, S. Srinivasa Rao, 2007, ESA.

LZ78 Compression in Low Main Memory Space

Rajeev Raman, Gonzalo Navarro, Diego Arroyuelo, 2017, SPIRE.

A Constant Update Time Finger Search Tree

Rajeev Raman, Paul F. Dietz, 1990, ICCI.

Sorting in Linear Time?

Rajeev Raman, Arne Andersson, Stefan Nilsson, 1998, J. Comput. Syst. Sci..

On Succinct Representations of Binary Trees

Rajeev Raman, S. Srinivasa Rao, Pooya Davoodi, 2017, Math. Comput. Sci..

Very fast optimal parallel algorithms for heap construction

Rajeev Raman, Paul F. Dietz, R. Raman, 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

Uncertainty in Sequential Pattern Mining

Rajeev Raman, Muhammad Muzammal, 2010, BNCOD.

Efficient Update Strategies for Geometric Computing with Uncertainty

Rajeev Raman, Danny Krizanc, Michael Hoffmann, 2003, CIAC.

Optimal Indexes for Sparse Bit Vectors

Rajeev Raman, S. Srinivasa Rao, Alexander Golynski, 2013, Algorithmica.

Encoding nearest larger values

Rajeev Raman, John Iacono, Patrick K. Nicholson, 2018, Theor. Comput. Sci..

Dynamizing Succinct Tree Representations

Stelios Joannou, Rajeev Raman, 2012, SEA.

Randomized Routing on Meshes with Buses

Rajeev Raman, Michael Kaufmann, Jop F. Sibeyn, 1993, ESA.

Encoding 2D Range Maximum Queries

Rajeev Raman, John Iacono, S. Srinivasa Rao, 2011, ISAAC.

Fast deterministic approximate and exact parallel sorting

Rajeev Raman, Torben Hagerup, T. Hagerup, 1993, SPAA '93.

Compact Encodings and Indexes for the Nearest Larger Neighbor Problem

Rajeev Raman, S. Srinivasa Rao, Seungbum Jo, 2015, WALCOM.

Lower bounds for set intersection queries

Kurt Mehlhorn, Rajeev Raman, Christian Uhrig, 1993, SODA '93.

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

Rajeev Raman, Paul F. Dietz, 1993, WADS.

Analysing Cache Effects in Distribution Sorting

Naila Rahman, Rajeev Raman, 1999, Algorithm Engineering.

Compact Dynamic Rewritable (CDRW) Arrays

Rajeev Raman, Simon J. Puglisi, Andreas Poyias, 2017, ALENEX.

Simple Randomized Algorithms for Closest Pair Problems

Michiel H. M. Smid, Rajeev Raman, Mordecai J. Golin, 1995, Nord. J. Comput..

Mining Sequential Patterns from Probabilistic Databases

Rajeev Raman, Muhammad Muzammal, 2011, PAKDD.

Engineering succinct DOM

Naila Rahman, Rajeev Raman, O'Neil Delpratt, 2008, EDBT '08.

16th International Symposium on Experimental Algorithms, SEA 2017, June 21-23, 2017, London, UK

Rajeev Raman, Costas S. Iliopoulos, Solon P. Pissis, 2017, SEA.

A simple optimal representation for balanced parentheses

Naila Rahman, Rajeev Raman, Venkatesh Raman, 2004, Theor. Comput. Sci..

Engineering the LOUDS Succinct Tree Representation

Naila Rahman, Rajeev Raman, O'Neil Delpratt, 2006, WEA.

Frequent Itemset Mining on Correlated Probabilistic Databases

Rajeev Raman, Yasemin Asan Kalaz, R. Raman, 2018, DEXA.

Fast Algorithms for Shortest Paths and Sorting

Rajeev Raman, R. Raman, 1996 .

A simple optimal representation for balanced parentheses

Naila Rahman, Rajeev Raman, Venkatesh Raman, 2006, Theor. Comput. Sci..

Sorting in linear time?

Rajeev Raman, Arne Andersson, Stefan Nilsson, 1995, STOC '95.

Range Extremum Queries

Rajeev Raman, R. Raman, 2012, IWOCA.

Streaming Algorithms for Data in Motion

Rajeev Raman, S. Muthukrishnan, Michael Hoffmann, 2007, ESCAPE.

Representing Trees of Higher Degree

Rajeev Raman, Erik D. Demaine, S. Srinivasa Rao, 2005, Algorithmica.

Algorithms — ESA 2002

Rajeev Raman, Rolf H. Möhring, R. Möhring, 2002, Lecture Notes in Computer Science.

Approximate and Exact Deterministic Parallel Selection

Rajeev Raman, Torben Hagerup, Shiva Chaudhuri, 1993, MFCS.

Succinct Representations of Ordinal Trees

Rajeev Raman, S. Srinivasa Rao, 2013, Space-Efficient Data Structures, Streams, and Algorithms.

Asymptotically Optimal Encodings for Range Selection

Rajeev Raman, Gonzalo Navarro, S. Srinivasa Rao, 2014, FSTTCS.

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

Rajeev Raman, 2018, PODS.

Improved Practical Compact Dynamic Tries

Rajeev Raman, Andreas Poyias, R. Raman, 2015, SPIRE.

Succinct Dynamic Dictionaries and Trees

Rajeev Raman, S. Srinivasa Rao, R. Raman, 2003, ICALP.

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

Rajeev Raman, S. Srinivasa Rao, Venkatesh Raman, 2002, SODA '02.

SEPIA: Search for Proofs Using Inferred Automata pdf

Rajeev Raman, Neil Walkinshaw, Thomas Gransden, 2015, CADE.

Dynamic Compressed Strings with Random Access

Rajeev Raman, Roberto Grossi, S. Srinivasa Rao, 2013, ICALP.

Encoding Data Structures

Rajeev Raman, 2015, WALCOM.

Converting to and from Dilated Integers

Rajeev Raman, David S. Wise, R. Raman, 2008, IEEE Transactions on Computers.

Universal Succinct Representations of Trees?

Rajeev Raman, S. Srinivasa Rao, Arash Farzan, 2009, ICALP.

Fast Deterministic Selection on Mesh-Connected Processor Arrays

Rajeev Raman, Lata Narayanan, Danny Krizanc, 1991, FSTTCS.

Waste makes haste: tight bounds for loose parallel sorting

Rajeev Raman, Torben Hagerup, 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

Random Access to Grammar-Compressed Strings and Trees

Gad M. Landau, Philip Bille, Rajeev Raman, 2015, SIAM J. Comput..

Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (Proceedings in Applied Mathematics)

Rajeev Raman, Matthias F. Stallmann, Robert Sedgewick, 2006 .

Compressed Prefix Sums

Naila Rahman, Rajeev Raman, O'Neil Delpratt, 2007, SOFSEM.

Persistence, amortization and randomization

Rajeev Raman, Paul F. Dietz, R. Raman, 1991, SODA '91.

Encoding Nearest Larger Values

Rajeev Raman, Patrick K. Nicholson, 2015, CPM.

Random Sampling Techniques in Parallel Algorithms

Rajeev Raman, R. Raman, 1999 .

Optimised Predecessor Data Structures for Internal Memory

Richard Cole, Naila Rahman, Rajeev Raman, 2001, WAE.

Dynamic interval routing on asynchronous rings

Rajeev Raman, Flaminia L. Luccio, Danny Krizanc, 1999, Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999.

Cache Analysis of Non-uniform Distribution Sorting Algorithms pdf

Naila Rahman, Rajeev Raman, R. Raman, 2007, ArXiv.

String-Matching techniques for musical similarity and melodic recognition

Rajeev Raman, Tim Crawford, Costas S. Ilipoulos, 1998 .

Recent results on the single-source shortest paths problem

Rajeev Raman, R. Raman, 1997, SIGA.

Eliminating Amortization: On Data Structures with Guaranteed Response Time

Rajeev Raman, R. Raman, 1993 .

On Elias-Fano for Rank Queries in FM-Indexes**Funded in part by Academy of Finland grant 319454.

Rajeev Raman, Simon J. Puglisi, Bella Zhukova, 2021, 2021 Data Compression Conference (DCC).

Weighted Ancestors in Suffix Trees Revisited

Rajeev Raman, Simon J. Puglisi, Dmitry Kosolobov, 2021, CPM.

Encoding range minima and range top-2 queries

Rajeev Raman, Gonzalo Navarro, Pooya Davoodi, 2014, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

Proceedings of the 10th Annual European Symposium on Algorithms

Rajeev Raman, Rolf H. Möhring, 2002 .

Optimal Encodings and Indexes for Nearest Larger Value Problems

Rajeev Raman, Seungbum Jo, Srinivasa Rao Satti, 2014 .