Himanshu Tyagi

Orcid: 0000-0003-2950-706X

Affiliations:
  • Indian Institute of Science, Bengaluru, India


According to our database1, Himanshu Tyagi authored at least 97 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Wyner-Ziv Estimators for Distributed Mean Estimation With Side Information and Optimization.
IEEE Trans. Inf. Theory, April, 2024

Optimal Rates for Nonparametric Density Estimation Under Communication Constraints.
IEEE Trans. Inf. Theory, 2024

Continual Mean Estimation Under User-Level Privacy.
IEEE J. Sel. Areas Inf. Theory, 2024

OML: Open, Monetizable, and Loyal AI.
IACR Cryptol. ePrint Arch., 2024

BFT-PoLoc: A Byzantine Fortified Trigonometric Proof of Location Protocol using Internet Delays.
CoRR, 2024

Proof of Diligence: Cryptoeconomic Security for Rollups.
CoRR, 2024

Proof of Backhaul: Trustfree Measurement of Broadband Bandwidth.
Proceedings of the 31st Annual Network and Distributed System Security Symposium, 2024

Proof of Diligence: Cryptoeconomic Security for Rollups.
Proceedings of the 6th Conference on Advances in Financial Technologies, 2024

2023
Comparative study of modelling flows in porous media for engineering applications using finite volume and artificial neural network methods.
Eng. Comput., December, 2023

SAKSHI: Decentralized AI Platforms.
CoRR, 2023

Unified Lower Bounds for Interactive High-dimensional Estimation under Information Constraints.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Rate Adaptation For Low Latency Real-Time Video Streaming.
Proceedings of the 28th National Conference on Communications, 2023

WiROS: A QoS Software Solution for ros2 in a WiFi Network.
Proceedings of the 15th International Conference on COMmunication Systems & NETworkS, 2023

2022
Multiple Support Recovery Using Very Few Measurements Per Sample.
IEEE Trans. Signal Process., 2022

Anomaly-Aware Adaptive Sampling for Electrical Signal Compression.
IEEE Trans. Smart Grid, 2022

Interactive Inference Under Information Constraints.
IEEE Trans. Inf. Theory, 2022

Fundamental Limits of Over-the-Air Optimization: Are Analog Schemes Optimal?
IEEE J. Sel. Areas Inf. Theory, 2022

Wyner-Ziv compression is (almost) optimal for distributed optimization.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Trust-free service measurement and payments for decentralized cellular networks.
Proceedings of the 21st ACM Workshop on Hot Topics in Networks, 2022

Tele-driving an electric vehicle over a private LTE network.
Proceedings of the 14th International Conference on COMmunication Systems & NETworkS, 2022

The Role of Interactivity in Structured Estimation.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Communication Complexity of Distributed High Dimensional Correlation Testing.
IEEE Trans. Inf. Theory, 2021

Sample-Measurement Tradeoff in Support Recovery Under a Subgaussian Prior.
IEEE Trans. Inf. Theory, 2021

RATQ: A Universal Fixed-Length Quantizer for Stochastic Optimization.
IEEE Trans. Inf. Theory, 2021

Open-Source Heterogeneous Constrained Edge-Computing Platform for Smart Grid Measurements.
IEEE Trans. Instrum. Meas., 2021

Inference Under Information Constraints III: Local Privacy Constraints.
IEEE J. Sel. Areas Inf. Theory, 2021

Tracking an Auto-Regressive Process with Limited Communication per Unit Time.
Entropy, 2021

Phase Transition for Support Recovery from Gaussian Linear Measurements.
CoRR, 2021

Information-constrained optimization: can adaptive processing of gradients help?
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Distributed Estimation with Multiple Samples per User: Sharp Rates and Phase Transition.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Phase Transitions for Support Recovery from Gaussian Linear Measurements.
Proceedings of the IEEE International Symposium on Information Theory, 2021


Network Emulation For Tele-driving Application Development.
Proceedings of the 13th International Conference on COMmunication Systems & NETworkS, 2021

Wyner-Ziv Estimators: Efficient Distributed Mean Estimation with Side-Information.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Strong Converse Using Change of Measure Arguments.
IEEE Trans. Inf. Theory, 2020

Communication for Generating Correlation: A Unifying Survey.
IEEE Trans. Inf. Theory, 2020

Optimal Source Codes for Timely Updates.
IEEE Trans. Inf. Theory, 2020

Inference Under Information Constraints II: Communication Constraints and Shared Randomness.
IEEE Trans. Inf. Theory, 2020

Inference Under Information Constraints I: Lower Bounds From Chi-Square Contraction.
IEEE Trans. Inf. Theory, 2020

A Distributed Hierarchy Framework for Enhancing Cyber Security of Control Center Applications.
CoRR, 2020

How Reliable are Test Numbers for Revealing the COVID-19 Ground Truth and Applying Interventions?
CoRR, 2020

On the Latency in Vehicular Control using Video Streaming over Wi-Fi.
Proceedings of the 2020 National Conference on Communications, 2020

