LEADER 00961nam a22002411i 4500 001 991002770059707536 005 20040615094036.0 008 040624s1962 fr a||||||||||||||||fre 035 $ab12975436-39ule_inst 035 $aARCHE-093311$9ExL 040 $aDip.to Beni Culturali$bita$cA.t.i. Arché s.c.r.l. Pandora Sicilia s.r.l. 082 04$a709 100 1 $aLaming Emperaire, Annette$0212729 245 13$aLa signification de l'art rupestre paléolithique :$bméthodes et applications /$cA. Laming-Emperaire 260 $aParis :$bA. & J. Picard,$c1962 300 $a424 p. :$bill. ;$c25 cm 650 4$aArte rupestre 907 $a.b12975436$b02-04-14$c12-07-04 912 $a991002770059707536 945 $aLE001 G 1 4$g1$i2001000063048$lle001$nC. 1$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i13578911$z12-07-04 996 $aSignification de l'art rupestre paléolithique$9285233 997 $aUNISALENTO 998 $ale001$b12-07-04$cm$da $e-$ffre$gfr $h3$i1 LEADER 02144oam 2200409zu 450 001 9910872744003321 005 20241212214841.0 035 $a(CKB)111026746712762 035 $a(SSID)ssj0000455415 035 $a(PQKBManifestationID)12166333 035 $a(PQKBTitleCode)TC0000455415 035 $a(PQKBWorkID)10399642 035 $a(PQKB)11387528 035 $a(NjHacI)99111026746712762 035 $a(EXLCZ)99111026746712762 100 $a20160829d1995 uy 101 0 $aeng 135 $aur||||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$a1994 IEEE-IMS Workshop on Information Theory and Statistics 210 31$a[Place of publication not identified]$cIEEE$d1995 215 $a1 online resource 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a9780780327610 311 08$a0780327616 330 $aThe author describes analogous coding theorems for the more general, interactive, communications required in computation. In this case the bits transmitted in the protocol are not known to the processors in advance but are determined dynamically. First he shows that any interactive protocol of length T between two processors connected by a noiseless channel can be simulated, if the channel is noisy (a binary symmetric channel of capacity C), in time proportional to T 1/C, and with error probability exponentially small in T. He then shows that this result can be extended to arbitrary distributed network protocols. He shows that any distributed protocol which runs in time T on a network of degree d having noiseless communication channels, can, if the channels are in fact noisy, be simulated on that network in time proportional to T 1/C log d. The probability of failure of the protocol is exponentially small in T. 606 $aInformation theory 615 0$aInformation theory. 676 $a003.54 712 02$aIEEE, Institute of Electrical and Electronics Engineers, Inc. Staff 801 0$bPQKB 906 $aBOOK 912 $a9910872744003321 996 $a1994 IEEE-IMS Workshop on Information Theory and Statistics$92496226 997 $aUNINA