Yogish Sabharwal

Proceedings of the 7th Joint International Conference on Data Science & Management of Data (11th ACM IKDD CODS and 29th COMAD), 2024

2023

Scalable algorithms for compact spanners on real world graphs.

[BibT_eX]

[DOI]

Maulein Pathak

Proceedings of the 37th International Conference on Supercomputing, 2023

2022

GREED: A Neural Framework for Learning Graph Distance Functions.

[BibT_eX]

[DOI]

Rishabh Ranjan

Siddharth Grover

Sourav Medya

Sayan Ranu

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

A Neural Framework for Learning Subgraph and Graph Similarity Measures.

[BibT_eX]

[DOI]

Rishabh Ranjan

Siddharth Grover

Sourav Medya

Sayan Ranu

CoRR, 2021

Efficient scaling of dynamic graph neural networks.

[BibT_eX]

[DOI]

Proceedings of the International Conference for High Performance Computing, 2021

Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings.

[BibT_eX]

[DOI]

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Efficient algorithms for decode efficient prefix codes.

[BibT_eX]

[DOI]

Proceedings of the 31st Data Compression Conference, 2021

HyperASPO: Fusion of Model and Hyper Parameter Optimization for Multi-objective Machine Learning.

[BibT_eX]

[DOI]

Aswin Kannan

Proceedings of the 2021 IEEE International Conference on Big Data (Big Data), 2021

Rightsizing Clusters for Time-Limited Tasks.

[BibT_eX]

[DOI]

Padmanabha Venkatagiri Seshadri

Pooja Aggarwal

Ashok Pon Kumar

Amith Singhee

Proceedings of the 14th IEEE International Conference on Cloud Computing, 2021

2020

Scheduling split intervals with non-uniform demands.

[BibT_eX]

[DOI]

Discret. Optim., 2020

Decode efficient prefix codes.

[BibT_eX]

[DOI]

CoRR, 2020

PoWER-BERT: Accelerating BERT inference for Classification Tasks.

[BibT_eX]

[DOI]

Saurabh ManishRaje

CoRR, 2020

Effective Elastic Scaling of Deep Learning Workloads.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Modeling, 2020

PoWER-BERT: Accelerating BERT Inference via Progressive Word-vector Elimination.

[BibT_eX]

[DOI]

Saurabh Raje

Proceedings of the 37th International Conference on Machine Learning, 2020

Decode-Efficient Prefix Codes for Hierarchical Memory Models.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 2020

Variable batch size across layers for efficient prediction on CNNs.

[BibT_eX]

[DOI]

Proceedings of the 13th IEEE International Conference on Cloud Computing, 2020

2019

On optimizing distributed non-negative Tucker decomposition.

[BibT_eX]

[DOI]

Shivmaran S. Pandian

Saurabh Raje

Shreenivas Bharadwaj Venkataramanan

Proceedings of the ACM International Conference on Supercomputing, 2019

Acceleration of Sparse Vector Autoregressive Modeling Using GPUs.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on High Performance Computing, 2019

2018

Improved algorithms for resource allocation under varying capacity.

[BibT_eX]

[DOI]

Shalmoli Gupta

J. Sched., 2018

Set Cover Problems with Small Neighborhood Covers.

[BibT_eX]

[DOI]

Archita Agarwal

Sambudha Roy

Theory Comput. Syst., 2018

On Optimizing Distributed Tucker Decomposition for Sparse Tensors.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Conference on Supercomputing, 2018

Improved Distributed Algorithm for Graph Truss Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2018: Parallel Processing, 2018

Efficient Training of Convolutional Neural Nets on Large Distributed Systems.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Cluster Computing, 2018

2017

Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2017

Efficient Inferencing of Compressed Deep Neural Networks.

[BibT_eX]

[DOI]

Dharma Teja Vooturi

CoRR, 2017

Replica Placement on Bounded Treewidth Graphs.

[BibT_eX]

[DOI]

Anshul Aggarwal

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

On Optimizing Distributed Tucker Decomposition for Dense Tensors.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2016

The Update Complexity of Selection and Related Problems.

