We show that in the bounded degree model for graph property testing, adaptivity is essential. An algorithm is non-adaptive if it makes all queries to the input before receiving an...
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
Brendan D. McKay, Nicholas C. Wormald, Beata Wysoc...
The ability to understand the factors contributing to parallel program performance are vital for understanding the impact of machine parameters on the performance of specific app...
Matthew J. Sottile, Vaddadi P. Chandu, David A. Ba...
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...