Muutke küpsiste eelistusi

E-raamat: Structural Information and Communication Complexity: 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings

Edited by , Edited by
  • Formaat: PDF+DRM
  • Sari: Lecture Notes in Computer Science 3499
  • Ilmumisaeg: 11-May-2005
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Keel: eng
  • ISBN-13: 9783540320739
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 55,56 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Structural Information and Communication Complexity: 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, ProceedingsSuurem pilt
  • Formaat: PDF+DRM
  • Sari: Lecture Notes in Computer Science 3499
  • Ilmumisaeg: 11-May-2005
  • Kirjastus: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Keel: eng
  • ISBN-13: 9783540320739
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book constitutes the refereed proceedings of the 12th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2005, held in Mont Saint-Michel, France in May 2005.









The 22 revised full papers presented were carefully reviewed and selected from 48 submissions. The papers address issues such as topics in distributed and parallel computing, information dissemination, communication complexity, interconnection networks, high speed networks, wireless networking, mobile computing, optical computing, and related areas.
Abstracts of Invited Talks 1(2)
On Designing Truthful Mechanisms for Online Scheduling
3(15)
Vincenzo Auletta
Roberto De Prisco
Paolo Penna
Giuseppe Persiano
On Private Computation in Incomplete Networks
18(16)
Amos Beimel
Traffic Grooming on the Path
34(15)
Jean-Claude Bermond
Laurent Braud
David Coudert
Range Augmentation Problems in Static Ad-Hoc Wireless Networks
49(16)
Davide Bilo
Guido Proietti
On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs
65(13)
Tiziana Calamoneri
Paola Vocca
A Tight Bound for Online Coloring of Disk Graphs
78(11)
Ioannis Caragiannis
Aleksei V. Fishkin
Christos Kaklamanis
Evi Papaioannou
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances
89(10)
Andrea E.F. Clementi
Miriam Di Ianni
Angelo Monti
Massimo Lauria
Gianlucca Rossi
Riccardo Silvestri
Distributed Exploration of an Unknown Graph
99(16)
Shantanu Das
Paola Flocchini
Amiya Nayak
Nicola Santoro
Two Absolute Bounds for Distributed Bit Complexity
115(12)
Yefim Dinitz
Noam Solomon
Finding Short Right-Hand-on-the-Wall Walks in Graphs
127(13)
Stefan Dobrev
Jesper Jansson
Kunihiko Sadakane
Wing-Kin Sung
Space Lower Bounds for Graph Exploration via Reduced Automata
140(15)
Pierre Fraigniaud
David Ilcinkas
Sergio Rajsbaum
Sebastien Tixeuil
Communications in Unknown Networks: Preserving the Secret of Topology
155(15)
Markus Hinkelmann
Andreas Jakoby
An Improved Algorithm for Adaptive Condition-Based Consensus
170(15)
Taisuke Izumi
Toshimitsu Masuzawa
Biangular Circle Formation by Asynchronous Mobile Robots
185(15)
Branislav Katreniak
Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs
200(16)
Ralf Klasing
Euripides Markou
Tomasz Radzik
Fabiano Sarracco
On Semi-perfect 1-Factorizations
216(15)
Rastislav Kralovic
Richard Kralovic
Free-Riders in Steiner Tree Cost-Sharing Games
231(15)
Paolo Penna
Carmine Ventre
On the Feasibility of Gathering by Autonomous Mobile Robots
246(16)
Giuseppe Prencipe
Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults
262(15)
Nicola Santoro
Peter Widmayer
Minimizing the Number of ADMs in SONET Rings with Maximum Throughput
277(15)
Mordechai Shalom
Shmuel Zaks
Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets
292(15)
Rui Wang
Francis C.M. Lau
Geometric Routing Without Geometry
307(16)
Mirjam Wattenhofer
Roger Wattenhofer
Peter Widmayer
Author Index 323
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97835403207392e.html
Märksõnad: