Browsing by Subject "Combinatorial mathematics"
Now showing items 16 of 6

Article
A combinatorial treatment of balancing networks
(1996)Balancing networks, originally introduced by Aspnes et al. (Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 348358, May 1991), represent a new class of distributed, lowcontention data structures ...

Article
The impact of network structure on the stability of greedy protocols
(2005)Some examples of the impact network structure has on stability behavior of greedy protocols and networks were presented. An important problem was to study the impact of network structure parameters on other greedy protocols. ...

Article
The price of anarchy for polynomial social cost
(2006)In this work, we consider an interesting variant of the well studied KP model for selfish routing on parallel links, which reflects some influence from the much older Wardrop model [J.G. Wardrop, Some theoretical aspects ...

Article
Propagation in CSP and SAT
(2006)Constraint Satisfaction Problems and Prepositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importance in both frameworks is that of constraint propagation. ...

Conference Object
A randomized, O(log w)depth 2smoothing network
(2009)A Ksmoothing network is a distributed, lowcontention 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 ...

Conference Object
Waitfree solvability via combinatorial topology
(1996)This paper addresses the question of whether Algebraic Topology is really necessary for determining the characterization of solvable tasks for the case of general t. A Combinatorial Topology framework, totally bypassing ...