Bureaucracy
发表于 2025-3-23 11:50:46
,A Meta-Theorem for Distributed Certification,oolean predicate. A certificate is assigned to each process in the system by a non-trustable oracle, and the processes are in charge of verifying these certificates, so that two properties are satisfied: ., i.e., for every legal instance, there is a certificate assignment leading all processes to ac
STEER
发表于 2025-3-23 15:54:20
http://reply.papertrans.cn/88/8800/879952/879952_12.png
Credence
发表于 2025-3-23 18:20:16
http://reply.papertrans.cn/88/8800/879952/879952_13.png
谦卑
发表于 2025-3-24 01:52:11
http://reply.papertrans.cn/88/8800/879952/879952_14.png
erythema
发表于 2025-3-24 03:07:10
,Dispersion of Mobile Robots on Directed Anonymous Graphs,ly reposition the robots such that each node will contain at most one robot. This problem gained significant interest due to its resemblance with several fundamental problems such as exploration, scattering, load balancing, relocation of electric cars to charging stations, etc. The objective is to s
装饰
发表于 2025-3-24 07:20:19
,Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes,if the corresponding objects intersect. Geometric intersection graph classes have been studied from both the theoretical and practical point of view. On the one hand, many hard problems can be efficiently solved or approximated when the input graph is restricted to a geometric intersection class of
切碎
发表于 2025-3-24 11:55:27
,Exactly Optimal Deterministic Radio Broadcasting with Collision Detection, be learned by all nodes in the network. We provide a deterministic algorithm that works on the beeping model, which is a restricted version of the radio broadcast model with collision detection. This algorithm improves on the round complexity of previous algorithms. We prove an exactly matching low
严峻考验
发表于 2025-3-24 17:17:46
http://reply.papertrans.cn/88/8800/879952/879952_18.png
联想
发表于 2025-3-24 22:07:39
,Fixed Points and 2-Cycles of Synchronous Dynamic Coloring Processes on Trees,f rounds these systems either reach a fixed point or enter a 2-cycle. The problem of finding the fixed points for this type of dynamical system is in general both NP-hard and #P-complete. In this paper we give a surprisingly simple graph-theoretic characterization of fixed points and 2-cycles for th
字谜游戏
发表于 2025-3-25 02:52:53
http://reply.papertrans.cn/88/8800/879952/879952_20.png