Staff profile

Head, NESTiD research group

• Distributed and Network Algorithms, Graph Algorithms, CS Theory, Self-healing and Resilient Algorithms, Game Theory, Network Systems.

• 2014: FHEA (Fellow of the Higher Education Academy):
• 2010: Member, Association of Computing Machinery (ACM):
• 2010: Member, IEEE:

Chapter in book

• Dense Subgraphs on Dynamic Networks
  
  Das Sarma, A., Lall, A., Nanongkai, D., & Trehan, A. (2012). Dense Subgraphs on Dynamic Networks. In M. Aguilera (Ed.), Distributed Computing (pp. 151-165). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-33651-5_11

Conference Paper

• Approximating Optimal Broadcast of Files in a Hose-Model Network
  
  Erlebach, T., Garg, N., Gupta, S., & Trehan, A. (2025). Approximating Optimal Broadcast of Files in a Hose-Model Network. In 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2025 (pp. 30:1-30:19). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2025.30
• Brief Announcement: Amnesiac Flooding: Easy to Break, Difficult to Escape
  
  Austin, H., Gadouleau, M., Mertzios, G., & Trehan, A. (2025). Brief Announcement: Amnesiac Flooding: Easy to Break, Difficult to Escape. In PODC ’25: Proceedings of the ACM Symposium on Principles of Distributed Computing (pp. 541-544). ACM. https://doi.org/10.1145/3732772.3733523
• Automated Artificial Intelligence Framework for Anomaly Detection in Healthcare SD-IoT Networks
  
  Algamdi, H., Aujla, G. S., Singh, A., Jindal, A., & Trehan, A. (2025). Automated Artificial Intelligence Framework for Anomaly Detection in Healthcare SD-IoT Networks. In GLOBECOM 2024 - 2024 IEEE Global Communications Conference (pp. 3503-3508). IEEE. https://doi.org/10.1109/GLOBECOM52923.2024.10901410
• Amnesiac Flooding: Easy to Break, Hard to Escape
  
  Austin, H., Gadouleau, M., Mertzios, G. B., & Trehan, A. (2025). Amnesiac Flooding: Easy to Break, Hard to Escape. In D. R. Kowalski (Ed.), 39th International Symposium on Distributed Computing (DISC 2025). https://doi.org/10.4230/LIPIcs.DISC.2025.10
• Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
  
  Bampis, E., Dogeas, K., Erlebach, T., Megow, N., Schlöter, J., & Trehan, A. (2024). Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024 (pp. 17:1-17:21). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.17
• All You Need are Random Walks: Fast and Simple Distributed Conductance Testing
  
  Batu, T., Trehan, A., & Trehan, C. (2024). All You Need are Random Walks: Fast and Simple Distributed Conductance Testing. In Lecture Notes in Computer Science.
• Intrusion Detection in Critical SD-IoT Ecosystem
  
  Algamdi, H., Aujla, G. S., Jindal, A., & Trehan, A. (2023). Intrusion Detection in Critical SD-IoT Ecosystem. In 2023 IEEE International Conference on Communications Workshops (ICC Workshops) (pp. 1559-1564). IEEE. https://doi.org/10.1109/iccworkshops57953.2023.10283685
• Payment scheduling in the Interval Debt Model
  
  Friedetzky, T., Kutner, D., Mertzios, G., Stewart, I., & Trehan, A. (2023). Payment scheduling in the Interval Debt Model. In Lecture Notes in Computer Science (pp. 267-282). Springer Verlag. https://doi.org/10.1007/978-3-031-23101-8_18
• DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead
  
  Gilbert, S., Pandurangan, G., Robinson, P., & Trehan, A. (2020). DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead. In ACM PODC ’20. Association for Computing Machinery (ACM). https://doi.org/10.1145/3382734.3405716
