On the Isomorphism Conjecture for 2-DFA Reductions. - Manindra Agrawal; Srinivasan Venkatesh 001 (Int. J. Found. Comput. Sci., 1996)

Pseudo-Average Block Sensitivity Equals Average Sensitivity. - Srinivasan Venkatesh 001 (Inf. Process. Lett., 1998)

The Communication Complexity of Pointer Chasing Applications of Entropy and Sampling (Abstract). - Stephen Ponzio; Jaikumar Radhakrishnan; Srinivasan Venkatesh 001 (CCC, 1999)

The Communication Complexity of Pointer Chasing: Applications of Entropy and Sampling. - Stephen Ponzio; Jaikumar Radhakrishnan; Srinivasan Venkatesh 001 (STOC, 1999)

Improved bounds for dictionary look-up with one error. - Gerth Stølting Brodal; Srinivasan Venkatesh 001 (Inf. Process. Lett., 2000)

Lower Bounds in the Quantum Cell Probe Model. - Pranab Sen; Srinivasan Venkatesh 001 (ICALP, 2001)

The Communication Complexity of Pointer Chasing. - Stephen Ponzio; Jaikumar Radhakrishnan; Srinivasan Venkatesh 001 (J. Comput. Syst. Sci., 2001)

On Approximating the Radii of Point Sets in High Dimensions. - Kasturi R. Varadarajan; Srinivasan Venkatesh 001; Jiawei Zhang 006 (FOCS, 2002)

The Quantum Complexity of Set Membership. - Jaikumar Radhakrishnan; Pranab Sen; Srinivasan Venkatesh 001 (Algorithmica, 2002)

Are Bitvectors Optimal? - Harry Buhrman; Peter Bro Miltersen; Jaikumar Radhakrishnan; Srinivasan Venkatesh 001 (SIAM J. Comput., 2002)

Optimal Separation of EROW and CROWPRAMs. - Navin Goyal; Michael E. Saks; Srinivasan Venkatesh 001 (CCC, 2003)

Communication Versus Computation. - Prahladh Harsha; Yuval Ishai; Joe Kilian; Kobbi Nissim; Srinivasan Venkatesh 001 (ICALP, 2004)

On the advantage over a random assignment. - Johan Håstad; Srinivasan Venkatesh 001 (Random Struct. Algorithms, 2004)

Towards practically feasible answering of regular path queries in lav data integration. - Manuel Tamashiro; Alex Thomo; Srinivasan Venkatesh 001 (CIKM, 2007)

A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC). - Bruce M. Kapron; Lior Malka; Srinivasan Venkatesh 001 (ICALP, 2007)

Communication vs. Computation. - Prahladh Harsha; Yuval Ishai; Joe Kilian; Kobbi Nissim; Srinivasan Venkatesh 001 (Comput. Complex., 2007)

Approximating the Radii of Point Sets. - Kasturi R. Varadarajan; Srinivasan Venkatesh 001; Yinyu Ye 001; Jiawei Zhang 006 (SIAM J. Comput., 2007)

Visibly Pushdown Transducers for Approximate Validation of Streaming XML. - Alex Thomo; Srinivasan Venkatesh 001; Ying Ying Ye (FoIKS, 2008)

Lower bounds for predecessor searching in the cell probe model. - Pranab Sen; Srinivasan Venkatesh 001 (J. Comput. Syst. Sci., 2008)

Approximate Dictionaries. - Srinivasan Venkatesh 001 (Encyclopedia of Algorithms, 2008)

k-Anonymization of Social Networks by Vertex Addition. - Sean Chester; Bruce M. Kapron; Ganesh Ramesh; Gautam Srivastava 001; Alex Thomo; S. Venkatesh 001 (ADBIS (2), 2011)

Social Network Anonymization via Edge Addition. - Bruce M. Kapron; Gautam Srivastava 001; S. Venkatesh 001 (ASONAM, 2011)

Indexing for Vector Projections. - Sean Chester; Alex Thomo; Srinivasan Venkatesh 001; Sue Whitesides (DASFAA (2), 2011)

Characterizing problems for realizing policies in self-adaptive and self-managing systems. - Sowmya Balasubramanian; Ronald J. Desmarais; Hausi A. Müller; Ulrike Stege; S. Venkatesh 001 (SEAMS, 2011)

Rewriting of visibly pushdown languages for XML data integration. - Alex Thomo; Srinivasan Venkatesh 001 (Theor. Comput. Sci., 2011)

