Ranjan Sinha (PhD)

ARC Research Fellow & Consultant
Department of Computer Science and Software Engineering
The University of Melbourne

office: ICT Building, Level 3, Room 17

email: sinhar[at]unimelb[.]edu[.]au
phone: +61 3 8344 1409       

fax: +61 3 9348 1184

Find out more on my contact details here.

Research Interests

  • Algorithm Engineering, Sorting (megabytes to terabytes)
  • Information Retrieval, Text and Image Indexing, Pattern Matching
  • Sustainable Computing, JouleSort
  • High-Throughput Short-Read Sequences (Genome Assembly and Error Correction)

Active Research Grants

Chief Investigator     Australian Research Council (ARC) Discovery Project Fellowship     2007-2010
Chief Investigator     Melbourne Early Career Researcher (ECR) Grants                          2008-2009

Supervision in 2009

  • Paul Coster (Hons)

  • Rohit Kapoor (PhD with Prof. Kotagiri)

Teaching in 2009

Accepted Papers

  • RepMaestro: Scalable Repeat Detection on Disk-based Genome Sequences, Bioinformatics Journal, (accepted, Impact Factor 4.926)

  • Engineering a Scalable, Cache and Space Efficient Trie for Strings, The International VLDB Journal, (accepted, Impact Factor 6.8)

  • Engineering Burstsort: Towards Fast In-place String Sorting, ACM Journal of Experimental Algorithmics (accepted)

  • SHREC: A Short-Read Error Correction Method, Bioinformatics Journal (accepted, Impact Factor 4.926)

  • A Fast Hybrid Short Read Fragment Assembly Algorithm, Bioinformatics Journal (accepted, Impact Factor 4.926)

Refereed Benchmark Papers

  • OzSort: Sorting 100GB for less than 87kJoules R. Sinha and N. Askitis. Winner of the JouleSort (Indy) Sort Benchmark. April 2009. Published paper. (First Australian team to win; Medals awarded at the ACM SIGMOD conference)



     
  • OzSort: Sorting over 246GB for a Penny N. Askitis and R. Sinha. Winner of the PennySort (Indy) Sort Benchmark. April 2009. Published paper. (First Australian team to win; Medals awarded at the ACM SIGMOD conference)

 



