Efficient fault-tolerant quantum computingSTEANE, A. M.Nature (London). 1999, Vol 399, Num 6732, pp 124-126, issn 0028-0836Article

Consensus under unreliable transmissionYAN, K. Q; WANG, S. C; CHIN, Y. H et al.Information processing letters. 1999, Vol 69, Num 5, pp 243-248, issn 0020-0190Article

On the fault tolerance of some popular bounded-degree networksLEIGHTON, F. T; MAGGS, B. M; SITARAMAN, R. K et al.SIAM journal on computing (Print). 1998, Vol 27, Num 5, pp 1303-1333, issn 0097-5397Article

A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classesCAI, J.-Y.Information processing letters. 1999, Vol 69, Num 4, pp 167-174, issn 0020-0190Article

On the existence of nonadditive quantum codesROYCHOWDHURY, V. P; VATAN, F.Lecture notes in computer science. 1999, pp 325-336, issn 0302-9743, isbn 3-540-65514-XConference Paper

A fault tolerant systolic mesh for linear system solutionBHUVANESWARI, K; SIVA RAM MURTHY, C.International journal of computer mathematics. 1998, Vol 67, Num 3-4, pp 315-332, issn 0020-7160Article

Fault-tolerant routings in double fixed-step networksFABREGA, J; ZARAGOZA, M.Discrete applied mathematics. 1997, Vol 78, Num 1-3, pp 61-74, issn 0166-218XArticle

On the progress in fault-tolerant real-time computingEZHILCHELVAN, Paul.IEEE International Symposium on reliable distributed systems. 2004, pp 103-105, isbn 0-7695-2239-4, 1Vol, 3 p.Conference Paper

Failure detection and randomization : A hybrid approach to solve consensusAGUILERA, M. K; TOUEG, S.SIAM journal on computing (Print). 1999, Vol 28, Num 3, pp 890-903, issn 0097-5397Article

Fault-tolerant quantum computation with higher-dimensional systemsGOTTESMAN, D.Lecture notes in computer science. 1999, pp 302-313, issn 0302-9743, isbn 3-540-65514-XConference Paper

Reliable broadcasting in product networksFENG BAO; IGARASHI, Y; ÖHRING, S. R et al.Discrete applied mathematics. 1998, Vol 83, Num 1-3, pp 3-20, issn 0166-218XArticle

The fault tolerance of NP-hard problemsGLASSER, Christian; PAVAN, A; TRAVERS, Stephen et al.Information and computation (Print). 2011, Vol 209, Num 3, pp 443-455, issn 0890-5401, 13 p.Conference Paper

From an intermittent rotating star to leader = D'une étoile qui bouge et clignote à l'élection d'un leaderFernández, Antonio; Raynal, Michel.Publication interne - IRISA. 2006, issn 1166-8687, 1Vol, 19 p.Report

A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphsTSAI, Ping-Ying.Information processing letters. 2011, Vol 111, Num 8, pp 375-378, issn 0020-0190, 4 p.Article

Test&set, adaptive renaming and set agreement (a guided visit to asynchronous computability) = Rennomage adaptatif, test&set et accord ensembliste (une visite guidée dans la calculabilité asynchrone)Gafni, Eli; Raynal, Michel; Travers, C et al.Publication interne - IRISA. 2007, issn 1166-8687, 1Vol, 14 p.Report

A transactional grid workflow service for ShanghaiGridFEILONG TANG; MINGLU LI; MINYI GUO et al.International journal of web and grid services (Print). 2007, Vol 3, Num 4, pp 424-446, issn 1741-1106, 23 p.Article

Cycle embedding in star graphs with edge faultsLI, Tseng-Kuei.Applied mathematics and computation. 2005, Vol 167, Num 2, pp 891-900, issn 0096-3003, 10 p.Article

A self-stabilizing algorithm for constructing weakly connected minimal dominating setsTURAU, Volker; HAUCK, Bernd.Information processing letters. 2009, Vol 109, Num 14, pp 763-767, issn 0020-0190, 5 p.Article

Conditional matching preclusion for hypercube-like interconnection networksPARK, Jung-Heum; SANG HYUK SON.Theoretical computer science. 2009, Vol 410, Num 27-29, pp 2632-2640, issn 0304-3975, 9 p.Article

Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphsLIU, Zi-Long; FANG TIAN; XU, Jun-Ming et al.Theoretical computer science. 2009, Vol 410, Num 38-40, pp 3804-3813, issn 0304-3975, 10 p.Article

Edge fault tolerance analysis of a class of interconnection networksQIANG ZHU; XU, Jun-Ming; MIN LV et al.Applied mathematics and computation. 2006, Vol 172, Num 1, pp 111-121, issn 0096-3003, 11 p.Article

Bifurcations and fundamental error bounds for fault-tolerant computationsGAO, J. B; YAN QI; FORTES, José A. B et al.IEEE transactions on nanotechnology. 2005, Vol 4, Num 4, pp 395-402, issn 1536-125X, 8 p.Article

Embedding a long fault-free cycle in a crossed cube with more faulty nodesQIANG DONG; XIAOFAN YANG.Information processing letters. 2010, Vol 110, Num 11, pp 464-468, issn 0020-0190, 5 p.Article

Edges of degree k in minimally restricted k-edge connected graphsYANMEI HONG; ZHAO ZHANG; QINGHAI LIU et al.Discrete mathematics. 2009, Vol 309, Num 13, pp 4448-4455, issn 0012-365X, 8 p.Article

A note on cycle embedding in folded hypercubes with faulty elementsHSIEH, Sun-Yuan.Information processing letters. 2008, Vol 108, Num 2, pp 81-81, issn 0020-0190, 1 p.Article