Faculty at School of Engineering

Arnab Ganguly

Arnab Ganguly

Associate Professor

School of Engineering


Contact Information

My primary research interest lies in algorithms and data structures, with an emphasis on succinct data structures for various generalizations of the classical pattern matching problem. Recently, I have been working on making these algorithms more useful in practice, by building software that implements these state-of-the-art algorithms.

  • Ph.D. in Computer Science, Louisiana State University, USA, August 2017
    Dissertation Title: “Succinct Data-Structures for Parameterized Pattern Matching, and Related Problems” advised by Dr. Rahul Shah
  • B.E. in Computer Science, Jadavpur University, India, December 2009

  • July 2025 – current
    Associate Professor, Shiv Nadar University, India
  • Aug 2022 – July 2025
    Associate Professor, University of Wisconsin - Whitewater, USA
  • Aug 2017 – July 2022
    Assistant Professor, University of Wisconsin - Whitewater, USA
  • May 2014 – Aug 2014
    Software Development Intern, Amazon, Seattle, USA
  • May 2013 – Aug 2013
    Software Development Intern, Amazon, Seattle, USA
  • Aug 2009 – July 2011
    Software Engineer, PricewaterHouse Coopers Pvt. Ltd., India

Dissertation Fellowship, Louisiana State University (Fall 2016 – Spring 2017)

  1. Abedin, S. Hooshmand, A. Ganguly, and S. V. Thankachan. The Heaviest Induced Ancestors Problem: Better Data Structures and Applications. Appeared in Algorithmica, volume 84(7), 2022, pages 2088-2105
  2. Ganguly, D. Gibney, S.V. Thankachan, and R. Shah. I/O-optimal categorical 3-sided skyline queries. Appeared in Theoretical Computer Science, volume 896, 2021, pages 132-144
  3. Ganguly, W.K. Hon, K. Sadakane, R. Shah, S.V. Thankachan, and Y. Yang. A Framework for Designing Space-Efficient Dictionaries for Parameterized and Order-Preserving Matching. Appeared in Theoretical Computer Science, volume 854, 2021, pages 52-62
  4. Abedin, A. Ganguly, W.K. Hon, K. Matsuda, Y. Nekrich, K. Sadakane, R. Shah, and S. V. Thankachan. A Linear-Space Data Structure for Range- LCP Queries in Poly-Logarithmic Time. Appeared in Theoretical Computer Science, volume 822, 2020, pages 15-22
  5. Ganguly, R. Shah, and S. V. Thankachan. Succinct Non-overlapping Indexing. Appeared in Algorithmica, volume 82(1), 2020, pages 107-117
  6. Biswas, A. Ganguly, R. Shah, and S.V. Thankachan. Ranked Document Retrieval for Multiple Patterns. Appeared in Theoretical Computer Science, volume 746, 2018, pages 98-111

  1. Ganguly, D. Gibney, R. Shah, and S.V. Thankachan. Two-Dimensional Longest Common Extension Queries in Compact Space. Appeared in the International Symposium on Theoretical Aspects of Computer Science (STACS 2025) (STACS) 2025, pages 38:1-38:17
  2. Ganguly, R.Shah, S. V. Thankachan. Fully Functional Parameterized Suffix Trees in Compact Space. Appeared in International Colloquium on Automata, Languages, and Programming (ICALP) 2022, pages 65:1- 65:18
  3. Ganguly, D. Patel, R.Shah, S. V. Thankachan. LF Successor: Compact Space Indexing for Order-Isomorphic Pattern Matching. Appeared in International Colloquium on Automata, Languages, and Programming (ICALP) 2021, pages 71:1-71:19
  4. Ganguly, J. I. Munro, Y. Nekrich, R. Shah, and S. V. Thankachan. Categorical Range Reporting with Frequencies. Appeared in International Conference on Database Theory (ICDT) 2019, pages 9:1-9:19
  5. Ganguly, R. Shah, and S.V. Thankachan. pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems. Appeared in Symposium on Discrete Algorithms (SODA) 2017, pages 397-407
  6. Biswas, A. Ganguly, R. Shah, and S.V. Thankachan. Forbidden Extension Queries. Appeared in Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2015, pages 320-335

  1. Combinatorial Pattern Matching (CPM)
  2. Data Compression Conference (DCC)
  3. European Symposium on Algorithms (ESA)
  4. Foundations of Software Technology and Theoretical Computer Science (FSTTCS)
  5. International Colloquium on Automata, Languages, and Programming (ICALP)
  6. International Computing and Combinatorics Conference (COCOON)
  7. International Symposium on Algorithms and Computation (ISAAC)
  8. International Symposium on String Processing and Information Retrieval (SPIRE)
  9. International Workshop on Algorithms in Bioinformatics (WABI)
  10. Symposium on Discrete Algorithms (SODA)
  11. Symposium on Simplicity in Algorithms (SOSA)
  12. Symposium on Theory of Computing (STOC)
  13. Theoretical Computer Science