Sciweavers

IPL
2006
69views more  IPL 2006»
14 years 17 days ago
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
André Große, Jörg Rothe, Gerd We...
IPL
2006
88views more  IPL 2006»
14 years 17 days ago
On Quickselect, partial sorting and Multiple Quickselect
We present explicit solutions of a class of recurrences related to the Quickselect algorithm. Thus we are immediately able to solve recurrences arising at the partial sorting probl...
Markus Kuba
IPL
2006
115views more  IPL 2006»
14 years 17 days ago
Approximate maximum weight branchings
We consider a special subgraph of a weighted directed graph: one comprising only the k heaviest edges incoming to each vertex. We show that the maximum weight branching in this su...
Amitabha Bagchi, Ankur Bhargava, Torsten Suel
IPL
2006
99views more  IPL 2006»
14 years 17 days ago
Computational complexity of queries based on itemsets
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
Nikolaj Tatti
IPL
2006
91views more  IPL 2006»
14 years 17 days ago
Improved undecidability results on weighted timed automata
In this paper, we strengthen two recent undecidability results of [9,10] about weighted timed automata, an extension of timed automata with cost variables. More precisely, we prop...
Patricia Bouyer, Thomas Brihaye, Nicolas Markey
IPL
2006
74views more  IPL 2006»
14 years 17 days ago
Periodic and Sturmian languages
Counting the number of distinct factors in the words of a language gives a measure of complexity for that language similar to the factor-complexity of infinite words. Similarly as ...
Lucian Ilie, Solomon Marcus, Ion Petre
IPL
2006
109views more  IPL 2006»
14 years 17 days ago
Knuth-Bendix completion of theories of commuting group endomorphisms
Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...
Aaron Stump, Bernd Löchner
IPL
2006
96views more  IPL 2006»
14 years 17 days ago
A closer look at constraints as processes
N. Raja, R. K. Shyamasundar
IPL
2006
81views more  IPL 2006»
14 years 17 days ago
Overcoming observability problems in distributed test architectures
Jessica Chen, Robert M. Hierons, Hasan Ural