Anonymizing Subsets of Social Networks with Degree Constrained Subgraphs. - Sean Chester; Jared Gaertner; Ulrike Stege; S. Venkatesh 001 (ASONAM, 2012)

Learning the News in Social Networks. - Krishnan Rajagopalan; Srinivasan Venkatesh 001; Alex Thomo (FoIKS, 2012)

Indexing Reverse Top-k Queries - Sean Chester; Alex Thomo; S. Venkatesh 001; Sue Whitesides (CoRR, 2012)

Computing optimal k-regret minimizing sets with top-k depth contours - Sean Chester; Alex Thomo; S. Venkatesh 001; Sue Whitesides (CoRR, 2012)

Regular Path Queries on Graph-Structured Data. - Alex Thomo; S. Venkatesh 001 (Handbook of Finite State Based Models and Applications, 2012)

The best answers? think twice: online detection of commercial campaigns in the CQA forums. - Cheng Chen 019; Kui Wu 001; Srinivasan Venkatesh 001; R. Kesav Bharadwaj (ASONAM, 2013)

Battling the internet water army: detection of hidden paid posters. - Cheng Chen 019; Kui Wu 001; Srinivasan Venkatesh 001; Xudong Zhang (ASONAM, 2013)

Indexing Reverse Top-k Queries in Two Dimensions. - Sean Chester; Alex Thomo; S. Venkatesh 001; Sue Whitesides (DASFAA (1), 2013)

Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes. - Sean Chester; Bruce M. Kapron; Ganesh Ramesh; Gautam Srivastava 001; Alex Thomo; S. Venkatesh 001 (Soc. Netw. Anal. Min., 2013)

Complexity of social network anonymization. - Sean Chester; Bruce M. Kapron; Gautam Srivastava 001; S. Venkatesh 001 (Soc. Netw. Anal. Min., 2013)

Three-way joins on MapReduce: An experimental study. - Ben Kimmett; Alex Thomo; S. Venkatesh 001 (IISA, 2014)

Comparing the staples in latent factor models for recommender systems. - Cheng Chen 019; Lan Zheng; Alex Thomo; Kui Wu 001; Srinivasan Venkatesh 001 (SAC, 2014)

Buyer to Seller Recommendation under Constraints. - Cheng Chen 019; Lan Zheng; Srinivasan Venkatesh 001; Alex Thomo; Kui Wu 001; Anthony Sukow (CoRR, 2014)

Computing k-Regret Minimizing Sets. - Sean Chester; Alex Thomo; S. Venkatesh 001; Sue Whitesides (Proc. VLDB Endow., 2014)

Anonymization and De-anonymization of Social Network Data. - Sean Chester; Bruce M. Kapron; Gautam Srivastava 001; Srinivasan Venkatesh 001; Alex Thomo (Encyclopedia of Social Network Analysis and Mining, 2014)

Copula analysis for statistical network calculus. - Fang Dong 004; Kui Wu 001; S. Venkatesh 001 (INFOCOM, 2015)

A model for learning the news in social networks. - Krishnan Rajagopalan; Srinivasan Venkatesh 001; Alex Thomo (Ann. Math. Artif. Intell., 2015)

On almost-universal multilinear modular hashing with composite moduli. - Khodakhast Bibak; Bruce M. Kapron; S. Venkatesh 001 (CoRR, 2015)

Restricted linear congruences and an authenticated encryption scheme. - Khodakhast Bibak; Bruce M. Kapron; Srinivasan Venkatesh 001; Roberto Tauraso; László Tóth 003 (CoRR, 2015)

Restricted linear congruences. - Khodakhast Bibak; Bruce M. Kapron; S. Venkatesh 001; Roberto Tauraso; László Tóth 003 (IACR Cryptol. ePrint Arch., 2015)

On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes. - Mohammad Hajiabadi; Bruce M. Kapron; S. Venkatesh 001 (IACR Cryptol. ePrint Arch., 2015)

k-Attribute-Anonymity is hard even for k=2. - Allan Scott; Srinivasan Venkatesh 001; Ulrike Stege (Inf. Process. Lett., 2015)

The Best Answers? Think Twice: Identifying Commercial Campagins in the CQA Forums. - Cheng Chen 019; Kui Wu 001; S. Venkatesh 001; R. Kesav Bharadwaj (J. Comput. Sci. Technol., 2015)

K-Core Decomposition of Large Networks on a Single PC. - Wissam Khaouid; Marina Barsky; S. Venkatesh 001; Alex Thomo (Proc. VLDB Endow., 2015)

