We hypothesize that certain program complexities and difficulties to realize reuse potentials have their roots in weak mechanisms for generic design of today’s programming techn...
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, A...
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
Dinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Va...
The main goal to be answered by this Ph.D. thesis is whether there is a potential for a successful and powerful application of agile methods and related techniques to embedded syst...