22 search results - page 2 / 5 » Common subproofs in proof pairs |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
If you are sharing a meal with a companion, how best to make sure you get your favourite fork-fulls? Ethiopian Dinner is a game in which two players take turns eating morsels from ...
TYPES
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
ESAS
2006
Springer
13 years 11 months ago
2006
Springer
In the context of ambient networks, this article describes a cryptographic protocol called Common History Extraction (CHE) protocol implementing a trust management framework. All t...
TPHOL
2008
IEEE
14 years 1 months ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
PODC
2009
ACM
14 years 7 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...