Kaushik Sarkar

most citedHow Do We Find Early Adopters Who Will Guide a Resource Constrained Network Towards a Desired Distribution of Behaviors?

9 citations · 16 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2016

Partial Covering Arrays: Algorithms and Asymptotics

Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis +1

A covering array $CA (N; t, k, v)$ is an $N \times k$ array with entries in ${1, 2, \dots, v}$ , for which every $N \times t$ subarray contains each $t$ -tuple of $\{1, 2, \ld…

math.CO2016

Upper bounds on the size of covering arrays

Kaushik Sarkar, Charles J. Colbourn

Covering arrays find important application in software and hardware interaction testing. For practical applications it is useful to determine or bound the minimum number of rows, C…