S. Venkatesh

Affiliations:
  • University of Victoria, Canada
  • Rutgers University, Piscataway, NJ, USA (former)
  • Tata Institute of Fundamental Research, Mumbai, India (PhD 2000)


According to our database1, S. Venkatesh authored at least 109 papers between 1996 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Scalable Misinformation Mitigation in Social Networks Using Reverse Sampling.
Comput. J., September, 2023

Scaling Up Structural Clustering to Large Probabilistic Graphs Using Lyapunov Central Limit Theorem.
Proc. VLDB Endow., 2023

1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids.
J. Graph Algorithms Appl., 2023

Identifying Autism Spectrum Disorder Using Brain Networks: Challenges and Insights.
Proceedings of the 14th International Conference on Information, 2023

2022
Four node graphlet and triad enumeration on distributed platforms.
Distributed Parallel Databases, 2022

Scalable probabilistic truss decomposition using central limit theorem and H-index.
Distributed Parallel Databases, 2022

Integrative COVID-19 biological network inference with probabilistic core decomposition.
Briefings Bioinform., 2022

Nucleus Decomposition in Probabilistic Graphs: Hardness and Algorithms.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Practical Survey on MapReduce Subgraph Enumeration Algorithms.
Proceedings of the Advances in Internet, Data & Web Technologies, 2022

The Hamiltonian Path Graph is Connected for Simple s, t Paths in Rectangular Grid Graphs.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

Dynamic Graph Summarization: Optimal and Scalable.
Proceedings of the IEEE International Conference on Big Data, 2022

Identifying Important Features for Clinical Diagnosis of Thyroid Disorder.
Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2022

2021
Distributed Enumeration of Four Node Graphlets at Quadrillion-Scale.
Proceedings of the SSDBM 2021: 33rd International Conference on Scientific and Statistical Database Management, 2021

Truss Decomposition on Large Probabilistic Networks using H-Index.
Proceedings of the SSDBM 2021: 33rd International Conference on Scientific and Statistical Database Management, 2021

Efficient Graph Summarization using Weighted LSH at Billion-Scale.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Graph Summarization with Controlled Utility Loss.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Reconfiguring Simple s, t Hamiltonian Paths in Rectangular Grid Graphs.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Approximating 4-cliques in streaming graphs: the power of dual sampling.
Proceedings of the ASONAM '21: International Conference on Advances in Social Networks Analysis and Mining, Virtual Event, The Netherlands, November 8, 2021

Multi-stage graph peeling algorithm for probabilistic core decomposition.
Proceedings of the ASONAM '21: International Conference on Advances in Social Networks Analysis and Mining, Virtual Event, The Netherlands, November 8, 2021

Fast and Scalable Triangle Counting in Graph Streams: The Hybrid Approach.
Proceedings of the Advanced Information Networking and Applications, 2021

2020
SCC++: Predicting the programming language of questions and snippets of Stack Overflow.
J. Syst. Softw., 2020

Utility-Based Graph Summarization: New and Improved.
CoRR, 2020

Triangle Enumeration on Massive Graphs Using AWS Lambda Functions.
Proceedings of the Advances in Intelligent Networking and Collaborative Systems - The 12th International Conference on Intelligent Networking and Collaborative Systems (INCoS-2020), Victoria, BC, Canada, 31 August, 2020

Reverse Prevention Sampling for Misinformation Mitigation in Social Networks.
Proceedings of the 23rd International Conference on Database Theory, 2020

Strongly Minimal MapReduce Algorithms: A TeraSort Case Study.
Proceedings of the Foundations of Information and Knowledge Systems, 2020

Efficient Enumeration of Four Node Graphlets at Trillion-Scale.
Proceedings of the 23rd International Conference on Extending Database Technology, 2020

2019
A generalization of Schönemann's theorem via a graph theoretic method.
Discret. Math., 2019

Graph-XLL: a Graph Library for Extra Large Graph Analytics on a Single Machine.
Proceedings of the 10th International Conference on Information, 2019

