Sciweavers

217 search results - page 44 / 44
» A new upper bound on the cyclic chromatic number
Sort
View
CCA
2009
Springer
13 years 9 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi
CN
2007
116views more  CN 2007»
13 years 5 months ago
Scalability and security in biased many-to-one communication
In multicast communication, a source transmits the same content to a set of receivers. Current protocols for multicast follow a tree communication model which makes them scalable....
Francesc Sebé, Josep Domingo-Ferrer