9 citations · 16 across the 2 of their papers we have counts for
5 papers
Two-stage algorithms for covering array construction
Kaushik Sarkar, Charles J. Colbourn
Modern software systems often consist of many different components, each with a number of options. Although unit tests may reveal faulty options for individual components, function…
Partial Covering Arrays: Algorithms and Asymptotics
Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis +1
A covering array is an array with entries in , for which every subarray contains each -tuple of $\{1, 2, \ld…
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…
Influencing Busy People in a Social Network
Kaushik Sarkar, Hari Sundaram
We identify influential early adopters in a social network, where individuals are resource constrained, to maximize the spread of multiple, costly behaviors. A solution to this pro…
How Do We Find Early Adopters Who Will Guide a Resource Constrained Network Towards a Desired Distribution of Behaviors?
Kaushik Sarkar, Hari Sundaram
We identify influential early adopters that achieve a target behavior distribution for a resource constrained social network with multiple costly behaviors. This problem is importa…