Skip to main content
Overview
Affiliations
AffiliationRoom numberTelephone
Associate Professor in the Department of Computer ScienceMCS 2013+44 (0) 191 33 42713

Publications

Chapter in book

  • Das Sarma, Atish, Lall, Ashwin, Nanongkai, Danupon & Trehan, Amitabh (2012). Dense Subgraphs on Dynamic Networks. In Distributed Computing. Aguilera, MarcosK Springer Berlin Heidelberg. 7611: 151-165.

Conference Paper

  • Hussak, Walter & Trehan, Amitabh (2020), On the Termination of Flooding, in Paul, Christophe & Bläser, Markus eds, Leibniz International Proceedings in Informatics (LIPIcs) 154: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Dagstuhl, Germany, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 17:1-17:13.
  • Castañeda, Armando, Lefévre, Jonas & Trehan, Amitabh (2020), Fully Compact Routing in Low Memory Self-Healing Trees, ICDCN 2020 Proceedings of the 21st International Conference on Distributed Computing and Networking. New York, NY, USA, Association for Computing Machinery.
  • Gilbert, Seth, Pandurangan, Gopal, Robinson, Peter & Trehan, Amitabh (2020), DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead, ACM PODC '20 Proceedings of the 39th Symposium on Principles of Distributed Computing. New York, NY, USA, Association for Computing Machinery, 438?447.
  • Hussak, Walter & Trehan, Amitabh (2019), On Termination of a Flooding Process, ACM PODC'19 Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019. Totronto, ON, Canada, 153-155.
  • Chockler, Gregory & Trehan, Amitabh (2014), Towards Self-healing SDN, Distributed Software Defined Net- works (DSDN) workshop, Principles of Distributed Computing (PODC) 2014.
  • Pandurangan, Gopal, Robinson, Peter & Trehan, Amitabh (2014), DEX: Self-Healing Expanders, IPDPS '14 Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium. Washington, DC, USA, IEEE Computer Society, 702-711.
  • Kutten, Shay Pandurangan, Gopal Peleg, David, Robinson, Peter & Trehan, Amitabh (2013), Sublinear Bounds for Randomized Leader Election, ICDCN'13. 348-362.
  • Kutten, Shay, Pandurangan, Gopal, Peleg, David, Robinson, Peter & Trehan, Amitabh (2013), On the Complexity of Universal Leader Election, ACM PODC '13 Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing. New York, NY, USA, ACM, 100-109.
  • Das Sarma, Atish & Trehan, Amitabh (2012), Edge-preserving self-healing: keeping network backbones densely connected, Workshop on Network Science for Communication Networks (NetSciCom 2012), IEEE InfoComm.
  • Das Sarma, Atish, Lall, Ashwin Nanongkai, Danupon & Trehan, Amitabh (2012), Brief announcement: maintaining large dense subgraphs on dynamic networks, ACM PODC'12 ACM Symposium on Principles of Distributed Computing, PODC '12, July 16-18, 2012. Funchal, Madeira, Portugal, 229-230.
  • Kutten, Shay Lavi, Ron & Trehan, Amitabh (2012), Composition Games for Distributed Systems: the EU Grant games (Abstract), Workshop on the Economics of Networks, Systems and Computation (NetEcon 2012), IEEE InfoComm.
  • Pandurangan, Gopal & Trehan, Amitabh (2011), Xheal: localized self-healing using expanders, ACM PODC '11 Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing. New York, NY, USA, ACM, 301-310.
  • Kutten, Shay, Lavi, Ron & Trehan, Amitabh (2011), Brief Announcement: Composition Games for Distributed Systems: The EU Grants Games, DISC. 197-199.
  • Kutten, Shay Lavi, Ron & Trehan, Amitabh (2011), Composition Games for Distributed Systems: The EU Grants Games, in David Peleg eds, Lecture Notes in Computer Science 6950: Distributed algorithms. 197-199.
  • King, Valerie, Lonargan, Steven Saia, Jared & Trehan, Amitabh (2011), Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information, ICDCN. 203-214.
  • Hayes, Thomas P., Saia, Jared & Trehan, Amitabh (2009), The forgiving graph: a distributed data structure for low stretch under adversarial attack, PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing. New York, NY, USA, ACM, 121-130.
  • Saia, Jared & Trehan, Amitabh (2008), Picking up the Pieces: Self-Healing in reconfigurable networks, IPDPS. 22nd IEEE International Symposium on Parallel and Distributed Processing. 1-12.
  • Hayes, Tom, Rustagi, Navin, Saia, Jared & Trehan, Amitabh (2008), The forgiving tree: a self-healing distributed data structure, ACM PODC'08 PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing. New York, NY, USA, ACM, 203-212.

Doctoral Thesis

  • Amitabh Trehan (2010). Algorithms for self-healing networks. University of New Mexico. PhD.

Journal Article

  • Hussak, Walter & Trehan, Amitabh (2019). On The Termination of a Flooding Process. CoRR abs/1907.07078.
  • Castañeda, Armando, Lefèvre, Jonas & Trehan, Amitabh (2018). Self-healing Routing and Other Problems in Compact Memory. CoRR abs/1803.03042.
  • Castañeda, Armando Dolev, Danny & Trehan, Amitabh (2018). Compact routing messages in self-healing trees. Theoretical Computer Science 709: 2 - 19.
  • Gopal Pandurangan, Peter Robinson & Amitabh Trehan (2016). DEX: self-healing expanders. Distributed Computing 29(3): 163-185.
  • Kutten, Shay, Pandurangan, Gopal Peleg, David Robinson, Peter & Trehan, Amitabh (2015). On the Complexity of Universal Leader Election. Journal of the ACM 62(1): 7:1-7:27.
  • Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson & Amitabh Trehan (2015). Sublinear bounds for randomized leader election. Theoretical Computer Science 561: 134 - 143.
  • Kutten, Shay Pandurangan, Gopal, Peleg, David, Robinson, Peter & Trehan, Amitabh (2014). Sublinear bounds for randomized leader election. Theoretical Computer Science (0): -
  • Pandurangan, Gopal & Trehan, Amitabh (2014). Xheal: a localized self-healing algorithm using expanders. Distributed Computing 27(1): 39-54.
  • Hayes, Thomas P., Saia, Jared & Trehan, Amitabh (2012). The Forgiving Graph: a distributed data structure for low stretch under adversarial attack. Distributed Computing 1-18.
  • Amitabh Trehan (2012). Self-healing using virtual structures. CoRR abs/1202.2466.

Other (Print)

  • Shay Kutten, Ron Lavi & Amitabh Trehan (2011). Composition Games for Distributed Systems: the EU Grant games.