kw.\*:("Fault tolerant computing")
Results 1 to 25 of 163
Selection :
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
Invremental compiler tranformations for multiple instruction retrySHYH-KWEI CHEN; ALEWINE, N. J; FUCHS, W. K et al.Software, practice & experience. 1994, Vol 24, Num 12, pp 1179-1198, issn 0038-0644Article
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
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 performance model of highly available multicomputer systemsMISBAHUDDIN, S; AL-HOLOU, N; KHAN, S. T et al.International journal of modelling & simulation. 2006, Vol 26, Num 2, pp 112-120, issn 0228-6203, 9 p.Article
Agreement under faulty interfacesDASGUPTA, P.Information processing letters. 1998, Vol 65, Num 3, pp 125-129, issn 0020-0190Article
A fault-tolerant broadcasting algorithm for hypercubesCHIU, G.-M.Information processing letters. 1998, Vol 66, Num 2, pp 93-99, issn 0020-0190Article
Noise Threshold for Universality of Two-Input GatesUNGER, Falk.IEEE transactions on information theory. 2008, Vol 54, Num 8, pp 3693-3698, issn 0018-9448, 6 p.Article
Fault-tolerant computation in the full information modelGOLDREICH, O; GOLDWASSER, S; LINIAL, N et al.SIAM journal on computing (Print). 1998, Vol 27, Num 2, pp 506-544, issn 0097-5397Article
Informatique sûre de fonctionnement : défis et solutions = Dependable computing challenges and solutionsARLAT, J.Journal européen des systèmes automatisés. 1996, Vol 30, Num 10, pp 1433-1465, issn 1269-6935Article
Finding the detour-critical-edge of a shortest path between two nodesNARDELLI, E; PROIETTI, G; WIDMAYER, P et al.Information processing letters. 1998, Vol 67, Num 1, pp 51-54, issn 0020-0190Article
Reconfiguring arrays with faults. Part I: Worst-case faultsCOLE, R. J; MAGGS, B. M; SITARAMAN, R. K et al.SIAM journal on computing (Print). 1997, Vol 26, Num 6, pp 1581-1611, issn 0097-5397Article
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