Searching for authors named "Rajeev Raman" – sorted by Relevance.
-
Fast Algorithms for Shortest Paths and Sorting
- Fast Algorithms for Shortest Paths and Sorting Rajeev Raman March 1996 Abstract A priority
- Cited by 5 (0 self) – Add To MetaCart
-
A Summary of Shortest-Paths Results
- A summary of shortest-paths results Rajeev Raman December 1996 Abstract This note attempts
- Cited by 2 (0 self) – Add To MetaCart
-
Improved Data Structures for Predecessor Queries in Integer Sets
- Improved data structures for predecessor queries in integer sets Rajeev Raman August 1995
- Cited by 3 (0 self) – Add To MetaCart
-
Engineering the LOUDS succinct tree representation
- Engineering the LOUDS Succinct Tree Representation ⋆ O’Neil Delpratt, Naila Rahman, and Rajeev
- Cited by 2 (0 self) – Add To MetaCart
-
Parallel Algorithms for Database Operations and a Database Operation for Parallel Algorithms
- Rajeev Raman Uzi Vishkin y Abstract This paper establishes some significant links between two areas
- Cited by 2 (0 self) – Add To MetaCart
-
Adapting Radix Sort to the Memory Hierarchy
- Adapting radix sort to the memory hierarchy Naila Rahman and Rajeev Raman King's College London We
- Cited by 12 (2 self) – Add To MetaCart
-
Approximate and Exact Deterministic Parallel Selection
- Rajeev Raman 3 Max-Planck-Institut fur Informatik Im Stadtwald 6600 Saarbrucken Germany Fax: +49 0681
- Cited by 15 (2 self) – Add To MetaCart
-
Succinct Dynamic Data Structures
- Succinct Dynamic Data Structures ? Rajeev Raman 1 , Venkatesh Raman 2 , S. Srinivasa Rao 2 1
- Cited by 20 (1 self) – Add To MetaCart
-
Succinct ordinal trees with level-ancestor queries
- Succinct ordinal trees with level-ancestor queries RICHARD F. GEARY AND RAJEEV RAMAN University
- Cited by 17 (2 self) – Add To MetaCart
-
Very Fast Optimal Parallel Algorithms for Heap Construction
- Science University of Rochester Rochester, NY 14627 Rajeev Raman y Institute for Advanced Computer
- Cited by 6 (0 self) – Add To MetaCart

