Srinivasan Venkatesh

54 papers A* 8A 4B 4C 1Misc 1Journal 29Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
The Reasoning Bottleneck in Graph-RAG: Structured Prompting and Context Compression for Multi-Hop QA.
CoRR
Yasaman Zarrinkia, Srinivasan Venkatesh, Alex Thomo
2025 — conf
GraphRAG-V: Fast Multi-hop Retrieval via Text-Chunk Communities.
ASONAM (3)
Tengkai Yu, Srinivasan Venkatesh, Alex Thomo
2021 C conf
Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs.
IWOCA
Rahnuma Islam Nishat, Srinivasan Venkatesh, Sue Whitesides
2020 J jnl
The Cayley graphs associated with some quasi-perfect Lee codes are Ramanujan graphs.
CoRR
Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh
2020 J jnl
Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes.
CoRR
Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh
2018 J jnl
Connecting a set of circles with minimum sum of radii.
Comput. Geom.
Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides
2018 J jnl
On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes.
Int. J. Found. Comput. Sci.
Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh, László Tóth
2015 J jnl
A model for learning the news in social networks.
Ann. Math. Artif. Intell.
Krishnan Rajagopalan, Srinivasan Venkatesh, Alex Thomo
2015 J jnl
Restricted linear congruences and an authenticated encryption scheme.
CoRR
Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh, Roberto Tauraso, László Tóth
2015 J jnl
k-Attribute-Anonymity is hard even for k=2.
Inf. Process. Lett.
Allan Scott, Srinivasan Venkatesh, Ulrike Stege
2014 — ch.
Anonymization and De-anonymization of Social Network Data.
Encyclopedia of Social Network Analysis and Mining
Sean Chester, Bruce M. Kapron, Gautam Srivastava, Srinivasan Venkatesh, Alex Thomo
2014 J jnl
Buyer to Seller Recommendation under Constraints.
CoRR
Cheng Chen, Lan Zheng, Srinivasan Venkatesh, Alex Thomo, Kui Wu, Anthony Sukow
2014 J jnl
Clearing Contamination in Large Networks.
CoRR
Michael Simpson, Srinivasan Venkatesh, Alex Thomo
2014 B conf
Clearing contamination in large networks.
ASONAM
Michael Simpson, Srinivasan Venkatesh, Alex Thomo
2014 Misc conf
Comparing the staples in latent factor models for recommender systems.
SAC
Cheng Chen, Lan Zheng, Alex Thomo, Kui Wu, Srinivasan Venkatesh
2013 B conf
Battling the internet water army: detection of hidden paid posters.
ASONAM
Cheng Chen, Kui Wu, Srinivasan Venkatesh, Xudong Zhang
2013 B conf
The best answers? think twice: online detection of commercial campaigns in the CQA forums.
ASONAM
Cheng Chen, Kui Wu, Srinivasan Venkatesh, R. Kesav Bharadwaj
2012 — conf
Learning the News in Social Networks.
FoIKS
Krishnan Rajagopalan, Srinivasan Venkatesh, Alex Thomo
2012 J jnl
The Best Answers? Think Twice: Online Detection of Commercial Campaigns in the CQA Forums
CoRR
Cheng Chen, Kui Wu, Srinivasan Venkatesh, R. Kesav Bharadwaj
2011 J jnl
Battling the Internet Water Army: Detection of Hidden Paid Posters
CoRR
Cheng Chen, Kui Wu, Srinivasan Venkatesh, Xudong Zhang
2011 J jnl
Connecting a Set of Circles with Minimum Sum of Radii
CoRR
Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides
2011 B conf
Connecting a Set of Circles with Minimum Sum of Radii.
WADS
Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides
2011 — conf
Indexing for Vector Projections.
DASFAA (2)
Sean Chester, Alex Thomo, Srinivasan Venkatesh, Sue Whitesides
2011 J jnl
Rewriting of visibly pushdown languages for XML data integration.
Theor. Comput. Sci.
Alex Thomo, Srinivasan Venkatesh
2010 — conf
Connectivity Graphs of Uncertainty Regions.
ISAAC (2)
Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides
2010 J jnl
Connectivity graphs of uncertainty regions
CoRR
Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides
2009 J jnl
A Framework for Non-Interactive Instance-Dependent Commitment Schemes (NIC).
IACR Cryptol. ePrint Arch.
Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh
2008 — ch.
Approximate Dictionaries.
Encyclopedia of Algorithms
Srinivasan Venkatesh
2008 J jnl
Lower bounds for predecessor searching in the cell probe model.
J. Comput. Syst. Sci.
Pranab Sen, Srinivasan Venkatesh
2008 A conf
Rewriting of visibly pushdown languages for xml data integration.
CIKM
Alex Thomo, Srinivasan Venkatesh
2008 — conf
Visibly Pushdown Transducers for Approximate Validation of Streaming XML.
FoIKS
Alex Thomo, Srinivasan Venkatesh, Ying Ying Ye
2007 A* conf
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC).
ICALP
Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh
2007 J jnl
Approximating the Radii of Point Sets.
SIAM J. Comput.
Kasturi R. Varadarajan, Srinivasan Venkatesh, Yinyu Ye, Jiawei Zhang
2007 J jnl
Communication vs. Computation.
Comput. Complex.
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh
2007 A conf
Towards practically feasible answering of regular path queries in lav data integration.
CIKM
Manuel Tamashiro, Alex Thomo, Srinivasan Venkatesh
2004 A* conf
Communication Versus Computation.
ICALP
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh
2004 J jnl
On the advantage over a random assignment.
Random Struct. Algorithms
Johan Håstad, Srinivasan Venkatesh
2003 J jnl
Lower bounds for predecessor searching in the cell probe model
CoRR
Pranab Sen, Srinivasan Venkatesh
2003 A conf
Optimal Separation of EROW and CROWPRAMs.
CCC
Navin Goyal, Michael E. Saks, Srinivasan Venkatesh
2002 J jnl
Are Bitvectors Optimal?
SIAM J. Comput.
Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh
2002 A* conf
On Approximating the Radii of Point Sets in High Dimensions.
FOCS
Kasturi R. Varadarajan, Srinivasan Venkatesh, Jiawei Zhang
2002 A* conf
On the advantage over a random assignment.
STOC
Johan Håstad, Srinivasan Venkatesh
2002 J jnl
The Quantum Complexity of Set Membership.
Algorithmica
Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
2001 A* conf
Lower Bounds in the Quantum Cell Probe Model.
ICALP
Pranab Sen, Srinivasan Venkatesh
2001 J jnl
Lower bounds in the quantum cell probe model
CoRR
Pranab Sen, Srinivasan Venkatesh
2001 J jnl
The Communication Complexity of Pointer Chasing.
J. Comput. Syst. Sci.
Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh
2000 A* conf
Are bitvectors optimal?
STOC
Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh
2000 J jnl
Improved bounds for dictionary look-up with one error.
Inf. Process. Lett.
Gerth Stølting Brodal, Srinivasan Venkatesh
2000 J jnl
The Quantum Complexity of Set Membership
CoRR
Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
2000 A* conf
The Quantum Complexity of Set Membership.
FOCS
Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh
1999 A conf
The Communication Complexity of Pointer Chasing Applications of Entropy and Sampling (Abstract).
CCC
Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh
1999 A* conf
The Communication Complexity of Pointer Chasing: Applications of Entropy and Sampling.
STOC
Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh
1998 J jnl
Pseudo-Average Block Sensitivity Equals Average Sensitivity.
Inf. Process. Lett.
Srinivasan Venkatesh
1996 J jnl
On the Isomorphism Conjecture for 2-DFA Reductions.
Int. J. Found. Comput. Sci.
Manindra Agrawal, Srinivasan Venkatesh