Srinivasan Venkatesh

Publication Activity (10 Years)

Years Active: 1996-2021
Publications (10 Years): 5

Top Topics

Encryption Scheme

Latent Factor Models

Social Networks

Community Based Question Answering

Top Venues

Ann. Math. Artif. Intell.

Publications

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