default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAyalvadi J. Ganesh
Person information
- affiliation: University of Bristol, School of Mathematics, United Kingdom
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j30]Conor J. Newton
, Ayalvadi Ganesh, Henry W. J. Reeve:
Asymptotic Optimality for Decentralised Bandits. Dyn. Games Appl. 13(1): 307-325 (2023)- [j29]Mark A. Graham, Ayalvadi J. Ganesh, Robert J. Piechocki:
Low Latency Allcast Over Broadcast Erasure Channels. IEEE Trans. Inf. Theory 69(3): 1604-1617 (2023) - [c29]Abia Amin, Ayalvadi Ganesh, Robert J. Piechocki:
A Novel Intrusion Detection Scheme Using Variational Autoencoders. ISNCC 2023: 1-7 - 2022
- [j28]Conor Newton, Ayalvadi Ganesh, Henry W. J. Reeve:
Asymptotic Optimality for Decentralised Bandits. SIGMETRICS Perform. Evaluation Rev. 49(2): 51-53 (2022) - [i10]Ayalvadi Ganesh, Arpan Mukhopadhyay:
A Model of Job Parallelism for Latency Reduction in Large-Scale Systems. CoRR abs/2203.08614 (2022) - 2021
- [j27]Yuchen Duan, Ayalvadi Ganesh:
The proportion of the population never hearing a rumour. Queueing Syst. Theory Appl. 99(3-4): 231-241 (2021) - [i9]Mark A. Graham, Ayalvadi J. Ganesh, Robert J. Piechocki:
Low latency allcast over broadcast erasure channels. CoRR abs/2107.10695 (2021) - [i8]Conor Newton, Ayalvadi Ganesh, Henry W. J. Reeve:
Asymptotic Optimality for Decentralised Bandits. CoRR abs/2109.09427 (2021) - 2020
- [c28]Ronshee Chawla, Abishek Sankararaman, Ayalvadi Ganesh, Sanjay Shakkottai:
The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits. AISTATS 2020: 3471-3481 - [c27]Abishek Sankararaman, Ayalvadi Ganesh, Sanjay Shakkottai:
Social Learning in Multi Agent Multi Armed Bandits. SIGMETRICS (Abstracts) 2020: 29-30 - [i7]Ronshee Chawla, Abishek Sankararaman, Ayalvadi Ganesh, Sanjay Shakkottai:
The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits. CoRR abs/2001.05452 (2020)
2010 – 2019
- 2019
- [j26]Abishek Sankararaman, Ayalvadi Ganesh, Sanjay Shakkottai:
Social Learning in Multi Agent Multi Armed Bandits. Proc. ACM Meas. Anal. Comput. Syst. 3(3): 53:1-53:35 (2019) - [c26]Mark A. Graham, Ayalvadi Ganesh, Robert J. Piechocki:
Sparse Random Linear Network Coding For Low Latency Allcast. Allerton 2019: 560-564 - [c25]Fengming Cao, Ziming Zhu, Mahesh Sooriyabandara, Zhong Fan, Ayalvadi Ganesh, Simon Armour:
Performance Analysis and Optimization of Cooperative Caching in Cellular Networks. EW 2019: 1-7 - [c24]Mark A. Graham, Ayalvadi Ganesh, Robert J. Piechocki:
Fountain Coding Enabled Data Dissemination for Connected and Automated Vehicles. VTC Spring 2019: 1-5 - [c23]A. Davidson, Ayalvadi Ganesh:
The Robot Crawler Model on Complete k-Partite and Erdős-Rényi Random Graphs. WAW 2019: 57-70 - [i6]Abishek Sankararaman, Ayalvadi Ganesh, Sanjay Shakkottai:
Social Learning in Multi Agent Multi Armed Bandits. CoRR abs/1910.02100 (2019) - 2018
- [j25]Thomas Bonald, Ayalvadi Ganesh:
Introduction to special issue: ACM SIGMETRICS 2016. Queueing Syst. Theory Appl. 88(3-4): 205-206 (2018) - 2017
- [j24]A. Davidson, Ayalvadi Ganesh:
Maximal Steiner Trees in the Stochastic Mean-Field Model of Distance. Comb. Probab. Comput. 26(6): 826-838 (2017) - [c22]Joseph Hollinghurst, Ayalvadi Ganesh, Timothy Baugé:
Latency Reduction In Communication Networks Using Redundant Messages. ITC 2017: 241-249 - 2016
- [j23]Ayalvadi Ganesh, Florian Simatos:
Introduction - Special Issue: ACM SIGMETRICS 2015. Queueing Syst. Theory Appl. 83(3-4): 193-194 (2016) - [c21]Fengming Cao, Zhenzhe Zhong, Zhong Fan, Mahesh Sooriyabandara, Simon Armour, Ayalvadi Ganesh:
User association for load balancing with uneven user distribution in IEEE 802.11ax networks. CCNC 2016: 487-490 - 2015
- [c20]Fengming Cao, Ayalvadi Ganesh, Simon Armour, Mahesh Sooriyabandara:
On the distribution and mean of received power in stochastic cellular network. Allerton 2015: 1166-1173 - [c19]Fengming Cao, Ayalvadi Ganesh, Simon Armour, Mahesh Sooriyabandara:
Performance analysis of coordinated transmission for stochastic cellular network. PIMRC 2015: 1729-1733 - 2014
- [j22]James R. Cruise, Ayalvadi Ganesh:
Probabilistic consensus via polling and majority rules. Queueing Syst. Theory Appl. 78(2): 99-120 (2014) - [i5]Tejas Bodas, Ayalvadi Ganesh, D. Manjunath:
Tolls and Welfare Optimization for Multiclass Traffic in Multiqueue Systems. CoRR abs/1409.7195 (2014) - 2013
- [c18]B. Santhana Krishnan, Ayalvadi Ganesh, D. Manjunath:
On connectivity thresholds in superposition of random key graphs on random geometric graphs. ISIT 2013: 2389-2393 - [i4]B. Santhana Krishnan, Ayalvadi Ganesh, D. Manjunath:
On Connectivity Thresholds in Superposition of Random Key Graphs on Random Geometric Graphs. CoRR abs/1301.6422 (2013) - [i3]James R. Cruise, Ayalvadi Ganesh:
Probabilistic consensus via polling and majority rules. CoRR abs/1311.4805 (2013) - 2012
- [j21]Ayalvadi Ganesh, Sarah Lilienthal, D. Manjunath, Alexandre Proutière, Florian Simatos:
Load balancing via random local search in closed and open systems. Queueing Syst. Theory Appl. 71(3): 321-345 (2012) - 2011
- [j20]Moez Draief, Ayalvadi J. Ganesh:
A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents. Discret. Event Dyn. Syst. 21(1): 41-61 (2011) - [c17]Tejas Bodas, Ayalvadi Ganesh, D. Manjunath:
Load balancing and routing games with admission price. CDC/ECC 2011: 249-254 - [i2]Oliver Johnson, Dino Sejdinovic, James R. Cruise, Ayalvadi Ganesh, Robert J. Piechocki:
Non-parametric change-point detection using string matching algorithms. CoRR abs/1106.5714 (2011) - 2010
- [j19]Christian Borgs, Jennifer T. Chayes, Ayalvadi Ganesh, Amin Saberi:
How to distribute antidote to control epidemics. Random Struct. Algorithms 37(2): 204-222 (2010) - [c16]Ayalvadi Ganesh, Sarah Lilienthal, D. Manjunath, Alexandre Proutière, Florian Simatos:
Load balancing via random local search in closed and open systems. SIGMETRICS 2010: 287-298 - [i1]Ayalvadi Ganesh, Sarah Lilienthal, D. Manjunath, Alexandre Proutière, Florian Simatos:
Load Balancing via Random Local Search in Closed and Open systems. CoRR abs/1002.4314 (2010)
2000 – 2009
- 2009
- [j18]Gaurav Sharma, Ayalvadi J. Ganesh, Peter B. Key:
Performance Analysis of Contention Based Medium Access Control Protocols. IEEE Trans. Inf. Theory 55(4): 1665-1682 (2009) - [c15]Ayalvadi Ganesh, Moez Draief:
A random walk model for infection on graphs. VALUETOOLS 2009: 34 - 2008
- [j17]Ayalvadi J. Ganesh, Giovanni Luca Torrisi:
Large Deviations of the Interference in a Wireless Communication Model. IEEE Trans. Inf. Theory 54(8): 3505-3517 (2008) - [j16]Milan Vojnovic, Ayalvadi J. Ganesh:
On the race of worms, alerts, and patches. IEEE/ACM Trans. Netw. 16(5): 1066-1079 (2008) - 2007
- [j15]Ayalvadi J. Ganesh, Anne-Marie Kermarrec, Erwan Le Merrer, Laurent Massoulié:
Peer counting and sampling in overlay networks based on random walks. Distributed Comput. 20(4): 267-278 (2007) - [j14]Ken Duffy, Ayalvadi J. Ganesh:
Modeling the Impact of Buffering on 802.11. IEEE Commun. Lett. 11(2): 219-221 (2007) - [j13]Ayalvadi J. Ganesh, Koenraad Laevens, Richard Steinberg:
Congestion Pricing and Noncooperative Games in Communication Networks. Oper. Res. 55(3): 430-438 (2007) - [j12]Ayalvadi J. Ganesh, Claudio Macci, Giovanni Luca Torrisi:
A class of risk processes with reserve-dependent premium rate: sample path large deviations and importance sampling. Queueing Syst. Theory Appl. 55(2): 83-94 (2007) - [c14]Ayalvadi J. Ganesh, Giovanni Luca Torrisi:
Large deviations of the interference in a wireless communication model. WiOpt 2007: 1-6 - 2006
- [j11]Ayalvadi J. Ganesh, Peter B. Key, Damien Polis, R. Srikant:
Congestion notification and probing mechanisms for endpoint admission control. IEEE/ACM Trans. Netw. 14(3): 568-578 (2006) - [j10]Indranil Gupta, Anne-Marie Kermarrec, Ayalvadi J. Ganesh:
Efficient and Adaptive Epidemic-Style Protocols for Reliable and Scalable Multicast. IEEE Trans. Parallel Distributed Syst. 17(7): 593-605 (2006) - [c13]Ayalvadi J. Ganesh, Dinan Gunawardena, Peter B. Key, Laurent Massoulié, Jacob Scott:
Efficient Quarantining of Scanning Worms: Optimal Detection and Coordination. INFOCOM 2006 - [c12]Gaurav Sharma, Ayalvadi J. Ganesh, Peter B. Key:
Performance Analysis of Contention Based Medium Access Control Protocols. INFOCOM 2006 - [c11]Laurent Massoulié, Erwan Le Merrer, Anne-Marie Kermarrec, Ayalvadi J. Ganesh:
Peer counting and sampling in overlay networks: random walk methods. PODC 2006: 123-132 - [c10]Moez Draief, Ayalvadi J. Ganesh, Laurent Massoulié:
Thresholds for virus spread on networks. VALUETOOLS 2006: 51 - 2005
- [j9]Supratim Deb, Ayalvadi J. Ganesh, Peter B. Key:
Resource allocation between persistent and transient flows. IEEE/ACM Trans. Netw. 13(2): 302-315 (2005) - [c9]Ayalvadi J. Ganesh, Laurent Massoulié, Donald F. Towsley:
The effect of network topology on the spread of epidemics. INFOCOM 2005: 1455-1466 - [c8]Milan Vojnovic, Ayalvadi J. Ganesh:
On the effectiveness of automatic patching. WORM 2005: 41-50 - 2004
- [b1]Ayalvadi J. Ganesh, Neil O'Connell, Damon Wischik:
Big queues. Lecture notes in mathematics 1838, Springer 2004, ISBN 978-3-540-20912-6, pp. I-XI, 1-254 - 2003
- [j8]Ayalvadi J. Ganesh, Anne-Marie Kermarrec, Laurent Massoulié:
Peer-to-Peer Membership Management for Gossip-Based Protocols. IEEE Trans. Computers 52(2): 139-149 (2003) - [j7]Anne-Marie Kermarrec, Laurent Massoulié, Ayalvadi J. Ganesh:
Probabilistic Reliable Dissemination in Large-Scale Systems. IEEE Trans. Parallel Distributed Syst. 14(3): 248-258 (2003) - [c7]Laurent Massoulié, Anne-Marie Kermarrec, Ayalvadi J. Ganesh:
Network Awareness and Failure Resilience in Self-Organising Overlay Networks. SRDS 2003: 47-55 - 2002
- [j6]Dudley Stark, Ayalvadi Ganesh, Neil O'Connell:
Information Loss In Riffle Shuffling. Comb. Probab. Comput. 11(1): 79-95 (2002) - [c6]Supratim Deb, Ayalvadi J. Ganesh, Peter B. Key:
Resource Allocation with Persistent and Transient Flows. NETWORKING 2002: 455-466 - [c5]Miguel Castro, Peter Druschel, Ayalvadi J. Ganesh, Antony I. T. Rowstron, Dan S. Wallach:
Secure Routing for Structured Peer-to-Peer Overlay Networks. OSDI 2002 - [c4]Ayalvadi J. Ganesh, Anne-Marie Kermarrec, Laurent Massoulié:
HiScamp: self-organizing hierarchical membership protocol. ACM SIGOPS European Workshop 2002: 133-139 - [c3]Indranil Gupta, Anne-Marie Kermarrec, Ayalvadi J. Ganesh:
Efficient Epidemic-Style Protocols for Reliable and Scalable Multicast. SRDS 2002: 180-189 - 2001
- [c2]Ayalvadi J. Ganesh, Koenraad Laevens, Richard Steinberg:
Congestion Pricing and User Adaptation. INFOCOM 2001: 959-965 - [c1]Ayalvadi J. Ganesh, Anne-Marie Kermarrec, Laurent Massoulié:
SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication. Networked Group Communication 2001: 44-55
1990 – 1999
- 1998
- [j5]Ayalvadi J. Ganesh:
Large deviations of the sojourn time for queues in series. Ann. Oper. Res. 79: 3-26 (1998) - [j4]Ayalvadi J. Ganesh, Peter Green, Neil O'Connell, Susan Pitts:
Bayesian network management. Queueing Syst. Theory Appl. 28(1-3): 267-282 (1998) - 1996
- [j3]Ayalvadi J. Ganesh:
Bias Correction in Effective Bandwidth Estimation. Perform. Evaluation 27/28(4): 319-330 (1996) - [j2]Ayalvadi J. Ganesh, Venkat Anantharam:
Stationary Tail Probabilities in Exponential Server Tandems with Renewal Arrivals. Queueing Syst. Theory Appl. 22(3-4): 203-247 (1996) - 1994
- [j1]Venkat Anantharam, Ayalvadi J. Ganesh:
Correctness within a constant of an optimal buffer allocation rule of thumb. IEEE Trans. Inf. Theory 40(3): 871-882 (1994)
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-10-07 22:10 CEST 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:
