Vista normal Vista MARC Vista ISBD

Structural Information and Communication Complexity [recurso electrónico] : 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010. Proceedings / edited by Boaz Patt-Shamir, Tinaz Ekim.

Por: Patt-Shamir, Boaz [editor.]Colaborador(es): Ekim, Tinaz [editor.] | SpringerLink (Online service)Tipo de material: Texto

TextoSeries Lecture Notes in Computer Science ; 6058Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Descripción: 273p. 42 illus. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783642132841Tema(s): Computer science | Computer Communication Networks | Data structures (Computer science) | Computer software | Computational complexity | Algorithms | Computer Science | Algorithm Analysis and Problem Complexity | Computer Communication Networks | Discrete Mathematics in Computer Science | Data Structures | AlgorithmsFormatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD: 005.1 Clasificación LoC:QA76.9.A43Recursos en línea: Libro electrónico Texto

Contenidos:

Communication Complexity: From Two-Party to Multiparty -- On the Impact of Local Taxes in a Set Cover Game -- Towards Network Games with Social Preferences -- Distributed Weighted Stable Marriage Problem -- Traffic Grooming in Star Networks via Matching Techniques -- Event Extent Estimation -- Asynchronous Deterministic Rendezvous in Bounded Terrains -- Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees -- Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings -- Average Long-Lived Memoryless Consensus: The Three-Value Case -- Algorithms for Extracting Timeliness Graphs -- Distributed Tree Comparison with Nodes of Limited Memory -- Periodic Data Retrieval Problem in Rings Containing a Malicious Host -- A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots -- Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots -- Maximum Interference of Random Sensors on a Line -- Multipath Spanners -- Strong Orientations of Planar Graphs with Bounded Stretch Factor -- A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs -- Fast Algorithms for min independent dominating set.

En: Springer eBooksResumen: The Colloquium on Structure, Information, Communication, and Complexity (SIROCCO) is devoted to the study of communication and knowledge in mul- processorsystemsfromboththe qualitativeandquantitativeviewpoints.Special emphasis is given to innovative approaches and fundamental understanding, in addition to e?orts to optimize current designs. SIROCCO has a traditionof interesting and productive scienti?c meetings in a relaxed and pleasant atmosphere, attracting leading researchersin a variety of ?elds in which communication and knowledge play a signi?cant role. Consistent with this tradition, the 17th SIROCCO meeting was held in Turkey, in the ? picturesque Nesin Mathematics Village, S ¸irince, Izmir, during June 7–11 2010. Thirty-seven papers were submitted to SIROCCO 2010. All papers und- went a thorough peer-review process, where each submission was reviewed by three to six reviewers. The reviews were the basis of the Program Committee deliberations,whichresultedinselecting 19 contributionsfor presentationatthe colloquium and publication in this volume. The presentations in this volume also include the abstract of an invited talk on communication complexity, given by Eyal Kushilevitz. We thank the authors of all the submitted papers, the Program Committee members, and the external reviewers. Without their dedication, we could not have prepared a program of such quality. We wouldalsolike to thank the SIROCCOSteering Committee Chair,Pierre Fraigniaud, for his energy and leadership in making this conference happen. Lastbutnotleast,wewouldlike tothankthe localarrangementspeoplefrom Nesin Mathematics Village, notably Asl? Can Korkmaz and the many students who volunteered on the organization team, for their invaluable help.

Existencias ( 1 )
Notas de título ( 3 )

Existencias
Tipo de ítem	Biblioteca actual	Colección	Signatura	Copia número	Estado	Fecha de vencimiento	Código de barras
Libro Electrónico	Biblioteca Electrónica	Colección de Libros Electrónicos	QA76.9 .A43 (Browse shelf(Abre debajo))	1	No para préstamo		374451-2001

The Colloquium on Structure, Information, Communication, and Complexity (SIROCCO) is devoted to the study of communication and knowledge in mul- processorsystemsfromboththe qualitativeandquantitativeviewpoints.Special emphasis is given to innovative approaches and fundamental understanding, in addition to e?orts to optimize current designs. SIROCCO has a traditionof interesting and productive scienti?c meetings in a relaxed and pleasant atmosphere, attracting leading researchersin a variety of ?elds in which communication and knowledge play a signi?cant role. Consistent with this tradition, the 17th SIROCCO meeting was held in Turkey, in the ? picturesque Nesin Mathematics Village, S ¸irince, Izmir, during June 7–11 2010. Thirty-seven papers were submitted to SIROCCO 2010. All papers und- went a thorough peer-review process, where each submission was reviewed by three to six reviewers. The reviews were the basis of the Program Committee deliberations,whichresultedinselecting 19 contributionsfor presentationatthe colloquium and publication in this volume. The presentations in this volume also include the abstract of an invited talk on communication complexity, given by Eyal Kushilevitz. We thank the authors of all the submitted papers, the Program Committee members, and the external reviewers. Without their dedication, we could not have prepared a program of such quality. We wouldalsolike to thank the SIROCCOSteering Committee Chair,Pierre Fraigniaud, for his energy and leadership in making this conference happen. Lastbutnotleast,wewouldlike tothankthe localarrangementspeoplefrom Nesin Mathematics Village, notably Asl? Can Korkmaz and the many students who volunteered on the organization team, for their invaluable help.