Search and Rescue on the Line (English)
- New search for: Coleman, Jared
- Further information on Coleman, Jared:
- https://orcid.org/http://orcid.org/0000-0003-1227-2962
- New search for: Cheng, Lorand
- New search for: Krishnamachari, Bhaskar
- New search for: Rajsbaum, Sergio
- Further information on Rajsbaum, Sergio:
- https://orcid.org/https://orcid.org/0000-0002-0009-5287
- New search for: Balliu, Alkida
- New search for: Daymude, Joshua J.
- New search for: Olivetti, Dennis
- New search for: Coleman, Jared
- Further information on Coleman, Jared:
- https://orcid.org/http://orcid.org/0000-0003-1227-2962
- New search for: Cheng, Lorand
- New search for: Krishnamachari, Bhaskar
In:
Structural Information and Communication Complexity
: 30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6–9, 2023, Proceedings
;
Chapter: 13
;
297-316
;
2023
- Article/Chapter (Book) / Electronic Resource
-
Title:Search and Rescue on the Line
-
Additional title:Lect.Notes Computer
-
Contributors:Rajsbaum, Sergio ( editor ) / Balliu, Alkida ( editor ) / Daymude, Joshua J. ( editor ) / Olivetti, Dennis ( editor ) / Coleman, Jared ( author ) / Cheng, Lorand ( author ) / Krishnamachari, Bhaskar ( author )
-
Conference:International Colloquium on Structural Information and Communication Complexity ; 2023 ; Alcalá de Henares, Spain
-
Published in:Structural Information and Communication Complexity : 30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6–9, 2023, Proceedings ; Chapter: 13 ; 297-316Lecture Notes in Computer Science ; 13892 ; 297-316
-
Publisher:
- New search for: Springer Nature Switzerland
-
Place of publication:Cham
-
Publication date:2023-05-25
-
Size:20 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Degree Realization by Bipartite MultigraphsBar-Noy, Amotz / Böhnlein, Toni / Peleg, David / Rawitz, Dror et al. | 2023
- 2
-
Thirty Years of SIROCCO A Data and Graph Mining Comparative Analysis of Its Temporal EvolutionCrescenzi, Pierluigi et al. | 2023
- 3
-
About Informatics, Distributed Computing, and Our Job: A Personal ViewRaynal, Michel et al. | 2023
- 4
-
Learning Hierarchically-Structured Concepts II: Overlapping Concepts, and Networks with FeedbackLynch, Nancy / Mallmann-Trenn, Frederik et al. | 2023
- 5
-
Distributed Coloring of HypergraphsAdamson, Duncan / Halldórsson, Magnús M. / Nolin, Alexandre et al. | 2023
- 6
-
Lockless Blockchain Sharding with Multiversion ControlAdhikari, Ramesh / Busch, Costas et al. | 2023
- 7
-
Self-adjusting Linear Networks with Ladder Demand GraphAksenov, Vitaly / Paramonov, Anton / Salem, Iosif / Schmid, Stefan et al. | 2023
- 8
-
Compatibility of Convergence Algorithms for Autonomous Mobile Robots (Extended Abstract)Asahiro, Yuichi / Yamashita, Masafumi et al. | 2023
- 9
-
FnF-BFT: A BFT Protocol with Provable Performance Under AttackAvarikioti, Zeta / Heimbach, Lioba / Schmid, Roland / Vanbever, Laurent / Wattenhofer, Roger / Wintermeyer, Patrick et al. | 2023
- 10
-
Divide & Scale: Formalization and Roadmap to Robust ShardingAvarikioti, Zeta / Desjardins, Antoine / Kokoris-Kogias, Lefteris / Wattenhofer, Roger et al. | 2023
- 11
-
Zero-Memory Graph Exploration with Unknown InportsBöckenhauer, Hans-Joachim / Frei, Fabian / Unger, Walter / Wehner, David et al. | 2023
- 12
-
The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-Genus NetworksChang, Yi-Jun et al. | 2023
- 13
-
Search and Rescue on the LineColeman, Jared / Cheng, Lorand / Krishnamachari, Bhaskar et al. | 2023
- 14
-
Routing Schemes for Hybrid Communication NetworksCoy, Sam / Czumaj, Artur / Scheideler, Christian / Schneider, Philipp / Werthmann, Julian et al. | 2023
- 15
-
Distributed Half-Integral Matching and BeyondDahal, Sameep / Suomela, Jukka et al. | 2023
- 16
-
Boundary Sketching with Asymptotically Optimal Distance and RotationDani, Varsha / Islam, Abir / Saia, Jared et al. | 2023
- 17
-
Cops & Robber on Periodic Temporal Graphs: Characterization and Improved BoundsDe Carufel, Jean-Lou / Flocchini, Paola / Santoro, Nicola / Simard, Frédéric et al. | 2023
- 18
-
Minimum Cost Flow in the CONGEST Modelde Vos, Tijn et al. | 2023
- 19
-
The Communication Complexity of Functions with Large OutputsFontes, Lila / Laplante, Sophie / Laurière, Mathieu / Nolin, Alexandre et al. | 2023
- 20
-
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST ModelFraigniaud, Pierre / Luce, Maël / Todinca, Ioan et al. | 2023
- 21
-
Energy-Efficient Distributed Algorithms for Synchronous NetworksFraigniaud, Pierre / Montealegre, Pedro / Rapaport, Ivan / Todinca, Ioan et al. | 2023
- 22
-
Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood DiversityGargano, Luisa / Rescigno, Adele A. et al. | 2023
- 23
-
Overcoming Probabilistic Faults in Disoriented Linear SearchGeorgiou, Konstantinos / Giachoudis, Nikos / Kranakis, Evangelos et al. | 2023
- 24
-
Packet Forwarding with SwapsMatsui, Cameron / Rosenbaum, Will et al. | 2023
- 25
-
Exact Distributed SamplingPemmaraju, Sriram V. / Sobel, Joshua Z. et al. | 2023
- 26
-
Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and ApproximationSchmid, Stefan / Svoboda, Jakub / Yeo, Michelle et al. | 2023