| The balanced connected subgraph problem | 0 | 0.34 | 2022 |
| Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing. | 0 | 0.34 | 2022 |
| Dynamic branch pruning aided low switching fixed complexity sphere decoding for small scale and massive MIMO detection | 0 | 0.34 | 2022 |
| Likelihood ascent search-aided low complexity improved performance massive MIMO detection in perfect and imperfect channel state information | 0 | 0.34 | 2022 |
| Separations Between Combinatorial Measures for Transitive Functions | 0 | 0.34 | 2022 |
| Estimating the Size of Union of Sets in Streaming Models | 0 | 0.34 | 2021 |
| Designing Samplers is Easy: The Boon of Testers | 0 | 0.34 | 2021 |
| Two new results about quantum exact learning | 0 | 0.34 | 2021 |
| Tight Chang's-Lemma-Type Bounds for Boolean Functions. | 0 | 0.34 | 2021 |
| Interplay Between Graph Isomorphism and Earth Mover's Distance in the Query and Communication Worlds. | 0 | 0.34 | 2021 |
| Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond | 0 | 0.34 | 2020 |
| Communication-Aware Hardware-Assisted MPI Overlap Engine. | 0 | 0.34 | 2020 |
| FALCON-X: Zero-copy MPI derived datatype processing on modern CPU and GPU architectures. | 2 | 0.38 | 2020 |
| EReinit: Scalable and efficient fault-tolerance for bulk-synchronous MPI applications: EReinit: Scalable and efficient fault-tolerance for bulk-synchronous MPI applications | 1 | 0.36 | 2020 |
| On Testing of Samplers | 0 | 0.34 | 2020 |
| The Balanced Connected Subgraph Problem | 0 | 0.34 | 2019 |
| Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. | 0 | 0.34 | 2019 |
| Efficient design for MPI asynchronous progress without dedicated resources | 1 | 0.37 | 2019 |
| FALCON: Efficient Designs for Zero-Copy MPI Datatype Processing on Emerging Architectures | 0 | 0.34 | 2019 |
| Two New Results About Quantum Exact Learning | 0 | 0.34 | 2019 |
| Leveraging Network-level parallelism with Multiple Process-Endpoints for MPI Broadcast | 1 | 0.36 | 2019 |
| Designing Scalable and High-Performance MPI Libraries on Amazon Elastic Fabric Adapter | 0 | 0.34 | 2019 |
| Design and Evaluation of Shared Memory CommunicationBenchmarks on Emerging Architectures using MVAPICH2 | 0 | 0.34 | 2019 |
| On Testing of Uniform Samplers | 0 | 0.34 | 2019 |
| Efficient Asynchronous Communication Progress For Mpi Without Dedicated Resources | 0 | 0.34 | 2018 |
| Cooperative rendezvous protocols for improved performance and overlap. | 0 | 0.34 | 2018 |
| Two new results about quantum exact learning. | 2 | 0.36 | 2018 |
| Improved Bounds on Fourier Entropy and Min-entropy | 0 | 0.34 | 2018 |
| SALaR: Scalable and Adaptive Designs for Large Message Reduction Collectives | 1 | 0.35 | 2018 |
| Property Testing of Joint Distributions using Conditional Samples. | 1 | 0.36 | 2018 |
| Designing Efficient Shared Address Space Reduction Collectives For Multi-/Many-Cores | 0 | 0.34 | 2018 |
| Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. | 0 | 0.34 | 2018 |
| Scalable reduction collectives with data partitioning-based multi-leader design | 7 | 0.52 | 2017 |
| Contention-Aware Kernel-Assisted MPI Collectives for Multi-/Many-Core Systems | 3 | 0.39 | 2017 |
| SHMEMPMI -- Shared Memory Based PMI for Improved Performance and Scalability | 0 | 0.34 | 2016 |
| Testing whether the uniform distribution is a stationary distribution. | 0 | 0.34 | 2016 |
| Slurm-V: Extending Slurm for Building Efficient HPC Cloud with SR-IOV and IVShmem. | 3 | 0.43 | 2016 |
| Upper Bounds on Fourier Entropy. | 0 | 0.34 | 2015 |
| Designing Non-Blocking Personalized Collectives With Near Perfect Overlap For Rdma-Enabled Clusters | 5 | 0.44 | 2015 |
| On-demand Connection Management for OpenSHMEM and OpenSHMEM+MPI | 1 | 0.36 | 2015 |
| Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees. | 4 | 0.45 | 2014 |
| Designing MPI Library with Dynamic Connected Transport DCT of InfiniBand: Early Experiences | 10 | 0.64 | 2014 |
| Helly-Type Theorems in Property Testing. | 0 | 0.34 | 2014 |
| Nearly Tight Bounds for Testing Function Isomorphism. | 2 | 0.38 | 2013 |
| Counting Popular Matchings in House Allocation Problems. | 1 | 0.37 | 2013 |
| Testing Uniformity of Stationary Distribution | 0 | 0.34 | 2013 |
| Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching | 9 | 0.67 | 2012 |
| On the power of conditional samples in distribution testing | 6 | 0.51 | 2012 |
| Improved competitive ratio for the matroid secretary problem | 19 | 1.05 | 2012 |
| Query Complexity Lower Bounds for Reconstruction of Codes. | 1 | 0.38 | 2011 |
