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):

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

• Algamdi, H., Aujla, G. S., Jindal, A., & Trehan, A. (2023). Intrusion Detection in Critical SD-IoT Ecosystem. . https://doi.org/10.1109/iccworkshops57953.2023.10283685
• Friedetzky, T., Kutner, D., Mertzios, G., Stewart, I., & Trehan, A. (2023). Payment scheduling in the Interval Debt Model. . https://doi.org/10.1007/978-3-031-23101-8_18
• Hussak, W., & Trehan, A. (2020). On the Termination of Flooding. In C. Paul, & M. Bläser (Eds.), . https://doi.org/10.4230/lipics.stacs.2020.17
• Gilbert, S., Pandurangan, G., Robinson, P., & Trehan, A. (2020). DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead. . https://doi.org/10.1145/3382734.3405716
• Castañeda, A., Lefévre, J., & Trehan, A. (2020). Fully Compact Routing in Low Memory Self-Healing Trees. . https://doi.org/10.1145/3369740.3369786
• Hussak, W., & Trehan, A. (2019). On Termination of a Flooding Process. . https://doi.org/10.1145/3293611.3331586
• Chockler, G., & Trehan, A. (2014). Towards Self-healing SDN.
• Pandurangan, G., Robinson, P., & Trehan, A. (2014). DEX: Self-Healing Expanders. . https://doi.org/10.1109/ipdps.2014.78
• Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., & Trehan, A. (2013). Sublinear Bounds for Randomized Leader Election.
• Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., & Trehan, A. (2013). On the Complexity of Universal Leader Election.
• Kutten, S., Lavi, R., & Trehan, A. (2012). Composition Games for Distributed Systems: the EU Grant games (Abstract).
• Das Sarma, A., & Trehan, A. (2012). Edge-preserving self-healing: keeping network backbones densely connected.
• Das Sarma, A., Lall, A., Nanongkai, D., & Trehan, A. (2012). Brief announcement: maintaining large dense subgraphs on dynamic networks.
• Kutten, S., Lavi, R., & Trehan, A. (2011). Composition Games for Distributed Systems: The EU Grants Games. In D. Peleg (Ed.),
• King, V., Lonargan, S., Saia, J., & Trehan, A. (2011). Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information.
• Kutten, S., Lavi, R., & Trehan, A. (2011). Brief Announcement: Composition Games for Distributed Systems: The EU Grants Games.
• Pandurangan, G., & Trehan, A. (2011). Xheal: localized self-healing using expanders.
• Hayes, T. P., Saia, J., & Trehan, A. (2009). The forgiving graph: a distributed data structure for low stretch under adversarial attack.
• Saia, J., & Trehan, A. (2008). Picking up the Pieces: Self-Healing in reconfigurable networks.
• Hayes, T., Rustagi, N., Saia, J., & Trehan, A. (2008). The forgiving tree: a self-healing distributed data structure.

Doctoral Thesis

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

Journal Article

• 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
• Kutten, S., Pandurangan, G., Peleg, D., Robinson, P., & Trehan, A. (2014). Sublinear bounds for randomized leader election. Theoretical Computer Science, -
• 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
• Trehan, A. (2012). Self-healing using virtual structures
• Hayes, T. P., Saia, J., & Trehan, A. (2012). The Forgiving Graph: a distributed data structure for low stretch under adversarial attack. Distributed Computing, 1-18. https://doi.org/10.1007/s00446-012-0160-1

Other (Print)

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