As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
Abstract. A real is called properly n-generic if it is n-generic but not n + 1generic. We show that every 1-generic real computes a properly 1-generic real. On the other hand, if m...
Barbara F. Csima, Rod Downey, Noam Greenberg, Deni...
Whether context-sensitive program analysis is more effective than context-insensitive analysis is an ongoing discussion. There is evidence that context-sensitivity matters in comp...
A traffic matrix D1 dominates a traffic matrix D2 if D2 can be routed on every (capacitated) network where D1 can be routed. We prove that D1 dominates D2 if and only if D1 , cons...
The paper shows elimination of imaginaries for real closed valued fields to the geometric sorts which were introduced in the [6]. We also show that this result is in some sense op...
A sequence of the form s1s2 . . . sms1s2 . . . sm is called a repetition. A vertex-coloring of a graph is called nonrepetitive if none of its paths is repetitively colored. We ans...
A (d, d + 1)-graph is a graph whose vertices all have degrees in the set {d, d + 1}. Such a graph is semiregular. An (r, r + 1)-factorization of a graph G is a decomposition of G ...
Abstract--Recent result shows how to compute distributively and efficiently the linear MMSE for the multiuser detection problem, using the Gaussian BP algorithm. In the current wor...
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodes on a network making strategic choices regarding the content to replicate in the...