Eintrag weiter verarbeiten
Online-Ressource

Structural Information and Communication Complexity: 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers

Gespeichert in:

Personen und Körperschaften: Moscibroda, Thomas (VerfasserIn), Rescigno, Adele A. (HerausgeberIn)
Titel: Structural Information and Communication Complexity: 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers/ edited by Thomas Moscibroda, Adele A. Rescigno
Format: E-Book Konferenzbericht
Sprache: Englisch
veröffentlicht:
Cham [u.a.] Springer 2013
Gesamtaufnahme: SpringerLink
Lecture notes in computer science ; 8179
Schlagwörter:
Computer Communication Networks
Data structures (Computer science)
Computer software
Computational complexity
Computer Science
Computer science
Algorithms
Computer networks .
Discrete mathematics.
Artificial intelligence
Konferenzschrift
Druckausg.: Structural information and communication complexity, Cham [u.a.] : Springer, 2013, XIX, 348 Seiten
Quelle: Verbunddaten SWB
Zugangsinformationen: Elektronischer Volltext - Campuslizenz
LEADER 09698cam a22016452 4500
001 0-1653132264
003 DE-627
005 20240122104826.0
007 cr uuu---uuuuu
008 131203s2013 gw |||||o 00| ||eng c
020 |a 9783319035789  |9 978-3-319-03578-9 
024 7 |a 10.1007/978-3-319-03578-9  |2 doi 
035 |a (DE-627)1653132264 
035 |a (DE-576)398204861 
035 |a (DE-599)BSZ398204861 
035 |a (OCoLC)863905816 
035 |a (ZBM)1277.68017 
035 |a (ZBM)1277.68017 
035 |a (DE-He213)978-3-319-03578-9 
035 |a (EBP)040552578 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
044 |c XA-DE  |c XA-CH 
050 0 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
084 |a SS 4800  |q BVB  |2 rvk  |0 (DE-625)rvk/143528: 
084 |a *68-06  |2 msc 
084 |a 68Mxx  |2 msc 
084 |a 68R10  |2 msc 
084 |a 00B25  |2 msc 
084 |a 54.32  |2 bkl 
084 |a 54.10  |2 bkl 
100 1 |a Moscibroda, Thomas  |4 aut 
245 1 0 |a Structural Information and Communication Complexity  |b 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers  |c edited by Thomas Moscibroda, Adele A. Rescigno 
264 1 |a Cham [u.a.]  |b Springer  |c 2013 
300 |a Online-Ressource (XX, 348 p. 53 illus, online resource) 
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 8179 
490 0 |a SpringerLink  |a Bücher 
500 |a Literaturangaben 
505 8 0 |a Distributed Community Detection in Dynamic GraphsExploration of the T -Interval-Connected Dynamic Graphs: The Case of the Ring -- A Characterization of Dynamic Networks Where Consensus Is Solvable -- Self-adjusting Grid Networks to Minimize Expected Path Length -- On Advice Complexity of the k-server Problem under Sparse Metrics -- Connected Surveillance Game -- Non-Additive Two-Option Ski Rental -- Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie -- A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations -- Self-organizing Flows in Social Networks -- Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters -- Influence Diffusion in Social Networks under Time Window Constraints -- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications -- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery -- Maintaining Balanced Trees for Structured Distributed Streaming Systems -- Rendezvous of Two Robots with Constant Memory -- Pattern Formation by Mobile Robots with Limited Visibility -- Optimal Gathering of Oblivious Robots in Anonymous Graphs -- Probabilistic Connectivity Threshold for Directional Antenna Widths -- Broadcasting in Ad Hoc Multiple Access Channels -- Profit Maximization in Flex-Grid All-Optical Networks -- Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies -- Optimal Buffer Management for 2-Frame Throughput Maximization -- Dynamically Maintaining Shortest Path Trees under Batches of Updates -- Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems -- Steiner Problems with Limited Number of Branching Nodes -- Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs -- Maximum Distance Separable Codes Based on Circulant Cauchy Matrices. 
520 |a This book constitutes the thoroughly refereed post-conference proceedings of the 20th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2013, held in Ischia, Italy, in July 2013. The 28 revised full papers presented were carefully reviewed and selected from 67 submissions. SIROCCO is devoted to the study of communication and knowledge in distributed systems. Special emphasis is given to innovative approaches and fundamental understanding, in addition to efforts to optimize current designs. The typical areas include distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing (including autonomous robots), peer to peer systems, communication complexity, fault tolerant graph theories and randomized/probabilistic issues in networks 
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 Computer Communication Networks 
650 0 |a Data structures (Computer science) 
650 0 |a Computer software 
650 0 |a Computational complexity 
650 0 |a Algorithms 
650 0 |a Computer science 
650 0 |a Algorithms 
650 0 |a Computer networks . 
650 0 |a Discrete mathematics. 
650 0 |a Artificial intelligence 
655 7 |a Konferenzschrift  |0 (DE-588)1071861417  |0 (DE-627)826484824  |0 (DE-576)433375485  |2 gnd-content 
689 0 0 |D s  |0 (DE-588)4238872-7  |0 (DE-627)104657308  |0 (DE-576)210416696  |a Verteiltes System  |2 gnd 
689 0 1 |D s  |0 (DE-588)4208537-8  |0 (DE-627)105111589  |0 (DE-576)210186798  |a Netzwerktopologie  |2 gnd 
689 0 2 |D s  |0 (DE-588)4694120-4  |0 (DE-627)352058366  |0 (DE-576)215109287  |a Mobile Computing  |2 gnd 
689 0 3 |D s  |0 (DE-588)4120591-1  |0 (DE-627)105775428  |0 (DE-576)209536381  |a Komplexitätstheorie  |2 gnd 
689 0 4 |D s  |0 (DE-588)4113782-6  |0 (DE-627)105826898  |0 (DE-576)209479302  |a Graphentheorie  |2 gnd 
689 0 5 |D s  |0 (DE-588)4123192-2  |0 (DE-627)105756881  |0 (DE-576)20955763X  |a Fehlertoleranz  |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 Rescigno, Adele A.  |e Hrsg.  |4 edt 
776 1 |z 9783319035772 
776 0 8 |i Druckausg.  |z 978-331-90357-7-2 
776 0 8 |i Druckausg.  |t Structural information and communication complexity  |d Cham [u.a.] : Springer, 2013  |h XIX, 348 Seiten  |w (DE-627)163416072X  |w (DE-576)500217440  |z 3642311032  |z 9783319035789  |z 9783319035772 
830 0 |a Lecture notes in computer science  |v 8179  |9 8179  |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-319-03578-9  |m X:SPRINGER  |x Verlag  |z lizenzpflichtig  |3 Volltext 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-03578-9  |x Resolving-System  |z lizenzpflichtig  |3 Volltext 
856 4 2 |u https://swbplus.bsz-bw.de/bsz398204861cov.jpg  |m V:DE-576  |m X:springer  |q image/jpeg  |v 20150320111424  |3 Cover 
856 4 2 |u https://zbmath.org/?q=an:1277.68017  |m B:ZBM  |v 2021-04-12  |x Verlag  |y Zentralblatt MATH  |3 Inhaltstext 
889 |w (DE-627)772980136 
912 |a ZDB-2-LNC  |b 2013 
912 |a ZDB-2-SCS  |b 2013 
912 |a ZDB-2-SEB 
912 |a ZDB-2-SXCS  |b 2013 
912 |a ZDB-2-SEB  |b 2013 
935 |h GBV  |i ExPruef 
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  |0 (DE-627)10640623X 
936 b k |a 54.10  |j Theoretische Informatik  |0 (DE-627)106418815 
951 |a BO 
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 Mehrrechnersystem 
950 |a Client-Server-Konzept 
950 |a Topologie 
950 |a Netzwerk 
950 |a Netzform 
950 |a Netzstruktur 
950 |a Netztopologie 
950 |a Netzarchitektur 
950 |a Komplexitätstheorie 
950 |a Kommunikationssysteme 
950 |a Коммуникационная система 
950 |a Fehlertolerantes System 
950 |a Voting 
950 |a Komplexes System 
950 |a Graph 
950 |a Diskrete Mathematik 
950 |a Information 
950 |a Mobile Computeranwendung 
950 |a Mobile Informationsverarbeitung 
950 |a Mobiler Computereinsatz 
950 |a Nomadic Computing 
950 |a Mobiles Rechnen 
950 |a Ubiquitous Computing 
950 |a Mobiles Endgerät 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-03578-9  |9 DE-14 
852 |a DE-14  |x epn:3363037775  |z 2013-12-03T09:42:53Z 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-03578-9  |9 DE-15 
852 |a DE-15  |x epn:3363037805  |z 2013-12-03T09:42:54Z 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-03578-9  |9 DE-Ch1 
852 |a DE-Ch1  |x epn:3363037848  |z 2013-12-03T09:42:54Z 
976 |h Elektronischer Volltext - Campuslizenz 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-03578-9  |z Zum Online-Dokument  |9 DE-Zi4 
852 |a DE-Zi4  |x epn:3363037872  |z 2013-12-03T09:42:54Z 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-03578-9  |9 DE-520 
852 |a DE-520  |x epn:3363037902  |z 2013-12-03T09:42:54Z 
980 |a 1653132264  |b 0  |k 1653132264  |o 398204861 
openURL url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Structural+Information+and+Communication+Complexity%3A+20th+International+Colloquium%2C+SIROCCO+2013%2C+Ischia%2C+Italy%2C+July+1-3%2C+2013%2C+Revised+Selected+Papers&rft.date=2013&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Structural+Information+and+Communication+Complexity%3A+20th+International+Colloquium%2C+SIROCCO+2013%2C+Ischia%2C+Italy%2C+July+1-3%2C+2013%2C+Revised+Selected+Papers&rft.series=Lecture+notes+in+computer+science%2C+8179&rft.au=Moscibroda%2C+Thomas&rft.pub=Springer&rft.edition=&rft.isbn=3319035789
SOLR
_version_ 1792258640657252352
access_facet Electronic Resources
author Moscibroda, Thomas
author2 Rescigno, Adele A.
author2_role edt
author2_variant a a r aa aar
author_facet Moscibroda, Thomas, Rescigno, Adele A.
author_role aut
author_sort Moscibroda, Thomas
author_variant t m tm
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-LNC, ZDB-2-SCS, ZDB-2-SEB, ZDB-2-SXCS
contents Distributed Community Detection in Dynamic GraphsExploration of the T -Interval-Connected Dynamic Graphs: The Case of the Ring -- A Characterization of Dynamic Networks Where Consensus Is Solvable -- Self-adjusting Grid Networks to Minimize Expected Path Length -- On Advice Complexity of the k-server Problem under Sparse Metrics -- Connected Surveillance Game -- Non-Additive Two-Option Ski Rental -- Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie -- A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations -- Self-organizing Flows in Social Networks -- Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters -- Influence Diffusion in Social Networks under Time Window Constraints -- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications -- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery -- Maintaining Balanced Trees for Structured Distributed Streaming Systems -- Rendezvous of Two Robots with Constant Memory -- Pattern Formation by Mobile Robots with Limited Visibility -- Optimal Gathering of Oblivious Robots in Anonymous Graphs -- Probabilistic Connectivity Threshold for Directional Antenna Widths -- Broadcasting in Ad Hoc Multiple Access Channels -- Profit Maximization in Flex-Grid All-Optical Networks -- Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies -- Optimal Buffer Management for 2-Frame Throughput Maximization -- Dynamically Maintaining Shortest Path Trees under Batches of Updates -- Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems -- Steiner Problems with Limited Number of Branching Nodes -- Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs -- Maximum Distance Separable Codes Based on Circulant Cauchy Matrices., This book constitutes the thoroughly refereed post-conference proceedings of the 20th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2013, held in Ischia, Italy, in July 2013. The 28 revised full papers presented were carefully reviewed and selected from 67 submissions. SIROCCO is devoted to the study of communication and knowledge in distributed systems. Special emphasis is given to innovative approaches and fundamental understanding, in addition to efforts to optimize current designs. The typical areas include distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing (including autonomous robots), peer to peer systems, communication complexity, fault tolerant graph theories and randomized/probabilistic issues in networks
ctrlnum (DE-627)1653132264, (DE-576)398204861, (DE-599)BSZ398204861, (OCoLC)863905816, (ZBM)1277.68017, (DE-He213)978-3-319-03578-9, (EBP)040552578
de15_date 2013-12-03T09:42:54Z
dech1_date 2013-12-03T09:42:54Z
doi_str_mv 10.1007/978-3-319-03578-9
facet_912a ZDB-2-LNC, ZDB-2-SCS, ZDB-2-SEB, ZDB-2-SXCS
facet_avail Online
facet_local_del330 Verteiltes System, Netzwerktopologie, Mobile Computing, Komplexitätstheorie, Graphentheorie, Fehlertoleranz, Kommunikationssystem, Nachrichtenverkehr, Informationsstruktur, Strukturkomplexität
finc_class_facet Informatik, Mathematik
fincclass_txtF_mv science-computerscience
footnote Literaturangaben
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 (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content
genre_facet Konferenzschrift
geogr_code not assigned
geogr_code_person not assigned
hierarchy_parent_id 0-316228877
hierarchy_parent_title Lecture notes in computer science
hierarchy_sequence 8179
hierarchy_top_id 0-316228877
hierarchy_top_title Lecture notes in computer science
id 0-1653132264
illustrated Not Illustrated
imprint Cham [u.a.], Springer, 2013
imprint_str_mv Cham [u.a.]: Springer, 2013
institution DE-14, DE-Zi4, DE-Ch1, DE-520, DE-15
is_hierarchy_id 0-1653132264
is_hierarchy_title Structural Information and Communication Complexity: 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers
isbn 9783319035789
isbn_isn_mv 9783319035772, 978-331-90357-7-2, 3642311032, 9783319035789
issn_isn_mv 1611-3349
kxp_id_str 1653132264
language English
last_indexed 2024-02-29T18:23:53.039Z
local_heading_facet_dezwi2 Computer Communication Networks, Data structures (Computer science), Computer software, Computational complexity, Computer Science, Computer science, Algorithms, Computer networks ., Discrete mathematics., Artificial intelligence, Verteiltes System, Netzwerktopologie, Mobile Computing, Komplexitätstheorie, Graphentheorie, Fehlertoleranz, Kommunikationssystem, Nachrichtenverkehr, Informationsstruktur, Strukturkomplexität
marc024a_ct_mv 10.1007/978-3-319-03578-9
match_str moscibroda2013structuralinformationandcommunicationcomplexity20thinternationalcolloquiumsirocco2013ischiaitalyjuly132013revisedselectedpapers
mega_collection Verbunddaten SWB
multipart_link 093890923
multipart_part (093890923)8179
oclc_num 863905816
physical Online-Ressource (XX, 348 p. 53 illus, online resource)
publishDate 2013
publishDateSort 2013
publishPlace Cham [u.a.]
publisher Springer
record_format marcfinc
record_id 398204861
recordtype marcfinc
rsn_id_str_mv (DE-15)3270565
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, 8179
series2 Lecture Notes in Computer Science ; 8179, SpringerLink ; Bücher
source_id 0
spelling Moscibroda, Thomas aut, Structural Information and Communication Complexity 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers edited by Thomas Moscibroda, Adele A. Rescigno, Cham [u.a.] Springer 2013, Online-Ressource (XX, 348 p. 53 illus, online resource), Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, Lecture Notes in Computer Science 8179, SpringerLink Bücher, Literaturangaben, Distributed Community Detection in Dynamic GraphsExploration of the T -Interval-Connected Dynamic Graphs: The Case of the Ring -- A Characterization of Dynamic Networks Where Consensus Is Solvable -- Self-adjusting Grid Networks to Minimize Expected Path Length -- On Advice Complexity of the k-server Problem under Sparse Metrics -- Connected Surveillance Game -- Non-Additive Two-Option Ski Rental -- Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie -- A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations -- Self-organizing Flows in Social Networks -- Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters -- Influence Diffusion in Social Networks under Time Window Constraints -- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications -- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery -- Maintaining Balanced Trees for Structured Distributed Streaming Systems -- Rendezvous of Two Robots with Constant Memory -- Pattern Formation by Mobile Robots with Limited Visibility -- Optimal Gathering of Oblivious Robots in Anonymous Graphs -- Probabilistic Connectivity Threshold for Directional Antenna Widths -- Broadcasting in Ad Hoc Multiple Access Channels -- Profit Maximization in Flex-Grid All-Optical Networks -- Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies -- Optimal Buffer Management for 2-Frame Throughput Maximization -- Dynamically Maintaining Shortest Path Trees under Batches of Updates -- Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems -- Steiner Problems with Limited Number of Branching Nodes -- Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs -- Maximum Distance Separable Codes Based on Circulant Cauchy Matrices., This book constitutes the thoroughly refereed post-conference proceedings of the 20th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2013, held in Ischia, Italy, in July 2013. The 28 revised full papers presented were carefully reviewed and selected from 67 submissions. SIROCCO is devoted to the study of communication and knowledge in distributed systems. Special emphasis is given to innovative approaches and fundamental understanding, in addition to efforts to optimize current designs. The typical areas include distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing (including autonomous robots), peer to peer systems, communication complexity, fault tolerant graph theories and randomized/probabilistic issues in networks, Computer Communication Networks, Data structures (Computer science), Computer software, Computational complexity, Computer Science, Computer science, Algorithms, Computer networks ., Discrete mathematics., Artificial intelligence, Konferenzschrift (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content, s (DE-588)4238872-7 (DE-627)104657308 (DE-576)210416696 Verteiltes System gnd, s (DE-588)4208537-8 (DE-627)105111589 (DE-576)210186798 Netzwerktopologie gnd, s (DE-588)4694120-4 (DE-627)352058366 (DE-576)215109287 Mobile Computing 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, s (DE-588)4123192-2 (DE-627)105756881 (DE-576)20955763X Fehlertoleranz 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, Rescigno, Adele A. Hrsg. edt, 9783319035772, Druckausg. 978-331-90357-7-2, Druckausg. Structural information and communication complexity Cham [u.a.] : Springer, 2013 XIX, 348 Seiten (DE-627)163416072X (DE-576)500217440 3642311032 9783319035789 9783319035772, Lecture notes in computer science 8179 8179 (DE-627)316228877 (DE-576)093890923 (DE-600)2018930-8 1611-3349 ns, https://doi.org/10.1007/978-3-319-03578-9 X:SPRINGER Verlag lizenzpflichtig Volltext, http://dx.doi.org/10.1007/978-3-319-03578-9 Resolving-System lizenzpflichtig Volltext, https://swbplus.bsz-bw.de/bsz398204861cov.jpg V:DE-576 X:springer image/jpeg 20150320111424 Cover, https://zbmath.org/?q=an:1277.68017 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext, (DE-627)772980136, http://dx.doi.org/10.1007/978-3-319-03578-9 DE-14, DE-14 epn:3363037775 2013-12-03T09:42:53Z, http://dx.doi.org/10.1007/978-3-319-03578-9 DE-15, DE-15 epn:3363037805 2013-12-03T09:42:54Z, http://dx.doi.org/10.1007/978-3-319-03578-9 DE-Ch1, DE-Ch1 epn:3363037848 2013-12-03T09:42:54Z, http://dx.doi.org/10.1007/978-3-319-03578-9 Zum Online-Dokument DE-Zi4, DE-Zi4 epn:3363037872 2013-12-03T09:42:54Z, http://dx.doi.org/10.1007/978-3-319-03578-9 DE-520, DE-520 epn:3363037902 2013-12-03T09:42:54Z
spellingShingle Moscibroda, Thomas, Structural Information and Communication Complexity: 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers, Lecture notes in computer science, 8179, Distributed Community Detection in Dynamic GraphsExploration of the T -Interval-Connected Dynamic Graphs: The Case of the Ring -- A Characterization of Dynamic Networks Where Consensus Is Solvable -- Self-adjusting Grid Networks to Minimize Expected Path Length -- On Advice Complexity of the k-server Problem under Sparse Metrics -- Connected Surveillance Game -- Non-Additive Two-Option Ski Rental -- Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie -- A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations -- Self-organizing Flows in Social Networks -- Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters -- Influence Diffusion in Social Networks under Time Window Constraints -- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications -- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery -- Maintaining Balanced Trees for Structured Distributed Streaming Systems -- Rendezvous of Two Robots with Constant Memory -- Pattern Formation by Mobile Robots with Limited Visibility -- Optimal Gathering of Oblivious Robots in Anonymous Graphs -- Probabilistic Connectivity Threshold for Directional Antenna Widths -- Broadcasting in Ad Hoc Multiple Access Channels -- Profit Maximization in Flex-Grid All-Optical Networks -- Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies -- Optimal Buffer Management for 2-Frame Throughput Maximization -- Dynamically Maintaining Shortest Path Trees under Batches of Updates -- Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems -- Steiner Problems with Limited Number of Branching Nodes -- Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs -- Maximum Distance Separable Codes Based on Circulant Cauchy Matrices., This book constitutes the thoroughly refereed post-conference proceedings of the 20th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2013, held in Ischia, Italy, in July 2013. The 28 revised full papers presented were carefully reviewed and selected from 67 submissions. SIROCCO is devoted to the study of communication and knowledge in distributed systems. Special emphasis is given to innovative approaches and fundamental understanding, in addition to efforts to optimize current designs. The typical areas include distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing (including autonomous robots), peer to peer systems, communication complexity, fault tolerant graph theories and randomized/probabilistic issues in networks, Computer Communication Networks, Data structures (Computer science), Computer software, Computational complexity, Computer Science, Computer science, Algorithms, Computer networks ., Discrete mathematics., Artificial intelligence, Konferenzschrift, Verteiltes System, Netzwerktopologie, Mobile Computing, Komplexitätstheorie, Graphentheorie, Fehlertoleranz, Kommunikationssystem, Nachrichtenverkehr, Informationsstruktur, Strukturkomplexität
swb_id_str 398204861
title Structural Information and Communication Complexity: 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers
title_auth Structural Information and Communication Complexity 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers
title_full Structural Information and Communication Complexity 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers edited by Thomas Moscibroda, Adele A. Rescigno
title_fullStr Structural Information and Communication Complexity 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers edited by Thomas Moscibroda, Adele A. Rescigno
title_full_unstemmed Structural Information and Communication Complexity 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers edited by Thomas Moscibroda, Adele A. Rescigno
title_in_hierarchy 8179. Structural Information and Communication Complexity: 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers (2013)
title_short Structural Information and Communication Complexity
title_sort structural information and communication complexity 20th international colloquium sirocco 2013 ischia italy july 1 3 2013 revised selected papers
title_sub 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers
title_unstemmed Structural Information and Communication Complexity: 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers
topic Computer Communication Networks, Data structures (Computer science), Computer software, Computational complexity, Computer Science, Computer science, Algorithms, Computer networks ., Discrete mathematics., Artificial intelligence, Konferenzschrift, Verteiltes System, Netzwerktopologie, Mobile Computing, Komplexitätstheorie, Graphentheorie, Fehlertoleranz, Kommunikationssystem, Nachrichtenverkehr, Informationsstruktur, Strukturkomplexität
topic_facet Computer Communication Networks, Data structures (Computer science), Computer software, Computational complexity, Computer Science, Computer science, Algorithms, Computer networks ., Discrete mathematics., Artificial intelligence, Konferenzschrift, Verteiltes System, Netzwerktopologie, Mobile Computing, Komplexitätstheorie, Graphentheorie, Fehlertoleranz, Kommunikationssystem, Nachrichtenverkehr, Informationsstruktur, Strukturkomplexität
url https://doi.org/10.1007/978-3-319-03578-9, http://dx.doi.org/10.1007/978-3-319-03578-9, https://swbplus.bsz-bw.de/bsz398204861cov.jpg, https://zbmath.org/?q=an:1277.68017