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

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

Conference Paper

• Bampis, E., Dogeas, K., Erlebach, T., Megow, N., Schlöter, J., & Trehan, A. (2024, August). Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. Presented at International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2024), London, UK
• Batu, T., Trehan, A., & Trehan, C. (2024, May). All You Need are Random Walks: Fast and Simple Distributed Conductance Testing. Presented at SIROCCO 2024: 31st International Colloquium On Structural Information and Communication Complexity, Vietri sul Mare, Salerno, Italy
• Algamdi, H., Aujla, G. S., Jindal, A., & Trehan, A. (2023, May). Intrusion Detection in Critical SD-IoT Ecosystem. Presented at 2023 IEEE International Conference on Communications Workshops (ICC Workshops), Rome, Italy
• Friedetzky, T., Kutner, D., Mertzios, G., Stewart, I., & Trehan, A. (2023, January). Payment scheduling in the Interval Debt Model. Presented at 48th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2023), Novy Smokovec, Slovakia
• Hussak, W., & Trehan, A. (2020, December). On the Termination of Flooding. Presented at 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Dagstuhl, Germany
• Gilbert, S., Pandurangan, G., Robinson, P., & Trehan, A. (2020, December). DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead. Presented at Proceedings of the 39th Symposium on Principles of Distributed Computing, New York, NY, USA
• Castañeda, A., Lefévre, J., & Trehan, A. (2020, December). Fully Compact Routing in Low Memory Self-Healing Trees. Presented at Proceedings of the 21st International Conference on Distributed Computing and Networking, New York, NY, USA
• Hussak, W., & Trehan, A. (2019, December). On Termination of a Flooding Process. Presented at Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019., Totronto, ON, Canada
• Chockler, G., & Trehan, A. (2014, December). Towards Self-healing SDN. Presented at Distributed Software Defined Net- works (DSDN) workshop, Principles of Distributed Computing (PODC) 2014
• Pandurangan, G., Robinson, P., & Trehan, A. (2014, December). DEX: Self-Healing Expanders. Presented at Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, Washington, DC, USA
• Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., & Trehan, A. (2013, December). On the Complexity of Universal Leader Election. Presented at Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, New York, NY, USA
• Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., & Trehan, A. (2013, December). Sublinear Bounds for Randomized Leader Election. Presented at ICDCN'13
• Das Sarma, A., & Trehan, A. (2012, December). Edge-preserving self-healing: keeping network backbones densely connected. Presented at Workshop on Network Science for Communication Networks (NetSciCom 2012), IEEE InfoComm
• Kutten, S., Lavi, R., & Trehan, A. (2012, December). 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
• Das Sarma, A., Lall, A., Nanongkai, D., & Trehan, A. (2012, December). Brief announcement: maintaining large dense subgraphs on dynamic networks. Presented at ACM Symposium on Principles of Distributed Computing, PODC '12, July 16-18, 2012, Funchal, Madeira, Portugal
• Kutten, S., Lavi, R., & Trehan, A. (2011, September). Composition Games for Distributed Systems: The EU Grants Games. Presented at Distributed algorithms
• Kutten, S., Lavi, R., & Trehan, A. (2011, December). Brief Announcement: Composition Games for Distributed Systems: The EU Grants Games. Presented at DISC
• King, V., Lonargan, S., Saia, J., & Trehan, A. (2011, December). Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information. Presented at ICDCN
• Pandurangan, G., & Trehan, A. (2011, December). Xheal: localized self-healing using expanders. Presented at Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, New York, NY, USA
• Hayes, T. P., Saia, J., & Trehan, A. (2009, December). 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
• 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
• Hayes, T., Rustagi, N., Saia, J., & Trehan, A. (2008, December). The forgiving tree: a self-healing distributed data structure. Presented at PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, New York, NY, USA

Doctoral Thesis

• Trehan, A. (2010). Algorithms for self-healing networks. (Thesis). University of New Mexico. https://durham-repository.worktribe.com/output/1617890

Journal Article

• Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., & Trehan, A. (online). Sublinear bounds for randomized leader election. Theoretical Computer Science, -
• Hussak, W., & Trehan, A. (2023). Termination of amnesiac flooding. Distributed Computing, 36(2), 193-207. https://doi.org/10.1007/s00446-023-00448-y
• Hussak, W., & Trehan, A. (2019). On The Termination of a Flooding Process
• Castañeda, A., Lefèvre, J., & Trehan, A. (2018). Self-healing Routing and Other Problems in Compact Memory
• 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
• 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
• 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
• Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., & Trehan, A. (2015). On the Complexity of Universal Leader Election. Journal of the ACM, 62(1), 7:1-7:27
• 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
• 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
• Trehan, A. (2012). Self-healing using virtual structures

Other (Print)

• Kutten, S., Lavi, R., & Trehan, A. (2011). Composition Games for Distributed Systems: the EU Grant games