語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Structural Information and Communica...
~
SpringerLink (Online service)
Structural Information and Communication Complexity = 26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1–4, 2019, Proceedings /
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
正題名/作者:
Structural Information and Communication Complexity/ edited by Keren Censor-Hillel, Michele Flammini.
其他題名:
26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1–4, 2019, Proceedings /
其他作者:
Censor-Hillel, Keren.
面頁冊數:
XXI, 368 p. 301 illus., 26 illus. in color.online resource. :
Contained By:
Springer Nature eBook
標題:
Algorithms. -
電子資源:
https://doi.org/10.1007/978-3-030-24922-9
ISBN:
9783030249229
Structural Information and Communication Complexity = 26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1–4, 2019, Proceedings /
Structural Information and Communication Complexity
26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1–4, 2019, Proceedings /[electronic resource] :edited by Keren Censor-Hillel, Michele Flammini. - 1st ed. 2019. - XXI, 368 p. 301 illus., 26 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11639. - Theoretical Computer Science and General Issues ;9163.
A Topological Perspective on Distributed Network Algorithms -- On Sense of Direction and Mobile Agents -- Locality of not-so-weak coloring -- Near-gathering of energy-constrained mobile agents -- Optimal Multi Broadcast with Beeps using Group Testing -- Tracking Routes in Communication Networks -- Positional Encoding by Robots with Non-Rigid Movements -- Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights -- Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory -- Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Robots -- Asynchronous Rendezvous with Different Maps -- Gathering Synchronous Robots in Graphs: from general properties to dense and symmetric topologies -- Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model -- Evacuating Two Robots from a Disk: A Second Cut -- Distributed pattern formation in a ring -- On Distributed Merlin-Arthur Decision Protocols -- Anonymous Read/Write Memory: Leader Election and Desanonymization -- Faster Construction of Overlay Networks -- Partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings -- Set Agreement Power is not a Precise Characterization for Oblivious Deterministic Anonymous Objects -- Making Randomized Algorithms Self-Stabilizing -- How to Color a French Flag{Biologically Inspired Algorithms for Scale-Invariant Patterning -- Self-Adjusting Line Networks -- Mutual Visibility for Asynchronous Robots -- Infinite Grid Exploration by Disoriented Robots -- A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks -- Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds -- A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault -- Average-based Population Protocols : Explicit and Tight Bounds of the Convergence Time -- Visiting Infinitely Often the Unit Interval while Minimizing the Idle-time of High Priority Points.
This book constitutes the refereed conference proceedings of the 26th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2019, held in L’Aquila, Italy, in July 2019. The 19 full papers and 9 short papers presented in this book were carefully reviewed and selected from 39 submissions. They are devoted to the study of the interplay between structural knowledge, communication, and computing in decentralized systems of multiple communicating entities.
ISBN: 9783030249229
Standard No.: 10.1007/978-3-030-24922-9doiSubjects--Topical Terms:
527865
Algorithms.
LC Class. No.: QA76.9.A43
Dewey Class. No.: 005.1
Structural Information and Communication Complexity = 26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1–4, 2019, Proceedings /
LDR
:04048nam a22004095i 4500
001
1014857
003
DE-He213
005
20200703084646.0
007
cr nn 008mamaa
008
210106s2019 gw | s |||| 0|eng d
020
$a
9783030249229
$9
978-3-030-24922-9
024
7
$a
10.1007/978-3-030-24922-9
$2
doi
035
$a
978-3-030-24922-9
050
4
$a
QA76.9.A43
072
7
$a
UMB
$2
bicssc
072
7
$a
COM051300
$2
bisacsh
072
7
$a
UMB
$2
thema
082
0 4
$a
005.1
$2
23
245
1 0
$a
Structural Information and Communication Complexity
$h
[electronic resource] :
$b
26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1–4, 2019, Proceedings /
$c
edited by Keren Censor-Hillel, Michele Flammini.
250
$a
1st ed. 2019.
264
1
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2019.
300
$a
XXI, 368 p. 301 illus., 26 illus. in color.
$b
online resource.
336
$a
text
$b
txt
$2
rdacontent
337
$a
computer
$b
c
$2
rdamedia
338
$a
online resource
$b
cr
$2
rdacarrier
347
$a
text file
$b
PDF
$2
rda
490
1
$a
Theoretical Computer Science and General Issues ;
$v
11639
505
0
$a
A Topological Perspective on Distributed Network Algorithms -- On Sense of Direction and Mobile Agents -- Locality of not-so-weak coloring -- Near-gathering of energy-constrained mobile agents -- Optimal Multi Broadcast with Beeps using Group Testing -- Tracking Routes in Communication Networks -- Positional Encoding by Robots with Non-Rigid Movements -- Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights -- Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory -- Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Robots -- Asynchronous Rendezvous with Different Maps -- Gathering Synchronous Robots in Graphs: from general properties to dense and symmetric topologies -- Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model -- Evacuating Two Robots from a Disk: A Second Cut -- Distributed pattern formation in a ring -- On Distributed Merlin-Arthur Decision Protocols -- Anonymous Read/Write Memory: Leader Election and Desanonymization -- Faster Construction of Overlay Networks -- Partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings -- Set Agreement Power is not a Precise Characterization for Oblivious Deterministic Anonymous Objects -- Making Randomized Algorithms Self-Stabilizing -- How to Color a French Flag{Biologically Inspired Algorithms for Scale-Invariant Patterning -- Self-Adjusting Line Networks -- Mutual Visibility for Asynchronous Robots -- Infinite Grid Exploration by Disoriented Robots -- A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks -- Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds -- A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault -- Average-based Population Protocols : Explicit and Tight Bounds of the Convergence Time -- Visiting Infinitely Often the Unit Interval while Minimizing the Idle-time of High Priority Points.
520
$a
This book constitutes the refereed conference proceedings of the 26th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2019, held in L’Aquila, Italy, in July 2019. The 19 full papers and 9 short papers presented in this book were carefully reviewed and selected from 39 submissions. They are devoted to the study of the interplay between structural knowledge, communication, and computing in decentralized systems of multiple communicating entities.
650
0
$a
Algorithms.
$3
527865
650
0
$a
Computer organization.
$3
596298
650
0
$2
lc
$a
Operating systems (Computers).
$3
868175
650
0
$a
Robotics.
$3
561941
650
0
$a
Computer science—Mathematics.
$3
1253519
650
0
$a
Data structures (Computer science).
$3
680370
650
1 4
$a
Algorithm Analysis and Problem Complexity.
$3
593923
650
2 4
$a
Computer Systems Organization and Communication Networks.
$3
669309
650
2 4
$a
Operating Systems.
$3
669804
650
2 4
$a
Discrete Mathematics in Computer Science.
$3
670123
650
2 4
$a
Data Structures.
$3
669824
700
1
$a
Censor-Hillel, Keren.
$4
edt
$4
http://id.loc.gov/vocabulary/relators/edt
$3
1229172
700
1
$a
Flammini, Michele.
$4
edt
$4
http://id.loc.gov/vocabulary/relators/edt
$3
1199893
710
2
$a
SpringerLink (Online service)
$3
593884
773
0
$t
Springer Nature eBook
776
0 8
$i
Printed edition:
$z
9783030249212
776
0 8
$i
Printed edition:
$z
9783030249236
830
0
$a
Theoretical Computer Science and General Issues ;
$v
9163
$3
1253524
856
4 0
$u
https://doi.org/10.1007/978-3-030-24922-9
912
$a
ZDB-2-SCS
912
$a
ZDB-2-SXCS
912
$a
ZDB-2-LNC
950
$a
Computer Science (SpringerNature-11645)
950
$a
Computer Science (R0) (SpringerNature-43710)
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入