Fuzzy Joins in MapReduce: An Experimental Study. - Ben Kimmett; S. Venkatesh 001; Alex Thomo (Proc. VLDB Endow., 2015)

A framework for non-interactive instance-dependent commitment schemes (NIC). - Bruce M. Kapron; Lior Malka; S. Venkatesh 001 (Theor. Comput. Sci., 2015)

A Comprehensive Analysis of Detection of Online Paid Posters. - Cheng Chen 019; Kui Wu 001; Venkatesh Srinivasan 001; Xudong Zhang (Recommendation and Search in Social Networks, 2015)

Group-Aware Weighted Bipartite B-Matching. - Cheng Chen 019; Sean Chester; Venkatesh Srinivasan 001; Kui Wu 001; Alex Thomo (CIKM, 2016)

From Recommendation to Profile Inference (Rec2PI): A Value-added Service to Wi-Fi Data Mining. - Cheng Chen 019; Fang Dong 004; Kui Wu 001; Venkatesh Srinivasan 001; Alex Thomo (CIKM, 2016)

Copula Analysis of Latent Dependency Structure for Collaborative Auto-Scaling of Cloud Services. - Fang Dong 004; Kui Wu 001; Venkatesh Srinivasan 001; Jianping Wang 001 (ICCCN, 2016)

Fuzzy joins in MapReduce: Edit and Jaccard distance. - Ben Kimmett; Alex Thomo; Venkatesh Srinivasan 001 (IISA, 2016)

On a variant of multilinear modular hashing with applications to authentication and secrecy codes. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001; László Tóth 003 (ISITA, 2016)

MMH⁎ with arbitrary modulus is always almost-universal. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001 (Inf. Process. Lett., 2016)

Efficient Computation of Feedback Arc Set at Web-Scale. - Michael Simpson 001; Venkatesh Srinivasan 001; Alex Thomo (Proc. VLDB Endow., 2016)

The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001 (IEEE Trans. Inf. Theory, 2016)

Conflict-Aware Weighted Bipartite B-Matching and Its Application to E-Commerce. - Cheng Chen 019; Lan Zheng; Venkatesh Srinivasan 001; Alex Thomo; Kui Wu 001; Anthony Sukow (IEEE Trans. Knowl. Data Eng., 2016)

Clearing Contamination in Large Networks. - Michael Simpson 001; Venkatesh Srinivasan 001; Alex Thomo (IEEE Trans. Knowl. Data Eng., 2016)

Approximate Dictionaries. - Venkatesh Srinivasan 001 (Encyclopedia of Algorithms, 2016)

Efficient Implementation of Anchored 2-core Algorithm. - Babak Tootoonchi; Venkatesh Srinivasan 001; Alex Thomo (ASONAM, 2017)

k-core Decomposition on Giraph and GraphChi. - Xin Hu; Fangming Liu; Venkatesh Srinivasan 001; Alex Thomo (INCoS, 2017)

Copula-based parameter estimation for Markov-modulated Poisson Process. - Fang Dong 004; Kui Wu 001; Venkatesh Srinivasan 001 (IWQoS, 2017)

Connectivity Graphs of Uncertainty Regions. - Erin W. Chambers; Alejandro Erickson; Sándor P. Fekete; Jonathan Lenchner; Jeff Sember; S. Venkatesh 001; Ulrike Stege; Svetlana Stolpner; Christophe Weibel; Sue Whitesides (Algorithmica, 2017)

Copula Analysis of Temporal Dependence Structure in Markov Modulated Poisson Process and Its Applications. - Fang Dong 004; Kui Wu 001; Venkatesh Srinivasan 001 (ACM Trans. Model. Perform. Evaluation Comput. Syst., 2017)

K-Truss Decomposition of Large Networks on a Single Consumer-Grade Machine. - Jian Wu; Alison Goshulak; Venkatesh Srinivasan 001; Alex Thomo (ASONAM, 2018)

A New Dependence Model for Heterogeneous Markov Modulated Poisson Processes. - Fang Dong 004; Kui Wu 001; Venkatesh Srinivasan 001 (Networking, 2018)

[Engineering Paper] SCC: Automatic Classification of Code Snippets. - Kamel Alreshedy; Dhanush Dharmaretnam; Daniel M. Germán; Venkatesh Srinivasan 001; T. Aaron Gulliver (SCAM, 2018)

