default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRajeev Raman
Person information
- affiliation: University of Leicester, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j39]Hengde Zhu
, Jian Wang, Shui-Hua Wang, Rajeev Raman, Juan Manuel Górriz, Yudong Zhang:
An Evolutionary Attention-Based Network for Medical Image Classification. Int. J. Neural Syst. 33(3): 2350010:1-2350010:17 (2023)- 2022
- [j38]Diego Arroyuelo, Rajeev Raman:
Adaptive Succinctness. Algorithmica 84(3): 694-718 (2022) - [j37]Dominik Köppl, Simon J. Puglisi, Rajeev Raman:
Fast and Simple Compact Hashing via Bucketing. Algorithmica 84(9): 2735-2766 (2022) - [c79]Saska Dönges, Simon J. Puglisi, Rajeev Raman:
On Dynamic Bitvector Implementations. DCC 2022: 252-261 - 2021
- [j36]Diego Arroyuelo, Rodrigo Cánovas, Johannes Fischer, Dominik Köppl, Marvin Löbel, Gonzalo Navarro, Rajeev Raman:
Engineering Practical Lempel-Ziv Tries. ACM J. Exp. Algorithmics 26: 14:1-14:47 (2021) - [c78]Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman:
Weighted Ancestors in Suffix Trees Revisited. CPM 2021: 8:1-8:15 - [c77]Danyang Ma, Simon J. Puglisi, Rajeev Raman, Bella Zhukova:
On Elias-Fano for Rank Queries in FM-Indexes. DCC 2021: 223-232 - [i17]Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman:
Weighted Ancestors in Suffix Trees Revisited. CoRR abs/2103.00462 (2021) - 2020
- [j35]Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada:
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. Theor. Comput. Sci. 842: 86-99 (2020) - [c76]Laith Ali Abdusahib, Diego Arroyuelo, Rajeev Raman:
Compressing and Randomly Accessing Sequences (note). DCC 2020: 355 - [c75]Dominik Köppl, Simon J. Puglisi, Rajeev Raman:
Fast and Simple Compact Hashing via Bucketing. SEA 2020: 7:1-7:14 - [i16]Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada:
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. CoRR abs/2003.03222 (2020)
2010 – 2019
- 2019
- [c74]Rafael Ktistakis, Philippe Fournier-Viger, Simon J. Puglisi, Rajeev Raman:
Succinct BWT-Based Sequence Prediction. DEXA (2) 2019: 91-101 - [c73]Diego Arroyuelo, Rajeev Raman:
Adaptive Succinctness. SPIRE 2019: 467-481 - 2018
- [j34]Andreas Poyias, Simon J. Puglisi, Rajeev Raman:
m-Bonsai: A Practical Compact Dynamic Trie. Int. J. Found. Comput. Sci. 29(8): 1257-1278 (2018) - [j33]Michael Hoffmann, John Iacono, Patrick K. Nicholson, Rajeev Raman:
Encoding nearest larger values. Theor. Comput. Sci. 710: 97-115 (2018) - [c72]Yasemin Asan Kalaz, Rajeev Raman:
Frequent Itemset Mining on Correlated Probabilistic Databases. DEXA (2) 2018: 84-98 - [c71]Rajeev Raman:
In-memory Representations of Databases via Succinct Data Structures: Tutorial Abstract. PODS 2018: 323-324 - 2017
- [j32]Seungbum Jo, Stelios Joannou, Daisuke Okanohara, Rajeev Raman, Srinivasa Rao Satti:
Compressed Bit vectors Based on Variable-to-Fixed Encodings. Comput. J. 60(5): 761-775 (2017) - [j31]Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti:
On Succinct Representations of Binary Trees. Math. Comput. Sci. 11(2): 177-189 (2017) - [j30]Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao:
Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries. ACM Trans. Algorithms 13(2): 28:1-28:31 (2017) - [c70]Andreas Poyias, Simon J. Puglisi, Rajeev Raman:
Compact Dynamic Rewritable (CDRW) Arrays. ALENEX 2017: 109-119 - [c69]Diego Arroyuelo, Rodrigo Cánovas, Gonzalo Navarro, Rajeev Raman:
LZ78 Compression in Low Main Memory Space. SPIRE 2017: 38-50 - [e3]Costas S. Iliopoulos, Solon P. Pissis, Simon J. Puglisi, Rajeev Raman:
16th International Symposium on Experimental Algorithms, SEA 2017, June 21-23, 2017, London, UK. LIPIcs 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-036-1 [contents] - [i15]Andreas Poyias, Simon J. Puglisi, Rajeev Raman:
m-Bonsai: a Practical Compact Dynamic Trie. CoRR abs/1704.05682 (2017) - 2016
- [j29]Varunkumar Jayapaul, Seungbum Jo, Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti:
Space efficient data structures for nearest larger neighbor. J. Discrete Algorithms 36: 63-75 (2016) - [j28]Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, Srinivasa Rao Satti, Sunil M. Shende:
Encoding 2D range maximum queries. Theor. Comput. Sci. 609: 316-327 (2016) - [j27]Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, Srinivasa Rao Satti:
Two dimensional range minimum queries and Fibonacci lattices. Theor. Comput. Sci. 638: 33-43 (2016) - [r3]Rajeev Raman:
Rank and Select Operations on Bit Strings. Encyclopedia of Algorithms 2016: 1772-1775 - 2015
- [j26]Muhammad Muzammal, Rajeev Raman:
Mining sequential patterns from probabilistic databases. Knowl. Inf. Syst. 44(2): 325-358 (2015) - [j25]Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann:
Random Access to Grammar-Compressed Strings and Trees. SIAM J. Comput. 44(3): 513-539 (2015) - [c68]Thomas Gransden, Neil Walkinshaw, Rajeev Raman:
SEPIA: Search for Proofs Using Inferred Automata. CADE 2015: 246-255 - [c67]Patrick K. Nicholson, Rajeev Raman:
Encoding Nearest Larger Values. CPM 2015: 385-395 - [c66]Ted Gueniche, Philippe Fournier-Viger, Rajeev Raman, Vincent S. Tseng:
CPT+: Decreasing the Time/Space Complexity of the Compact Prediction Tree. PAKDD (2) 2015: 625-636 - [c65]Andreas Poyias, Rajeev Raman:
Improved Practical Compact Dynamic Tries. SPIRE 2015: 324-336 - [c64]Rajeev Raman:
Encoding Data Structures. WALCOM 2015: 1-7 - [c63]Seungbum Jo, Rajeev Raman, Srinivasa Rao Satti:
Compact Encodings and Indexes for the Nearest Larger Neighbor Problem. WALCOM 2015: 53-64 - [c62]Lorenz Hübschle-Schneider, Rajeev Raman:
Tree Compression with Top Trees Revisited. SEA 2015: 15-27 - [i14]Thomas Gransden, Neil Walkinshaw, Rajeev Raman:
SEPIA: Search for Proofs Using Inferred Automata. CoRR abs/1505.07987 (2015) - [i13]Lorenz Hübschle-Schneider, Rajeev Raman:
Tree Compression with Top Trees Revisited. CoRR abs/1506.04499 (2015) - 2014
- [j24]Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao:
Optimal Indexes for Sparse Bit Vectors. Algorithmica 69(4): 906-924 (2014) - [c61]Seungbum Jo, Stelios Joannou, Daisuke Okanohara, Rajeev Raman, Srinivasa Rao Satti:
Compressed Bit Vectors Based on Variable-to-Fixed Encodings. DCC 2014: 409 - [c60]Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti:
Asymptotically Optimal Encodings for Range Selection. FSTTCS 2014: 291-301 - [c59]Thomas Gransden, Neil Walkinshaw, Rajeev Raman:
Mining State-Based Models from Proof Corpora. CICM 2014: 282-297 - [i12]Thomas Gransden, Neil Walkinshaw, Rajeev Raman:
Mining State-Based Models from Proof Corpora. CoRR abs/1405.3623 (2014) - [i11]Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti:
On Succinct Representations of Binary Trees. CoRR abs/1410.4963 (2014) - 2013
- [c58]Rajeev Raman, S. Srinivasa Rao:
Succinct Representations of Ordinal Trees. Space-Efficient Data Structures, Streams, and Algorithms 2013: 319-332 - [c57]Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti:
Encodings for Range Selection and Top-k Queries. ESA 2013: 553-564 - [c56]Roberto Grossi, Rajeev Raman, Srinivasa Rao Satti, Rossano Venturini:
Dynamic Compressed Strings with Random Access. ICALP (1) 2013: 504-515 - [i10]Pooya Davoodi, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao:
Encoding Range Minimum Queries. CoRR abs/1311.4394 (2013) - 2012
- [j23]Yusaku Kaneta, Hiroki Arimura, Rajeev Raman:
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism. J. Discrete Algorithms 14: 119-135 (2012) - [j22]J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct representations of permutations and functions. Theor. Comput. Sci. 438: 74-88 (2012) - [c55]Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti:
Succinct Representations of Binary Trees for Range Minimum Queries. COCOON 2012: 396-407 - [c54]Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao:
Two Dimensional Range Minimum Queries and Fibonacci Lattices. ESA 2012: 217-228 - [c53]Arash Farzan, J. Ian Munro, Rajeev Raman:
Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima. ICALP (1) 2012: 327-338 - [c52]Rajeev Raman:
Range Extremum Queries. IWOCA 2012: 280-287 - [c51]Stelios Joannou, Rajeev Raman:
Dynamizing Succinct Tree Representations. SEA 2012: 224-235 - [i9]Arash Farzan, J. Ian Munro, Rajeev Raman:
Succinct Indices for Range Queries with applications to Orthogonal Range Maxima. CoRR abs/1204.4835 (2012) - 2011
- [c50]Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao:
Encoding 2D Range Maximum Queries. ISAAC 2011: 180-189 - [c49]Muhammad Muzammal, Rajeev Raman:
Mining Sequential Patterns from Probabilistic Databases. PAKDD (2) 2011: 210-221 - [c48]Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann:
Random Access to grammar-Compressed Strings. SODA 2011: 373-389 - [c47]Stelios Joannou, Rajeev Raman:
An Empirical Evaluation of Extendible Arrays. SEA 2011: 447-458 - [i8]J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct Representations of Permutations and Functions. CoRR abs/1108.1983 (2011) - [i7]Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao:
Optimal Indexes for Sparse Bit Vectors. CoRR abs/1108.2157 (2011) - [i6]Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao:
Encoding 2-D Range Maximum Queries. CoRR abs/1109.2885 (2011) - 2010
- [c46]Muhammad Muzammal, Rajeev Raman:
On Probabilistic Models for Uncertain Sequential Pattern Mining. ADMA (1) 2010: 60-72 - [c45]Muhammad Muzammal, Rajeev Raman:
Uncertainty in Sequential Pattern Mining. BNCOD 2010: 147-150 - [c44]Roberto Grossi, Alessio Orlandi, Rajeev Raman:
Optimal Trade-Offs for Succinct String Indexes. ICALP (1) 2010: 678-689 - [i5]Roberto Grossi, Alessio Orlandi, Rajeev Raman:
Optimal Trade-Off for Succinct String Indexes. CoRR abs/1006.5354 (2010)
2000 – 2009
- 2009
- [c43]Arash Farzan, Rajeev Raman, S. Srinivasa Rao:
Universal Succinct Representations of Trees? ICALP (1) 2009: 451-462 - [c42]Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao:
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. STACS 2009: 517-528 - [i4]Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao:
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. CoRR abs/0902.2648 (2009) - 2008
- [j21]Rajeev Raman, Matthias F. Stallmann:
Preface. ACM J. Exp. Algorithmics 13 (2008) - [j20]Rajeev Raman, David S. Wise:
Converting to and from Dilated Integers. IEEE Trans. Computers 57(4): 567-573 (2008) - [c41]O'Neil Delpratt, Rajeev Raman, Naila Rahman:
Engineering succinct DOM. EDBT 2008: 49-60 - [c40]Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty. STACS 2008: 277-288 - [c39]Alexander Golynski, Rajeev Raman, S. Srinivasa Rao:
On the Redundancy of Succinct Data Structures. SWAT 2008: 148-159 - [r2]Naila Rahman, Rajeev Raman:
Rank and Select Operations on Binary Strings. Encyclopedia of Algorithms 2008 - [i3]Thomas Erlebach, Michael Hoffmann, Danny Krizanc, Matús Mihalák, Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty. CoRR abs/0802.2855 (2008) - 2007
- [j19]Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti:
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4): 43 (2007) - [c38]Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao:
On the Size of Succinct Indices. ESA 2007: 371-382 - [c37]Michael Hoffmann, S. Muthukrishnan, Rajeev Raman:
Streaming Algorithms for Data in Motion. ESCAPE 2007: 294-304 - [c36]O'Neil Delpratt, Naila Rahman, Rajeev Raman:
Compressed Prefix Sums. SOFSEM (1) 2007: 235-247 - [i2]Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti:
Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets. CoRR abs/0705.0552 (2007) - [i1]Naila Rahman, Rajeev Raman:
Cache Analysis of Non-uniform Distribution Sorting Algorithms. CoRR abs/0706.2839 (2007) - 2006
- [j18]Richard F. Geary, Rajeev Raman, Venkatesh Raman:
Succinct ordinal trees with level-ancestor queries. ACM Trans. Algorithms 2(4): 510-534 (2006) - [j17]Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman:
A simple optimal representation for balanced parentheses. Theor. Comput. Sci. 368(3): 231-246 (2006) - [c35]O'Neil Delpratt, Naila Rahman, Rajeev Raman:
Engineering the LOUDS Succinct Tree Representation. WEA 2006: 134-145 - [e2]Rajeev Raman, Matthias F. Stallmann:
Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, ALENEX 2006, Miami, Florida, USA, January 21, 2006. SIAM 2006, ISBN 978-1-61197-286-3 [contents] - 2005
- [j16]Rolf H. Möhring, Rajeev Raman:
Preface. Algorithmica 42(3-4): 199-201 (2005) - [j15]David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Representing Trees of Higher Degree. Algorithmica 43(4): 275-292 (2005) - [j14]Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman:
Efficient Update Strategies for Geometric Computing with Uncertainty. Theory Comput. Syst. 38(4): 411-423 (2005) - 2004
- [j13]Danny Krizanc, Flaminia L. Luccio, Rajeev Raman:
Compact Routing Schemes for Dynamic Ring Networks. Theory Comput. Syst. 37(5): 585-607 (2004) - [c34]Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman:
A Simple Optimal Representation for Balanced Parentheses. CPM 2004: 159-172 - [c33]Richard F. Geary, Rajeev Raman, Venkatesh Raman:
Succinct ordinal trees with level-ancestor queries. SODA 2004: 1-10 - [r1]Rajeev Raman:
Data Structures for Sets. Handbook of Data Structures and Applications 2004 - 2003
- [c32]Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman:
Efficient Update Strategies for Geometric Computing with Uncertainty. CIAC 2003: 12-23 - [c31]J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct Representations of Permutations. ICALP 2003: 345-356 - [c30]Rajeev Raman, S. Srinivasa Rao:
Succinct Dynamic Dictionaries and Trees. ICALP 2003: 357-368 - 2002
- [c29]Michael A. Bender, Richard Cole, Rajeev Raman:
Exponential Structures for Efficient Cache-Oblivious Algorithms. ICALP 2002: 195-207 - [c28]Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. SODA 2002: 233-242 - [c27]Torben Hagerup, Rajeev Raman:
An Efficient Quasidictionary. SWAT 2002: 1-18 - [e1]Rolf H. Möhring, Rajeev Raman:
Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings. Lecture Notes in Computer Science 2461, Springer 2002, ISBN 3-540-44180-8 [contents] - 2001
- [j12]Naila Rahman, Rajeev Raman:
Adapting Radix Sort to the Memory Hierarchy. ACM J. Exp. Algorithmics 6: 7 (2001) - [c26]Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct Dynamic Data Structures. WADS 2001: 426-437 - [c25]Naila Rahman, Richard Cole, Rajeev Raman:
Optimised Predecessor Data Structures for Internal Memory. WAE 2001: 67-78 - 2000
- [j11]Naila Rahman, Rajeev Raman:
Analysing Cache Effects in Distribution Sorting. ACM J. Exp. Algorithmics 5: 14 (2000) - [c24]Naila Rahman, Rajeev Raman:
Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms. ESA 2000: 380-391
1990 – 1999
- 1999
- [j10]Paul F. Dietz, Rajeev Raman:
Small-Rank Selection in Parallel, with Applications to Heap Construction. J. Algorithms 30(1): 33-51 (1999) - [c23]Danny Krizanc, Flaminia L. Luccio, Rajeev Raman:
Dynamic Interval Routing on Asynchronous Rings. IPPS/SPDP 1999: 225-232 - [c22]Naila Rahman, Rajeev Raman:
Analysing Cache Effects in Distribution Sorting. WAE 1999: 183-197 - [c21]Maureen Korda, Rajeev Raman:
An Experimental Evaluation of Hybrid Data Structures for Searching. WAE 1999: 214-228 - [p1]Giuseppe F. Italiano, Rajeev Raman:
Topics in Data Structures. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j9]Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman:
Sorting in Linear Time? J. Comput. Syst. Sci. 57(1): 74-93 (1998) - [j8]Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Randomized Data Structures for the Dynamic Closest-Pair Problem. SIAM J. Comput. 27(4): 1036-1072 (1998) - [c20]Rajeev Raman:
Random Sampling Techniques in Parallel Computation. IPPS/SPDP Workshops 1998: 351-360 - [c19]Naila Rahman, Rajeev Raman:
An Experimental Study of Word-level Parallelism in Some Sorting Algorithms. WAE 1998: 193-203 - 1997
- [j7]Michael Kaufmann, Rajeev Raman, Jop F. Sibeyn:
Routing on Meshes with Buses. Algorithmica 18(3): 417-444 (1997) - [j6]Rajeev Raman:
Recent results on the single-source shortest paths problem. SIGACT News 28(2): 81-87 (1997) - 1996
- [j5]Danny Krizanc, Lata Narayanan, Rajeev Raman:
Fast Deterministic Selection on Mesh-Connected Processor Arrays. Algorithmica 15(4): 319-331 (1996) - [c18]Rajeev Raman:
Priority Queues: Small, Monotone and Trans-dichotomous. ESA 1996: 121-137 - 1995
- [j4]Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig:
Lower Bounds for Set Intersection Queries. Algorithmica 14(2): 154-168 (1995) - [j3]Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Simple Randomized Algorithms for Closest Pair Problems. Nord. J. Comput. 2(1): 3-27 (1995) - [c17]Rajeev Raman, Uzi Vishkin:
Parallel algorithms for database operations and a database operation for parallel algorithms. IPPS 1995: 173-179 - [c16]Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman:
Sorting in linear time? STOC 1995: 427-436 - 1994
- [j2]Paul F. Dietz, Rajeev Raman:
A Constant Update Time Finger Search Tree. Inf. Process. Lett. 52(3): 147-154 (1994) - [j1]Rajeev Raman:
A simpler analysis of algorithm 65 (find). SIGACT News 25(2): 86-89 (1994) - [c15]Rajeev Raman, Uzi Vishkin:
Optimal Randomized Parallel Algorithms for Computing the Row Maxima of a Totally Monotone Matrix. SODA 1994: 613-621 - [c14]Paul F. Dietz, Rajeev Raman:
Very fast optimal parallel algorithms for heap construction. SPDP 1994: 514-521 - 1993
- [c13]Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Simple Randomized Algorithms for Closest Pair Problems. CCCG 1993: 246-251 - [c12]Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman:
Randomized Routing on Meshes with Buses. ESA 1993: 333-344 - [c11]Shiva Chaudhuri, Torben Hagerup, Rajeev Raman:
Approximate and Exact Deterministic Parallel Selection. MFCS 1993: 352-361 - [c10]Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig:
Lower Bounds for Set Intersection Queries. SODA 1993: 194-201 - [c9]Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Randomized Data Structures for the Dynamic Closest-Pair Problem. SODA 1993: 301-310 - [c8]Torben Hagerup, Rajeev Raman:
Fast Deterministic Approximate and Exact Parallel Sorting. SPAA 1993: 346-355 - [c7]Paul F. Dietz, Rajeev Raman:
Persistence, Randomization and Parallelization: On Some Combinatorial Games and their Applications (Abstract). WADS 1993: 289-301 - 1992
- [c6]Torben Hagerup, Rajeev Raman:
Waste Makes Haste: Tight Bounds for Loose Parallel Sorting. FOCS 1992: 628-637 - 1991
- [c5]Danny Krizanc, Lata Narayanan, Rajeev Raman:
Fast Deterministic Selection on Mesh-Connected Processor Arrays. FSTTCS 1991: 336-346 - [c4]Rajeev Raman:
Generating Random Graphs Efficiently. ICCI 1991: 149-160 - [c3]Paul F. Dietz, Rajeev Raman:
Persistence, Amortization and Randomization. SODA 1991: 78-88 - 1990
- [c2]Rajeev Raman:
The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting. FSTTCS 1990: 161-175 - [c1]Paul F. Dietz, Rajeev Raman:
A Constant Update Time Finger Search Tree. ICCI 1990: 100-109
Coauthor Index
S. Srinivasa Rao 0001
aka: Srinivasa Rao Satti
aka: Srinivasa Rao Satti
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
