Sciweavers

2432 search results - page 8 / 487
» Degrees and choice numbers
Sort
View
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 4 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
EOR
2010
114views more  EOR 2010»
13 years 7 months ago
Technology choice under several uncertainty sources
We analyze a model of irreversible investment with two sources of uncertainty. A riskneutral decision maker has the choice between two mutually exclusive projects under input pric...
Catherine Bobtcheff, Stéphane Villeneuve
FSE
2000
Springer
96views Cryptology» more  FSE 2000»
13 years 11 months ago
On the Interpolation Attacks on Block Ciphers
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
Amr M. Youssef, Guang Gong
MOC
2000
71views more  MOC 2000»
13 years 7 months ago
Salem numbers of negative trace
We prove that, for all d 4, there are Salem numbers of degree 2d and trace -1, and that the number of such Salem numbers is d/ (log log d)2 . As a consequence, it follows that the...
C. J. Smyth
COMBINATORICA
1998
77views more  COMBINATORICA 1998»
13 years 7 months ago
A Bound on the Total Chromatic Number
We prove that the total chromatic number of any graph with maximum degree is at most plus an absolute constant. In particular, we show that for su ciently large, the total chromat...
Michael Molloy, Bruce A. Reed