World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
35
Citations
6025
World Ranking
11603
National Ranking
730

Overview

Rajeev Raman is affiliated with the University of Leicester in the United Kingdom. Their research primarily spans the fields of Computer Science and Biochemistry, Genetics and Molecular Biology.

The main areas of their work include:

  • Algorithms and Data Compression
  • Semigroups and Automata Theory
  • DNA and Biological Computing
  • Network Packet Processing and Optimization
  • Single-cell and Spatial Transcriptomics
  • Generative Adversarial Networks and Image Synthesis
  • Advanced Neural Network Applications

Prominent subfields within their research contributions are:

  • Artificial Intelligence
  • Molecular Biology
  • Computer Vision and Pattern Recognition
  • Hardware and Architecture
  • Surgery

Rajeev Raman has collaborated frequently with several co-authors, including:

  • Dominik Köppl
  • Simon J. Puglisi
  • Péter Burcsi
  • Gabriele Fici
  • Zsuzsanna Lipták

Their recent publications cover a range of topics and venues, such as:

  • "An Evolutionary Attention-Based Network for Medical Image Classification," 2022, International Journal of Neural Systems
  • "Generating a Gray code for prefix normal words in amortized polylogarithmic time per word," 2020, Theoretical Computer Science
  • "Fast and Simple Compact Hashing via Bucketing," 2020, arXiv (Cornell University)
  • "Adaptive Succinctness," 2021, Algorithmica
  • "Fast and Simple Compact Hashing via Bucketing," 2022, Algorithmica

The main publication venues where this researcher frequently publishes include:

  • arXiv (Cornell University)
  • Algorithmica
  • International Journal of Orthopaedic Surgery
  • International Journal of Neural Systems
  • Theoretical Computer Science

Best Publications

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

    Rajeev Raman;Venkatesh Raman;Srinivasa Rao Satti

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

    Rajeev Raman;Venkatesh Raman;S. Srinivasa Rao

  • Representing Trees of Higher Degree

    David Benoit;Erik D. Demaine;J. Ian Munro;Rajeev Raman

  • Sorting in Linear Time

    Arne Andersson;Torben Hagerup;Stefan Nilsson;Rajeev Raman

  • Algorithms — ESA 2002

    Rolf Möhring;Rajeev Raman

  • String Matching Techniques for Musical Similarity and Melodic Recognition

    Tim Crawford;Costas S. Ilipoulos;Rajeev Raman

  • Succinct ordinal trees with level-ancestor queries

    Richard F. Geary;Rajeev Raman;Venkatesh Raman

  • A simple optimal representation for balanced parentheses

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

  • Succinct Dynamic Data Structures

    Rajeev Raman;Venkatesh Raman;S. Srinivasa Rao

  • Succinct representations of permutations

    J. Ian Munro;Rajeev Raman;Venkatesh Raman;Satti Srinivasa Rao

  • Priority Queues: Small, Monotone and Trans-dichotomous

    Rajeev Raman

  • Random Access to Grammar-Compressed Strings and Trees

    Philip Bille;Gad M. Landau;Rajeev Raman;Kunihiko Sadakane

  • Succinct dynamic dictionaries and trees

    Rajeev Raman;Satti Srinivasa Rao

  • Recent results on the single-source shortest paths problem

    Rajeev Raman

  • Engineering the LOUDS succinct tree representation

    Oneil Delpratt;Naila Rahman;Rajeev Raman

  • The power of Collision: randomized parallel algorithms for chaining and integer sorting

    Rajeev Raman

  • Random access to grammar-compressed strings

    Philip Bille;Gad M. Landau;Rajeev Raman;Kunihiko Sadakane

  • Mining sequential patterns from probabilistic databases

    Muhammad Muzammal;Rajeev Raman

  • Succinct representations of permutations and functions

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

  • Persistence, amortization and randomization

    Paul F. Dietz;Rajeev Raman

Frequent Co-Authors

Venkatesh Raman
Venkatesh Raman Indian Institute of Technology Palakkad
Simon J. Puglisi
Simon J. Puglisi University of Helsinki
Torben Hagerup
Torben Hagerup University of Augsburg
J. Ian Munro
J. Ian Munro University of Waterloo
gonzalo navarro
gonzalo navarro University of Chile
Danny Krizanc
Danny Krizanc Wesleyan University
Michiel Smid
Michiel Smid Carleton University
Kunihiko Sadakane
Kunihiko Sadakane University of Tokyo
Kurt Mehlhorn
Kurt Mehlhorn Max Planck Institute for Informatics
Gad M. Landau
Gad M. Landau University of Haifa

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

The field of Computer Science offers a wealth of flexible learning opportunities and diverse career options. For those seeking practicality and accessibility, there are accelerated computer science degree programs online, which allow motivated students to finish their studies faster and enter the workforce sooner.

Students who are concerned about past academic performance can still find excellent online graduate schools with low gpa requirements. These institutions offer second chances, making advanced study more accessible for those who are determined to advance in their careers.

Computer Science also opens doors to interdisciplinary fields. For example, environmental innovators can explore environmental engineering degree programs online, combining tech skills with sustainable solutions. Curious about potential roles? Discover what can you do with an environmental science major—a pathway that increasingly values computational expertise.

Exploring these online programs can help match your educational needs and career ambitions, no matter your background or schedule.

Best Scientists Citing Rajeev Raman

Trending Scientists

Recently Published Articles