Titlebook: Structural Information and Communication Complexity; 30th International C Sergio Rajsbaum,Alkida Balliu,Dennis Olivetti Conference proceedi

敲竹杠

首创精神

蜈蚣

冷峻

集合

Learning Hierarchically-Structured Concepts II: Overlapping Concepts, and Networks with Feedbackl in two ways: we allow limited overlap between children of different concepts, and we allow networks to include feedback edges. For these more general cases, we describe and analyze algorithms for recognition and algorithms for learning.

Mitigate

Cops & Robber on Periodic Temporal Graphs: Characterization and Improved Boundson, we design an algorithm for determining if a periodic temporal graph is copwin with time complexity ., where ., improving the existing . bound. Let us stress that, when . (i.e., in the . case), the complexity becomes ., improving the best existing . bound.

模范

油毡

删减

: A BFT Protocol with Provable Performance Under Attackber of replicas and thus competitive with state-of-the-art protocols; . ’s amortized throughput with less than . byzantine replicas is at least .th of its best-case throughput. We also provide a proof-of-concept implementation and preliminary evaluation of ..

dialect

Search and Rescue on the Lineunknown (and potentially infinite) length. We also consider scenarios where the destination is either at the endpoint or in the middle of the path. We provide both deterministic and randomized online algorithms for each of these scenarios and prove bounds on their (expected) competitive ratios.