Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks

Author： Meyer auf der Heide F.   Storch M.   Wanka R.  

Publisher： Springer Publishing Company

ISSN： 1432-4350

Source： Theory of Computing Systems, Vol.30, Iss.6, 1997-12, pp. : 627-644

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

Related content

A trade-off between collision probability and key size in universal hashing using polynomials

By Sarkar Palash  

Designs, Codes and Cryptography, Vol. 58, Iss. 3, 2011-03 ,pp. : 271-278

Springer Publishing Company

Access to resources Recommend Favorite

An Optimal Parallel Co-Connectivity Algorithm

By Chong Ka Wong  

Theory of Computing Systems, Vol. 37, Iss. 4, 2004-07 ,pp. : 527-546

Springer Publishing Company

Access to resources Recommend Favorite

Optimal networks for mass transportation problems

By Brancolini Alessio   Buttazzo Giuseppe  

ESAIM: Control, Optimisation and Calculus of Variations, Vol. 11, Iss. 1, 2010-03 ,pp. : 88-101

Edp Sciences

Access to resources Recommend Favorite

Universal Ls-rate-optimality of Lr-optimal quantizers by dilatation and contraction

By Sagna Abass  

ESAIM: Probability and Statistics, Vol. 13, Iss. issue, 2009-06 ,pp. : 218-246

Edp Sciences

Access to resources Recommend Favorite

On a relation between the universal Teichmüller space and the Grunsky operator

By Yanagishita Masahiro  

Acta Mathematica Sinica, Vol. 30, Iss. 4, 2014-04 ,pp. : 591-600

Springer Publishing Company

Access to resources Recommend Favorite