Optimal Time-Space Tradeoff for Shared Memory Leader Election

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.25, Iss.1, 1997-10, pp. : 95-117

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Finding shuffle words that represent optimal scheduling of shared memory access

By Reidenbach Daniel Schmid Markus L.

International Journal of Computer Mathematics, Vol. 90, Iss. 6, 2013-06 ,pp. : 1292-1309

Taylor & Francis Ltd

Access to resources Recommend Favorite

Algorithms for Leader Election by Cellular Automata

By Nichitiu C. Mazoyer J. Remila E.

Journal of Algorithms, Vol. 41, Iss. 2, 2001-11 ,pp. : 302-329

Elsevier

Access to resources Recommend Favorite

Time-space non-commutativity in gravitational quantum well scenario

By Saha A.

The European Physical Journal C - Particles and Fields, Vol. 51, Iss. 1, 2007-06 ,pp. : 199-205

Springer Publishing Company

Access to resources Recommend Favorite

Inductive Time-Space Lower Bounds for Sat and Related Problems

By Williams Ryan

computational complexity, Vol. 15, Iss. 4, 2006-12 ,pp. : 433-470

Springer Publishing Company

Access to resources Recommend Favorite

Time-Space Tradeoffs for Counting NP Solutions Modulo Integers

By Williams R.

computational complexity, Vol. 17, Iss. 2, 2008-05 ,pp. : 179-219

Springer Publishing Company

Access to resources Recommend Favorite