Refereed Published Papers

  • Reducing Space Requirements for Disk Resident Suffix Arrays A. Moffat, S. J. Puglisi, R. Sinha. In Proceedings of the Conference of Database Systems for Advanced Applications. Brisbane, Australia, April 2009. Published paper.

  • Improving Suffix Array Locality for Fast Pattern Matching on Disk R. Sinha, S. J. Puglisi, A. Moffat, A. Turpin, In Proceedings of the 28th ACM SIGMOD/PODS Conference, Vancouver, Canada, June 2008. Bibtex. Published paper. PROT dataset (106MB).

  • Engineering Burstsort: Towards Fast In-place String Sorting R. Sinha, A. Wirth, In Proceedings of the 7th International Workshop on Experimental Algorithms (WEA), Provincetown, Cape Cod, Massachusetts, USA, May 2008. Bibtex. Published paper.

  • Clustering Near-duplicate Images in Large Collections J. J. Foo, R. Sinha, J. Zobel, In Proceedings of the 9th ACM SIGMM International Workshop on Multimedia Information Retrieval (ACM MIR), University of Augsburg, Germany, 28-29 September, 2007. Bibtex. Published paper.

  • SICO: A System for Detection of Near-Duplicate Images During Search J. J. Foo, R. Sinha, J. Zobel, In Proceedings of the 2007 IEEE International Conference on Multimedia and Expo (IEEE ICME), Beijing, China, 2-5 July 2007. Bibtex. Published paper. SICO.

  • Detection of Image Versions For Web Search J. J. Foo, J. Zobel, R. Sinha, S. M. M. Tahaghoghi, In Proceedings of the 6th ACM International Conference on Image and Video Retrieval (ACM CIVR), Amsterdam, July 2007. Bibtex. Published paper.

  • Using Redundant Bit-Vectors for Near-Duplicate Image Detection J. J. Foo, R. Sinha, In Proceedings of the 12th International Conference on Database Systems For Advanced Applications (DASFAA), Bangkok, Thailand, April 2007. Bibtex. Published paper.

  • Discovery of Image Versions in Large Collections J. J. Foo, R. Sinha, J. Zobel, In Proceedings of the 13th International MultiMedia Modelling Conference (ACM MMM), Singapore, January 2007. Bibtex. Published paper.

  • Pruning SIFT for Scalable Near-Duplicate Image Matching J. J. Foo, R. Sinha, In Proceedings of the 18th Australasian Database Conference (ADC), Ballarat, Australia, January 2007. Bibtex. Published paper.

  • HAT-trie: A Cache-Conscious Trie-based Data Structure for Strings N. Askitis, R. Sinha, In Proceedings of the 30th Australasian Computer Science Conference (ACSC), Ballarat, Australia, January 2007. Bibtex. Published paper.

  • Cache-Efficient String Sorting Using Copying R. Sinha, D. Ring and J. Zobel, ACM Journal of Experimental Algorithmics (ACM JEA), 11(1.2), 2006. Bibtex. Data (457MB). Published paper. Full text. Software.

  • Using Random Sampling to Build Approximate Tries for Efficient String Sorting R. Sinha and J. Zobel, ACM Journal of Experimental Algorithmics (ACM JEA), 10, 2005. Bibtex. Published paper.

  • Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries R. Sinha and J. Zobel, ACM Journal of Experimental Algorithmics (ACM JEA), 9(1.5), 2004. Bibtex. Data (457MB). Published paper. Software.

  • Using Random Sampling to Build Approximate Tries for Efficient String Sorting R. Sinha and J. Zobel, In Proceedings of the 3rd Workshop on Efficient and Experimental Algorithms (WEA), C.C.Ribeiro (ed), Angra dos Reis, Rio de Janeiro, Brazil, May 2004. Bibtex. Published paper.

  • Using Compact Tries for Cache-Efficient Sorting of Integers R. Sinha, In Proceedings of the 3rd Workshop on Efficient and Experimental Algorithms (WEA), C.C.Ribeiro (ed), Angra dos Reis, Rio de Janeiro, Brazil, May 2004. Bibtex. Published paper.

  • Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries R. Sinha and J. Zobel, In Proceedings of the 5th Workshop on Algorithm Engineering and Experiments (ACM-SIAM ALENEX), R. Ladner (ed), Baltimore, Maryland, USA, January 2003. Bibtex. Published paper.

  • Efficient Trie-based Sorting of Large Sets of Strings R. Sinha and J. Zobel, In Proceedings of the Australasian Computer Science Conference (ACSC), M. Oudshoorn (ed), Adelaide, Australia, February, 2003. Bibtex. Published paper. 

Technical Reports

  • Using Redundant Bit-Vectors for Near-Duplicate Image Detection J. J. Foo, R. Sinha, TR-06-3, School of Computer Science and Information Technology, RMIT University, 2006.

Research Activities

  • Member of computing societies such as ACM, ACM SIGMOD, and ACS.

  • Spoke at several conferences and venues including SIGMOD and Bell Labs.

  • Session chair and publicity chair for conferences such as WEA and CSPRSC.

  • Reviewed papers for several journal and conferences including:

    • ACM Special Interest Group on the Management of Data (ACM SIGMOD)
    • ACM Journal of Experimental Algorithmics (ACM JEA)
    • Very Large Data Bases (VLDB)
    • International Conference on Data Engineering (IEEE ICDE)
    • Combinatorial Pattern Matching (CPM)
    • Australasian Database Conference (ADC)
    • Australasian Computer Science Conference (ACSC)
    • String Processing and Information Retrieval (SPIRE)
    • ACM Transactions on Information Systems (ACM TOIS)
    • Information Systems (IS)
    • Information Processing Letters (IPL)
    • Software: Practice and Experience (SPE)

Social Activities