Combinatorial Techniques and Objects in Computer Science: Fault-tolerance and Other Interesting Applications

Author： Singhi N.M. Shriniwas I. Antony T.A.

ISSN： 0195-6698

Source： European Journal of Combinatorics, Vol.17, Iss.2, 1996-02, pp. : 97-111

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

An application of combinatorial techniques to a topological problem

Bulletin of the Australian Mathematical Society, Vol. 9, Iss. 3, 1973-12 ,pp. : 439-443

Cambridge University Press

Access to resources Recommend Favorite

Distributed Objects for Parallel Numerical Applications

By Baude Francoise Caromel Denis Sagnol David

ESAIM: Mathematical Modelling and Numerical Analysis, Vol. 36, Iss. 5, 2010-03 ,pp. : 837-861

Edp Sciences

Access to resources Recommend Favorite

Theory of combinatorial designs with applications to encryption and the design of experiments

Bulletin of the Australian Mathematical Society, Vol. 37, Iss. 3, 1988-06 ,pp. : 467-468

Cambridge University Press

Access to resources Recommend Favorite

Special selection in logic in computer science

The Journal of Symbolic Logic, Vol. 62, Iss. 2, 1997-06 ,pp. : 608-608

Cambridge University Press

Access to resources Recommend Favorite

Constructivity in computer science: A summer symposium

The Journal of Symbolic Logic, Vol. 58, Iss. 3, 1993-09 ,pp. : 1097-1097

Cambridge University Press

Access to resources Recommend Favorite