Rahul Shah

Roy Paul Daniels Distinguished Professor

Contact

rahul@lsu.edu 
Office 3272J
Patrick F. Taylor Hall

Educational Background

Ph.D. in Computer Science, Rutgers University, 2002

M.S. in Computer Science, Rutgers University, 1999

B.Tech. in Computer Science and Engineering, Indian Institute of Technology, Bombay, 1997

Google Scholar Logo

Rahul Shah

Visit Website

  • CSC 7300: Algorithms Design and Analysis
  • CSC 3102: Advance Data Structures and Algorithms Analysis
  • CSC 2262: Numerical Methods
  • Algorithms
  • Data Structures
  • Databases
  • Kulekci, M. O., Parthasarathi, M. P., Shah, R., & Thankachan, S. V. (2026, March). Relative compressed reverse suffix array. In 43rd International Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 62:1-62:21).
  • Hon, W.-K., Shah, R., & Thankachan, S. V. (2025). Circular dictionary matching using extended BWT. In The Expanding World of Compressed Data (Manzini Festschrift) (pp. 11:1-11:14).
  • Ganguly, A., Gibney, D., Shah, R., & Thankachan, S. V. (2025, March). Two-dimensional longest common extension queries in compact space. In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 38:1-38:17).
  • Shah, R., Sheng, C., Thankachan, S. V., & Vitter, J. S. (2023). Ranked document retrieval in external memory. ACM Transactions on Algorithms, 19(1), 5:1-5:12.
  • Ganguly, A., Shah, R., & Thankachan, S. V. (2022, July). Fully functional parameterized suffix trees in compact space. In 49th International Colloquium on Automata, Languages, and Programming (ICALP) (pp. 65:1-65:18).
  • Ganguly, A., Gibney, D., Thankachan, S. V., & Shah, R. (2021). I/O-optimal categorical 3-sided skyline queries. Theoretical Computer Science, 896, 132-144.
  • Ganguly, A., Patel, D., Shah, R., & Thankachan, S. V. (2021, July). LF Successor: Compact space indexing for order-isomorphic pattern matching. In 48th International Colloquium on Automata, Languages, and Programming (ICALP) (pp. 71:1-71:19).
  • Patel, D., & Shah, R. (2021, December). Inverse suffix array queries for 2-dimensional pattern matching in near-compact space. In 32nd International Symposium on Algorithms and Computation (ISAAC) (pp. 60:1-60:14).
  • Ganguly, A., Hon, W.-K., Sadakane, K., Shah, R., Thankachan, S. V., & Yang, Y. (2021). A framework for designing space-efficient dictionaries for parameterized and order-preserving matching. Theoretical Computer Science, 854, 52-62.
 
  • 2021-2025: Source: NSF, Title:  EAGER: CCF: AF: Sublinear Data Structures for Approximate Queries, $225,768.