名次后缀 发表于 2025-3-28 18:10:06

http://reply.papertrans.cn/88/8800/879964/879964_41.png

环形 发表于 2025-3-28 19:03:44

Brief Announcement: Fast Approximate Counting and Leader Election in Populationsmust determine an estimation . of the population size, where .. We call . the estimation parameter. Consider the setting in which an agent is in an initial state ., the rest . agents are in state . and the only existing transition is .. This is the . process and it can be shown that the expected tim

木质 发表于 2025-3-28 23:21:01

http://reply.papertrans.cn/88/8800/879964/879964_43.png

brother 发表于 2025-3-29 05:52:53

Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Modelnd . cannot be achieved in one round for arbitrary graph classes, and we give tight algorithms for that case..From (i) we recover all known results concerning the reconstruction of graph classes in one round and bandwidth .: forests, planar graphs, cographs, etc. But we also get new one-round algori

皱痕 发表于 2025-3-29 09:15:47

Space-Efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional Rings, we show that the memory space per agent can be reduced to .. To the best of our knowledge, this is the first research considering the effect of the multiplicity detection on memory space required to solve problems.

解开 发表于 2025-3-29 14:38:16

Explorable Families of Graphsven an explorable family of graphs, explores any graph of this family, without knowing which graph of the family is being explored. The answer to this question turns out to depend on how the explorable family is given to the hypothetical universal algorithm. If the algorithm can get the answer to an

grovel 发表于 2025-3-29 19:22:06

d theory, geometric quantization and symplectic geometry, coherent states methods, holomorphic representation theory, Poisson structures, non-commutative geometry, supersymmetry and quantum groups. The editors have the pleasant task of first thanking all the local organizers, in particular Dr. K. Gilewicz, fo978-1-4615-2564-6

内行 发表于 2025-3-29 22:46:52

geometric quantization and symplectic geometry, coherent states methods, holomorphic representation theory, Poisson structures, non-commutative geometry, supersymmetry and quantum groups. The editors have the pleasant task of first thanking all the local organizers, in particular Dr. K. Gilewicz, fo

crescendo 发表于 2025-3-30 03:54:36

Amotz Bar-Noy,Keerti Choudhary,David Peleg,Dror Rawitzd theory, geometric quantization and symplectic geometry, coherent states methods, holomorphic representation theory, Poisson structures, non-commutative geometry, supersymmetry and quantum groups. The editors have the pleasant task of first thanking all the local organizers, in particular Dr. K. Gilewicz, fo978-1-4615-2564-6

Hangar 发表于 2025-3-30 06:51:48

Johanne Cohen,George Manoussakis,Laurence Pilard,Devan Sohiergeometric quantization and symplectic geometry, coherent states methods, holomorphic representation theory, Poisson structures, non-commutative geometry, supersymmetry and quantum groups. The editors have the pleasant task of first thanking all the local organizers, in particular Dr. K. Gilewicz, fo
页: 1 2 3 4 [5] 6
查看完整版本: Titlebook: Structural Information and Communication Complexity; 25th International C Zvi Lotker,Boaz Patt-Shamir Conference proceedings 2018 Springer