Mikael Onsjö

Learn More
This report addresses the problem of identifying a threshold for propagation connectiv-ity in random hypergraphs as specified in [BO09]. In that paper we gave upper and lower bounds for the threshold that left a gap of a factor (log n)(log log n) 2. Unfortunately there is some uncertainty regarding a detail in the lemma that was used to provide the upper(More)
We consider the problem of computing f m (f m−1 (· · · f 1 (x) · · ·)) where each function f i : R n → R n can be broken up in pairs so that the computation at, e.g., indices k and l involve only the vales of the argument at positions k and l. That is, f j (u)) k def = f + j (u k , u l) and so on. This generalizes " butterfly " algorithms, such as Radix-2(More)
1 Problem Description Bisection Problem is to patition a given graph G into subgraphs G 1 and G 2 of equal size with minimum number of cut edges, i.e., edges between G 1 and G 2. This problem has been studied extensively by many researchers [1, 2, 4], and several algorithms have been proposed and analyzed both mathematically and experimentally. Here we(More)
  • 1