The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Rajeev Raman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
    Simple Randomized Algorithms for Closest Pair Problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:246-251 [Conf]
  2. Richard Bruce, Michael Hoffmann 0002, Danny Krizanc, Rajeev Raman
    Efficient Update Strategies for Geometric Computing with Uncertainty. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:12-23 [Conf]
  3. Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman
    A Simple Optimal Representation for Balanced Parentheses. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:159-172 [Conf]
  4. Naila Rahman, Rajeev Raman
    Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:380-391 [Conf]
  5. Rajeev Raman
    Priority Queues: Small, Monotone and Trans-dichotomous. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:121-137 [Conf]
  6. Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman
    Randomized Routing on Meshes with Buses. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:333-344 [Conf]
  7. Torben Hagerup, Rajeev Raman
    Waste Makes Haste: Tight Bounds for Loose Parallel Sorting [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:628-637 [Conf]
  8. Danny Krizanc, Lata Narayanan, Rajeev Raman
    Fast Deterministic Selection on Mesh-Connected Processor Arrays. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:336-346 [Conf]
  9. Rajeev Raman
    The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:161-175 [Conf]
  10. Michael A. Bender, Richard Cole, Rajeev Raman
    Exponential Structures for Efficient Cache-Oblivious Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:195-207 [Conf]
  11. J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
    Succinct Representations of Permutations. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:345-356 [Conf]
  12. Rajeev Raman, S. Srinivasa Rao
    Succinct Dynamic Dictionaries and Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:357-368 [Conf]
  13. Paul F. Dietz, Rajeev Raman
    A Constant Update Time Finger Search Tree. [Citation Graph (0, 0)][DBLP]
    ICCI, 1990, pp:100-109 [Conf]
  14. Rajeev Raman
    Generating Random Graphs Efficiently. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:149-160 [Conf]
  15. Danny Krizanc, Flaminia L. Luccio, Rajeev Raman
    Dynamic Interval Routing on Asynchronous Rings. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1999, pp:225-232 [Conf]
  16. Rajeev Raman
    Random Sampling Techniques in Parallel Computation. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP Workshops, 1998, pp:351-360 [Conf]
  17. Rajeev Raman, Uzi Vishkin
    Parallel algorithms for database operations and a database operation for parallel algorithms. [Citation Graph (0, 0)][DBLP]
    IPPS, 1995, pp:173-0 [Conf]
  18. Shiva Chaudhuri, Torben Hagerup, Rajeev Raman
    Approximate and Exact Deterministic Parallel Selection. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:352-361 [Conf]
  19. Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig
    Lower Bounds for Set Intersection Queries. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:194-201 [Conf]
  20. Paul F. Dietz, Rajeev Raman
    Persistence, Amortization and Randomization. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:78-88 [Conf]
  21. Richard F. Geary, Rajeev Raman, Venkatesh Raman
    Succinct ordinal trees with level-ancestor queries. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1-10 [Conf]
  22. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
    Randomized Data Structures for the Dynamic Closest-Pair Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:301-310 [Conf]
  23. Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
    Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:233-242 [Conf]
  24. Rajeev Raman, Uzi Vishkin
    Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:613-621 [Conf]
  25. Torben Hagerup, Rajeev Raman
    Fast Deterministic Approximate and Exact Parallel Sorting. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:346-355 [Conf]
  26. Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman
    Sorting in linear time? [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:427-436 [Conf]
  27. Torben Hagerup, Rajeev Raman
    An Efficient Quasidictionary. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:1-18 [Conf]
  28. Paul F. Dietz, Rajeev Raman
    Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:289-301 [Conf]
  29. Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
    Succinct Dynamic Data Structures. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:426-437 [Conf]
  30. Naila Rahman, Rajeev Raman
    Analysing Cache Effects in Distribution Sorting. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:183-197 [Conf]
  31. Maureen Korda, Rajeev Raman
    An Experimental Evaluation of Hybrid Data Structures for Searching. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:214-228 [Conf]
  32. Naila Rahman, Richard Cole, Rajeev Raman
    Optimised Predecessor Data Structures for Internal Memory. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2001, pp:67-78 [Conf]
  33. Naila Rahman, Rajeev Raman
    An Experimental Study of Word-level Parallelism in Some Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:193-203 [Conf]
  34. O'Neil Delpratt, Naila Rahman, Rajeev Raman
    Engineering the LOUDS Succinct Tree Representation. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:134-145 [Conf]
  35. David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
    Representing Trees of Higher Degree. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:43, n:4, pp:275-292 [Journal]
  36. Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig
    Lower Bounds for Set Intersection Queries. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:2, pp:154-168 [Journal]
  37. Michael Kaufmann, Rajeev Raman, Jop F. Sibeyn
    Routing on Meshes with Buses. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:3, pp:417-444 [Journal]
  38. Danny Krizanc, Lata Narayanan, Rajeev Raman
    Fast Deterministic Selection on Mesh-Connected Processor Arrays. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:15, n:4, pp:319-331 [Journal]
  39. Rolf H. Möhring, Rajeev Raman
    Preface. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:3-4, pp:199-201 [Journal]
  40. Paul F. Dietz, Rajeev Raman
    A Constant Update Time Finger Search Tree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:3, pp:147-154 [Journal]
  41. Paul F. Dietz, Rajeev Raman
    Small-Rank Selection in Parallel, with Applications to Heap Construction. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:30, n:1, pp:33-51 [Journal]
  42. Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman
    Sorting in Linear Time? [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:57, n:1, pp:74-93 [Journal]
  43. Naila Rahman, Rajeev Raman
    Analysing Cache Effects in Distribution Sorting. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2000, v:5, n:, pp:14- [Journal]
  44. Naila Rahman, Rajeev Raman
    Adapting Radix Sort to the Memory Hierarchy. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2001, v:6, n:, pp:7- [Journal]
  45. Richard Bruce, Michael Hoffmann 0002, Danny Krizanc, Rajeev Raman
    Efficient Update Strategies for Geometric Computing with Uncertainty. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:4, pp:411-423 [Journal]
  46. Danny Krizanc, Flaminia L. Luccio, Rajeev Raman
    Compact Routing Schemes for Dynamic Ring Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:5, pp:585-607 [Journal]
  47. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
    Simple Randomized Algorithms for Closest Pair Problems. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1995, v:2, n:1, pp:3-27 [Journal]
  48. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
    Randomized Data Structures for the Dynamic Closest-Pair Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1036-1072 [Journal]
  49. Richard F. Geary, Rajeev Raman, Venkatesh Raman
    Succinct ordinal trees with level-ancestor queries. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:510-534 [Journal]
  50. Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman
    A simple optimal representation for balanced parentheses. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:368, n:3, pp:231-246 [Journal]
  51. Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao
    On the Size of Succinct Indices. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:371-382 [Conf]
  52. O'Neil Delpratt, Naila Rahman, Rajeev Raman
    Compressed Prefix Sums. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:235-247 [Conf]
  53. M. Hoffmann, S. Muthukrishnan, Rajeev Raman
    Streaming Algorithms for Data in Motion. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:294-304 [Conf]
  54. Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
    Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  55. Naila Rahman, Rajeev Raman
    Cache Analysis of Non-uniform Distribution Sorting Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  56. Engineering succinct DOM. [Citation Graph (, )][DBLP]


  57. Universal Succinct Representations of Trees? [Citation Graph (, )][DBLP]


  58. Optimal Trade-Offs for Succinct String Indexes. [Citation Graph (, )][DBLP]


  59. More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. [Citation Graph (, )][DBLP]


  60. Computing Minimum Spanning Trees with Uncertainty. [Citation Graph (, )][DBLP]


  61. On the Redundancy of Succinct Data Structures. [Citation Graph (, )][DBLP]


  62. Computing Minimum Spanning Trees with Uncertainty [Citation Graph (, )][DBLP]


  63. More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries [Citation Graph (, )][DBLP]


  64. Optimal Trade-Off for Succinct String Indexes [Citation Graph (, )][DBLP]


Search in 0.033secs, Finished in 0.038secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002