[BibT_eX]

[DOI]

Manoj Gupta

Theory Comput. Syst., 2016

Improvable Knapsack Problems.

[BibT_eX]

[DOI]

CoRR, 2016

Reusable Resource Scheduling via Colored Interval Covering.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

Subgraph Counting: Color Coding Beyond Trees.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

2015

Facility Location with Matroid or Knapsack Constraints.

[BibT_eX]

[DOI]

Ravishankar Krishnaswamy

Math. Oper. Res., 2015

Architecture Aware Resource Allocation for Structured Grid Applications: Flood Modelling Case.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE/ACM International Symposium on Cluster, 2015

2014

Facility location with red-blue demands.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

Approximation Algorithms for the Weight-Reducible Knapsack Problem.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2014

Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems.

[BibT_eX]

[DOI]

Fabio Checconi

Fabrizio Petrini

Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

Multicore Parallelization of the PTAS Dynamic Program for the Bin-Packing Problem.

[BibT_eX]

[DOI]

Anirudh Chakravorty

Thomas George

Proceedings of the Distributed Computing and Networking - 15th International Conference, 2014

Algorithms for power-aware resource activation.

[BibT_eX]

[DOI]

Sonika Arora

Archita Agarwal

Proceedings of the 21st International Conference on High Performance Computing, 2014

Replica Placement on Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Sonika Arora

Kanika Gupta

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

A divide and conquer strategy for scaling weather simulations with multiple regions of interest.

[BibT_eX]

[DOI]

Sci. Program., 2013

Energy delivery networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE Fourth International Conference on Smart Grid Communications, 2013

Distributed Algorithms for Scheduling on Line and Tree Networks with Non-uniform Bandwidths.

[BibT_eX]

[DOI]

Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

A hybrid parallelization approach for high resolution operational flood forecasting.

[BibT_eX]

[DOI]

Proceedings of the 20th Annual International Conference on High Performance Computing, 2013

Evaluation and enhancement of weather application performance on Blue Gene/Q.

[BibT_eX]

[DOI]

Proceedings of the 20th Annual International Conference on High Performance Computing, 2013

Algorithms for the relaxed Multiple-Organization Multiple-Machine Scheduling Problem.

[BibT_eX]

[DOI]

Proceedings of the 20th Annual International Conference on High Performance Computing, 2013

Replica Placement via Capacitated Vertex Cover.

[BibT_eX]

[DOI]

Sonika Arora

Koyel Mukherjee

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers.

[BibT_eX]

[DOI]

Archita Agarwal

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Scheduling Jobs with Multiple Non-uniform Tasks.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2013 Parallel Processing, 2013

2012

Efficient Decentralized Algorithms for the Distributed Trigger Counting Problem.

[BibT_eX]

[DOI]

Burkhard D. Steinmacher-Burow

Theory Comput. Syst., 2012

Looking under the hood of the IBM blue gene/Q network.

[BibT_eX]

[DOI]

Swati Singhal

Jeffrey J. Parker

Proceedings of the SC Conference on High Performance Computing Networking, 2012

Breaking the speed and scalability barriers for graph exploration on distributed-memory machines.

[BibT_eX]

[DOI]

Proceedings of the SC Conference on High Performance Computing Networking, 2012

Distributed algorithms for scheduling on line and tree networks.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Collective algorithms for sub-communicators.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Supercomputing, 2012

Mapping strategies for the PERCS architecture.

[BibT_eX]

[DOI]

Monu Kedia

Naga Praveen Kumar Katta

Ramakrishnan Rajamony

Aruna Ramanan

Proceedings of the 19th International Conference on High Performance Computing, 2012

Scheduling Resources for Executing a Partial Set of Jobs.

[BibT_eX]

[DOI]

Arindam Pal

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Density Functions subject to a Co-Matroid Constraint.

[BibT_eX]

[DOI]

Sivaramakrishnan R. Natarajan

Natwar Modani

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011

Clustering with Internal Connectedness.

[BibT_eX]

[DOI]

Aditya Pancholi

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

The Matroid Median Problem.

[BibT_eX]

[DOI]

