Sciweavers

ICALP
2004
Springer
14 years 5 months ago
Games with Winning Conditions of High Borel Complexity
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
Olivier Serre
ICALP
2004
Springer
14 years 5 months ago
Counting in Trees for Free
Helmut Seidl, Thomas Schwentick, Anca Muscholl, Pe...
ICALP
2004
Springer
14 years 5 months ago
On the Expressive Power of Monadic Least Fixed Point Logic
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
Nicole Schweikardt
ICALP
2004
Springer
14 years 5 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
ICALP
2004
Springer
14 years 5 months ago
Hardness of String Similarity Search and Other Indexing Problems
Süleyman Cenk Sahinalp, Andrey Utis
ICALP
2004
Springer
14 years 5 months ago
Extensional Theories and Rewriting
This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automate...
Grigore Rosu
ICALP
2004
Springer
14 years 5 months ago
A Note on Karr's Algorithm
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
Markus Müller-Olm, Helmut Seidl
ICALP
2004
Springer
14 years 5 months ago
Property Testing of Regular Tree Languages
We consider the Edit distance with moves on the class of words and the class of ordered trees. We first exhibit a simple tester for the class of regular languages on words and gen...
Frédéric Magniez, Michel de Rougemon...