Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...
This paper studies a nonlinear vector precoding scheme which inverts the wireless multiple-input multiple-output (MIMO) channel at the transmitter so that simple symbol-bysymbol de...
In this paper we study standard bases for submodules of K[[t1, . . . , tm]][x1, . . . , xn]s respectively of their localisation with respect to a t-local monomial ordering. The mai...
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...