Author： Aumann Y. Bar-Ilan J. Feige U.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.233, Iss.1, 2000-02, pp. : 247-261
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
By Wang B.-F.
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. :
Access to resources
Recommend
Tight bounds on the round complexity of distributed 1-solvable tasks
By M.S. Paterson Biran O. Moran S. Zaks S.
Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. :
Cost versus faults - the optimum balance in debugging
Assembly Automation, Vol. 6, Iss. 1, 1993-12 ,pp. :
New lower bounds on the cost of binary search trees
Theoretical Computer Science, Vol. 156, Iss. 1, 1996-03 ,pp. :