• Article  

      A combinatorial treatment of balancing networks 

      Busch, Costas; Mavronicolas, Marios (1996)
      Balancing networks, originally introduced by Aspnes et al. (Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 348-358, May 1991), represent a new class of distributed, low-contention data structures ...
    • Conference Object  

      Contention in balancing networks resolved 

      Hadjimitsis, Leonidas; Mavronicolas, Marios (ACM, 1998)
      Counting networks have been originally presented by Aspnes et al. as a new class of distributed/coordinated data structures suitable for solving many fundamental, multi-processor coordination problems that can be expressed ...
    • Article  

      The impact of randomization in smoothing networks 

      Mavronicolas, Marios; Sauerwald, T. (2010)
      We revisit randomized smoothing networks (Herlihy and Tirthapura in J Parallel Distrib Comput 66(5):626-632, 2006), which are made up of balancers and wires. We assume that balancers are oriented independently and uniformly ...
    • Article  

      Sequentially consistent versus linearizable counting networks 

      Mavronicolas, Marios; Merritt, M.; Taubenfeld, G. (2008)
      We compare the impact of timing conditions on implementing sequentially consistent and linearizable counters using (uniform) counting networks in distributed systems. For counting problems in application domains which do ...