2767 search results - page 63 / 554 » Universal Exponentiation Algorithm |
APLAS
2006
ACM
15 years 3 months ago
2006
ACM
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
COCO
2003
Springer
15 years 3 months ago
2003
Springer
We define and study strong diagonalization and compare it to weak diagonalization, implicit in [7]. Kozen’s result in [7] shows that virtually every separation can be recast as...
SPAA
2010
ACM
14 years 10 months ago
2010
ACM
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
HYBRID
2003
Springer
15 years 3 months ago
2003
Springer
The algorithmic analysis of timed automata is fundamentally limited by the undecidability of the universality problem. For this reason and others, there has been considerable inter...