• Conference Object  

      A randomized, O(log w)-depth 2-smoothing network 

      Mavronicolas, Marios; Sauerwald, T. (2009)
      A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous propagation through the network. The maximum ...