Asynchronous Byzantine Agreement with optimal resilience

By Patra Arpita   Choudhury Ashish   Rangan C.  

Distributed Computing, Vol. 27, Iss. 2, 2014-04 ,pp. : 111-146

Springer Publishing Company

Access to resources Recommend Favorite

Scalable and leaderless Byzantine consensus in cloud computing environments

By Lim JongBeom   Suh Taeweon   Gil JoonMin   Yu Heonchang  

Information Systems Frontiers, Vol. 16, Iss. 1, 2014-03 ,pp. : 19-34

Springer Publishing Company

Access to resources Recommend Favorite

On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method

By Kolpakov R.   Posypkin M.   Sigal I.  

Automation and Remote Control, Vol. 71, Iss. 10, 2010-10 ,pp. : 2152-2161

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Application of lower bound direct method to engineering structures

By François Akoa   Abdelkader Hachemi   An Le   Said Mouhtamid   Tao Pham  

Journal of Global Optimization, Vol. 37, Iss. 4, 2007-04 ,pp. : 609-630

Springer Publishing Company

Access to resources Recommend Favorite

A new lower bound for the open-shop problem

By Guéret C.   Prins C.  

Annals of Operations Research, Vol. 92, Iss. 1, 1999-01 ,pp. : 165-183

Springer Publishing Company

Access to resources Recommend Favorite