01377nam0 22002891i 450 UON0022833520231205103448.77685-86726-30-320030730d2001 |0itac50 baporBR|||| |||||ˆOs‰ seguidores do Duce: os italianos fascistas no estado de Sao PauloMaria Luiza Tucci Carneiro (org.)Viviane Teresinha dos SantosSan PauloArquivo do Estado2001168 p.24 cm.001UON002998202001 Inventario deopsmodulo V - Italianos210 Sao PauloArquivo do Estado. Impresa Oficial,Italiani in BrasileStoriaUONC048984FIBRSão PauloUONL002145SANTOSViviane Teresinha (dos)UONV138392TUCCI CARNEIROMaria LuizaUONV138393Arquivo do EstadoUONV269159650ITSOL20250808RICAUON00228335SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI AME 1116 SI SC 37089 5 1116 SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI AME 1116 SI SC 38559 5 1116 Seguidores do Duce: os italianos fascistas no estado de Sao Paulo1271793UNIOR04652nam 22007935 450 991014415250332120251116234547.01-280-30785-497866103078523-540-27796-X10.1007/b98251(CKB)1000000000212434(SSID)ssj0000252598(PQKBManifestationID)11204911(PQKBTitleCode)TC0000252598(PQKBWorkID)10199211(PQKB)11513999(DE-He213)978-3-540-27796-5(MiAaPQ)EBC3088004(PPN)155233963(BIP)46175964(BIP)10695658(EXLCZ)99100000000021243420121227d2004 u| 0engurnn|008mamaatxtccrStructural Information and Communication Complexity 11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004, Proceedings /edited by Ratislav Královic, Ondrej Sykora1st ed. 2004.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2004.1 online resource (X, 303 p.) Lecture Notes in Computer Science,1611-3349 ;3104Bibliographic Level Mode of Issuance: Monograph3-540-22230-8 Includes bibliographical references at the end of each chapters and index.Traffic Grooming in a Passive Star WDM Network -- The Price of Anarchy in All-Optical Networks -- Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks -- Path Layout on Tree Networks: Bounds in Different Label Switching Models -- On Approximability of the Independent Set Problem for Low Degree Graphs -- Asynchronous Broadcast in Radio Networks -- Two-Hop Virtual Path Layout in Tori -- Robot Convergence via Center-of-Gravity Algorithms -- F-Chord: Improved Uniform Routing on Chord -- Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor -- Improved Bounds for Optimal Black Hole Search with a Network Map -- Sparse Additive Spanners for Bounded Tree-Length Graphs -- No-Hole L(p,0) Labelling of Cycles, Grids and Hypercubes -- Existence of Nash Equilibria in Selfish Routing Problems -- Mobile Agents Rendezvous When Tokens Fail -- Time Efficient Gossiping in Known Radio Networks -- Long-Lived Rambo: Trading Knowledge for Communication -- Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach -- Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks -- Perfect Token Distribution on Trees -- Approximation Algorithm for Hotlink Assignment in the Greedy Model -- Optimal Decision Strategies in Byzantine Environments -- Sharing the Cost of Multicast Transmissions in Wireless Networks -- NP-Completeness Results for All-Shortest-Path Interval Routing -- On-Line Scheduling of Parallel Jobs -- The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces.This book constitutes the refereed proceedings of the 11th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2004, held in Smolenice Castle, Slowakia in June 2004.The 26 revised full papers presented were carefully reviewed and selected from 56 submissions.Lecture Notes in Computer Science,1611-3349 ;3104Computer networksAlgorithmsComputer scienceMathematicsDiscrete mathematicsArtificial intelligenceData processingComputer Communication NetworksAlgorithmsDiscrete Mathematics in Computer ScienceData ScienceComputer networks.Algorithms.Computer scienceMathematics.Discrete mathematics.Artificial intelligenceData processing.Computer Communication Networks.Algorithms.Discrete Mathematics in Computer Science.Data Science.004.36Královic Ratislavedthttp://id.loc.gov/vocabulary/relators/edtSykora Ondrejedthttp://id.loc.gov/vocabulary/relators/edtColloquium on Structural Information and Communication ComplexityMiAaPQMiAaPQMiAaPQBOOK9910144152503321Structural Information and Communication Complexity2889850UNINA