Triad Enumeration at Trillion-Scale Using a Single Commodity Machine.
Proceedings of the Advances in Database Technology, 2019

Fast Truss Decomposition in Large-scale Probabilistic Graphs.
Proceedings of the Advances in Database Technology, 2019

Efficient Computation of Probabilistic Core Decomposition at Web-Scale.
Proceedings of the Advances in Database Technology, 2019

2018
Anonymization and De-anonymization of Social Network Data.
Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes.
Int. J. Found. Comput. Sci., 2018

Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes.
Des. Codes Cryptogr., 2018

Predicting the Programming Language of Questions and Snippets of StackOverflow Using Natural Language Processing.
CoRR, 2018

SCC: Automatic Classification of Code Snippets.
CoRR, 2018

Scalable Misinformation Prevention in Social Networks.
CoRR, 2018

Connecting a set of circles with minimum sum of radii.
Comput. Geom., 2018

[Engineering Paper] SCC: Automatic Classification of Code Snippets.
Proceedings of the 18th IEEE International Working Conference on Source Code Analysis and Manipulation, 2018

A New Dependence Model for Heterogeneous Markov Modulated Poisson Processes.
Proceedings of the 17th International IFIP TC6 Networking Conference, 2018

K-Truss Decomposition of Large Networks on a Single Consumer-Grade Machine.
Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

2017
Copula Analysis of Temporal Dependence Structure in Markov Modulated Poisson Process and Its Applications.
ACM Trans. Model. Perform. Evaluation Comput. Syst., 2017

Connectivity Graphs of Uncertainty Regions.
Algorithmica, 2017

Copula-based parameter estimation for Markov-modulated Poisson Process.
Proceedings of the 25th IEEE/ACM International Symposium on Quality of Service, 2017

<i>k</i>-core Decomposition on Giraph and GraphChi.
Proceedings of the Advances in Intelligent Networking and Collaborative Systems, 2017

Efficient Implementation of Anchored 2-core Algorithm.
Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017

2016
Approximate Dictionaries.
Encyclopedia of Algorithms, 2016

Clearing Contamination in Large Networks.
IEEE Trans. Knowl. Data Eng., 2016

Conflict-Aware Weighted Bipartite B-Matching and Its Application to E-Commerce.
IEEE Trans. Knowl. Data Eng., 2016

The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs.
IEEE Trans. Inf. Theory, 2016

Efficient Computation of Feedback Arc Set at Web-Scale.
Proc. VLDB Endow., 2016

MMH<sup>⁎</sup> with arbitrary modulus is always almost-universal.
Inf. Process. Lett., 2016

On a variant of multilinear modular hashing with applications to authentication and secrecy codes.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Fuzzy joins in MapReduce: Edit and Jaccard distance.
Proceedings of the 7th International Conference on Information, 2016

Copula Analysis of Latent Dependency Structure for Collaborative Auto-Scaling of Cloud Services.
Proceedings of the 25th International Conference on Computer Communication and Networks, 2016

From Recommendation to Profile Inference (Rec2PI): A Value-added Service to Wi-Fi Data Mining.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

Group-Aware Weighted Bipartite B-Matching.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

2015
A Comprehensive Analysis of Detection of Online Paid Posters.
Proceedings of the Recommendation and Search in Social Networks, 2015

A framework for non-interactive instance-dependent commitment schemes (NIC).
Theor. Comput. Sci., 2015

Fuzzy Joins in MapReduce: An Experimental Study.
Proc. VLDB Endow., 2015

K-Core Decomposition of Large Networks on a Single PC.
Proc. VLDB Endow., 2015

The Best Answers? Think Twice: Identifying Commercial Campagins in the CQA Forums.
J. Comput. Sci. Technol., 2015

k-Attribute-Anonymity is hard even for k=2.
Inf. Process. Lett., 2015

On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes.
IACR Cryptol. ePrint Arch., 2015

Restricted linear congruences.
IACR Cryptol. ePrint Arch., 2015

