Conference paper
Modeling UpLink power control with outage probabilities
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Universal traversal sequences for d-regular n-vertex graphs require length Ω(d2n2 + dn2 log( n d)), for 3 ≤d≤ n 3 - 2. This is nearly tight for d = Θ(n). We also introduce and study several variations on the problem, e.g., edge-universal traversal sequences, showing how improved lower bounds on these would improve the bounds given above. © 1992.
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Hannaneh Hajishirzi, Julia Hockenmaier, et al.
UAI 2011
Naga Ayachitula, Melissa Buco, et al.
SCC 2007