Information Technology Reference
In-Depth Information
3.
F. Chung Graham: Graph Theory in the Information Age,
Notices of AMS
,
57
, no. 6,
p. 726-732, (July 2010).
4.
B. Eisenberg: On the Expectation of the Maximum of IID Geometric Random Variables,
Statistics & Probability Letters
,
78
, p. 135-143, (2008).
5.
B. Escoffier, L. Gourvés, J. Monnot: Strategic Coloring of a Graph,
Algorithms and Complex-
ity, Lecture Notes in Computer Science
, 6087, Springer, Berlin, p. 155-166 (2010)
6.
T.S. Ferguson:
Game Theory
, part II.
7.
K. Hamza: The Smallest Uniform Upper Bound on the Distance Between the Mean and the
Median of the Binomial and Poisson Distributions,
Statistics & Probability Letters
,
23
,p.
21-25, (1995).
8.
W. Hoeffding: On the Distribution of the Number of Successes in Independent Trials,
An.
Math. Statistics
,
27
, p. 713-721, (1956).
9.
R. Kaas and J.M. Buhrman: Mean, Median and Mode in Binomial Distributions,
Statistica
Neerlandica
34
(1), p. 13-18, (1980).
10.
M. Kearns, S. Suri, N. Montfort: An Experimental Study of the Coloring Problem on Human
Suject Networks,
Science
,
313
(5788), p. 824-827, (2006)
11.
T. L. Lai and H. Robbins: Maximally Dependent Random Variables,
Proc.Nat.Acad.Sci.USA
,
73
, No. 2, p. 286-288, February 1976, Statistics.
12.
T. L. Lai and H. Robbins: A Class of Dependent Random Variables and their Maxima,
Z.
Wahrscheinlichkeitstheorie verw. Gebiete
,
42
, p. 89-111, (1978).
13.
M. Luby: Removing Randomness in Parallel Computation without a Processor Penalty,
FOCS
,
p. 162-173, (1988).
14.
P.N. Panagopoulou and P. G. Spirakis: A Game Theoretic Approach for Efficient Graph Col-
oring,
ISAAC 2008
, LNCS 5369, p. 183-195, (2008).
15.
M. Shaked and J.G. Shanthikumar:
Stochastic Orders and their Applications
. Springer, New
York (2007).
Search WWH ::
Custom Search