Sciweavers

Share
FCT
2009
Springer
9 years 9 months ago
Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
Thomas Thierauf, Fabian Wagner
FCT
2009
Springer
9 years 9 months ago
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...
Paul Hänsch, Michaela Slaats, Wolfgang Thomas
FCT
2009
Springer
9 years 10 months ago
Maintaining Arrays of Contiguous Objects
Michael A. Bender, Sándor P. Fekete, Tom Ka...
FCT
2009
Springer
9 years 10 months ago
1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs
Abstract. In the frequency allocation problem we are given a cellular telephone network whose geographical coverage area is divided into cells where phone calls are serviced by fre...
Rafal Witkowski
FCT
2009
Springer
9 years 10 months ago
Multiway In-Place Merging
Abstract. We present an algorithm for asymptotically efficient multiway blockwise in-place merging. Given an array A containing sorted subsequences A1, . . . , Ak of respective le...
Viliam Geffert, Jozef Gajdos
FCT
2009
Springer
10 years 8 days ago
Closure Operators for Order Structures
We argue that closure operators are fundamental tools for the study of relationships between order structures and their sequence representations. We also propose and analyse a clos...
Ryszard Janicki, Dai Tri Man Le, Nadezhda Zubkova
FCT
2009
Springer
10 years 8 days ago
Small Weakly Universal Turing Machines
We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an infinitely repeate...
Turlough Neary, Damien Woods
FCT
2009
Springer
10 years 8 days ago
Earliest Query Answering for Deterministic Nested Word Automata
Olivier Gauwin, Joachim Niehren, Sophie Tison
books