We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Traditionally, universities focus primarily on instructionist teaching. Such an understanding has been criticized from theoretical and practical points of view. We believe that so...
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Comparative evaluation of visualization and experiment results is a critical step in computational steering. In this paper, we present a study of image comparison metrics for quan...