Skip to content
GraphTheory.in
h-index
17

via OpenAlex

Citations
1,533

via OpenAlex

Publications
129

About

Nikhil Karamchandani is a researcher at Indian Institute of Technology Guwahati. With a publication span from 2005 to 2019, he has focused on understanding the properties and behaviors of complex networks. His works explore topics such as random geometric graph models, clustering in exponential random networks, stochastic approximation algorithms for rumor source inference, and persistence in random growing trees.

Research areas

  • Computer science
  • Computer network
  • Mathematics
  • Algorithm
  • Statistics

Publications (129)

Sorted by most cited.

  1. Hierarchical Coded Caching

    2016

    View DOI
    268 cites
  2. Secure State Estimation Against Sensor Attacks in the Presence of Noise

    2016

    View DOI
    147 cites
  3. Network Coding for Computing: Cut-Set Bounds

    2011

    View DOI
    118 cites
  4. Content caching and delivery over heterogeneous wireless networks

    2015

    View DOI
    105 cites
  5. Rumor source detection under probabilistic sampling

    2013

    View DOI
    74 cites
  6. Rate-Memory Trade-off for Multi-Access Coded Caching With Uncoded Placement

    2020

    View DOI
    61 cites
  7. Effect of number of users in multi-level coded caching

    2015

    View DOI
    51 cites
  8. Hierarchical Coded Caching

    2014

    View DOI
    30 cites
  9. Coded Caching for Heterogeneous Wireless Networks with Multi-level Access.

    2014

    24 cites
  10. Network coding for computing

    2008

    View DOI
    22 cites
  11. Temporally Agnostic Rumor-Source Detection

    2017

    View DOI
    20 cites
  12. Secure state estimation and control using multiple (insecure) observers

    2014

    View DOI
    19 cites
  13. Time and Energy Complexity of Function Computation Over Networks

    2011

    View DOI
    19 cites
  14. On the Exact Rate-Memory Trade-off for Multi-access Coded Caching with Uncoded Placement

    2018

    View DOI
    18 cites
  15. Private Index Coding

    2018

    View DOI
    18 cites
  16. Towards a Distributed Caching Service at the WiFi Edge Using Wi-Cache

    2021

    View DOI
    16 cites
  17. Computation over Mismatched Channels

    2013

    View DOI
    16 cites
  18. Evolving Random Geometric Graph Models for Mobile Wireless Networks

    2006

    View DOI
    16 cites
  19. Network computing capacity for the reverse butterfly network

    2009

    View DOI
    15 cites
  20. Structured Index Coding Problems and Multi-access Coded Caching

    2021

    View DOI
    14 cites
  21. Function Computation over Linear Channels

    2010

    View DOI
    14 cites
  22. Multi-level Coded Caching

    2014

    13 cites
  23. Cooperation in multi-access networks via coalitional game theory

    2011

    View DOI
    13 cites
  24. On Renting Edge Resources for Service Hosting

    2021

    View DOI
    12 cites
  25. On the Clustering Properties of Exponential Random Networks

    2005

    View DOI
    12 cites
  26. Effects of storage heterogeneity in distributed cache systems

    2018

    View DOI
    10 cites
  27. Flag Manifold-Based Precoder Interpolation Techniques for MIMO-OFDM Systems

    2021

    View DOI
    9 cites
  28. Rate-Memory Trade-off for Multi-access Coded Caching with Uncoded Placement

    2019

    View DOI
    8 cites
  29. Stochastic approximation algorithms for rumor source inference on graphs

    2019

    View DOI
    8 cites
  30. Coded Caching for Multi-level Popularity and Access

    2017

    View DOI
    8 cites
  31. Rate and delay for coded caching with carrier aggregation

    2016

    View DOI
    8 cites
  32. Partial Service Caching at the Edge

    2020

    7 cites
  33. Content replication in large distributed caches

    2017

    View DOI
    7 cites
  34. Secure state estimation: Optimal guarantees against sensor attacks in the presence of noise

    2015

    View DOI
    7 cites
  35. Function computation via subspace coding

    2010

    View DOI
    7 cites
  36. Network Coding for Computing Part I : Cut-Set Bounds

    2009

    7 cites
  37. Structured Index Coding Problem and Multi-Access Coded Caching

    2021

    View DOI
    6 cites
  38. Wi-cache: Towards an SDN based distributed content caching system in WLAN

    2018

    View DOI
    6 cites
  39. Caching with partial matching under Zipf demands

    2017

    View DOI
    6 cites
  40. Fundamental limits of secretive coded caching

    2016

    View DOI
    6 cites
  41. On Gradient Coding With Partial Recovery

    2022

    View DOI
    5 cites
  42. Greedy $k$-Center From Noisy Distance Samples

    2022

    View DOI
    5 cites
  43. On Index Coded Video Delivery at the WiFi Edge: Performance and System Design

    2021

    View DOI
    5 cites
  44. Distributed computation of symmetric functions with binary inputs

    2009

    View DOI
    5 cites
  45. Online Partial Service Hosting at the Edge

    2023

    View DOI
    4 cites
  46. Regret-Optimal Online Caching for Adversarial and Stochastic Arrivals

    2023

    View DOI
    4 cites
  47. Fundamental Limits of Demand-Private Coded Caching

    2022

    View DOI
    4 cites
  48. Maintaining Ferment

    2019

    View DOI
    4 cites
  49. Top-m Clustering with a Noisy Oracle

    2019

    View DOI
    4 cites
  50. Resource pooling in large-scale content delivery systems

    2017

    View DOI
    4 cites
  51. Renting Edge Computing Resources for Service Hosting

    2023

    View DOI
    3 cites
  52. An SDN Based Content Cache at the WiFi Edge

    2018

    View DOI
    3 cites
  53. Agile Broadcast Services: Addressing the Wireless Spectrum Crunch via Coalitional Game Theory

    2014

    View DOI
    3 cites
  54. Function computation via subspace coding

    2012

    View DOI
    3 cites
  55. Renting Edge Computing Resources for Service Hosting

    2022

    View DOI
    2 cites
  56. On the Optimal Transmission Rate for Symmetric Index Coding Problems

    2021

    View DOI
    2 cites
  57. Improved Memory-Rate Trade-off for Caching with Demand Privacy

    2021

    View DOI
    2 cites
  58. Online Caching and Coding at the WiFi Edge: Gains and Tradeoffs

    2020

    View DOI
    2 cites
  59. Resource Pooling in Large-Scale Content Delivery Systems

    2019

    View DOI
    2 cites
  60. Linear Codes, Target Function Classes, and Network Computing Capacity

    2013

    View DOI
    2 cites
  61. Function computation over linear channels

    2012

    2 cites
  62. Network coding for computing: Linear codes

    2011

    2 cites
  63. Scaling laws for delay-sensitive traffic in Rayleigh fading networks

    2008

    View DOI
    2 cites
  64. Representative Arm Identification: A fixed confidence approach to identify cluster representatives

    2025

    View DOI
    1 cites
  65. On the Regret of Online Coded Caching

    2024

    View DOI
    1 cites
  66. On Distributed Multi-User Secret Sharing with Multiple Secrets per User

    2024

    View DOI
    1 cites
  67. On Distributed Multi-User Secret Sharing with Multiple Secrets per User

    2023

    View DOI
    1 cites
  68. On the Regret of Online Coded Caching

    2023

    View DOI
    1 cites
  69. On the Regret of Online Edge Service Hosting

    2022

    View DOI
    1 cites
  70. A Wireless Intrusion Detection System for 802.11 WPA3 Networks

    2022

    View DOI
    1 cites
  71. Private Index Coding

    2021

    View DOI
    1 cites
  72. Greedy $k$-Center from Noisy Distance Samples

    2021

    View DOI
    1 cites
  73. Query Complexity of Heavy Hitter Estimation

    2021

    View DOI
    1 cites
  74. Online Service Policies for Content Delivery

    2020

    View DOI
    1 cites
  75. RetroRenting: An Online Policy for Service Caching at the Edge

    2019

    View DOI
    1 cites
  76. Maintaining Ferment: On Opinion Control Over Social Networks

    2019

    View DOI
    1 cites
  77. TopK Ordering on Distributed Systems

    2018

    View DOI
    1 cites
  78. Coded caching with partial adaptive matching

    2017

    View DOI
    1 cites
  79. Linear coding for network computing

    2011

    View DOI
    1 cites
  80. Distributed function computation in networks: A joint delay-energy perspective

    2011

    View DOI
    1 cites
  81. Scaling Laws for Delay Sensitive Traffic in Rayleigh Fading Networks

    2007

    View DOI
    1 cites
  82. Cost-Aware Best Arm Identification via Dueling Feedback with Applications to Large Language Models

    2026

    View DOI
    0 cites
  83. Small-Error Cascaded Group Testing

    2026

    0 cites
  84. Cascading Bandits with Feedback

    2025

    View DOI
    0 cites
  85. Observation-Free Attacks on Online Learning to Rank

    2025

    View DOI
    0 cites
  86. Byzantine-Resilient Distributed Computation via Task Replication and Local Computations

    2025

    View DOI
    0 cites
  87. Near Optimal Best Arm Identification for Clustered Bandits

    2025

    View DOI
    0 cites
  88. On the Asymptotic Optimality of Confidence Interval Based Algorithms for Fixed Confidence MABs

    2025

    View DOI
    0 cites
  89. Efficient Regret-Optimal Online Caching

    2025

    View DOI
    0 cites
  90. Regret-Optimal Policies for Rental Caches

    2025

    View DOI
    0 cites
  91. On the Regret of Coded Caching with Adversarial Requests

    2024

    View DOI
    0 cites
  92. Representative Arm Identification: A fixed confidence approach to identify cluster representatives

    2024

    View DOI
    0 cites
  93. Optimal Stopping Rules for Best Arm Identification in Stochastic Bandits under Uniform Sampling

    2024

    View DOI
    0 cites
  94. Cascaded Group Testing

    2024

    View DOI
    0 cites
  95. Fixed confidence community mode estimation

    2024

    View DOI
    0 cites
  96. Fixed confidence community mode estimation

    2023

    View DOI
    0 cites
  97. Best Arm Identification in Bandits with Limited Precision Sampling

    2023

    View DOI
    0 cites
  98. Multi-access Coded Caching with Linear Subpacketization

    2023

    View DOI
    0 cites
  99. ICQ: A Quantization Scheme for Best-Arm Identification Over Bit-Constrained Channels

    2023

    View DOI
    0 cites
  100. On the Regret of Online Edge Service Hosting

    2023

    View DOI
    0 cites
  101. Regret-Optimal Online Caching for Adversarial and Stochastic Arrivals

    2022

    View DOI
    0 cites
  102. Best Arm Identification in Sample-path Correlated Bandits

    2022

    View DOI
    0 cites
  103. Sequential community mode estimation

    2022

    View DOI
    0 cites
  104. Sequential Community Mode Estimation

    2021

    View DOI
    0 cites
  105. Multi-source TCP (MSTCP): A transport protocol for distributed content delivery

    2021

    View DOI
    0 cites
  106. ICCCN 2021 Technical Program

    2021

    View DOI
    0 cites
  107. Query Complexity of k-NN based Mode Estimation

    2021

    View DOI
    0 cites
  108. Online Partial Service Hosting at the Edge

    2021

    View DOI
    0 cites
  109. On Gradient Coding with Partial Recovery

    2021

    View DOI
    0 cites
  110. Greedy k-Center from Noisy Distance Samples

    2020

    View DOI
    0 cites
  111. Index Coding at the WiFi Edge: An Implementation Study for Video\n Delivery

    2020

    View DOI
    0 cites
  112. Index Coding at the WiFi Edge: An Implementation Study for Video Delivery

    2020

    View DOI
    0 cites
  113. Coded Caching for Heterogeneous Wireless Networks

    2020

    View DOI
    0 cites
  114. Sequential Mode Estimation with Oracle Queries

    2020

    View DOI
    0 cites
  115. Jordan centre in random trees: persistence and distance to root

    2019

    View DOI
    0 cites
  116. Coded Caching: Global vs Local Content Popularity

    2019

    View DOI
    0 cites
  117. Storage Policies for a Two-Cache System

    2019

    View DOI
    0 cites
  118. Learning Recommendations While Influencing Interests

    2018

    View DOI
    0 cites
  119. Persistence of the Jordan Center in Random Growing Trees

    2018

    View DOI
    0 cites
  120. Caching With Partial Adaptive Matching

    2018

    View DOI
    0 cites
  121. Session details: Topics in Edge Computing

    2018

    View DOI
    0 cites
  122. MCMC Approaches to Rumor Source Inference using Pairwise Information

    2017

    View DOI
    0 cites
  123. Private Coded Caching

    2017

    View DOI
    0 cites
  124. Randomized Kaczmarz for rank aggregation from pairwise comparisons

    2016

    View DOI
    0 cites
  125. Secretive Coded Caching

    2016

    0 cites
  126. Coded caching in hybrid networks

    2016

    View DOI
    0 cites
  127. Secure State Estimation: Optimal Guarantees against Sensor Attacks in\n the Presence of Noise

    2015

    View DOI
    0 cites
  128. Computation over Mismatched Channels

    2012

    View DOI
    0 cites
  129. Network computing: limits and achievability

    2011

    0 cites