Srinivasan Parthasarathy

According to our database1, Srinivasan Parthasarathy authored at least 45 papers between 2002 and 2019.

Collaborative distances:



In proceedings 
PhD thesis 





Optimal Exploitation of Clustering and History Information in Multi-armed Bandit.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

An analysis of the Greedy Algorithm for Stochastic Set Cover.
CoRR, 2018

Foresight: Recommending Visual Insights.
PVLDB, 2017

Foresight: Rapid Data Exploration Through Guideposts.
CoRR, 2017

REMIX: Automated Exploration for Interactive Outlier Detection.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Minimum Weighted Completion Time.
Encyclopedia of Algorithms, 2016

Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks.
ACM Trans. Algorithms, 2016

Graph-based Exploration of Non-graph Datasets.
PVLDB, 2016

SOFIA: An Analytics Recommendation System.
Proceedings of the ISWC 2015 Posters & Demonstrations Track co-located with the 14th International Semantic Web Conference (ISWC-2015), 2015

Impact of DHCP churn on network characterization.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2014

Fast Nearest Neighbor Search on Large Time-Evolving Graphs.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2014

FAQ: A Framework for Fast Approximate Query Processing on Temporal Data.
Proceedings of the 3rd International Workshop on Big Data, 2014

READ: Rapid data Exploration, Analysis and Discovery.
Proceedings of the 17th International Conference on Extending Database Technology, 2014

Approximation Algorithms for Throughput Maximization in Wireless Networks With Delay Constraints.
IEEE/ACM Trans. Netw., 2013

Association control algorithms for handoff frequency minimization in mobile wireless networks.
Wireless Networks, 2012

Capacity of wireless networks under SINR interference constraints.
Wireless Networks, 2011

Approximation algorithms for throughput maximization in wireless networks with delay constraints.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

A Spectral Framework for Detecting Inconsistency across Multi-source Object Relationships.
Proceedings of the 11th IEEE International Conference on Data Mining, 2011

Cross-Layer Capacity Estimation and Throughput Maximization in Wireless Networks.
Proceedings of the Algorithms for Next Generation Networks, 2010

A unified approach to scheduling on unrelated parallel machines.
J. ACM, 2009

Scheduling on Unrelated Machines under Tree-Like Precedence Constraints.
Algorithmica, 2009

Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Minimum Weighted Completion Time.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Minimizing broadcast latency and redundancy in ad hoc networks.
IEEE/ACM Trans. Netw., 2008

Harmony: Holistic messaging middleware for event-driven systems.
IBM Systems Journal, 2008

Near-optimal algorithms for shared filter evaluation in data stream systems.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

A generic flow algorithm for shared filter ordering problems.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

Association Control in Mobile Wireless Networks.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Capacity of Asynchronous Random-Access Scheduling in Wireless Networks.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

Power Efficient Throughput Maximization in Multi-Hop Wireless Networks.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

Distributed algorithms for connected domination in wireless networks.
J. Parallel Distributed Comput., 2007

Cross-layer latency minimization in wireless networks with SINR constraints.
Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2007

Scalable event matching for overlapping subscriptions in pub/sub systems.
Proceedings of the 2007 Inaugural International Conference on Distributed Event-Based Systems, 2007

Efficient Design of End-to-End Probes for Source-Routed Networks.
Proceedings of the Second International Conference on COMmunication System softWAre and MiddlewaRE (COMSWARE 2007), 2007

Resource Allocation in Networked and Distributed Environments.
PhD thesis, 2006

Provable algorithms for parallel generalized sweep scheduling.
J. Parallel Distributed Comput., 2006

Dependent rounding and its applications to approximation algorithms.
J. ACM, 2006

Algorithmic aspects of capacity in wireless networks.
Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2005

Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

Similarity Searching in Peer-to-Peer Databases.
Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

Approximation Algorithms for Scheduling on Multiple Machines.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

End-to-end packet-scheduling in wireless ad-hoc networks.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

Dependent Rounding in Bipartite Graphs.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002