53 citations · 178 across the 27 of their papers we have counts for
29 papers
The Reasoning Bottleneck in Graph-RAG: Structured Prompting and Context Compression for Multi-Hop QA
Yasaman Zarrinkia, Venkatesh Srinivasan, Alex Thomo
Graph-RAG systems achieve strong multi-hop question answering by indexing documents into knowledge graphs, but strong retrieval does not guarantee strong answers. Evaluating KET-RA…
The Hamiltonian Path Graph is Connected for Simple Paths in Rectangular Grid Graphs
Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides
A \emph{simple} path in a rectangular grid graph is a Hamiltonian path from the top-left corner to the bottom-right corner such that each \emph{inter…
Efficient Massively Parallel Join Optimization for Large Queries
Riccardo Mancini, Srinivas Karthik, Bikash Chandra +2
Modern data analytical workloads often need to run queries over a large number of tables. An optimal query plan for such queries is crucial for being able to run these queries with…
Multi-Stage Graph Peeling Algorithm for Probabilistic Core Decomposition
Yang Guo, Xuekui Zhang, Fatemeh Esfahani +3
Mining dense subgraphs where vertices connect closely with each other is a common task when analyzing graphs. A very popular notion in subgraph analysis is core decomposition. Rece…
MMH* with arbitrary modulus is always almost-universal
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
Universal hash functions, discovered by Carter and Wegman in 1979, are of great importance in computer science with many applications. MMH is a well-known -universal…
Unweighted linear congruences with distinct coordinates and the Varshamov--Tenengolts codes
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
In this paper, we first give explicit formulas for the number of solutions of unweighted linear congruences with distinct coordinates. Our main tools are properties of Ramanujan su…