Universal interactive Gaussian quantization with side information.
Proceedings of the IEEE Information Theory Workshop, 2020

Limits on Gradient Compression for Stochastic Optimization.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Tracking an Auto-Regressive Process with Limited Communication.
Proceedings of the IEEE International Symposium on Information Theory, 2020

CORNET: A Co-Simulation Middleware for Robot Networks.
Proceedings of the 2020 International Conference on COMmunication Systems & NETworkS, 2020

Distributed Signal Detection under Communication Constraints.
Proceedings of the Conference on Learning Theory, 2020

2019
A New Proof of Nonsignalling Multiprover Parallel Repetition Theorem.
Electron. Colloquium Comput. Complex., 2019

Domain Compression and its Application to Randomness-Optimal Distributed Goodness-of-Fit.
Electron. Colloquium Comput. Complex., 2019

Finite Precision Stochastic Optimization - Accounting for the Bias.
CoRR, 2019

Communication for Generating Correlation: A Survey.
CoRR, 2019

Practical Universal Data Exchange using Polar Codes.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Communication-Constrained Inference and the Role of Shared Randomness.
Proceedings of the 36th International Conference on Machine Learning, 2019

Fault-Aware Compression for High Sampling Rate Data Acquisition in Smart Grids.
Proceedings of the Tenth ACM International Conference on Future Energy Systems, 2019

Inference under Information Constraints: Lower Bounds from Chi-Square Contraction.
Proceedings of the Conference on Learning Theory, 2019

Test without Trust: Optimal Locally Private Distribution Testing.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Interactive Communication for Data Exchange.
IEEE Trans. Inf. Theory, 2018

Distributed Simulation and Distributed Inference.
Electron. Colloquium Comput. Complex., 2018

RT-Polar: An HARQ Scheme with Universally Competitive Rates.
Proceedings of the IEEE Information Theory Workshop, 2018

Extra Samples can Reduce the Communication for Independence Testing.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Optimal Lossless Source Codes for Timely Updates.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Effective Memory Shrinkage in Estimation.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Universal Multiparty Data Exchange and Secret Key Agreement.
IEEE Trans. Inf. Theory, 2017

Estimating Renyi Entropy of Discrete Distributions.
IEEE Trans. Inf. Theory, 2017

Network dynamics in friend recommendation: a study of Indian engineering students.
Int. J. Inf. Technol. Manag., 2017

Coding theorems using Rényi information measures.
Proceedings of the Twenty-third National Conference on Communications, 2017

Optimality of the recursive data exchange protocol.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Secret Key Agreement: General Capacity and Second-Order Asymptotics.
IEEE Trans. Inf. Theory, 2016

Multiterminal Secrecy by Public Discussion.
Found. Trends Commun. Inf. Theory, 2016

Universal multiparty data exchange.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Converses For Secret Key Agreement and Secure Computing.
IEEE Trans. Inf. Theory, 2015

Universal Hashing for Information-Theoretic Security.
Proc. IEEE, 2015

Information Complexity Density and Simulation of Protocols.
Electron. Colloquium Comput. Complex., 2015

The Complexity of Estimating Rényi Entropy.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Gaussian estimation under attack uncertainty.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Impossibility bounds for secure computing.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Common randomness for secure computing.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
A Bound For Multiparty Secret Key Agreement And Implications For A Problem Of Secure Computing.
IACR Cryptol. ePrint Arch., 2014

Semantically-Secure Coding Scheme Achieving the Capacity of a Gaussian Wiretap Channel.
CoRR, 2014

Explicit capacity-achieving coding scheme for the Gaussian wiretap channel.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Strong converse for a degraded wiretap channel via active hypothesis testing.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

Converse results for secrecy generation over channels.
Proceedings of the 48th Asilomar Conference on Signals, Systems and Computers, 2014

2013
Common Randomness Principles of Secrecy.
PhD thesis, 2013

How Many Queries Will Resolve Common Randomness?
IEEE Trans. Inf. Theory, 2013

Common Information and Secret Key Capacity.
IEEE Trans. Inf. Theory, 2013

Distributed Function Computation with Confidentiality.
IEEE J. Sel. Areas Commun., 2013

Secret key capacity for multipleaccess channel with public feedback.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Distributed Function Computation Under Privacy Constraints
CoRR, 2012

Fault-tolerant secret key generation.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Distributed computing with privacy.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
When Is a Function Securely Computable?
IEEE Trans. Inf. Theory, 2011

Minimal public communication for maximum rate secret key generation.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Secure computing.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
The Gelfand-Pinsker channel: Strong converse and upper bound for the reliability function.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Capacity region of a state dependent degraded broadcast channel with noncausal transmitter CSI.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008
A simple criterion on degree sequences of graphs.
Discret. Appl. Math., 2008

2007
Optimal Receiver for MPSK Signaling with Imperfect Channel Estimation.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2007


  Loading...