Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
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...
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
Chetan Nanjunda Mathur, Mohamed A. Haleem, Rajarat...