Structural information and communication complexity : 17th international colloquium, SIROCCO 2010, Şirince, Turkey, June 7-11, 2010 : proceedings / Boaz Patt-Shamir, Tinaz Ekim (eds.).

By: (17th : Colloquium on Structural Information and Communication Complexity (17th : 2010 : İzmir, Turkey)
Contributor(s): Patt-Shamir, Boaz | Ekim, Tınaz
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 6058.; LNCS sublibrary: Publisher: Berlin ; New York : Springer, ©2010Description: 1 online resource (xii, 261 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783642132841; 3642132847Subject(s): Electronic data processing -- Distributed processing -- Congresses | Computer algorithms -- Congresses | Computer networks -- Congresses | Algorithms | Electronic Data Processing | Computer Communication Networks | Evaluation Studies as Topic | Informatique | Computer algorithms | Computer networks | Electronic data processing -- Distributed processing | Verteiltes System | Autonomes System | Ad-hoc-Netz | Komplexitätstheorie | Kommunikationssystem | Nachrichtenverkehr | Informationsstruktur | Strukturkomplexität | Şirince <2010>Genre/Form: Congress. | Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Structural information and communication complexity.DDC classification: 004.6 LOC classification: QA76.9.D5 | C64 2010Online resources: Click here to access online
Contents:
Communication complexity : from two-party to multiparty (invited talk) / Eyal Kushilevitz -- On the impact of local taxes in a set cover game / Bruno Escoffier, Laurent Gourvès, and Jérôme Monnot -- Towards network games with social preferences / Petr Kuznetsov and Stefan Schmid -- Distributed weighted stable marriage problem / Nir Amira, Ran Giladi, and Zvi Lotker -- Traffic grooming in star networks via matching techniques / Ignasi Sau, Mordechai Shalom, and Shmuel Zaks -- Event extent estimation / Marcin Bienkowski, Leszek Gąsieniec, Marek Klonowski, Miroslaw Korzeniowski, and Stefan Schmid -- Asynchronous deterministic rendezvous in bounded terrains / Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, and Andrzej Pelc -- Space-optimal rendezvous of mobile agents in asynchronous trees / Daisuke Baba, Tomoko Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa -- Mobile robots gathering algorithm with local weak multiplicity in rings / Tomoko Izumi, Taisuke Izumi, Sayaka Kamei, and Fukuhito Ooshita -- Average long-lived memoryless consensus : the three-value case / Ivan Rapaport and Eric Rémila -- Algorithms for extracting timeliness graphs / Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier, and Mikel Larrea -- Distributed tree comparison with nodes of limited memory / Emanuele Guido Fusco and Andrzej Pelc -- Periodic data retrieval problem in rings containing a malicious host (extended abstract) / Rastislav Královič and Stanislav Miklík -- A continuous, local strategy for constructing a short chain of mobile robots / Bastian Degener, Barbara Kempkes, Peter Kling, and Friedhelm Meyer auf der Heide -- Optimal deterministic ring exploration with oblivious asynchronous robots / Anissa Lamani, Maria Gradinariu Potop-Butucaru, and Sébastien Tixeuil -- Maximum interference of random sensors on a line / Evangelos Kranakis, Danny Krizanc, Lata Narayanan, and Ladislav Stacho -- Multipath spanners / Cyril Gavoille, Quentin Godfroy, and Laurent Viennot -- Strong orientations of planar graphs with bounded stretch factor / Evangelos Kranakis, Oscar Morales Ponce, and Ladislav Stacho -- A linear time algorithm for the minimum spanning caterpillar problem for bounded treewidth graphs / Michael J. Dinneen and Masoud Khosravani -- Fast algorithms for min independent dominating set / Nicolas Bourgeois, Bruno Escoffier, and Vangelis Th. Paschos.
Summary: Annotation This book constitutes the refereed proceedings of the 17th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2010, held in Sirince, Turkey, in June 2010. The 19 revised full papers presented were carefully reviewed and selected from 37 submissions. The volume also contains the abstract of one invited talk. The papers are organized in topical section on game theory, network algorithms, motion planning, asynchrony, network algorithms, motion planning, topology algorithms, and graph algorithms.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

Print version record.

Communication complexity : from two-party to multiparty (invited talk) / Eyal Kushilevitz -- On the impact of local taxes in a set cover game / Bruno Escoffier, Laurent Gourvès, and Jérôme Monnot -- Towards network games with social preferences / Petr Kuznetsov and Stefan Schmid -- Distributed weighted stable marriage problem / Nir Amira, Ran Giladi, and Zvi Lotker -- Traffic grooming in star networks via matching techniques / Ignasi Sau, Mordechai Shalom, and Shmuel Zaks -- Event extent estimation / Marcin Bienkowski, Leszek Gąsieniec, Marek Klonowski, Miroslaw Korzeniowski, and Stefan Schmid -- Asynchronous deterministic rendezvous in bounded terrains / Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, and Andrzej Pelc -- Space-optimal rendezvous of mobile agents in asynchronous trees / Daisuke Baba, Tomoko Izumi, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa -- Mobile robots gathering algorithm with local weak multiplicity in rings / Tomoko Izumi, Taisuke Izumi, Sayaka Kamei, and Fukuhito Ooshita -- Average long-lived memoryless consensus : the three-value case / Ivan Rapaport and Eric Rémila -- Algorithms for extracting timeliness graphs / Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier, and Mikel Larrea -- Distributed tree comparison with nodes of limited memory / Emanuele Guido Fusco and Andrzej Pelc -- Periodic data retrieval problem in rings containing a malicious host (extended abstract) / Rastislav Královič and Stanislav Miklík -- A continuous, local strategy for constructing a short chain of mobile robots / Bastian Degener, Barbara Kempkes, Peter Kling, and Friedhelm Meyer auf der Heide -- Optimal deterministic ring exploration with oblivious asynchronous robots / Anissa Lamani, Maria Gradinariu Potop-Butucaru, and Sébastien Tixeuil -- Maximum interference of random sensors on a line / Evangelos Kranakis, Danny Krizanc, Lata Narayanan, and Ladislav Stacho -- Multipath spanners / Cyril Gavoille, Quentin Godfroy, and Laurent Viennot -- Strong orientations of planar graphs with bounded stretch factor / Evangelos Kranakis, Oscar Morales Ponce, and Ladislav Stacho -- A linear time algorithm for the minimum spanning caterpillar problem for bounded treewidth graphs / Michael J. Dinneen and Masoud Khosravani -- Fast algorithms for min independent dominating set / Nicolas Bourgeois, Bruno Escoffier, and Vangelis Th. Paschos.

Annotation This book constitutes the refereed proceedings of the 17th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2010, held in Sirince, Turkey, in June 2010. The 19 revised full papers presented were carefully reviewed and selected from 37 submissions. The volume also contains the abstract of one invited talk. The papers are organized in topical section on game theory, network algorithms, motion planning, asynchrony, network algorithms, motion planning, topology algorithms, and graph algorithms.

There are no comments for this item.

to post a comment.

Powered by Koha