Restricted linear congruences and an authenticated encryption scheme.
CoRR, 2015

On almost-universal multilinear modular hashing with composite moduli.
CoRR, 2015

A model for learning the news in social networks.
Ann. Math. Artif. Intell., 2015

Copula analysis for statistical network calculus.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

2014
Anonymization and De-anonymization of Social Network Data.
Encyclopedia of Social Network Analysis and Mining, 2014

Computing k-Regret Minimizing Sets.
Proc. VLDB Endow., 2014

Buyer to Seller Recommendation under Constraints.
CoRR, 2014

Comparing the staples in latent factor models for recommender systems.
Proceedings of the Symposium on Applied Computing, 2014

Three-way joins on MapReduce: An experimental study.
Proceedings of the 5th International Conference on Information, 2014

2013
Complexity of social network anonymization.
Soc. Netw. Anal. Min., 2013

Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes.
Soc. Netw. Anal. Min., 2013

Indexing Reverse Top-k Queries in Two Dimensions.
Proceedings of the Database Systems for Advanced Applications, 2013

Battling the internet water army: detection of hidden paid posters.
Proceedings of the Advances in Social Networks Analysis and Mining 2013, 2013

The best answers? think twice: online detection of commercial campaigns in the CQA forums.
Proceedings of the Advances in Social Networks Analysis and Mining 2013, 2013

2012
Regular Path Queries on Graph-Structured Data.
Proceedings of the Handbook of Finite State Based Models and Applications., 2012

Computing optimal k-regret minimizing sets with top-k depth contours
CoRR, 2012

Indexing Reverse Top-k Queries
CoRR, 2012

Learning the News in Social Networks.
Proceedings of the Foundations of Information and Knowledge Systems, 2012

Anonymizing Subsets of Social Networks with Degree Constrained Subgraphs.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

2011
Rewriting of visibly pushdown languages for XML data integration.
Theor. Comput. Sci., 2011

Characterizing problems for realizing policies in self-adaptive and self-managing systems.
Proceedings of the 2011 ICSE Symposium on Software Engineering for Adaptive and Self-Managing Systems, 2011

Indexing for Vector Projections.
Proceedings of the Database Systems for Advanced Applications, 2011

Social Network Anonymization via Edge Addition.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2011

k-Anonymization of Social Networks by Vertex Addition.
Proceedings of the ADBIS 2011, 2011

2008
Approximate Dictionaries.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Lower bounds for predecessor searching in the cell probe model.
J. Comput. Syst. Sci., 2008

Visibly Pushdown Transducers for Approximate Validation of Streaming XML.
Proceedings of the Foundations of Information and Knowledge Systems, 2008

2007
Approximating the Radii of Point Sets.
SIAM J. Comput., 2007

Communication vs. Computation.
Comput. Complex., 2007

A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC).
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Towards practically feasible answering of regular path queries in lav data integration.
Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, 2007

2004
On the advantage over a random assignment.
Random Struct. Algorithms, 2004

Communication Versus Computation.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
Optimal Separation of EROW and CROWPRAMs.
Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003

2002
Are Bitvectors Optimal?
SIAM J. Comput., 2002

The Quantum Complexity of Set Membership.
Algorithmica, 2002

On Approximating the Radii of Point Sets in High Dimensions.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
The Communication Complexity of Pointer Chasing.
J. Comput. Syst. Sci., 2001

Lower Bounds in the Quantum Cell Probe Model.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Improved bounds for dictionary look-up with one error.
Inf. Process. Lett., 2000

1999
The Communication Complexity of Pointer Chasing: Applications of Entropy and Sampling.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

The Communication Complexity of Pointer Chasing Applications of Entropy and Sampling (Abstract).
Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

1998
Pseudo-Average Block Sensitivity Equals Average Sensitivity.
Inf. Process. Lett., 1998

1996
On the Isomorphism Conjecture for 2-DFA Reductions.
Int. J. Found. Comput. Sci., 1996


  Loading...