Structural information and communication complexity : 12th international colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005 : proceedings /
"SIROCCO 2005 was the twelfth in this series, held in Mont Saint-Michel, France, May 24 26, 2005."
| Corporate Author: | |
|---|---|
| Other Authors: | , |
| Format: | Conference Proceeding Book |
| Language: | English |
| Published: |
Berlin ; New York :
Springer,
c2005
Berlin ; New York : ©2005 Berlin ; New York : ©2005 |
| Series: | Lecture notes in computer science,
3499 Lecture notes in computer science ; 3499 Lecture notes in computer science ; 3499 Lecture notes in computer science ; 3499 Lecture notes in computer science 3499 |
| Subjects: |
| LEADER | 14568nam a2201321Ia 4500 | ||
|---|---|---|---|
| 001 | f9b950dd-d542-46fc-b22b-bc64b0554227 | ||
| 005 | 20240812000000.0 | ||
| 008 | 050614s2005 gw a b 101 0 eng d | ||
| 010 | |z 2006927796 | ||
| 016 | 7 | |a 974531367 |2 DE-101 | |
| 019 | |a 225303280 | ||
| 019 | |a 60400721 |a 288258352 |a 613656981 |a 729901496 |a 739138567 |a 785777454 |a 819134755 |a 880024584 |a 964889943 | ||
| 020 | |a 3540260528 | ||
| 020 | |a 3540320733 | ||
| 020 | |a 9783540260523 | ||
| 020 | |a 9783540320739 | ||
| 024 | 3 | |a 9783540260523 | |
| 029 | 1 | |a NLGGC |b 275794741 | |
| 029 | 1 | |a YDXCP |b 2240018 | |
| 035 | |a (MCM)001362390MIT01 | ||
| 035 | |a (MdBJ)2517144 | ||
| 035 | |a (OCoLC)225303280 | ||
| 035 | |a (OCoLC)262680893 |z (OCoLC)60400721 |z (OCoLC)288258352 |z (OCoLC)613656981 |z (OCoLC)729901496 |z (OCoLC)739138567 |z (OCoLC)785777454 |z (OCoLC)819134755 |z (OCoLC)880024584 |z (OCoLC)964889943 | ||
| 035 | |a (OCoLC)60634595 | ||
| 035 | |a (OCoLC-I)275762058 | ||
| 035 | |a (OCoLC-M)60634595 | ||
| 035 | |a (RPB)b38316225-01bu_inst | ||
| 035 | |a 2517144 |9 ExL | ||
| 035 | |a ocm60634595 | ||
| 035 | |l (OCoLC)262680893 | ||
| 035 | |z (OCoLC)225303280 | ||
| 037 | |a 978-3-540-26052-3 |b Springer |n http://www.springerlink.com | ||
| 040 | |a GW5XE |b eng |e pn |c GW5XE |d GW5XE |d I8H |d HNK |d OHX |d NUI |d OCLCQ |d YNG |d E7B |d OCLCQ |d OCLCF |d OCLCO |d BEDGE |d NLGGC |d ITD |d OCLCO |d SLY |d COO |d YDXCP |d IDEBK |d OCL |d OCLCO |d OCLCQ |d OCLCO |d EBLCP |d VT2 | ||
| 040 | |a LWU |b eng |c LWU |d CUS |d C$Q |d BAKER |d IQU |d IXA |d NLGGC |d YDXCP |d LVB |d BTCTA |d DEBSZ |d UWW |d GW5XE |d E7B |d OCLCQ |d OCLCF |d OCLCO |d OCLCQ |d OCL |d OCLCO | ||
| 040 | |a LWU |b eng |c LWU |d CUS |d C$Q |d BAKER |d IQU |d IXA |d NLGGC |d YDXCP |d LVB |d BTCTA |d DEBSZ |d UWW |d GW5XE |d E7B |d OCLCQ |d OCLCF |d OCLCO |d OCLCQ | ||
| 040 | |a LWU |c LWU |d CUS |d C$Q |d BAKER |d IQU |d IXA |d MYG |d OrLoB-B | ||
| 040 | |a LWU |c LWU |d CUS |d C$Q |d CSt | ||
| 040 | |a LWU |c LWU |d CUS |d C$Q |d UtOrBLW |d OrLoB-B | ||
| 049 | |a CGUA | ||
| 049 | |a JHEE | ||
| 049 | |a MAIN | ||
| 049 | |a MYGG | ||
| 049 | |a RBNN | ||
| 050 | 4 | |a QA76.9.D5 |b C618 2005 | |
| 072 | 7 | |a QA |2 lcco | |
| 082 | 0 | 4 | |a 004 |
| 084 | |a 54.10 |2 bcl | ||
| 084 | |a TP393-532 |2 clc | ||
| 090 | |a QA76.9.D5 |b C618 2005 | ||
| 090 | |a QA76.9.D5.C65 2005 | ||
| 111 | 2 | |a Colloquium on Structural Information and Communication Complexity |n (12th : |d 2005 : |c Le Mont-Saint-Michel, France) | |
| 245 | 1 | 0 | |a Structural information and communication complexity : |b 12th international colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005 : proceedings / |c Andrzej Pelc, Michel Raynal (eds.) |
| 246 | 3 | 0 | |a SIROCCO 2005 |
| 260 | |a Berlin ; |a New York : |b Springer, |c c2005 | ||
| 260 | |a Berlin ; |a New York : |b Springer, |c ©2005 | ||
| 264 | 1 | |a Berlin ; |a New York : |b Springer, |c ©2005 | |
| 300 | |a 1 online resource (x, 322 pages) : |b illustrations | ||
| 300 | |a x, 322 p. : |b ill. ; |c 24 cm | ||
| 300 | |a x, 322 pages : |b illustrations ; |c 24 cm | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 337 | |a unmediated |b n |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 338 | |a volume |b nc |2 rdacarrier | ||
| 440 | 0 | |a Lecture notes in computer science, |x 0302-9743 ; |v 3499 | |
| 490 | 1 | |a Lecture notes in computer science, |x 0302-9743 ; |v 3499 | |
| 500 | |a "Colloquium on Structural Information and Communication Complexity ... annual meeting ... 12th in this series"--Preface | ||
| 504 | |a Includes bibliographical references and index | ||
| 505 | 0 | |a On designing truthful mechanisms for online scheduling / Vincenzo Auletta -- On private computation in incomplete networks / Amos Beimel -- Traffic grooming on the path Jean-Claude Bermond, Laurent Braud, David Coudert -- Range augmentation problems in static ad-hoc wireless networks / Davide Bilò, Guido Proietti -- On the approximability of the L(h; k)-labelling problem on bipartite graphs / Tiziana Calamoneri, Paola Vocca -- A tight bound for online coloring of disk graphs / Ioannis Caragiannis -- Divide and conquer is almost optimal for the bounded-hop MST problem on random Euclidean instances / Andrea E.F. Clementi, Miriam Di Ianni, Angelo Monti -- Distributed exploration of an unknown graph / Shantanu Das, Paola Flocchini, Amiya Nayak -- Two absolute bounds for distributed bit complexity / Yefim Dinitz, Noam Solomon -- Finding short right-hand-on-the-wall walks in graphs / Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane -- Space lower bounds for graph exploration via reduced automata / Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum -- Communications in unknown networks: preserving the secret of topology / Markus Hinkelmann, Andreas Jakoby -- An improved algorithm for adaptive condition-based consensus / Taisuke Izumi, Toshimitsu Masuzawa -- Biangular circle formation by asynchronous mobile robots / Branislav Katreniak -- Hardness and approximation results for black hole search in arbitrary graphs / Ralf Klasing, Euripides Markou, Tomasz Radzik -- On semi-perfect 1-factorizations / Rastislav Královic, Richard Královic -- Free-riders in Steiner tree cost-sharing games / Paolo Penna, Carmine Ventre -- On the feasibility of gathering by autonomous mobile robots / Giuseppe Prencipe -- Majority and unanimity in synchronous networks with ubiquitous dynamic faults / Nicola Santoro, Peter Widmayer -- Minimizing the number of ADMs in SONET rings with maximum throughput / Mordechai Shalom, Shmuel Zaks -- Optimal gossiping in square meshes in all-port mode and with short packets / Rui Wang, Francis C.M. Lau -- Geometric routing without geometry / Mirjam Wattenhofer, Roger Wattenhofer, Peter Widmayer | |
| 505 | 0 | 0 | |t On designing truthful mechanisms for online scheduling / |r Vincenzo Auletta, Roberto De Prisco, Paolo Penna and Giuseppe Persiano -- |t On private computation in incomplete networks / |r Amos Beimel -- |t Traffic grooming on the path / |r Jean-Claude Bermond, Laurent Braud and David Coudert -- |t Range augmentation problems in static ad-hoc wireless networks / |r Davide Bilo and Guido Proietti -- |t On the approximability of the L(h, k)-labelling problem on bipartite graphs / |r Tiziana Calamoneri and Paola Vocca -- |t A tight bound for online coloring of disk graphs / |r Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis and Evi Papaioannou -- |t Divide and conquer is almost optimal for the bounded-hop MST problem on random Euclidean instances / |r Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianlucca Rossi and Riccardo Silvestri -- |t Distributed exploration of an unknown graph / |r Shantanu Das, Paola Flocchini, Amiya Nayak and Nicola Santoro -- |t Two absolute bounds for distributed bit complexity / |r Yefim Dinitz and Noam Solomon -- |t Finding short right-hand-on-the-wall walks in graphs / |r Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung -- |t Space lower bounds for graph exploration via reduced automata / |r Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum and Sebastien Tixeuil -- |t Communications in unknown networks : preserving the secret of topology / |r Markus Hinkelmann and Andreas Jakoby -- |t An improved algorithm for adaptive condition-based consensus / |r Taisuke Izumi and Toshimitsu Masuzawa -- |t Biangular circle formation by asynchronous mobile robots / |r Branislav Katreniak -- |t Hardness and approximation results for black hole search in arbitrary graphs / |r Ralf Klasing, Euripides Markou, Tomasz Radzik and Fabiano Sarracco -- |t On semi-perfect 1-factorizations / |r Rastislav Kralovic and Richard Kralovic -- |t Free-riders in Steiner tree cost-sharing games / |r Paolo Penna and Carmine Ventre -- |t On the feasibility of gathering by autonomous mobile robots / |r Giuseppe Prencipe -- |t Majority and unanimity in synchronous networks with ubiquitous dynamic faults / |r Nicola Santoro and Peter Widmayer -- |t Minimizing the number of ADMs in SONET rings with maximum throughput / |r Mordechai Shalom and Shmuel Zaks -- |t Optimal gossiping in square meshes in all-port mode and with short packets / |r Rui Wang and Francis C. M. Lau -- |t Geometric routing without geometry / |r Miriam Wattenhofer, Roger Wattenhofer and Peter Widmayer |
| 505 | 0 | 0 | |t On designing truthful mechanisms for online scheduling / |r Vincenzo Auletta, Roberto De Prisco, Paolo Penna and Giuseppe Persiano -- |t On private computation in incomplete networks / |r Amos Beimel -- |t Traffic grooming on the path / |r Jean-Claude Bermond, Laurent Braud and David Coudert -- |t Range augmentation problems in static ad-hoc wireless networks / |r Davide Bilo and Guido Proietti -- |t On the approximability of the L(h, k)-labelling problem on bipartite graphs / |r Tiziana Calamoneri and Paola Vocca -- |t A tight bound for online coloring of disk graphs / |r Ioannis Caragiannis, Aleksei V. Fishkin, Christos Kaklamanis and Evi Papaioannou -- |t Divide and conquer is almost optimal for the bounded-hop MST problem on random Euclidean instances / |r Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianlucca Rossi and Riccardo Silvestri -- |t Distributed exploration of an unknown graph / |r Shantanu Das, Paola Flocchini, Amiya Nayak and Nicola Santoro -- |t Two absolute bounds for distributed bit complexity / |r Yefim Dinitz and Noam Solomon -- |t Finding short right-hand-on-the-wall walks in graphs / |r Stefan Dobrev, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung -- |t Space lower bounds for graph exploration via reduced automata / |r Pierre Fraigniaud, David Ilcinkas, Sergio Rajsbaum and Sebastien Tixeuil -- |t Communications in unknown networks : preserving the secret of topology / |r Markus Hinkelmann and Andreas Jakoby -- |t An improved algorithm for adaptive condition-based consensus / |r Taisuke Izumi and Toshimitsu Masuzawa -- |t Biangular circle formation by asynchronous mobile robots / |r Branislav Katreniak -- |t Hardness and approximation results for black hole search in arbitrary graphs / |r Ralf Klasing, Euripides Markou, Tomasz Radzik and Fabiano Sarracco -- |t On semi-perfect 1-factorizations / |r Rastislav Kralovic and Richard Kralovic -- |t Free-riders in Steiner tree cost-sharing games / |r Paolo Penna and Carmine Ventre -- |
| 505 | 8 | 0 | |t On the feasibility of gathering by autonomous mobile robots / |r Giuseppe Prencipe -- |t Majority and unanimity in synchronous networks with ubiquitous dynamic faults / |r Nicola Santoro and Peter Widmayer -- |t Minimizing the number of ADMs in SONET rings with maximum throughput / |r Mordechai Shalom and Shmuel Zaks -- |t Optimal gossiping in square meshes in all-port mode and with short packets / |r Rui Wang and Francis C. M. Lau -- |t Geometric routing without geometry / |r Miriam Wattenhofer, Roger Wattenhofer and Peter Widmayer |
| 520 | |a "SIROCCO 2005 was the twelfth in this series, held in Mont Saint-Michel, France, May 24 26, 2005." | ||
| 530 | |a Also available on the World Wide Web | ||
| 530 | |a Also available online via the World Wide Web; access restricted to licensed sites/users | ||
| 530 | |a Also issued online | ||
| 588 | 0 | |a Print version record | |
| 590 | |a OCLC |b WorldCat Holdings | ||
| 590 | |a SpringerLink |b Springer Lecture Notes in Computer Science | ||
| 596 | |a 31 | ||
| 650 | 0 | |a Computer networks |v Congresses | |
| 650 | 0 | |a Electronic data processing |x Distributed processing |v Congresses | |
| 650 | 6 | |a Réseaux d'ordinateurs |v Congrès | |
| 650 | 6 | |a Traitement réparti |v Congrès | |
| 650 | 7 | |a Computer networks |2 fast | |
| 650 | 7 | |a Electronic data processing |x Distributed processing |2 fast | |
| 650 | 7 | |a Informatique |2 eclas | |
| 650 | 0 | 7 | |a Computer networks |2 cct |
| 650 | 0 | 7 | |a Electronic data processing |x Distributed processing |2 cct |
| 655 | 4 | |a Electronic books | |
| 655 | 7 | |a Conference papers and proceedings |2 fast | |
| 655 | 7 | |a Conference papers and proceedings |2 lcgft | |
| 700 | 1 | |a Pelc, Andrzej |1 http://viaf.org/viaf/57708097 | |
| 700 | 1 | |a Pelc, Andrzej | |
| 700 | 1 | |a Raynal, M |q (Michel) |1 http://viaf.org/viaf/92406650 | |
| 700 | 1 | |a Raynal, M |q (Michel) | |
| 776 | |w (OCoLC)262680893 | ||
| 776 | 0 | 8 | |i Print version: |a Colloquium on Structural Information and Communication Complexity (12th : 2005 : Le Mont-Saint-Michel, France) |t Structural information and communication complexity. |d Berlin ; New York : Springer, ©2005 |z 3540260528 |z 9783540260523 |w (OCoLC)60634595 |
| 830 | 0 | |a Lecture notes in computer science ; |v 3499 |x 0302-9743 | |
| 830 | 0 | |a Lecture notes in computer science ; |v 3499 |x 0302-9743. | |
| 830 | 0 | |a Lecture notes in computer science ; |v 3499 | |
| 830 | 0 | |a Lecture notes in computer science |v 3499 | |
| 999 | 1 | 0 | |i f9b950dd-d542-46fc-b22b-bc64b0554227 |l a5987845 |s US-CST |m structural_information_and_communication_complexity12th_international______2005_______sprina________________________________________colloquium_on_struct_______________e |
| 999 | 1 | 0 | |i f9b950dd-d542-46fc-b22b-bc64b0554227 |l 11068274 |s US-ICU |m structural_information_and_communication_complexity12th_international______2005_______sprina________________________________________colloquium_on_struct_______________e |
| 999 | 1 | 0 | |i f9b950dd-d542-46fc-b22b-bc64b0554227 |l 5644035 |s US-ICU |m structural_information_and_communication_complexity12th_international______2005_______sprina________________________________________colloquium_on_struct_______________e |
| 999 | 1 | 0 | |i f9b950dd-d542-46fc-b22b-bc64b0554227 |l 990013623900106761 |s US-MCM |m structural_information_and_communication_complexity12th_international______2005_______sprina________________________________________colloquium_on_struct_______________e |
| 999 | 1 | 0 | |i f9b950dd-d542-46fc-b22b-bc64b0554227 |l 991029303559707861 |s US-MDBJ |m structural_information_and_communication_complexity12th_international______2005_______sprina________________________________________colloquium_on_struct_______________e |
| 999 | 1 | 0 | |i f9b950dd-d542-46fc-b22b-bc64b0554227 |l 991003037179706966 |s US-RPB |m structural_information_and_communication_complexity12th_international______2005_______sprina________________________________________colloquium_on_struct_______________e |
| 999 | 1 | 1 | |l a5987845 |s ISIL:US-CST |t BKS |a SAL3 STACKS |b 36105121818947 |c QA76.9 .D5 C64 2005 |d LC |x STKS-MONO |y 36105121818947 |p LOANABLE |
| 999 | 1 | 1 | |l 5644035 |s ISIL:US-ICU |t BKS |a ASR-SciASR |b 70302791 |c QA76.9.D5C617 2005 |d Library of Congress classification |y 7864162 |p LOANABLE |
| 999 | 1 | 1 | |l 990013623900106761 |s ISIL:US-MCM |t BKS |a LSA OCC |b 39080028592365 |c QA76.9.D5.C65 2005 |d 0 |x BOOK |y 23485813270006761 |p UNLOANABLE |
| 999 | 1 | 1 | |l 991029303559707861 |s ISIL:US-MDBJ |t BKS |a LSC shmoffs |b 31151024351870 |c QA76.9.D5 C618 2005 |d 0 |x jhbooks |y 23420192690007861 |p LOANABLE |
| 999 | 1 | 1 | |l 991003037179706966 |s ISIL:US-RPB |t BKS |a ROCK RKSTORAGE |b 31236018830433 |c QA76.9.D5 C618 2005 |d 0 |y 23331212650006966 |p LOANABLE |