Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems

By Sen S.  

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 59-78

Elsevier

Access to resources Recommend Favorite

Lower Bounds on the Multiparty Communication Complexity

By Duris P.   Rolim J.D.P.  

Journal of Computer and System Sciences, Vol. 56, Iss. 1, 1998-02 ,pp. : 90-95

Academic Press

Access to resources Recommend Favorite

New lower bounds on the cost of binary search trees

By De Prisco R.   De Santis A.  

Theoretical Computer Science, Vol. 156, Iss. 1, 1996-03 ,pp. : 315-325

Elsevier

Access to resources Recommend Favorite

Lower bounds for one-way probabilistic communication complexity and their application to space complexity

By Ablayev F.  

Theoretical Computer Science, Vol. 157, Iss. 2, 1996-05 ,pp. : 139-159

Elsevier

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