314 search results - page 31 / 63 » Complete Problems for Dynamic Complexity Classes |
110
click to vote
COCO
2007
Springer
15 years 8 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
100
click to vote
IFIPTCS
2010
15 years 8 days ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
148
click to vote
PODC
2011
ACM
14 years 5 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
144
Voted
CSL
2008
Springer
15 years 4 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
136
click to vote
HPCC
2007
Springer
15 years 8 months ago
2007
Springer
As Grids become increasingly relied upon as critical infrastructure, it is imperative to ensure the highly-available and secure day-to-day operation of the Grid infrastructure. The...