Ravishankar Krishnaswamy

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Minimum Cost Resource Allocation for Meeting Job Requirements.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Improved Algorithms for the Distributed Trigger Counting Problem.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

An Efficient Decentralized Algorithm for the Distributed Trigger Counting Problem.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

Maximizing throughput of jobs with multiple resource requirements.

[BibT_eX]

[DOI]

Neha Sengupta

Proceedings of the 18th International Conference on High Performance Computing, 2011

Real Time Contingency Analysis for Power Grids.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

Resource Allocation for Covering Time Varying Demands.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

Scheduling Resources for Throughput Maximization.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010

Efficient Algorithms for Global Snapshots in Large Distributed Systems.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2010

Linear-time approximation schemes for clustering problems in any dimensions.

[BibT_eX]

[DOI]

J. ACM, 2010

On the Complexity of the $k$-Anonymization Problem

[BibT_eX]

[DOI]

CoRR, 2010

Brief Announcement: A Decentralized Algorithm for Distributed Trigger Counting.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

Varying bandwidth resource allocation problem with bag constraints.

[BibT_eX]

[DOI]

Deva P. Seetharam

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Optimal bucket algorithms for large MPI collectives on torus interconnects.

[BibT_eX]

[DOI]

Nikhil Jain

Proceedings of the 24th International Conference on Supercomputing, 2010

Performance evaluation and optimization of random memory access on multicores with high productivity.

[BibT_eX]

[DOI]

Vaibhav Saxena

Pramod Bhatotia

Proceedings of the 2010 International Conference on High Performance Computing, 2010

Finding Independent Sets in Unions of Perfect Graphs.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Optimizing Matrix Transpose on Torus Interconnects.

[BibT_eX]

[DOI]

Nikhil Jain

Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

2009

HPCC Random Access benchmark for next generation supercomputers.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Analysis of sampling techniques for association rule mining.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2009

Approximating Decision Trees with Multiway Branches.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

Optimizations in financial engineering: The Least-Squares Monte Carlo method of Longstaff and Schwartz.

[BibT_eX]

[DOI]

Alan King

Sunil Kumar

Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

Optimization of All-to-All Communication on the Blue Gene/L Supercomputer.

[BibT_eX]

[DOI]

Proceedings of the 2008 International Conference on Parallel Processing, 2008

Optimization of BLAS on the Cell Processor.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing, 2008

Optimization of Fast Fourier Transforms on the Blue Gene/L Supercomputer.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing, 2008

2007

The Priority <i>k</i>-Median Problem.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006

Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions.

[BibT_eX]

[DOI]

Nishant Sharma

J. Comput. Syst. Sci., 2006

Optimizing the HPCC randomaccess benchmark on blue Gene/L Supercomputer.

[BibT_eX]

[DOI]

Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, 2006

MPI and communication - Software routing and aggregation of messages to optimize the performance of HPCC randomaccess benchmark.

[BibT_eX]

[DOI]

Proceedings of the ACM/IEEE SC2006 Conference on High Performance Networking and Computing, 2006

Gordon Bell finalists I - Large scale drop impact analysis of mobile phone using ADVC on Blue Gene/L.

[BibT_eX]

[DOI]

Proceedings of the ACM/IEEE SC2006 Conference on High Performance Networking and Computing, 2006

Scalable algorithms for global snapshots in distributed systems.

[BibT_eX]

[DOI]

Proceedings of the 20th Annual International Conference on Supercomputing, 2006

2005

A linear time algorithm for approximate 2-means clustering.

[BibT_eX]

[DOI]

Comput. Geom., 2005

Linear Time Algorithms for Clustering Problems in Any Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

A Framework for Session Based Recommendations.

[BibT_eX]

[DOI]

Natwar Modani

S. Karthik

Proceedings of the E-Commerce and Web Technologies: 6th International Conference, 2005

2004

Online marketing research.

[BibT_eX]

[DOI]

IBM J. Res. Dev., 2004

A Simple Linear Time (1+έ)-Approximation Algorithm for k-Means Clustering in Any Dimensions.

[BibT_eX]

[DOI]