default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnshoo Tandon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]Ramya Burra, Anshoo Tandon, Srishti Mittal:
Empowering SMPC: Bridging the Gap Between Scalability, Memory Efficiency and Privacy in Neural Network Inference. COMSNETS 2024: 1-6- [c22]Prajjwal Gupta, V Arvind Rameshwar, Anshoo Tandon, Novoneel Chakraborty:
Mean Estimation with User-Level Privacy for Spatio-Temporal IoT Datasets. SPCOM 2024: 1-5 - [i17]V Arvind Rameshwar, Anshoo Tandon, Prajjwal Gupta, Novoneel Chakraborty, Abhay Sharma:
Mean Estimation with User-Level Privacy for Spatio-Temporal IoT Datasets. CoRR abs/2401.15906 (2024) - [i16]V Arvind Rameshwar, Anshoo Tandon:
Improving the Privacy Loss Under User-Level DP Composition for Fixed Estimation Error. CoRR abs/2405.06261 (2024) - [i15]Haritha K, Ramya Burra, Srishti Mittal, Sarthak Sharma, Abhilash Venkatesh, Anshoo Tandon:
Enhancing MOTION2NX for Efficient, Scalable and Secure Image Inference using Convolutional Neural Networks. CoRR abs/2408.16387 (2024) - [i14]V Arvind Rameshwar, Anshoo Tandon, Abhay Sharma:
Optimal Tree-Based Mechanisms for Differentially Private Approximate CDFs. CoRR abs/2409.18573 (2024) - 2023
- [j15]Fengzhuo Zhang
, Anshoo Tandon, Vincent Y. F. Tan:
Active-LATHE: An Active Learning Algorithm for Boosting the Error Exponent for Learning Homogeneous Ising Trees. IEEE Trans. Inf. Theory 69(4): 2537-2555 (2023) - [i13]Ramya Burra, Anshoo Tandon, Srishti Mittal:
Empowering SMPC: Bridging the Gap Between Scalability, Memory Efficiency and Privacy in Neural Network Inference. CoRR abs/2310.10133 (2023) - 2022
- [c21]Fengzhuo Zhang, Anshoo Tandon, Vincent Y. F. Tan:
Active-LATHE: An Active Learning Algorithm for Boosting the Error Exponent for Learning Homogeneous Ising Trees. ITW 2022: 594-599 - 2021
- [j14]Ting-Yi Wu, Anshoo Tandon, Lav R. Varshney, Mehul Motani:
Skip-Sliding Window Codes. IEEE Trans. Commun. 69(5): 2824-2836 (2021) - [j13]Han Mao Kiah, Anshoo Tandon, Mehul Motani:
Generalized Sphere-Packing Bound for Subblock-Constrained Codes. IEEE Trans. Inf. Theory 67(1): 187-199 (2021) - [c20]Anshoo Tandon, Aldric H. J. Han, Vincent Y. F. Tan:
SGA: A Robust Algorithm for Partial Recovery of Tree-Structured Graphical Models with Noisy Samples. ICML 2021: 10107-10117 - [i12]Anshoo Tandon, Aldric H. J. Yuan, Vincent Y. F. Tan:
SGA: A Robust Algorithm for Partial Recovery of Tree-Structured Graphical Models with Noisy Samples. CoRR abs/2101.08917 (2021) - [i11]Fengzhuo Zhang, Anshoo Tandon, Vincent Y. F. Tan:
Active-LATHE: An Active Learning Algorithm for Boosting the Error Exponent for Learning Homogeneous Ising Trees. CoRR abs/2110.14341 (2021) - 2020
- [j12]Utku Tefek, Anshoo Tandon, Teng Joon Lim:
Malicious relay detection using sentinels: A stochastic geometry framework. J. Commun. Networks 22(4): 303-315 (2020) - [j11]Anshoo Tandon, Vincent Y. F. Tan, Shiyao Zhu:
Exact Asymptotics for Learning Tree-Structured Graphical Models With Side Information: Noiseless and Noisy Samples. IEEE J. Sel. Areas Inf. Theory 1(3): 760-776 (2020) - [j10]Ting-Yi Wu, Anshoo Tandon, Mehul Motani, Lav R. Varshney:
Outage-Constrained Rate of Skip-Sliding Window Codes. IEEE Trans. Green Commun. Netw. 4(2): 506-514 (2020) - [j9]Nalam Venkata Abhishek, Anshoo Tandon, Teng Joon Lim, Biplab Sikdar:
A GLRT-Based Mechanism for Detecting Relay Misbehavior in Clustered IoT Networks. IEEE Trans. Inf. Forensics Secur. 15: 435-446 (2020) - [j8]Anshoo Tandon, Vincent Y. F. Tan, Lav R. Varshney:
The Bee-Identification Error Exponent With Absentee Bees. IEEE Trans. Inf. Theory 66(12): 7602-7614 (2020) - [c19]Anshoo Tandon, Vincent Y. F. Tan, Lav R. Varshney:
Bee-Identification Error Exponent with Absentee Bees. ISIT 2020: 2891-2896 - [i10]Anshoo Tandon, Vincent Y. F. Tan, Shiyao Zhu:
Exact Asymptotics for Learning Tree-Structured Graphical Models with Side Information: Noiseless and Noisy Samples. CoRR abs/2005.04354 (2020)
2010 – 2019
- 2019
- [j7]Anshoo Tandon, Teng Joon Lim, Utku Tefek:
Sentinel based malicious relay detection in wireless IoT networks. J. Commun. Networks 21(5): 458-468 (2019) - [j6]Anshoo Tandon, Vincent Y. F. Tan, Lav R. Varshney:
The Bee-Identification Problem: Bounds on the Error Exponent. IEEE Trans. Commun. 67(11): 7405-7416 (2019) - [j5]Anshoo Tandon, Mehul Motani, Lav R. Varshney:
Are Run-Length Limited Codes Suitable for Simultaneous Energy and Information Transfer? IEEE Trans. Green Commun. Netw. 3(4): 988-996 (2019) - [c18]Han Mao Kiah, Anshoo Tandon, Mehul Motani:
Generalized Sphere-Packing Bound for Subblock-Constrained Codes. ISIT 2019: 1737-1741 - [c17]Ting-Yi Wu, Anshoo Tandon, Lav R. Varshney, Mehul Motani:
Multicasting Energy and Information Simultaneously. ISIT 2019: 2494-2498 - [c16]Anshoo Tandon, Vincent Y. F. Tan, Lav R. Varshney:
Random Coding Error Exponent for the Bee-Identification Problem. ITW 2019: 1-5 - [c15]Ting-Yi Wu, Anshoo Tandon, Mehul Motani, Lav R. Varshney:
On the Outage-Constrained Rate of Skip-Sliding Window Codes. ITW 2019: 1-5 - [i9]Han Mao Kiah, Anshoo Tandon, Mehul Motani:
Generalized Sphere-Packing Bound for Subblock-Constrained Codes. CoRR abs/1901.00387 (2019) - [i8]Anshoo Tandon, Vincent Y. F. Tan, Lav R. Varshney:
Error Exponent Bounds for the Bee-Identification Problem. CoRR abs/1905.07868 (2019) - [i7]Anshoo Tandon, Vincent Y. F. Tan, Lav R. Varshney:
On the Bee-Identification Error Exponent with Absentee Bees. CoRR abs/1910.10333 (2019) - 2018
- [j4]Anshoo Tandon, Han Mao Kiah, Mehul Motani:
Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes. IEEE Trans. Inf. Theory 64(10): 6604-6619 (2018) - [c14]Anshoo Tandon, Teng Joon Lim, Utku Tefek:
Sentinel Based Malicious Relay Detection Scheme for Wireless IoT Networks. GLOBECOM Workshops 2018: 1-6 - [c13]Ting-Yi Wu, Anshoo Tandon, Lav R. Varshney, Mehul Motani:
Skip-Sliding Window Codes. ISIT 2018: 1799-1803 - [c12]Anshoo Tandon, Mehul Motani:
On the Sphere Packing Error Exponent for Constant Subblock-Composition Codes. ISITA 2018: 266-270 - [c11]Anshoo Tandon, Han Mao Kiah, Mehul Motani:
Improved Asymptotic Sphere-Packing Bounds for Subblock-Constrained Codes. ISITA 2018: 585-589 - [c10]Nalam Venkata Abhishek, Anshoo Tandon, Teng Joon Lim, Biplab Sikdar:
Detecting Forwarding Misbehavior In Clustered IoT Networks. Q2SWinet@MSWiM 2018: 1-6 - [i6]Ting-Yi Wu, Anshoo Tandon, Lav R. Varshney, Mehul Motani:
Multicasting Energy and Information Simultaneously. CoRR abs/1806.11271 (2018) - [i5]Anshoo Tandon, Mehul Motani, Lav R. Varshney:
Are RLL Codes Suitable for Simultaneous Energy and Information Transfer? CoRR abs/1807.09040 (2018) - 2017
- [j3]Anshoo Tandon, Mehul Motani:
A Cross-Layer Approach to Reducing Packet Delay in Polling-Based Multiuser Systems. IEEE Trans. Veh. Technol. 66(2): 1506-1518 (2017) - [c9]Anshoo Tandon, Han Mao Kiah, Mehul Motani:
Bounds on the asymptotic rate of binary constant subblock-composition codes. ISIT 2017: 704-708 - [c8]Anshoo Tandon, Han Mao Kiah, Mehul Motani:
Binary subblock energy-constrained codes: Bounds on code size and asymptotic rate. ISIT 2017: 1480-1484 - [i4]Anshoo Tandon, Han Mao Kiah, Mehul Motani:
Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes. CoRR abs/1701.04954 (2017) - [i3]Ting-Yi Wu, Anshoo Tandon, Lav R. Varshney, Mehul Motani:
Skip-Sliding Window Codes. CoRR abs/1711.09494 (2017) - 2016
- [j2]Anshoo Tandon, Mehul Motani:
Diphase: Characterizing Packet Delay in Multi-Source Energy Harvesting Systems. IEEE Trans. Commun. 64(9): 3808-3819 (2016) - [j1]Anshoo Tandon, Mehul Motani, Lav R. Varshney:
Subblock-Constrained Codes for Real-Time Simultaneous Energy and Information Transfer. IEEE Trans. Inf. Theory 62(7): 4212-4227 (2016) - [c7]Anshoo Tandon, Mehul Motani, Lav R. Varshney:
Subblock energy-constrained codes for simultaneous energy and information transfer. ISIT 2016: 1969-1973 - 2015
- [c6]Anshoo Tandon, Mehul Motani, Lav R. Varshney:
Real-time simultaneous energy and information transfer. ISIT 2015: 1124-1128 - [i2]Anshoo Tandon, Mehul Motani, Lav R. Varshney:
Subblock-Constrained Codes for Real-Time Simultaneous Energy and Information Transfer. CoRR abs/1506.00213 (2015) - 2014
- [c5]Anshoo Tandon, Mehul Motani, Lav R. Varshney:
On code design for simultaneous energy and information transfer. ITA 2014: 1-6 - [c4]Anshoo Tandon, Mehul Motani, Lav R. Varshney:
Constant subblock composition codes for simultaneous energy and information transfer. SECON Workshops 2014: 45-50 - [c3]Anshoo Tandon, Mehul Motani:
Has green energy arrived? Delay analysis for energy harvesting communication systems. SECON 2014: 582-590 - 2013
- [c2]Anshoo Tandon, Mehul Motani, Vineet Srivastava:
On the impact of channel coding on average packet delay in a multiuser environment. WCNC 2013: 499-504
2000 – 2009
- 2007
- [c1]G. Susinder Rajan, Anshoo Tandon, B. Sundar Rajan:
On Four-Group ML Decodable Distributed Space Time Codes for Cooperative Communication. WCNC 2007: 606-610 - [i1]G. Susinder Rajan, Anshoo Tandon, B. Sundar Rajan:
On Four-group ML Decodable Distributed Space Time Codes for Cooperative Communication. CoRR abs/cs/0701067 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-22 20:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
