Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Trehan, Amitabh"'
Autor:
Bampis, Evripidis, Dogeas, Konstantinos, Erlebach, Thomas, Megow, Nicole, Schlöter, Jens, Trehan, Amitabh
We study the two-sided stable matching problem with one-sided uncertainty for two sets of agents A and B, with equal cardinality. Initially, the preference lists of the agents in A are given but the preferences of the agents in B are unknown. An algo
Externí odkaz:
http://arxiv.org/abs/2407.10170
The network-based study of financial systems has received considerable attention in recent years but has seldom explicitly incorporated the dynamic aspects of such systems. We consider this problem setting from the temporal point of view and introduc
Externí odkaz:
http://arxiv.org/abs/2403.02198
We propose a simple and time-optimal algorithm for property testing a graph for its conductance in the CONGEST model. Our algorithm takes only $O(\log n)$ rounds of communication (which is known to be optimal), and consists of simply running multiple
Externí odkaz:
http://arxiv.org/abs/2305.14178
Autor:
Hussak, Walter, Trehan, Amitabh
Basic synchronous flooding proceeds in rounds. Given a finite undirected (network) graph $G$, a set of sources $I \subseteq G$ initiate flooding in the first round by every node in $I$ sending the same message to all of its neighbours. In each subseq
Externí odkaz:
http://arxiv.org/abs/2009.05776
Autor:
Hussak, Walter, Trehan, Amitabh
Flooding is among the simplest and most fundamental of all distributed network algorithms. A node begins the process by sending a message to all its neighbours and the neighbours, in the next round forward the message to all the neighbours they did n
Externí odkaz:
http://arxiv.org/abs/1907.07078
This paper seeks to address the question of designing distributed algorithms for the setting of compact memory i.e. sublinear bits working memory for arbitrary connected networks. The nodes in our networks may have much lower internal memory as compa
Externí odkaz:
http://arxiv.org/abs/1803.03042
Autor:
Hussak, Walter1 (AUTHOR) w.hussak@lboro.ac.uk, Trehan, Amitabh2 (AUTHOR)
Publikováno v:
Distributed Computing. Jun2023, Vol. 36 Issue 2, p193-207. 15p.
Existing compact routing schemes, e.g., Thorup and Zwick [SPAA 2001] and Chechik [PODC 2013], often have no means to tolerate failures, once the system has been setup and started. This paper presents, to our knowledge, the first self-healing compact
Externí odkaz:
http://arxiv.org/abs/1508.04234
Autor:
Trehan, Amitabh
Many modern networks are \emph{reconfigurable}, in the sense that the topology of the network can be changed by the nodes in the network. For example, peer-to-peer, wireless and ad-hoc networks are reconfigurable. More generally, many social networks
Externí odkaz:
http://arxiv.org/abs/1305.4675
This paper concerns {\em randomized} leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete $n$-node networks that runs in O(1) rounds and (with high probability) uses only $O(\sqrt{n}\l
Externí odkaz:
http://arxiv.org/abs/1210.4822