Connecting a set of circles with minimum sum of radii. - Erin W. Chambers; Sándor P. Fekete; Hella-Franziska Hoffmann; Dimitri Marinakis; Joseph S. B. Mitchell; Srinivasan Venkatesh 001; Ulrike Stege; Sue Whitesides (Comput. Geom., 2018)

Scalable Misinformation Prevention in Social Networks. - Michael Simpson 001; Venkatesh Srinivasan 001; Alex Thomo (CoRR, 2018)

SCC: Automatic Classification of Code Snippets. - Kamel Alreshedy; Dhanush Dharmaretnam; Daniel M. Germán; Venkatesh Srinivasan 001; T. Aaron Gulliver (CoRR, 2018)

Predicting the Programming Language of Questions and Snippets of StackOverflow Using Natural Language Processing. - Kamel Alreshedy; Dhanush Dharmaretnam; Daniel M. Germán; Venkatesh Srinivasan 001; T. Aaron Gulliver (CoRR, 2018)

Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001 (Des. Codes Cryptogr., 2018)

On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes. - Khodakhast Bibak; Bruce M. Kapron; Srinivasan Venkatesh 001; László Tóth 003 (Int. J. Found. Comput. Sci., 2018)

Anonymization and De-anonymization of Social Network Data. - Sean Chester; Bruce M. Kapron; Gautam Srivastava 001; Venkatesh Srinivasan 001; Alex Thomo (Encyclopedia of Social Network Analysis and Mining. 2nd Ed., 2018)

Efficient Computation of Probabilistic Core Decomposition at Web-Scale. - Fatemeh Esfahani; Venkatesh Srinivasan 001; Alex Thomo; Kui Wu 001 (EDBT, 2019)

Fast Truss Decomposition in Large-scale Probabilistic Graphs. - Fatemeh Esfahani; Jian Wu; Venkatesh Srinivasan 001; Alex Thomo; Kui Wu 001 (EDBT, 2019)

Triad Enumeration at Trillion-Scale Using a Single Commodity Machine. - Yudi Santoso; Alex Thomo; Venkatesh Srinivasan 001; Sean Chester (EDBT, 2019)

Graph-XLL: a Graph Library for Extra Large Graph Analytics on a Single Machine. - Jian Wu; Venkatesh Srinivasan 001; Alex Thomo (IISA, 2019)

A generalization of Schönemann's theorem via a graph theoretic method. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001 (Discret. Math., 2019)

Efficient Enumeration of Four Node Graphlets at Trillion-Scale. - Yudi Santoso; Venkatesh Srinivasan 001; Alex Thomo (EDBT, 2020)

Strongly Minimal MapReduce Algorithms: A TeraSort Case Study. - Daniel Xia; Michael Simpson 001; Venkatesh Srinivasan 001; Alex Thomo (FoIKS, 2020)

Reverse Prevention Sampling for Misinformation Mitigation in Social Networks. - Michael Simpson 001; Venkatesh Srinivasan 001; Alex Thomo (ICDT, 2020)

Triangle Enumeration on Massive Graphs Using AWS Lambda Functions. - Tengkai Yu; Venkatesh Srinivasan 001; Alex Thomo (INCoS, 2020)

Utility-Based Graph Summarization: New and Improved. - Mahdi Hajiabadi; Jasbir Singh; Venkatesh Srinivasan 001; Alex Thomo (CoRR, 2020)

MMH* with arbitrary modulus is always almost-universal. - Khodakhast Bibak; Bruce M. Kapron; Venkatesh Srinivasan 001 (CoRR, 2020)

SCC++: Predicting the programming language of questions and snippets of Stack Overflow. - Kamel Alrashedy; Dhanush Dharmaretnam; Daniel M. Germán; Venkatesh Srinivasan 001; T. Aaron Gulliver (J. Syst. Softw., 2020)

Fast and Scalable Triangle Counting in Graph Streams: The Hybrid Approach. - Paramvir Singh; Venkatesh Srinivasan 001; Alex Thomo (AINA (2), 2021)

Multi-stage graph peeling algorithm for probabilistic core decomposition. - Yang Guo 002; Xuekui Zhang; Fatemeh Esfahani; Venkatesh Srinivasan 001; Alex Thomo; Li Xing (ASONAM, 2021)

Approximating 4-cliques in streaming graphs: the power of dual sampling. - Anmol Mann; Venkatesh Srinivasan 001; Alex Thomo (ASONAM, 2021)

Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs. - Rahnuma Islam Nishat; Srinivasan Venkatesh 001; Sue Whitesides (IWOCA, 2021)