• On the Termination of Flooding
  
  Hussak, W., & Trehan, A. (2020). On the Termination of Flooding. In C. Paul & M. Bläser (Eds.), Leibniz International Proceedings in Informatics (LIPIcs) (pp. 17:1-17:13). Schloss Dagstuhl-Leibniz-Zentrum für Informatik. https://doi.org/10.4230/lipics.stacs.2020.17
• Fully Compact Routing in Low Memory Self-Healing Trees
  
  Castañeda, A., Lefévre, J., & Trehan, A. (2020). Fully Compact Routing in Low Memory Self-Healing Trees. In ICDCN 2020. Association for Computing Machinery (ACM). https://doi.org/10.1145/3369740.3369786
• On Termination of a Flooding Process
  
  Hussak, W., & Trehan, A. (2019). On Termination of a Flooding Process. In ACM PODC’19 (pp. 153-155). https://doi.org/10.1145/3293611.3331586
• DEX: Self-Healing Expanders
  
  Pandurangan, G., Robinson, P., & Trehan, A. (2014). DEX: Self-Healing Expanders. In IPDPS ’14 (pp. 702-711). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ipdps.2014.78
• Towards Self-healing SDN
  
  Chockler, G., & Trehan, A. (2014). Towards Self-healing SDN. Presented at Distributed Software Defined Net- works (DSDN) workshop, Principles of Distributed Computing (PODC) 2014.
• Sublinear Bounds for Randomized Leader Election
  
  Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., & Trehan, A. (2013). Sublinear Bounds for Randomized Leader Election. Presented at ICDCN’13.
• On the Complexity of Universal Leader Election
  
  Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., & Trehan, A. (2013). On the Complexity of Universal Leader Election. In ACM PODC ’13 (pp. 100-109). ACM.
• Edge-preserving self-healing: keeping network backbones densely connected
  
  Das Sarma, A., & Trehan, A. (2012). Edge-preserving self-healing: keeping network backbones densely connected. Presented at Workshop on Network Science for Communication Networks (NetSciCom 2012), IEEE InfoComm.
• Brief announcement: maintaining large dense subgraphs on dynamic networks
  
  Das Sarma, A., Lall, A., Nanongkai, D., & Trehan, A. (2012). Brief announcement: maintaining large dense subgraphs on dynamic networks. In ACM PODC’12 (pp. 229-230).
• Composition Games for Distributed Systems: the EU Grant games (Abstract)
  
  Kutten, S., Lavi, R., & Trehan, A. (2012). Composition Games for Distributed Systems: the EU Grant games (Abstract). Presented at Workshop on the Economics of Networks, Systems and Computation (NetEcon 2012), IEEE InfoComm.
• Composition Games for Distributed Systems: The EU Grants Games
  
  Kutten, S., Lavi, R., & Trehan, A. (2011). Composition Games for Distributed Systems: The EU Grants Games. In D. Peleg (Ed.), Lecture Notes in Computer Science (pp. 197-199).
• Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
  
  King, V., Lonargan, S., Saia, J., & Trehan, A. (2011). Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information. Presented at ICDCN.
• Brief Announcement: Composition Games for Distributed Systems: The EU Grants Games
  
  Kutten, S., Lavi, R., & Trehan, A. (2011). Brief Announcement: Composition Games for Distributed Systems: The EU Grants Games. Presented at DISC.
• Xheal: localized self-healing using expanders
  
  Pandurangan, G., & Trehan, A. (2011). Xheal: localized self-healing using expanders. In ACM PODC ’11 (pp. 301-310). ACM.
• The forgiving graph: a distributed data structure for low stretch under adversarial attack
  
  Hayes, T. P., Saia, J., & Trehan, A. (2009). The forgiving graph: a distributed data structure for low stretch under adversarial attack. Presented at PODC ’09: Proceedings of the 28th ACM symposium on Principles of distributed computing, New York, NY, USA.
• Picking up the Pieces: Self-Healing in reconfigurable networks
  
  Saia, J., & Trehan, A. (2008, April). Picking up the Pieces: Self-Healing in reconfigurable networks. Presented at IPDPS. 22nd IEEE International Symposium on Parallel and Distributed Processing.
