6 citations · 6 across the 1 of their papers we have counts for
5 papers
On the Hardness of Red-Blue Pebble Games
Pál András Papp, Roger Wattenhofer
Red-blue pebble games model the computation cost of a two-level memory hierarchy. We present various hardness results in different red-blue pebbling variants, with a focus on the o…
A General Stabilization Bound for Influence Propagation in Graphs
Pál András Papp, Roger Wattenhofer
We study the stabilization time of a wide class of processes on graphs, in which each node can only switch its state if it is motivated to do so by at least a fract…
Network-Aware Strategies in Financial Systems
Pál András Papp, Roger Wattenhofer
We study the incentives of banks in a financial network, where the network consists of debt contracts and credit default swaps (CDSs) between banks. One of the most important quest…
Stabilization Time in Minority Processes
Pál András Papp, Roger Wattenhofer
We analyze the stabilization time of minority processes in graphs. A minority process is a dynamically changing coloring, where each node repeatedly changes its color to the color…
Stabilization Time in Weighted Minority Processes
Pál András Papp, Roger Wattenhofer
A minority process in a weighted graph is a dynamically changing coloring. Each node repeatedly changes its color in order to minimize the sum of weighted conflicts with its neighb…