315 search results - page 44 / 63 » A General Small Cancellation Theory |
STOC
1999
ACM
13 years 12 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
SIGECOM
2008
ACM
13 years 7 months ago
2008
ACM
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
ML modules provide hierarchical namespace management, as well as fine-grained control over the propagation of type information, but they do not allow modules to be broken up into ...
SENSYS
2009
ACM
14 years 2 months ago
2009
ACM
Having access to an accurate time is a vital building block in all networks; in wireless sensor networks even more so, because wireless media access or data fusion may depend on i...