A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Multicast Triangular Semilattice Network
[article]

2018
*
arXiv
*
pre-print

We investigate the structure of the code graph of a

arXiv:1808.04512v1
fatcat:2oeod2vptfdarivu4ggoecpgpi
*multicast**network*that has a characteristic shape of an inverted equilateral triangle. ... ' receivers and required field sizes up to a*network*of 4 sources. ... A k-triangle in a*triangular**semilattice**network*▽ n is a subgraph isomorphic as a directed graph to a*triangular**semilattice**network*▽ k . We call k the length of a k-triangle. ...##
###
Cantor meets Scott: Semantic Foundations for Probabilistic Networks
[article]

2016
*
arXiv
*
pre-print

implementation and show how to use it to solve a variety of problems including characterizing the expected congestion induced by different routing schemes and reasoning probabilistically about reachability in a

arXiv:1607.05830v5
fatcat:dktiz7otdzfflnw2lsctab2ife
*network*... (M, ) is not a*Semilattice*Despite the fact that (M, ) is a directed set (Lemma 12), it is not a*semilattice*. Here is a counterexample. Let b = {π, σ, τ }, where π, σ, τ are distinct packets. ... Consider the infinite*triangular*matrix E and its inverse E −1 with rows and columns indexed by the finite subsets of H, where Eac = [a ⊆ c] E −1 ac = (−1) |c−a| [a ⊆ c] . ...##
###
Cantor meets Scott: semantic foundations for probabilistic networks

2017
*
SIGPLAN notices
*

implementation and show how to use it to solve a variety of problems including characterizing the expected congestion induced by different routing schemes and reasoning probabilistically about reachability in a

doi:10.1145/3093333.3009843
fatcat:mdvrhemsxnblpoxseuh6nkjvc4
*network*... Surprisingly, despite Lemma 12, the probability measures do not form an upper*semilattice*under , although counterexamples are somewhat difficult to construct. ... Consider the infinite*triangular*matrix E and its inverse E −1 with rows and columns indexed by the finite subsets of H, where Eac = [a ⊆ c] E −1 ac = (−1) |c−a| [a ⊆ c]. ...