Fusion trees can be implemented with AC 0 instructions only

Author： Andersson A.   Miltersen P.B.   Thorup M.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.215, Iss.1, 1999-02, pp. : 337-344

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

On TC0, AC0, and Arithmetic Circuits

By Agrawal M.   Allender E.   Datta S.  

Journal of Computer and System Sciences, Vol. 60, Iss. 2, 2000-04 ,pp. : 395-421

Academic Press

Access to resources Recommend Favorite

"Surfing Global Change": how didactic visions can be implemented

By Ahamer Gilbert  

Campus-Wide Information Systems, Vol. 22, Iss. 5, 2005-12 ,pp. : 298-319

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Determining what sets of trees can be the clique trees of a chordal graph

By Caria Pablo  

Journal of the Brazilian Computer Society, Vol. 18, Iss. 2, 2012-06 ,pp. : 121-128

Springer Publishing Company

Access to resources Recommend Favorite

An exact characterization of symmetric functions in qAC 0 [2]

By Lu C.-J.  

Theoretical Computer Science, Vol. 261, Iss. 2, 2001-06 ,pp. : 297-303

Elsevier

Access to resources Recommend Favorite

Fully dynamic distributed search trees can be balanced in O(lg2 N) time

By Barillari F.   Nardelli E.   Pepe M.  

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 11, 2002-11 ,pp. : 1617-1628

Academic Press

Access to resources Recommend Favorite