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
  • Shah, R., Sheng, C., Thankachan, S., & Vitter, J. (2023). Ranked Document Retrieval in External Memory. ACM Transactions on Algorithms, 19(1), 1-12.
  • Ganguly, A., Shah, R., & Thankachan, S. V. (2022, June). Fully functional parameterized suffix trees in compact space. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) (Vol. 229).
  • 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., 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.
  • Patel, D., & Shah, R. (2021). Inverse suffix array queries for 2-dimensional pattern matching in near-compact space. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021) (pp. 60-1). Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
  • Ganguly, A., Patel, D., Shah, R., & Thankachan, S. V. (2021). LF successor: Compact space indexing for order-isomorphic pattern matching. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) (pp. 71-1). Schloss Dagstuhl–Leibniz-Zentrum für Informatik.
  • Abedin, P., Ganguly, A., Hon, W. K., Matsuda, K., Nekrich, Y., Sadakane, K., ... & Thankachan, S. V. (2020). A linear-space data structure for range-LCP queries in poly-logarithmic time. Theoretical Computer Science, 822, 15-22.
  • Munro, J. I., Navarro, G., Shah, R., & Thankachan, S. V. (2020). Ranked document selection. Theoretical Computer Science, 812, 149-159.
  • Ganguly, A., Shah, R., & Thankachan, S. V. (2020). Succinct non-overlapping indexing. Algorithmica, 82(1), 107-117.
  • Ganguly, A., Hon, W. K., Huang, Y. A., Pissis, S. P., Shah, R., & Thankachan, S. V. (2019, March). Parameterized text indexing with one wildcard. In 2019 Data Compression Conference (DCC) (pp. 152-161). IEEE.
 
  • 2021-2025: Source: NSF, Title:  EAGER: CCF: AF: Sublinear Data Structures for Approximate Queries, $225,768.