In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Workflow evolution is a collective term for concepts that deal with changes of workflow models. Adapted workflow models are deployed on a workflow engine as new model version. That...
ABSTRACT. The design process followed to produce traditional applications needs to be enhanced to cope with new contextaware ubiquitous application requirements. With the popularit...