
Minsum kSink Problem on Path Networks
We consider the problem of locating a set of k sinks on a path network w...
read it

Stabbing pairwise intersecting disks by five points
We present an O(n) expected time algorithm and an O(n n) deterministic ...
read it

Faster Matroid Intersection
In this paper we consider the classic matroid intersection problem: give...
read it

Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
The first fully dynamic algorithm for maintaining a maximal independent ...
read it

Approximating the Minimal Lookahead Needed to Win Infinite Games
We present an exponentialtime algorithm approximating the minimal looka...
read it

Approximation of subsets of natural numbers by c.e. sets
The approximation of natural numbers subsets has always been one of the ...
read it

Computing the Expected Execution Time of Probabilistic Workflow Nets
FreeChoice Workflow Petri nets, also known as Workflow Graphs, are a po...
read it
Decision times of infinite computations
The decision time of an infinite time algorithm is the supremum of its halting times over all real inputs. The decision time of a set of reals is the least decision time of an algorithm that decides the set; semidecision times of semidecidable sets are defined similary. It is not hard to see that ω_1 is the maximal decision time of sets of reals. Our main results determine the supremum of countable decision times as σ and that of countable semidecision times as τ, where σ and τ denote the suprema of Σ_1 and Σ_2definable ordinals, respectively, over L_ω_1. We further compute analogous suprema for singletons.
READ FULL TEXT
Comments
There are no comments yet.