• The forgiving tree: a self-healing distributed data structure
  
  Hayes, T., Rustagi, N., Saia, J., & Trehan, A. (2008). The forgiving tree: a self-healing distributed data structure. In ACM PODC’08 (pp. 203-212). ACM.

Doctoral Thesis

• Algorithms for self-healing networks
  
  Trehan, A. (2010). Algorithms for self-healing networks [Thesis]. University of New Mexico. http://proquest.umi.com/pqdlink?did=2085415901

Journal Article

• Amnesiac Flooding and the curious case of Unique Algorithms (Distributed Computing Column)
  
  Trehan, A. (2025). Amnesiac Flooding and the curious case of Unique Algorithms (Distributed Computing Column). Bulletin of EATCS, 147, 73-90.
• Payment Scheduling in the Interval Debt Model
  
  Stewart, I., Kutner, D., Friedetzky, T., Trehan, A., & Mertzios, G. (2025). Payment Scheduling in the Interval Debt Model. Theoretical Computer Science, 1028, Article 115028. https://doi.org/10.1016/j.tcs.2024.115028
• Termination of amnesiac flooding
  
  Hussak, W., & Trehan, A. (2023). Termination of amnesiac flooding. Distributed Computing, 36(2), 193-207. https://doi.org/10.1007/s00446-023-00448-y
• Compact routing messages in self-healing trees
  
  Castañeda, A., Dolev, D., & Trehan, A. (2018). Compact routing messages in self-healing trees. Theoretical Computer Science, 709, 2-19. https://doi.org/10.1016/j.tcs.2016.11.022
• DEX: self-healing expanders
  
  Pandurangan, G., Robinson, P., & Trehan, A. (2016). DEX: self-healing expanders. Distributed Computing, 29(3), 163-185. https://doi.org/10.1007/s00446-015-0258-3
• On the Complexity of Universal Leader Election
  
  Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., & Trehan, A. (2015). On the Complexity of Universal Leader Election. Journal of the Association for Computing Machinery., 62(1), 7:1-7:27.
• Sublinear bounds for randomized leader election
  
  Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., & Trehan, A. (2015). Sublinear bounds for randomized leader election. Theoretical Computer Science, 561, 134-143. https://doi.org/10.1016/j.tcs.2014.02.009
• Xheal: a localized self-healing algorithm using expanders
  
  Pandurangan, G., & Trehan, A. (2014). Xheal: a localized self-healing algorithm using expanders. Distributed Computing, 27(1), 39-54. https://doi.org/10.1007/s00446-013-0192-1
• The Forgiving Graph: a distributed data structure for low stretch under adversarial attack
  
  Hayes, T. P., Saia, J., & Trehan, A. (2012). The Forgiving Graph: a distributed data structure for low stretch under adversarial attack. Distributed Computing, 25, 261–278. https://doi.org/10.1007/s00446-012-0160-1
• Self-healing using virtual structures
  
  Trehan, A. (2012). Self-healing using virtual structures. CoRR, abs/1202.2466.
• Sublinear bounds for randomized leader election
  
  Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., & Trehan, A. (n.d.). Sublinear bounds for randomized leader election. Theoretical Computer Science, -.

Other (Print)

• Composition Games for Distributed Systems: the EU Grant games
  
  Kutten, S., Lavi, R., & Trehan, A. (2011). Composition Games for Distributed Systems: the EU Grant games. Distributed Computing - 25th International Symposium, DISC 2011, Rome, Italy, September 20-22, 2011. Proceedings.

Working Paper

• On The Termination of a Flooding Process
  
  Hussak, W., & Trehan, A. (2019). On The Termination of a Flooding Process. ArXiv. https://doi.org/10.48550/arXiv.1907.07078
• Self-healing Routing and Other Problems in Compact Memory
  
  Castañeda, A., Lefèvre, J., & Trehan, A. (2018). Self-healing Routing and Other Problems in Compact Memory. ArXiv. https://doi.org/10.48550/arXiv.1803.03042