Performance Analysis for Dynamic Tree Embedding in k-Partite Networks by a Random Walk

By Shen H.   Li K.   Pan Y.   Young G.H.   Zheng S.Q.  

Journal of Parallel and Distributed Computing, Vol. 50, Iss. 1, 1998-01 ,pp. : 144-156

Academic Press

Access to resources Recommend Favorite

Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems

By Bompadre Agustín  

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 659-700

Springer Publishing Company

Access to resources Recommend Favorite

Bounds and error bounds for queueing networks

By van Dijk N.M.  

Annals of Operations Research, Vol. 79, Iss. 1, 1998-01 ,pp. : 295-319

Springer Publishing Company

Access to resources Recommend Favorite

Treewidth Lower Bounds with Brambles

By Bodlaender Hans   Grigoriev Alexander   Koster Arie  

Algorithmica, Vol. 51, Iss. 1, 2008-05 ,pp. : 81-98

Springer Publishing Company

Access to resources Recommend Favorite

Lower bounds for asynchronous consensus

By Lamport Leslie  

Distributed Computing, Vol. 19, Iss. 2, 2006-10 ,pp. : 104-125

Springer Publishing Company

Access to resources Recommend Favorite