1274 search results - page 119 / 255 » New Proofs for |
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— We consider the problem of broadcasting a live stream of data in an unstructured network. Broadcasting has been studied extensively for networks with capacity constraints at th...
101
click to vote
TPHOL
2007
IEEE
15 years 7 months ago
2007
IEEE
This paper concerns the formal semantics of programming languages, and the specification and verification of software. We are interested in the verification of real programs, wr...
123
Voted
RTA
2010
Springer
15 years 4 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
125
click to vote
CSL
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We present a new proof of decidability of higher-order subtyping in the presence of bounded quantification. The algorithm is formulated as a judgement which operates on b...
109
Voted
DM
2008
15 years 26 days ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...