default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRanjan Sinha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c16]Chaitali Gupta, Ranjan Sinha, Yong Zhang:
Eagle: User profile-based anomaly detection for securing Hadoop clusters. IEEE BigData 2015: 1336-1343- 2014
- [c15]Chaitali Gupta, Mayank Bansal, Tzu-Cheng Chuang, Ranjan Sinha, Sami Ben-Romdhane:
Astro: A predictive model for anomaly detection and feedback-based scheduling on Hadoop. IEEE BigData 2014: 854-862 - 2010
- [j8]Nikolas Askitis, Ranjan Sinha:
RepMaestro: scalable repeat detection on disk-based genome sequences. Bioinform. 26(19): 2368-2374 (2010) - [j7]Ranjan Sinha, Anthony Wirth:
Engineering burstsort: Toward fast in-place string sorting. ACM J. Exp. Algorithmics 15 (2010) - [j6]Nikolas Askitis, Ranjan Sinha:
Engineering scalable, cache and space efficient tries for strings. VLDB J. 19(5): 633-660 (2010)
2000 – 2009
- 2009
- [j5]Jan Schröder
, Heiko Schröder, Simon J. Puglisi, Ranjan Sinha, Bertil Schmidt:
SHREC: a short-read error correction method. Bioinform. 25(17): 2157-2163 (2009) - [j4]Bertil Schmidt, Ranjan Sinha, Bryan Beresford-Smith, Simon J. Puglisi:
A fast hybrid short read fragment assembly algorithm. Bioinform. 25(17): 2279-2280 (2009) - [c14]Alistair Moffat, Simon J. Puglisi, Ranjan Sinha:
Reducing Space Requirements for Disk Resident Suffix Arrays. DASFAA 2009: 730-744 - 2008
- [c13]Ranjan Sinha, Simon J. Puglisi, Alistair Moffat, Andrew Turpin:
Improving suffix array locality for fast pattern matching on disk. SIGMOD Conference 2008: 661-672 - [c12]Ranjan Sinha, Anthony Wirth:
Engineering Burstsort: Towards Fast In-Place String Sorting. WEA 2008: 14-27 - 2007
- [c11]Nikolas Askitis, Ranjan Sinha:
HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings. ACSC 2007: 97-105 - [c10]Jun Jie Foo, Ranjan Sinha:
Pruning SIFT for Scalable Near-duplicate Image Matching. ADC 2007: 63-71 - [c9]Jun Jie Foo, Justin Zobel, Ranjan Sinha, Seyed M. M. Tahaghoghi:
Detection of near-duplicate images for web search. CIVR 2007: 557-564 - [c8]Jun Jie Foo, Ranjan Sinha:
Using Redundant Bit Vectors for Near-Duplicate Image Detection. DASFAA 2007: 472-484 - [c7]Jun Jie Foo, Ranjan Sinha, Justin Zobel:
SICO: A System for Detection of Near-Duplicate Images During Search. ICME 2007: 595-598 - [c6]Jun Jie Foo, Justin Zobel, Ranjan Sinha:
Clustering near-duplicate images in large collections. Multimedia Information Retrieval 2007: 21-30 - [c5]Jun Jie Foo, Ranjan Sinha, Justin Zobel:
Discovery of Image Versions in Large Collections. MMM (2) 2007: 433-442 - 2006
- [j3]Ranjan Sinha, Justin Zobel, David Ring:
Cache-efficient string sorting using copying. ACM J. Exp. Algorithmics 11 (2006) - 2005
- [j2]Ranjan Sinha, Justin Zobel:
Using random sampling to build approximate tries for efficient string sorting. ACM J. Exp. Algorithmics 10 (2005) - 2004
- [j1]Ranjan Sinha, Justin Zobel:
Cache-conscious sorting of large sets of strings with dynamic tries. ACM J. Exp. Algorithmics 9 (2004) - [c4]Ranjan Sinha:
Using Compact Tries for Cache-Efficient Sorting of Integers. WEA 2004: 513-528 - [c3]Ranjan Sinha, Justin Zobel:
Using Random Sampling to Build Approximate Tries for Efficient String Sorting. WEA 2004: 529-544 - 2003
- [c2]Ranjan Sinha, Justin Zobel:
Efficient Trie-Based Sorting of Large Sets of Strings. ACSC 2003: 11-18 - [c1]Ranjan Sinha, Justin Zobel:
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries. ALENEX 2003: 93-105
Coauthor Index
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 2024-04-25 05:42 CEST 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:
