33 citations · 79 across the 13 of their papers we have counts for
16 papers
Amnesiac Flooding: Easy to break, hard to escape
Henry Austin, Maximilien Gadouleau, George B. Mertzios +1
Broadcast is a central problem in distributed computing. Recently, Hussak and Trehan [PODC'19/DC'23] proposed a stateless broadcasting protocol (Amnesiac Flooding), which was surpr…
Payment Scheduling in the Interval Debt Model
Tom Friedetzky, David C. Kutner, George B. Mertzios +2
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 cons…
Terminating cases of flooding
Walter Hussak, Amitabh Trehan
Basic synchronous flooding proceeds in rounds. Given a finite undirected (network) graph , a set of sources initiate flooding in the first round by every node in…
On The Termination of a Flooding Process
Walter Hussak, Amitabh Trehan
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,…
Compact Routing Messages in Self-Healing Trees
Armando Castaneda, Danny Dolev, Amitabh Trehan
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.…
Algorithms for Self-Healing Networks
Amitabh Trehan
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…