778 search results - page 111 / 156 » Expressiveness and complexity of graph logic |
FSTTCS
2009
Springer
14 years 5 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
ECOWS
2007
Springer
14 years 5 months ago
2007
Springer
Execution monitoring of complex web service process models is critical for effective management and control of web services based systems. During the composite process model execu...
SODA
2010
ACM
14 years 8 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
APLAS
2010
ACM
13 years 10 months ago
2010
ACM
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
ECCC
2006
13 years 11 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...