This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...
We present an algorithm to compute r-th roots in Fqm with complexity O((log m + r log q)m2 log2 q) for certain choices of m and q. This compares well to previously known algorithms...
The Web services technology allows for easy creation of complex applications consisting of smaller components - Web services. This article performs an in-depth analysis of a Web s...
We present a design methodology for specifying embedded systems that addresses the complex nature of embedded systems design. Our approach uses modern model-based techniques to co...
Web services systems impose additional complexity upon software maintenance and evolution processes. To handle it, we propose a framework for evolving and maintaining Web service ...