|
|
|
|
| LEADER |
08498cam a22014292 4500 |
| 001 |
0-1648920578 |
| 003 |
DE-627 |
| 005 |
20240122105327.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
100309s2010 gw |||||o 00| ||eng c |
| 020 |
|
|
|a 9783642114762
|9 978-3-642-11476-2
|
| 024 |
7 |
|
|a 10.1007/978-3-642-11476-2
|2 doi
|
| 035 |
|
|
|a (DE-627)1648920578
|
| 035 |
|
|
|a (DE-576)320489507
|
| 035 |
|
|
|a (DE-599)BSZ320489507
|
| 035 |
|
|
|a (OCoLC)699828618
|
| 035 |
|
|
|a (OCoLC)839411931
|
| 035 |
|
|
|a (ZBM)1181.68009
|
| 035 |
|
|
|a (DE-He213)978-3-642-11476-2
|
| 035 |
|
|
|a (EBP)040514587
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 044 |
|
|
|c XA-DE
|
| 050 |
|
0 |
|a QA76.9.A43
|
| 072 |
|
7 |
|a UMB
|2 bicssc
|
| 072 |
|
7 |
|a COM051300
|2 bisacsh
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 084 |
|
|
|a SS 4800
|2 rvk
|0 (DE-625)rvk/143528:
|
| 084 |
|
|
|a *68-06
|2 msc
|
| 084 |
|
|
|a 68Mxx
|2 msc
|
| 084 |
|
|
|a 68Wxx
|2 msc
|
| 084 |
|
|
|a 00B25
|2 msc
|
| 084 |
|
|
|a 54.32
|2 bkl
|
| 084 |
|
|
|a 54.10
|2 bkl
|
| 100 |
1 |
|
|a Kutten, Shay
|4 aut
|
| 245 |
1 |
0 |
|a Structural Information and Communication Complexity
|b 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers
|c edited by Shay Kutten, Janez Žerovnik
|
| 264 |
|
1 |
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2010
|
| 300 |
|
|
|a Online-Ressource (350p. 75 illus, digital)
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a Computermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a Online-Ressource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science
|v 5869
|
| 490 |
0 |
|
|a SpringerLink
|a Bücher
|
| 520 |
|
|
|a Invited Talks -- Zooming in on Network-on-Chip Architectures -- On Efficient Gossiping in Radio Networks -- Regular Papers -- Regular Register: An Implementation in a Churn Prone Environment -- Ordered Coloring Grids and Related Graphs -- Sub-linear Universal Spatial Gossip Protocols -- Designing Hypergraph Layouts to GMPLS Routing Strategies -- On Gossip and Populations -- Reconstructing Visibility Graphs with Simple Robots -- Stability of Networks in Stretchable Graphs -- Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents -- Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks -- A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm -- Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications -- More Efficient Periodic Traversal in Anonymous Undirected Graphs -- Black Hole Search in Directed Graphs -- Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots -- Revisiting Randomized Parallel Load Balancing Algorithms -- An Improved Strategy for Exploring a Grid Polygon -- An Efficient Self-stabilizing Distance-2 Coloring Algorithm -- Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs -- A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition -- On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology -- Loosely-Stabilizing Leader Election in Population Protocol Model -- Convergence of Mobile Robots with Uniformly-Inaccurate Sensors -- An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract).
|
| 520 |
|
|
|a This book constitutes the thoroughly refereed post-conference proceedings of the 16th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2009, held in Piran, Slovenia, in May 2009. The 23 revised full papers presented were carefully reviewed and selected from 53 submissions. The volume also contains two invited papers. SIROCCO addresses topics such as distributed computing, parallel computing, game theory, social networks, networking, mobile computing, peer to peer systems, communication complexity, combinatorial optimization; special focus is put to compact data structures, information dissemination, informative labeling schemes, distributed scheduling, wireless networks and scheduling of transmissions, routing, broadcasting, and localization.
|
| 650 |
|
0 |
|a Computer Communication Networks
|
| 650 |
|
0 |
|a Data structures (Computer science)
|
| 650 |
|
0 |
|a Computer software
|
| 650 |
|
0 |
|a Computational complexity
|
| 650 |
|
0 |
|a Computer Science
|
| 650 |
|
0 |
|a Computer science
|
| 650 |
|
0 |
|a Algorithms
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
|
0 |
|a Computer networks .
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Artificial intelligence
|
| 655 |
|
7 |
|a Konferenzschrift
|y 2009
|z Piran
|0 (DE-588)1071861417
|0 (DE-627)826484824
|0 (DE-576)433375485
|2 gnd-content
|
| 689 |
0 |
0 |
|D s
|0 (DE-588)4070085-9
|0 (DE-627)104131403
|0 (DE-576)209179252
|a Rechnernetz
|2 gnd
|
| 689 |
0 |
1 |
|D s
|0 (DE-588)4238872-7
|0 (DE-627)104657308
|0 (DE-576)210416696
|a Verteiltes System
|2 gnd
|
| 689 |
0 |
2 |
|D s
|0 (DE-588)4120591-1
|0 (DE-627)105775428
|0 (DE-576)209536381
|a Komplexitätstheorie
|2 gnd
|
| 689 |
0 |
3 |
|D s
|0 (DE-588)4113782-6
|0 (DE-627)105826898
|0 (DE-576)209479302
|a Graphentheorie
|2 gnd
|
| 689 |
0 |
|
|5 DE-101
|
| 689 |
1 |
0 |
|D s
|0 (DE-588)4125542-2
|0 (DE-627)105739456
|0 (DE-576)20957741X
|a Kommunikationssystem
|2 gnd
|
| 689 |
1 |
1 |
|D s
|0 (DE-588)4265845-7
|0 (DE-627)104572604
|0 (DE-576)210645164
|a Nachrichtenverkehr
|2 gnd
|
| 689 |
1 |
2 |
|D s
|0 (DE-588)4026925-5
|0 (DE-627)106286617
|0 (DE-576)208968539
|a Informationsstruktur
|2 gnd
|
| 689 |
1 |
3 |
|D s
|0 (DE-588)4197555-8
|0 (DE-627)105195618
|0 (DE-576)210116056
|a Strukturkomplexität
|2 gnd
|
| 689 |
1 |
|
|5 DE-101
|
| 700 |
1 |
|
|a Žerovnik, Janez
|4 oth
|
| 776 |
1 |
|
|z 9783642114755
|
| 776 |
0 |
8 |
|i Buchausg. u.d.T.
|t Structural information and communication complexity
|d Berlin : Springer, 2010
|h XI, 340 S.
|w (DE-627)618342265
|w (DE-576)31922015X
|z 364211475x
|z 9783642114755
|
| 830 |
|
0 |
|a Lecture notes in computer science
|v 5869
|9 5869
|w (DE-627)316228877
|w (DE-576)093890923
|w (DE-600)2018930-8
|x 1611-3349
|7 ns
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-642-11476-2
|m X:SPRINGER
|x Verlag
|z lizenzpflichtig
|3 Volltext
|
| 856 |
4 |
2 |
|u https://swbplus.bsz-bw.de/bsz320489507cov.jpg
|m V:DE-576
|m X:springer
|q image/jpeg
|v 20150402155941
|3 Cover
|
| 856 |
4 |
2 |
|u https://zbmath.org/?q=an:1181.68009
|m B:ZBM
|v 2021-04-12
|x Verlag
|y Zentralblatt MATH
|3 Inhaltstext
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|b 2010
|
| 912 |
|
|
|a ZDB-2-SEB
|
| 912 |
|
|
|a ZDB-2-SCS
|b 2010
|
| 912 |
|
|
|a ZDB-2-SXCS
|b 2010
|
| 912 |
|
|
|a ZDB-2-SEB
|b 2010
|
| 936 |
r |
v |
|a SS 4800
|b Lecture notes in computer science
|k Informatik
|k Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen
|k Schriftenreihen (indiv. Sign.)
|k Lecture notes in computer science
|0 (DE-627)1271461242
|0 (DE-625)rvk/143528:
|0 (DE-576)201461242
|
| 936 |
b |
k |
|a 54.32
|j Rechnerkommunikation
|q SEPA
|0 (DE-627)10640623X
|
| 936 |
b |
k |
|a 54.10
|j Theoretische Informatik
|q SEPA
|0 (DE-627)106418815
|
| 951 |
|
|
|a BO
|
| 950 |
|
|
|a Computernetz
|
| 950 |
|
|
|a Computernetzwerk
|
| 950 |
|
|
|a Datenverarbeitung
|
| 950 |
|
|
|a Verbundsystem
|
| 950 |
|
|
|a Mehrrechnernetz
|
| 950 |
|
|
|a Vernetzung
|
| 950 |
|
|
|a Datennetz
|
| 950 |
|
|
|a Mehrrechnersystem
|
| 950 |
|
|
|a Verteiltes System
|
| 950 |
|
|
|a Verkehr
|
| 950 |
|
|
|a Distributed System
|
| 950 |
|
|
|a Distributed Data Processing
|
| 950 |
|
|
|a VDV-System
|
| 950 |
|
|
|a Verteilte Datenverarbeitung
|
| 950 |
|
|
|a Verteilte Verarbeitung
|
| 950 |
|
|
|a Verteiltes Datenverarbeitungssystem
|
| 950 |
|
|
|a Verteiltes Softwaresystem
|
| 950 |
|
|
|a Datenverarbeitungssystem
|
| 950 |
|
|
|a Rechnernetz
|
| 950 |
|
|
|a Client-Server-Konzept
|
| 950 |
|
|
|a Komplexitätstheorie
|
| 950 |
|
|
|a Kommunikationssysteme
|
| 950 |
|
|
|a Коммуникационная система
|
| 950 |
|
|
|a Komplexes System
|
| 950 |
|
|
|a Graph
|
| 950 |
|
|
|a Diskrete Mathematik
|
| 950 |
|
|
|a Information
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-11476-2
|9 DE-14
|
| 852 |
|
|
|a DE-14
|z 2011-07-20T14:58:12Z
|x epn:3331550841
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-11476-2
|9 DE-15
|
| 852 |
|
|
|a DE-15
|z 2011-05-16T16:33:42Z
|x epn:3331550957
|
| 976 |
|
|
|h Elektronischer Volltext - Campuslizenz
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-11476-2
|z Zum Online-Dokument
|9 DE-Zi4
|
| 852 |
|
|
|a DE-Zi4
|z 2011-01-26T14:25:49Z
|x epn:3331551074
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-11476-2
|9 DE-520
|
| 852 |
|
|
|a DE-520
|z 2012-11-21T15:46:08Z
|x epn:3331551120
|
| 980 |
|
|
|a 1648920578
|b 0
|k 1648920578
|o 320489507
|
SOLR
| _version_ |
1789364085581676544 |
| access_facet |
Electronic Resources |
| author |
Kutten, Shay |
| author2 |
Žerovnik, Janez |
| author2_role |
oth |
| author2_variant |
j ž jž |
| author_facet |
Kutten, Shay, Žerovnik, Janez |
| author_role |
aut |
| author_sort |
Kutten, Shay |
| author_variant |
s k sk |
| callnumber-first |
Q - Science |
| callnumber-label |
QA76 |
| callnumber-raw |
QA76.9.A43 |
| callnumber-search |
QA76.9.A43 |
| callnumber-sort |
QA 276.9 A43 |
| callnumber-subject |
QA - Mathematics |
| collection |
ZDB-2-SCS, ZDB-2-LNC, ZDB-2-SEB, ZDB-2-SXCS |
| contents |
Invited Talks -- Zooming in on Network-on-Chip Architectures -- On Efficient Gossiping in Radio Networks -- Regular Papers -- Regular Register: An Implementation in a Churn Prone Environment -- Ordered Coloring Grids and Related Graphs -- Sub-linear Universal Spatial Gossip Protocols -- Designing Hypergraph Layouts to GMPLS Routing Strategies -- On Gossip and Populations -- Reconstructing Visibility Graphs with Simple Robots -- Stability of Networks in Stretchable Graphs -- Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents -- Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks -- A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm -- Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications -- More Efficient Periodic Traversal in Anonymous Undirected Graphs -- Black Hole Search in Directed Graphs -- Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots -- Revisiting Randomized Parallel Load Balancing Algorithms -- An Improved Strategy for Exploring a Grid Polygon -- An Efficient Self-stabilizing Distance-2 Coloring Algorithm -- Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs -- A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition -- On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology -- Loosely-Stabilizing Leader Election in Population Protocol Model -- Convergence of Mobile Robots with Uniformly-Inaccurate Sensors -- An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract)., This book constitutes the thoroughly refereed post-conference proceedings of the 16th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2009, held in Piran, Slovenia, in May 2009. The 23 revised full papers presented were carefully reviewed and selected from 53 submissions. The volume also contains two invited papers. SIROCCO addresses topics such as distributed computing, parallel computing, game theory, social networks, networking, mobile computing, peer to peer systems, communication complexity, combinatorial optimization; special focus is put to compact data structures, information dissemination, informative labeling schemes, distributed scheduling, wireless networks and scheduling of transmissions, routing, broadcasting, and localization. |
| ctrlnum |
(DE-627)1648920578, (DE-576)320489507, (DE-599)BSZ320489507, (OCoLC)699828618, (OCoLC)839411931, (ZBM)1181.68009, (DE-He213)978-3-642-11476-2, (EBP)040514587 |
| de15_date |
2011-05-16T16:33:42Z |
| doi_str_mv |
10.1007/978-3-642-11476-2 |
| era_facet |
2009 |
| facet_912a |
ZDB-2-SCS, ZDB-2-LNC, ZDB-2-SEB, ZDB-2-SXCS |
| facet_avail |
Online |
| facet_local_del330 |
Rechnernetz, Verteiltes System, Komplexitätstheorie, Graphentheorie, Kommunikationssystem, Nachrichtenverkehr, Informationsstruktur, Strukturkomplexität |
| finc_class_facet |
Informatik, Mathematik |
| finc_id_str |
0000841034 |
| fincclass_txtF_mv |
science-computerscience |
| format |
eBook, ConferenceProceedings |
| format_access_txtF_mv |
Book, E-Book |
| format_de105 |
Ebook |
| format_de14 |
Book, E-Book |
| format_de15 |
Book, E-Book |
| format_del152 |
Buch |
| format_detail_txtF_mv |
text-online-monograph-independent-conference |
| format_dezi4 |
e-Book |
| format_finc |
Book, E-Book |
| format_legacy |
ElectronicBook |
| format_legacy_nrw |
Book, E-Book |
| format_nrw |
Book, E-Book |
| format_strict_txtF_mv |
E-Book |
| genre |
Konferenzschrift 2009 Piran (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content |
| genre_facet |
Konferenzschrift |
| geogr_code |
not assigned |
| geogr_code_person |
not assigned |
| geographic_facet |
Piran |
| hierarchy_parent_id |
0-316228877 |
| hierarchy_parent_title |
Lecture notes in computer science |
| hierarchy_sequence |
5869 |
| hierarchy_top_id |
0-316228877 |
| hierarchy_top_title |
Lecture notes in computer science |
| id |
0-1648920578 |
| illustrated |
Not Illustrated |
| imprint |
Berlin, Heidelberg, Springer Berlin Heidelberg, 2010 |
| imprint_str_mv |
Berlin, Heidelberg: Springer Berlin Heidelberg, 2010 |
| institution |
DE-14, DE-Zi4, DE-520, DE-15 |
| is_hierarchy_id |
0-1648920578 |
| is_hierarchy_title |
Structural Information and Communication Complexity: 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers |
| isbn |
9783642114762 |
| isbn_isn_mv |
9783642114755, 364211475x |
| issn_isn_mv |
1611-3349 |
| kxp_id_str |
1648920578 |
| language |
English |
| last_indexed |
2024-01-28T19:36:10.647Z |
| local_heading_facet_dezwi2 |
Computer Communication Networks, Data structures (Computer science), Computer software, Computational complexity, Computer Science, Computer science, Algorithms, Discrete mathematics., Computer networks ., Computer programming., Artificial intelligence, Rechnernetz, Verteiltes System, Komplexitätstheorie, Graphentheorie, Kommunikationssystem, Nachrichtenverkehr, Informationsstruktur, Strukturkomplexität |
| marc024a_ct_mv |
10.1007/978-3-642-11476-2 |
| match_str |
kutten2010structuralinformationandcommunicationcomplexity16thinternationalcolloquiumsirocco2009piransloveniamay25272009revisedselectedpapers |
| mega_collection |
Verbunddaten SWB |
| multipart_link |
093890923 |
| multipart_part |
(093890923)5869 |
| oclc_num |
699828618, 839411931 |
| physical |
Online-Ressource (350p. 75 illus, digital) |
| publishDate |
2010 |
| publishDateSort |
2010 |
| publishPlace |
Berlin, Heidelberg |
| publisher |
Springer Berlin Heidelberg |
| record_format |
marcfinc |
| record_id |
320489507 |
| recordtype |
marcfinc |
| rsn_id_str_mv |
(DE-15)2459761 |
| rvk_facet |
SS 4800 |
| rvk_label |
Informatik, Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen, Schriftenreihen (indiv. Sign.), Lecture notes in computer science |
| rvk_path |
SS, SQ - SU, SS 4000 - SS 5999, SS 4800 |
| rvk_path_str_mv |
SS, SQ - SU, SS 4000 - SS 5999, SS 4800 |
| series |
Lecture notes in computer science, 5869 |
| series2 |
Lecture Notes in Computer Science ; 5869, SpringerLink ; Bücher |
| source_id |
0 |
| spelling |
Kutten, Shay aut, Structural Information and Communication Complexity 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers edited by Shay Kutten, Janez Žerovnik, Berlin, Heidelberg Springer Berlin Heidelberg 2010, Online-Ressource (350p. 75 illus, digital), Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, Lecture Notes in Computer Science 5869, SpringerLink Bücher, Invited Talks -- Zooming in on Network-on-Chip Architectures -- On Efficient Gossiping in Radio Networks -- Regular Papers -- Regular Register: An Implementation in a Churn Prone Environment -- Ordered Coloring Grids and Related Graphs -- Sub-linear Universal Spatial Gossip Protocols -- Designing Hypergraph Layouts to GMPLS Routing Strategies -- On Gossip and Populations -- Reconstructing Visibility Graphs with Simple Robots -- Stability of Networks in Stretchable Graphs -- Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents -- Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks -- A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm -- Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications -- More Efficient Periodic Traversal in Anonymous Undirected Graphs -- Black Hole Search in Directed Graphs -- Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots -- Revisiting Randomized Parallel Load Balancing Algorithms -- An Improved Strategy for Exploring a Grid Polygon -- An Efficient Self-stabilizing Distance-2 Coloring Algorithm -- Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs -- A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition -- On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology -- Loosely-Stabilizing Leader Election in Population Protocol Model -- Convergence of Mobile Robots with Uniformly-Inaccurate Sensors -- An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract)., This book constitutes the thoroughly refereed post-conference proceedings of the 16th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2009, held in Piran, Slovenia, in May 2009. The 23 revised full papers presented were carefully reviewed and selected from 53 submissions. The volume also contains two invited papers. SIROCCO addresses topics such as distributed computing, parallel computing, game theory, social networks, networking, mobile computing, peer to peer systems, communication complexity, combinatorial optimization; special focus is put to compact data structures, information dissemination, informative labeling schemes, distributed scheduling, wireless networks and scheduling of transmissions, routing, broadcasting, and localization., Computer Communication Networks, Data structures (Computer science), Computer software, Computational complexity, Computer Science, Computer science, Algorithms, Discrete mathematics., Computer networks ., Computer programming., Artificial intelligence, Konferenzschrift 2009 Piran (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content, s (DE-588)4070085-9 (DE-627)104131403 (DE-576)209179252 Rechnernetz gnd, s (DE-588)4238872-7 (DE-627)104657308 (DE-576)210416696 Verteiltes System gnd, s (DE-588)4120591-1 (DE-627)105775428 (DE-576)209536381 Komplexitätstheorie gnd, s (DE-588)4113782-6 (DE-627)105826898 (DE-576)209479302 Graphentheorie gnd, DE-101, s (DE-588)4125542-2 (DE-627)105739456 (DE-576)20957741X Kommunikationssystem gnd, s (DE-588)4265845-7 (DE-627)104572604 (DE-576)210645164 Nachrichtenverkehr gnd, s (DE-588)4026925-5 (DE-627)106286617 (DE-576)208968539 Informationsstruktur gnd, s (DE-588)4197555-8 (DE-627)105195618 (DE-576)210116056 Strukturkomplexität gnd, Žerovnik, Janez oth, 9783642114755, Buchausg. u.d.T. Structural information and communication complexity Berlin : Springer, 2010 XI, 340 S. (DE-627)618342265 (DE-576)31922015X 364211475x 9783642114755, Lecture notes in computer science 5869 5869 (DE-627)316228877 (DE-576)093890923 (DE-600)2018930-8 1611-3349 ns, https://doi.org/10.1007/978-3-642-11476-2 X:SPRINGER Verlag lizenzpflichtig Volltext, https://swbplus.bsz-bw.de/bsz320489507cov.jpg V:DE-576 X:springer image/jpeg 20150402155941 Cover, https://zbmath.org/?q=an:1181.68009 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext, http://dx.doi.org/10.1007/978-3-642-11476-2 DE-14, DE-14 2011-07-20T14:58:12Z epn:3331550841, http://dx.doi.org/10.1007/978-3-642-11476-2 DE-15, DE-15 2011-05-16T16:33:42Z epn:3331550957, http://dx.doi.org/10.1007/978-3-642-11476-2 Zum Online-Dokument DE-Zi4, DE-Zi4 2011-01-26T14:25:49Z epn:3331551074, http://dx.doi.org/10.1007/978-3-642-11476-2 DE-520, DE-520 2012-11-21T15:46:08Z epn:3331551120 |
| spellingShingle |
Kutten, Shay, Structural Information and Communication Complexity: 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers, Lecture notes in computer science, 5869, Invited Talks -- Zooming in on Network-on-Chip Architectures -- On Efficient Gossiping in Radio Networks -- Regular Papers -- Regular Register: An Implementation in a Churn Prone Environment -- Ordered Coloring Grids and Related Graphs -- Sub-linear Universal Spatial Gossip Protocols -- Designing Hypergraph Layouts to GMPLS Routing Strategies -- On Gossip and Populations -- Reconstructing Visibility Graphs with Simple Robots -- Stability of Networks in Stretchable Graphs -- Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents -- Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks -- A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm -- Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications -- More Efficient Periodic Traversal in Anonymous Undirected Graphs -- Black Hole Search in Directed Graphs -- Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots -- Revisiting Randomized Parallel Load Balancing Algorithms -- An Improved Strategy for Exploring a Grid Polygon -- An Efficient Self-stabilizing Distance-2 Coloring Algorithm -- Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs -- A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition -- On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology -- Loosely-Stabilizing Leader Election in Population Protocol Model -- Convergence of Mobile Robots with Uniformly-Inaccurate Sensors -- An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract)., This book constitutes the thoroughly refereed post-conference proceedings of the 16th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2009, held in Piran, Slovenia, in May 2009. The 23 revised full papers presented were carefully reviewed and selected from 53 submissions. The volume also contains two invited papers. SIROCCO addresses topics such as distributed computing, parallel computing, game theory, social networks, networking, mobile computing, peer to peer systems, communication complexity, combinatorial optimization; special focus is put to compact data structures, information dissemination, informative labeling schemes, distributed scheduling, wireless networks and scheduling of transmissions, routing, broadcasting, and localization., Computer Communication Networks, Data structures (Computer science), Computer software, Computational complexity, Computer Science, Computer science, Algorithms, Discrete mathematics., Computer networks ., Computer programming., Artificial intelligence, Konferenzschrift 2009 Piran, Rechnernetz, Verteiltes System, Komplexitätstheorie, Graphentheorie, Kommunikationssystem, Nachrichtenverkehr, Informationsstruktur, Strukturkomplexität |
| swb_id_str |
320489507 |
| title |
Structural Information and Communication Complexity: 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers |
| title_auth |
Structural Information and Communication Complexity 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers |
| title_full |
Structural Information and Communication Complexity 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers edited by Shay Kutten, Janez Žerovnik |
| title_fullStr |
Structural Information and Communication Complexity 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers edited by Shay Kutten, Janez Žerovnik |
| title_full_unstemmed |
Structural Information and Communication Complexity 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers edited by Shay Kutten, Janez Žerovnik |
| title_in_hierarchy |
5869. Structural Information and Communication Complexity: 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers (2010) |
| title_short |
Structural Information and Communication Complexity |
| title_sort |
structural information and communication complexity 16th international colloquium sirocco 2009 piran slovenia may 25 27 2009 revised selected papers |
| title_sub |
16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers |
| title_unstemmed |
Structural Information and Communication Complexity: 16th International Colloquium, SIROCCO 2009, Piran, Slovenia, May 25-27, 2009, Revised Selected Papers |
| topic |
Computer Communication Networks, Data structures (Computer science), Computer software, Computational complexity, Computer Science, Computer science, Algorithms, Discrete mathematics., Computer networks ., Computer programming., Artificial intelligence, Konferenzschrift 2009 Piran, Rechnernetz, Verteiltes System, Komplexitätstheorie, Graphentheorie, Kommunikationssystem, Nachrichtenverkehr, Informationsstruktur, Strukturkomplexität |
| topic_facet |
Computer Communication Networks, Data structures (Computer science), Computer software, Computational complexity, Computer Science, Computer science, Algorithms, Discrete mathematics., Computer networks ., Computer programming., Artificial intelligence, Konferenzschrift, Rechnernetz, Verteiltes System, Komplexitätstheorie, Graphentheorie, Kommunikationssystem, Nachrichtenverkehr, Informationsstruktur, Strukturkomplexität |
| url |
https://doi.org/10.1007/978-3-642-11476-2, https://swbplus.bsz-bw.de/bsz320489507cov.jpg, https://zbmath.org/?q=an:1181.68009, http://dx.doi.org/10.1007/978-3-642-11476-2 |