Graph Summarization with Controlled Utility Loss. - Mahdi Hajiabadi; Jasbir Singh; Venkatesh Srinivasan 001; Alex Thomo (KDD, 2021)

Efficient Graph Summarization using Weighted LSH at Billion-Scale. - Quinton Yong; Mahdi Hajiabadi; Venkatesh Srinivasan 001; Alex Thomo (SIGMOD Conference, 2021)

Truss Decomposition on Large Probabilistic Networks using H-Index. - Fatemeh Esfahani; Mahsa Daneshmand; Venkatesh Srinivasan 001; Alex Thomo; Kui Wu 001 (SSDBM, 2021)

Distributed Enumeration of Four Node Graphlets at Quadrillion-Scale. - Xiaozhou Liu; Yudi Santoso; Venkatesh Srinivasan 001; Alex Thomo (SSDBM, 2021)

Identifying Important Features for Clinical Diagnosis of Thyroid Disorder. - Sowmya Balasubramanian; Venkatesh Srinivasan 001; Alex Thomo (ASONAM, 2022)

Dynamic Graph Summarization: Optimal and Scalable. - Mahdi Hajiabadi; Venkatesh Srinivasan 001; Alex Thomo (IEEE Big Data, 2022)

Practical Survey on MapReduce Subgraph Enumeration Algorithms. - Xiaozhou Liu; Yudi Santoso; Venkatesh Srinivasan 001; Alex Thomo (EIDWT, 2022)

Nucleus Decomposition in Probabilistic Graphs: Hardness and Algorithms. - Fatemeh Esfahani; Venkatesh Srinivasan 001; Alex Thomo; Kui Wu 001 (ICDE, 2022)

1-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids. - Rahnuma Islam Nishat; Venkatesh Srinivasan 001; Sue Whitesides (WALCOM, 2022)

Integrative COVID-19 biological network inference with probabilistic core decomposition. - Yang Guo 002; Fatemeh Esfahani; Xiaojian Shao; Venkatesh Srinivasan 001; Alex Thomo; Li Xing; Xuekui Zhang (Briefings Bioinform., 2022)

Scalable probabilistic truss decomposition using central limit theorem and H-index. - Fatemeh Esfahani; Mahsa Daneshmand; Venkatesh Srinivasan 001; Alex Thomo; Kui Wu 001 (Distributed Parallel Databases, 2022)

Four node graphlet and triad enumeration on distributed platforms. - Yudi Santoso; Xiaozhou Liu; Venkatesh Srinivasan 001; Alex Thomo (Distributed Parallel Databases, 2022)

Brain network similarity using k-cores. - Kazi Tabassum Ferdous; Sowmya Balasubramanian; Venkatesh Srinivasan 001; Alex Thomo (ASONAM, 2023)

Identifying Autism Spectrum Disorder Using Brain Networks: Challenges and Insights. - Keanelek Enns; Venkatesh Srinivasan 001; Alex Thomo (IISA, 2023)

Faster approximate subgraph counts with privacy. - Dung Nguyen 002; Mahantesh Halappanavar; Venkatesh Srinivasan 001; Anil Vullikanti (NeurIPS, 2023)

1-Complex s,t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids. - Rahnuma Islam Nishat; Venkatesh Srinivasan 001; Sue Whitesides (J. Graph Algorithms Appl., 2023)

Scaling Up Structural Clustering to Large Probabilistic Graphs Using Lyapunov Central Limit Theorem. - Joseph Howie; Venkatesh Srinivasan 001; Alex Thomo (Proc. VLDB Endow., 2023)

Scalable Misinformation Mitigation in Social Networks Using Reverse Sampling. - Michael Simpson 001; Venkatesh Srinivasan 001; Alex Thomo (Comput. J., 2023)

Synthetic Generation of Patient Service Utilization Data: A Scalability Study. - Sowmya Balasubramanian; Kenneth A. Moselle; Venkatesh Srinivasan 001; Alex Thomo (MIE, 2024)

Efficient Computation of K-Edge Connected Components: An Empirical Analysis. - Hanieh Sadri; Venkatesh Srinivasan 001; Alex Thomo (WAW, 2024)

The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs. - Rahnuma Islam Nishat; Venkatesh Srinivasan 001; Sue Whitesides (J. Comb. Optim., 2024)

Are brain networks classifiable? - Keanelek Enns; Kazi Tabassum Ferdous; Sowmya Balasubramanian; Smita Ghosh; Venkatesh Srinivasan 001; Alex Thomo (Netw. Model. Anal. Health Informatics Bioinform., 2024)