The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
Wouter Gelade, Marcel Marquardt, Thomas Schwentick
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
Localization is a fundamental operation in mobile and self-configuring networks such as sensor networks and mobile ad hoc networks. For example, sensor location is often critical...
Sameer Tilak, Vinay Kolar, Nael B. Abu-Ghazaleh, K...
In practical nonlinear filtering, the assessment of achievable filtering performance is important. In this paper, we focus on the problem of how to efficiently approximate the post...
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...