Return to home page
Searching: Muskingum library catalog
Some OPAL libraries remain closed or are operating at reduced service levels. Materials from those libraries may not be requestable; requested items may take longer to arrive. Note that pickup procedures may differ between libraries. Please contact your library for new procedures, specific requests, or other assistance.
  Previous Record Previous Item Next Item Next Record
  Reviews, Summaries, etc...
EBOOK
Conference Colloquium on Structural Information and Communication Complexity (17th : 2010 : Izmir, Turkey)
Title Structural information and communication complexity : 17th international colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010 : proceedings / Boaz Patt-Shamir, Tinaz Ekim (eds.).
Imprint Berlin ; New York : Springer, 2010.

LOCATION CALL # STATUS MESSAGE
 OHIOLINK SPRINGER EBOOKS    ONLINE  
View online
LOCATION CALL # STATUS MESSAGE
 OHIOLINK SPRINGER EBOOKS    ONLINE  
View online
Conference Colloquium on Structural Information and Communication Complexity (17th : 2010 : Izmir, Turkey)
Series Lecture notes in computer science, 0302-9743 ; 6058
LNCS sublibrary: SL 1-theoretical computer science and general issues
Lecture notes in computer science ; 6058.
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
Subject Electronic data processing -- Distributed processing -- Congresses.
Computer algorithms -- Congresses.
Computer networks -- Congresses.
Algorithms.
Electronic Data Processing.
Computer Communication Networks.
Evaluation Studies as Topic.
Alt Name Patt-Shamir, Boaz.
Ekim, Tnaz.
Description 1 online resource (xii, 261 pages) : illustrations.
polychrome rdacc
Bibliography Note Includes bibliographical references and index.
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 Gourves, and Jerome 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 Gasieniec, 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 Remila -- Algorithms for extracting timeliness graphs / Carole Delporte-Gallet, Stephane 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 Kralovic and Stanislav Miklik -- 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 Sebastien 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.
Note Print version record.
ISBN 9783642132841
3642132847
9783642132834 (pbk.)
3642132839 (pbk.)
ISBN/ISSN 10.1007/978-3-642-13284-1
OCLC # 654399457
Additional Format Print version: Colloquium on Structural Information and Communication Complexity (17th : 2010 : Izmir, Turkey). Structural information and communication complexity. Berlin ; New York : Springer, 2010 9783642132834 3642132839 (OCoLC)635376274


If you experience difficulty accessing or navigating this content, please contact the OPAL Support Team