LEADER 00949nam a22002533i 4500
001 991003464859707536
005 20040419105836.0
008 040802s1965    it |||||||||||||||||ita  
035   $ab13078124-39ule_inst
035   $aARCHE-103073$9ExL
040   $aBiblioteca Interfacoltà$bita$cA.t.i. Arché s.c.r.l. Pandora Sicilia s.r.l.
082 04$a928
100 1 $aGoldoni, Carlo$0158273
245 10$aMemorie italiane /$cCarlo Goldoni ; a cura di Felice Del Beccaro
260   $aMilano :$bA. Mondadori,$cc1965
300   $a218 p. ;$c19 cm
440  0$aBiblioteca moderna Mondadori ;$v817
700 1 $aDel Beccaro, Felice
907   $a.b13078124$b02-04-14$c05-08-04
912   $a991003464859707536
945   $aLE002 Fondo Giudici F 42$g1$i2002000223944$lle002$nC. 1$o-$pE0.00$q-$rn$so  $t0$u0$v0$w0$x0$y.i13706755$z05-08-04
996   $aMemorie italiane$9290950
997   $aUNISALENTO
998   $ale002$b05-08-04$cm$da  $e-$fita$git $h0$i1

LEADER 03340nam  2200673Ia 450 
001 9910967286103321
005 20251116230630.0
010   $a0-7735-7347-X
024 7 $a10.1515/9780773573475
035   $a(CKB)1000000000521367
035   $a(OCoLC)243568029
035   $a(CaPaEBR)ebrary10135281
035   $a(SSID)ssj0000278759
035   $a(PQKBManifestationID)11255538
035   $a(PQKBTitleCode)TC0000278759
035   $a(PQKBWorkID)10246991
035   $a(PQKB)11242018
035   $a(CaPaEBR)400804
035   $a(CaBNvSL)slc00200079
035   $a(Au-PeEL)EBL3331270
035   $a(CaPaEBR)ebr10141943
035   $a(OCoLC)929121531
035   $a(DE-B1597)655250
035   $a(DE-B1597)9780773573475
035   $a(VaAlCD)20.500.12592/mt072k
035   $a(schport)gibson_crkn/2009-12-01/1/400804
035   $a(MiAaPQ)EBC3331270
035   $a(MiAaPQ)EBC3245550
035   $a(EXLCZ)991000000000521367
100   $a19861127d1986      uy         0
101 0 $aeng
135   $aurcn|||||||||
181   $ctxt
182   $cc
183   $acr
200 10$aDistributed algorithms on graphs $eproceedings of the 1st International Workshop on Distributed Algorithms, Ottawa, Canada, August 1985 /$fedited by Eli Gafni and Nicola Santoro
205   $a1st ed.
210   $aOttawa $cCarleton University Press$d1986
215   $a1 online resource (200 p.)
300   $aIncludes index.
311 08$a0-88629-054-6 
320   $aIncludes bibliography and index.
327   $tFront Matter --$tContents --$tThe Bit Complexity of Probabilistic Leader Election on a Unidirectional Ring --$tMinimizing a Virtual Control Token Ring --$tNew Upperbounds for Decentralized Extrema-Finding in a Ring of Processors --$tEfficient Algorithmsfor Routing Information in a Multicomputer System --$tLower Bounds on Common Knowledge in Distributed Algorithms --$tScheme for Efficiency-Performance Measures of Distributed and Parallel Algorithms --$tDuplicate Routing in Distributed Networks --$tNotes on Distributed Algorithms in Unidirectional Rings --$tSense of Direction and Communication Complexity in Distributed Networks --$tThe Communication Complexity Hierarchy in Distributed Computing --$tSimulation of Chaotic Algorithms by Token Algorithms --$tA General Distributed Graph Algorithm for Fair Access to Critical Sections --$tAddenda --$tOpen Problems --$tA Bibliography of Distributed Algorithms --$tAuthor Index
330   $aThis volume contains papers presented at the First International Workshop on Distributed Algorithms. The papers present solutions to a wide spectrum of problems (leader election, resource allocation, routing, etc.) and focus on a variety of issues that influence communications complexity.
606   $aElectronic data processing$xDistributed processing$vCongresses
606   $aAlgorithms
615  0$aElectronic data processing$xDistributed processing
615  0$aAlgorithms.
676   $a004/.36
701   $aGafni$b Eli$01545798
701   $aSantoro$b N$g(Nicola),$f1951-$0968033
712 12$aInternational Workshop on Distributed Algorithms.
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910967286103321
996   $aDistributed algorithms on graphs$94467123
997   $aUNINA