default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmitabh Trehan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c24]Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan:
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. APPROX/RANDOM 2024: 17:1-17:21- [c23]Tugkan Batu
, Amitabh Trehan, Chhaya Trehan:
All You Need are Random Walks: Fast and Simple Distributed Conductance Testing. SIROCCO 2024: 64-82 - [i17]Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan:
Payment Scheduling in the Interval Debt Model. CoRR abs/2403.02198 (2024) - [i16]Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan:
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. CoRR abs/2407.10170 (2024) - 2023
- [j9]Walter Hussak, Amitabh Trehan:
Termination of amnesiac flooding. Distributed Comput. 36(2): 193-207 (2023) - [c22]Hammam Algamdi, Gagangeet Singh Aujla, Anish Jindal, Amitabh Trehan:
Intrusion Detection in Critical SD-IoT Ecosystem. ICC Workshops 2023: 1559-1564 - [c21]Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan:
Payment Scheduling in the Interval Debt Model. SOFSEM 2023: 267-282 - 2020
- [j8]Ra'Ed Bani-Abdelrahman, Rafat Alshorman, Walter Hussak, Amitabh Trehan:
Specification of synchronous network flooding in temporal logic. Int. Arab J. Inf. Technol. 17(6): 867-874 (2020) - [c20]Armando Castañeda, Jonas Lefèvre, Amitabh Trehan:
Fully Compact Routing in Low Memory Self-Healing Trees. ICDCN 2020: 21:1-21:10 - [c19]Seth Gilbert, Gopal Pandurangan, Peter Robinson, Amitabh Trehan:
DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead. PODC 2020: 438-447 - [c18]Walter Hussak, Amitabh Trehan:
On the Termination of Flooding. STACS 2020: 17:1-17:13 - [i15]Walter Hussak, Amitabh Trehan:
Terminating cases of flooding. CoRR abs/2009.05776 (2020)
2010 – 2019
- 2019
- [c17]Walter Hussak, Amitabh Trehan:
On Termination of a Flooding Process. PODC 2019: 153-155 - [i14]Walter Hussak, Amitabh Trehan:
On The Termination of a Flooding Process. CoRR abs/1907.07078 (2019) - 2018
- [j7]Armando Castañeda, Danny Dolev, Amitabh Trehan:
Compact routing messages in self-healing trees. Theor. Comput. Sci. 709: 2-19 (2018) - [e1]Posco Tso, Amitabh Trehan, Iain Phillips, Lin Cui:
Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018. ACM 2018 [contents] - [i13]Armando Castañeda, Jonas Lefèvre, Amitabh Trehan:
Self-healing Routing and Other Problems in Compact Memory. CoRR abs/1803.03042 (2018) - 2016
- [j6]Gopal Pandurangan, Peter Robinson, Amitabh Trehan:
DEX: self-healing expanders. Distributed Comput. 29(3): 163-185 (2016) - [j5]Amitabh Trehan:
Report on BCTCS 2016. Bull. EATCS 119 (2016) - [c16]Daniel Playfair, Amitabh Trehan, Barry McLarnon, Dimitrios S. Nikolopoulos:
Big data availability: Selective partial checkpointing for in-memory database queries. IEEE BigData 2016: 2785-2794 - [c15]Armando Castañeda, Danny Dolev, Amitabh Trehan:
Compact routing messages in self-healing trees. ICDCN 2016: 23:1-23:10 - 2015
- [j4]Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan:
On the Complexity of Universal Leader Election. J. ACM 62(1): 7:1-7:27 (2015) - [j3]Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan:
Sublinear bounds for randomized leader election. Theor. Comput. Sci. 561: 134-143 (2015) - [i12]Armando Castañeda, Danny Dolev, Amitabh Trehan:
Compact Routing Messages in Self-Healing Trees. CoRR abs/1508.04234 (2015) - 2014
- [j2]Gopal Pandurangan, Amitabh Trehan:
Xheal: a localized self-healing algorithm using expanders. Distributed Comput. 27(1): 39-54 (2014) - [c14]Gopal Pandurangan, Peter Robinson, Amitabh Trehan:
DEX: Self-Healing Expanders. IPDPS 2014: 702-711 - 2013
- [c13]Shay Kutten, Ron Lavi, Amitabh Trehan:
Composition Games for Distributed Systems: The EU Grant Games. AAAI 2013: 562-568 - [c12]Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan:
Sublinear Bounds for Randomized Leader Election. ICDCN 2013: 348-362 - [c11]Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan:
On the complexity of universal leader election. PODC 2013: 100-109 - [i11]Amitabh Trehan:
Algorithms for Self-Healing Networks. CoRR abs/1305.4675 (2013) - 2012
- [j1]Thomas P. Hayes, Jared Saia, Amitabh Trehan:
The Forgiving Graph: a distributed data structure for low stretch under adversarial attack. Distributed Comput. 25(4): 261-278 (2012) - [c10]Shay Kutten, Ron Lavi, Amitabh Trehan:
Composition games for distributed systems: The EU grant games (abstract). INFOCOM Workshops 2012: 170 - [c9]Atish Das Sarma, Amitabh Trehan:
Edge-preserving self-healing: Keeping network backbones densely connected. INFOCOM Workshops 2012: 226-231 - [c8]Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Brief announcement: maintaining large dense subgraphs on dynamic networks. PODC 2012: 229-230 - [c7]Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Dense Subgraphs on Dynamic Networks. DISC 2012: 151-165 - [i10]Amitabh Trehan:
Self-healing using virtual structures. CoRR abs/1202.2466 (2012) - [i9]Gopal Pandurangan, Peter Robinson, Amitabh Trehan:
Self-healing Deterministic Expanders. CoRR abs/1206.1522 (2012) - [i8]Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Dense Subgraphs on Dynamic Networks. CoRR abs/1208.1454 (2012) - [i7]Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, Amitabh Trehan:
Sublinear Bounds for Randomized Leader Election. CoRR abs/1210.4822 (2012) - 2011
- [c6]Valerie King, Steven Lonargan, Jared Saia, Amitabh Trehan:
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information. ICDCN 2011: 203-214 - [c5]Gopal Pandurangan, Amitabh Trehan:
Xheal: localized self-healing using expanders. PODC 2011: 301-310 - [c4]Shay Kutten, Ron Lavi, Amitabh Trehan:
Brief Announcement: Composition Games for Distributed Systems: The EU Grants Games. DISC 2011: 197-199 - [i6]Gopal Pandurangan, Amitabh Trehan:
Xheal: Localized Self-healing using Expanders. CoRR abs/1104.0882 (2011) - [i5]Shay Kutten, Ron Lavi, Amitabh Trehan:
Composition Games for Distributed Systems: the EU Grant games. CoRR abs/1105.5255 (2011) - [i4]Atish Das Sarma, Amitabh Trehan:
Edge-preserving self-healing: keeping network backbones densely connected. CoRR abs/1108.5893 (2011)
2000 – 2009
- 2009
- [c3]Thomas P. Hayes, Jared Saia, Amitabh Trehan:
The forgiving graph: a distributed data structure for low stretch under adversarial attack. PODC 2009: 121-130 - [i3]Tom Hayes, Jared Saia, Amitabh Trehan:
The Forgiving Graph: A distributed data structure for low stretch under adversarial attack. CoRR abs/0902.2501 (2009) - 2008
- [c2]Jared Saia, Amitabh Trehan:
Picking up the Pieces: Self-Healing in reconfigurable networks. IPDPS 2008: 1-12 - [c1]Tom Hayes, Navin Rustagi, Jared Saia, Amitabh Trehan:
The forgiving tree: a self-healing distributed data structure. PODC 2008: 203-212 - [i2]Jared Saia, Amitabh Trehan:
Picking up the Pieces: Self-Healing in Reconfigurable Networks. CoRR abs/0801.3710 (2008) - [i1]Tom Hayes, Navin Rustagi, Jared Saia, Amitabh Trehan:
The Forgiving Tree: A Self-Healing Distributed Data Structure. CoRR abs/0802.3267 (2008)
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:12 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:
