Publications
(My name appears as Venkatesh Srinivasan in some publications and as S.Venkatesh in other publications)
Journals
- Unweighted Linear Congruences with Distinct Coordinates and the Varshamov-Tenengolts Codes
Khodakhast Bibak, Bruce M. Kapron, and Venkatesh Srinivasan,
Designs, Codes and Cryptography (DESI), 2018, to appear.
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan,and Laszlo Toth,
International Journal of Foundations of Computer Science (IJFCS), 29, 2018, pages 357-375.
- Copula Analysis of Temporal Dependence Structure in
MMPP and Its Applications
Fang Dong, Kui Wu, and Venkatesh Srinivasan,
ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS), 2(3), 2017, pages 1-28.
- Restricted Linear Congruences
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan, Roberto Tauraso and Laszlo Toth,
Journal of Number Theory, 171, 2017, pages 128-144.
- The Cayley Graphs Associated with Some Quasi-Perfect Lee Codes are Ramanujan Graphs
Khodakhast Bibak, Bruce M. Kapron and Venkatesh Srinivasan,
IEEE Transactions on Information Theory, 62, 2016, pages 6355-6358.
- Counting Surface-Kernel Epimorphisms from a Co-Compact Fuchsian Group to a Cyclic Group
Khodakhast Bibak, Bruce M. Kapron and Venkatesh Srinivasan,
Nuclear Physics B, 910, 2016, pages 712-723.
- MMH* with Composite Modulus is Always Almost-Universal
Khodakhast Bibak, Bruce M. Kapron and Venkatesh Srinivasan,
Information Processing Letters, 116, 2016, pages 481-483.
- On a Restricted Linear Congruence
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan,
International Journal of Number Theory 12(8), 2016, pages 2167-2171.
- Connecting a Set of Circles with Minimum Sum of Radii
Erin W. Chambers, Sandor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan, Ulrike Stege and Sue Whitesides,
Computational Geometry: Theory and Applications, 68, 2018, pages 62-78.
- Clearing Contamination in Large Networks
Michael Simpson, Venkatesh Srinivasan and Alex Thomo,
IEEE Transactions on Knowledge and Data Engineering (TKDE), 28(6), 2016, pages 1435-1448.
- Conflict-Aware Weighted Bipartite Matching and Its Application to E-Commerce
Cheng Chen, Lan Zheng, Venkatesh Srinivasan, Alex Thomo, Kui Wu and Anthony Sukow,
IEEE Transactions on Knowledge and Data Engineering (TKDE), 28(6), 2016, pages 1475-1488.
- Connectivity Graphs of Uncertainty Regions
Erin W. Chambers, Alejandro Erickson, Sandor P. Fekete, Jonathan Lenchner, Jeff Sember, Venkatesh Srinivasan, Ulrike Stege, Svetlana Stolpner, Christophe Weibel and Sue Whitesides,
Algorithmica, 78(3), 2017, pages 990-1019.
- A Characterization of Non-Interactive Instance-Dependent Commitment-Schemes (NIC)
Bruce Kapron, Lior Malka and S. Venkatesh,
Theoretical Computer Science, 593, 2015, pages 1-15.
- Suppressing Columns to k-Anonymize Data is Hard Even for k=2
Allan Scott, Venkatesh Srinivasan and Ulrike Stege,
Information Processing Letters, 115(2), 2015, pages 368-370.
- The Best Answers? Think Twice: Online Detection of Commercial Campaigns in the CQA Forums
Cheng Chen, Kui Wu, S. Venkatesh and Kesav Bharadwaj,
Journal of Computer Science and Technology, 30(4), 2015, pages 810-828.
- A Model for Learning the News in Social Networks
Krishnan Rajagopalan, Alex Thomo and S. Venkatesh,
Annals of Mathematics and Artificial Intelligence, 73(1-2), 2015, pages 125-138.
- Why Waldo Befriended the Dummy? k-Anonymization of Social Networks with Pseudo-nodes
Sean Chester, Bruce M. Kapron, Ganesh Ramesh, Gautam Srivastava, Alex Thomo and S. Venkatesh,
Social Network Analysis and Mining, 3(3), 2013, pages 151-166.
- Complexity of Social Network Anonymization
Sean Chester, Bruce M. Kapron, Gautam Srivastava and S. Venkatesh,
Social Network Analysis and Mining, 3(2), 2013, pages 151-166.
- Rewriting of Visibly Pushdown Languages for XML
Data Integration
Alex Thomo and S.Venkatesh,
Theoretical Computer Science, 412(39), 2011, pages 5285-5297.
- Lower Bounds for Predecessor Searching in the Cell Probe Model
Pranab Sen and S. Venkatesh,
Journal of Computer and System Sciences, 74(3), 2008, pages 364-385.
- Communication vs. Computation
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim and S.Venkatesh,
Computational Complexity, 16(1), 2007, pages 1-33.
- Approximating the Radii of Point Sets
Kasturi Varadarajan, S. Venkatesh, Yinyu Ye and Jiawei Zhang,
SIAM Journal of Computing, 36(6), 2007, pages 1764-1776.
- On the Advantage over a Random Assignment
Johan Håstad and S. Venkatesh,
Random Structures and Algorithms, 25(2), 2004, pages 117-149.
- The Quantum Complexity
of Set Membership
Jaikumar Radhakrishnan, Pranab Sen and
S. Venkatesh,
Algorithmica, 34(4), 2002, pages 462-479.
- Are Bitvectors
Optimal?
Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan
and S. Venkatesh,
SIAM Journal of Computing (SICOMP), 31(6), 2002, pages 1723-1744.
- Improved Bounds for
Dictionary Look-up with One Error
Gerth Stølting Brodal and
S. Venkatesh,
Information Processing Letters (IPL), 75(1-2),
2000, pages 57-59.
- The Communication
Complexity of Pointer Chasing
Stephen J. Ponzio, Jaikumar
Radhakrishnan and S. Venkatesh,
Journal of Computer and System Sciences (JCSS), 62(2), 2001, pages 323-355.
- Pseudo-Average Block
Sensitivity Equals Average Sensitivity
S. Venkatesh,
Information Processing Letters (IPL), 68(2), 1998, pages 93-95.
- On the Isomorphism
Conjecture for 2-DFA Reductions
Manindra Agrawal and S. Venkatesh,
International Journal of Foundations of Computer Science (IJFCS),
1996, pages 339-352.
Conferences
- A New Dependence Model for Heterogenous Markov Modulated Poisson Processes
Fang Dong, Kui Wu and Venkatesh Srinivasan,
Proceedings of IFIP Networking Conference (NETWORKING), 2018, to appear.
- Efficient Implementation of Anchored 2-core Algorithm
Babak Tootoonchi, Venkatesh Srinivasan and Alex Thomo,
Proceedings of International Symposium on Foundations and Applications of Big Data Analytics (FAB-ASONAM), 2017, pages 1009-1016.
- k-core Decomposition on Giraph and GraphChi
Xin Hu, Fangming Liu, Venkatesh Srinivasan and Alex Thomo,
Proceedings of 9th International Conference on Intelligent Networking and Collaborative Systems (INCoS), 2017, pages 274-284.
- Copula-based Parameter Estimation for Markov-modulated Poisson Process
Fang Dong, Kui Wu and Venkatesh Srinivasan,
Proceedings of IEEE/ACM Symposium on Quality of Service (IWQoS), 2017, pages 1-10.
- Conflict-Aware Weighted Bipartite Matching and Its Application to E-Commerce
Cheng Chen, Lan Zheng, Venkatesh Srinivasan, Alex Thomo, Kui Wu and Anthony Sukow,
IEEE International Conference on Data Engineering (ICDE), poster track, 2017, pages 41-42.
- Efficient Computation of Feedback Arc Set at Web-scale
Michael Simpson, Venkatesh Srinivasan and Alex Thomo,
Proceedings of 43rd International Conference on Very Large Data Bases (VLDB), 2017, pages 133-144.
- Group-Aware Weighted Bipartite B-Matching
Cheng Chen, Sean Chester, Venkatesh Srinivasan, Alex Thomo and Kui Wu,
Proceedings of 25th International Conference on Information and Knowledge Management (CIKM), 2016, pages 459-468.
- From Recommendation to Profile Inference (Rec2PI): A Novel Value-added Service to WiFi Data Mining
Cheng Chen, Fang Dong, Kui Wu, Venkatesh Srinivasan and Alex Thomo,
Proceedings of 25th International Conference on Information and Knowledge Management (CIKM), 2016, pages 1503-1512.
- Fuzzy Joins in MapReduce: Jaccard and Edit Distance
Ben Kimmett, Venkatesh Srinivasan and Alex Thomo,
Proceedings of 7th International Conference on Information, Intelligence, Systems and Applications (IISA), 2016, pages 1-6.
- On a Variant of Multilinear Modular Hashing with Applications to Authentication and Secrecy Codes
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan and Laszlo Toth,
Proceedings of the International Symposium on Information Theory and its Applications (ISITA), 2016, pages 320-324.
- Copula Analysis of Latent Dependency Structure for Collaborative Auto-Scaling of Cloud Services
Fang Dong, Kui Wu, Venkatesh Srinivasan and Jianping Wang,
Proceedings of the 25th International Conference on Computer Communications and Networks (ICCCN), 2016, pages 1-8.
- On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes
Mohammad Hajiabadi, Bruce M. Kapron and Venkatesh Srinivasan,
Proceedings of 19th International Conference on Theory and Practice of Public-Key Cryptography (PKC), 2016, pages 129-158.
- K-Core Decomposition for Large Networks on a Single PC
Wissam Khaouid, Marina Barsky, Venkatesh Srinivasan and Alex Thomo,
Proceedings of 42nd International Conference on Very Large Data Bases (VLDB), 2016, pages 13-23.
- Fuzzy Joins in MapReduce: An Experimental Study
Ben Kimmett, Venkatesh Srinivasan and Alex Thomo,
Proceedings of 41st International Conference on Very Large Data Bases (VLDB), 2015, pages 1514-1517.
- Copula Analysis for Statistical Network Calculus
Fang Dong, Kui Wu and Venkatesh Srinivasan,
Proceedings of 2015 IEEE Conference on Computer Communications (INFOCOM), 2015, pages 1535-1543.
- Clearing Contamination in Large Networks
Michael Simpson, Venkatesh Srinivasan and Alex Thomo,
Proceedings of IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2014, pages 425-428.
- Three-Way Joins on MapReduce: An Experimental Study
Ben Kimmett, Alex Thomo and S.Venkatesh,
Proceedings of 5th International Conference on Information, Intelligence, Systems and Applications (IISA), 2014, pages 227-232.
- Comparing the Staples in Latent Factor Models
Cheng Chen, Lan Zheng, Alex Thomo, Kui Wu and Venkatesh Srinivasan,
Proceedings of 29th ACM Symposium On Applied Computing (SAC)- Data Mining track, 2014, pages 91-96.
- Computing k-Regret Minimizing Sets
Sean Chester, Alex Thomo, S. Venkatesh and Sue Whitesides,
Proceedings of 40th International Conference on Very Large Data Bases (VLDB), 2014, pages 389-400.
- The Best Answers? Think Twice: Online Detection of Commercial Campaigns in the CQA Forums
Cheng Chen, Kui Wu, S. Venkatesh and Kesav Bharadwaj,
Proceedings of IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2013, pages 458-465.
- Battling the Internet Water Army: Detection of Hidden Paid Posters
Cheng Chen, Kui Wu, S. Venkatesh and Xudong Zhang,
Proceedings of IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2013, pages 116-120.
- Indexing Reverse Top-k Queries in Two Dimensions
Sean Chester, Alex Thomo, S. Venkatesh and Sue Whitesides,
Proceedings of the 18th International Conference on Database Systems for Advanced Applications (DASFAA), 2013 pages 201-208.
- Anonymizing Subsets of Social Networks with Degree Constrained Subgraphs
Sean Chester, Jared Gaertner, Ulrike Stege and S. Venkatesh,
Proceedings of IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2012, pages 418-422.
- Learning the News in Social Networks
Krishnan Rajagopalan, Alex Thomo and S. Venkatesh,
Proceedings of the 7th Int. Symposium on Foundations of Information and Knowledge Systems (FoIKS), 2012, pages 298-311.
- K-Anonymization of Social Networks by Vertex Addition
Sean Chester, Bruce M. Kapron, Ganesh Ramesh, Gautam Srivastava, Alex Thomo and S. Venkatesh,
Proceedings of 15th International Conference on Advances in Databases and Information Systems (ADBIS), short paper, 2011, pages 107-116.
- Social Network Anonymization via Edge Addition
Bruce M. Kapron, Gautam Srivastava and S. Venkatesh,
Proceedings of IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2011, pages 155-162.
- Indexing for Vector Projections
Sean Chester, Alex Thomo, S. Venkatesh and Sue Whitesides,
Proceedings of the 16th International Conference on Database Systems for Advanced Applications (DASFAA), 2011, pages 367-376.
- Connecting a Set of Circles with Minimum Sum of Radii
Erin W. Chambers, Sandor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan, Ulrike Stege and Sue Whitesides,
Proceedings of 12th International Symposium on Algorithms and Data Structures (WADS), 2011, pages 183-194.
- Characterizing Problems for Realizing Policies in Self-Adaptive and Self-Managing Systems,
S. Balasubramanian, R. Desmarais, H. Muller, U. Stege and S. Venkatesh,
Proceedings of 6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS), 2011, pages 70-79.
- Connectivity Graphs of Uncertainty Regions
Erin W. Chambers, Alejandro Erickson, Sandor P. Fekete, Jonathan Lenchner, Jeff Sember, Venkatesh Srinivasan, Ulrike Stege, Svetlana Stolpner, Christophe Weibel and Sue Whitesides,
Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC), 2010, pages 434-445.
- Rewriting of Visibly Pushdown Languages for XML
Data Integration
Alex Thomo and S.Venkatesh,
Proceedings of the 17th ACM Conference on Information and
Knowledge Management (CIKM) , 2008, pages 521-530.
- Visibly Pushdown Transducers for Approximate Validation of Streaming XML
Alex Thomo, S. Venkatesh and YingYing Ye,
Proceedings of the 5th Int. Symposium on Foundations of Information and Knowledge Systems (FoIKS), Springer, 2008, pages 219-238.
- Towards Practically Feasible Answering of
Regular Path Queries in LAV Data Integration
Manuel Tamashiro, Alex Thomo and S. Venkatesh,
Proceedings of the 16th ACM Conference on Information and
Knowledge Management (CIKM) , 2007, pages 381-390.
- A Characterization of Non-Interactive Instance-Dependent Commitment-Schemes
Bruce Kapron, Lior Malka and S. Venkatesh,
Proceedings of the 34th International Colloquium on Automata, Languages
and Programming (ICALP), 2007, pages 328-339.
- Communication vs. Computation
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim and S.Venkatesh,
Proceedings of the 31st International Colloquium on Automata, Languages
and Programming (ICALP), 2004, pages 745-756.
- Optimal Separation between EROW and CROW PRAMs
Navin Goyal, Michael Saks and S.Venkatesh,
Proceedings of 18th IEEE Conference on Computational Complexity
(CCC), 2003, pages 93-102.
- On Approximating the Radii of Point Sets in
High Dimensions
Kasturi Varadarajan, S. Venkatesh and Jiawei Zhang,
Proceedings of the IEEE Conference on Foundations of Computer
Science (FOCS), 2002, pages 561-569.
- On the advantage over a random assignment
Johan Håstad and S. Venkatesh,
Proceedings of the ACM Symposium on Theory of Computing (STOC), 2002,
pages 43-52.
- Lower bounds in the
quantum cell probe model
Pranab Sen and S. Venkatesh,
Proceedings of Intenational Colloquium on Automata, Languages and
Programming (ICALP), 2001, pages 358-369.
- The Quantum Complexity
of Set Membership
Jaikumar Radhakrishnan, Pranab Sen and
S. Venkatesh,
Proceedings of IEEE Conference on Foundations of
Computer Science (FOCS), 2000, pages 554-562.
- Are bitvectors
optimal?
Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan
and S. Venkatesh,
Proceedings of the ACM Symposium on Theory of
Computing (STOC), 2000, pages 449-458.
- The communication
complexity of pointer chasing
Stephen J. Ponzio, Jaikumar
Radhakrishnan and S. Venkatesh,
Proceedings of the ACM Symposium on
Theory of Computing (STOC), 1999, pages 602-611.
Workshops
- Connecting a Set of Circles with Minimum Sum of Radii
Erin W. Chambers, Sandor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan, Ulrike Stege and Sue Whitesides,
Proceedings of 27th European Workshop on Computational Geometry (EuroCG), 2011, 4 pages.
Book Articles
- Approximate Dictionaries
Venkatesh Srinivasan
Encyclopedia of Algorithms, 2016, pages 90-94.
- A Comprehensive Analysis of Detection of Hidden Paid Posters
Cheng Chen, Kui Wu, Venkatesh Srinivasan and Xudong Zhang
Recommendation and Search in Social Networks, Springer 2015, pages 101-118.
- Copula Analysis for Stochastic Network Calculus
Kui Wu, Fang Dong and Venkatesh Srinivasan,
IEEE Communications Society MMTC E-Letters, March 2014, pages 37-40.
- Anonymization and Deanonymization of Social Network Data
Sean Chester, Bruce Kapron, Gautam Srivastava, Venkatesh Srinivasan and Alex Thomo
Encyclopedia of Social Network Analysis and Mining (ESNAM), 2014, pages 48-56.
- Linear Algebra Methods in Communication Complexity
Louis Deaett and Venkatesh Srinivasan
Linear Algebra and its Applications, 436(12), 2012, pages 4459-4472.
- Regular Path Queries on Graph-Structured Data
Alex Thomo and S.Venkatesh
CRC Handbook on Finite State Based Models and Applications, 2011, pages 207-221.