Communication Complexity and Lower Bounds on Multilective Computations

E-ISSN： 1290-385x|33|2|193-212

ISSN： 0988-3754

Source： RAIRO - Theoretical Informatics and Applications, Vol.33, Iss.2, 2010-03, pp. : 193-212

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

Bisimulation on speed: Lower time bounds

By Lüttgen Gerald Vogler Walter

RAIRO - Theoretical Informatics and Applications, Vol. 39, Iss. 3, 2010-03 ,pp. : 587-618

Edp Sciences

Access to resources Recommend Favorite

Lower Bounds for Las Vegas Automata by Information Theory

By Hirvensalo Mika Seibert Sebastian

RAIRO - Theoretical Informatics and Applications, Vol. 37, Iss. 1, 2010-03 ,pp. : 39-49

Edp Sciences

Access to resources Recommend Favorite

Improved Lower Bounds on the Approximability of the Traveling Salesman Problem

By Böckenhauer Hans-Joachim Seibert Sebastian

RAIRO - Theoretical Informatics and Applications, Vol. 34, Iss. 3, 2010-03 ,pp. : 213-255

Edp Sciences

Access to resources Recommend Favorite

Lower Space Bounds for Accepting Shuffle Languages

By Szepietowski Andrzej

RAIRO - Theoretical Informatics and Applications, Vol. 33, Iss. 3, 2010-03 ,pp. : 303-307

Edp Sciences

Access to resources Recommend Favorite

Advanced Extraction and Lower Bounds for Removal of Pollutants from Wastewater by Water Plants

By Zimmels Y Kirzhner F Malkovskaja A

Water Environment Research, Vol. 79, Iss. 3, 2007-03 ,pp. : 287-296

Water Environment Federation

Access to resources Recommend Favorite