( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Reconstructibility of the K-count from n - 1 cards.

, и . Discret. Math., 347 (6): 113950 (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Gunilla Martinsson

Eduard Anders

Lothar Anders

Friedrich Anders

Felix Anders

 

Другие публикации лиц с тем же именем

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances., , , , и . STOC, стр. 321-334. ACM, (2023)When can multi-agent rendezvous be executed in time linear in the diameter of a plane configuration?, , и . ICDCN, стр. 2:1-2:8. ACM, (2016)Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning., , , , и . ICML, том 97 из Proceedings of Machine Learning Research, стр. 604-613. PMLR, (2019)When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument., , и . ANALCO, стр. 94-102. SIAM, (2019)The (1 + 1)-EA with mutation rate (1 + ϵ)/n is efficient on monotone functions: an entropy compression argument. (hot-off-the-press track at GECCO 2019)., , и . GECCO (Companion), стр. 25-26. ACM, (2019)Reconstructibility of the K-count from n - 1 cards., и . Discret. Math., 347 (6): 113950 (2024)Mastermind with a Linear Number of Queries., и . CoRR, (2020)Navigating an Infinite Space with Unreliable Movements., и . SODA, стр. 1170-1179. SIAM, (2020)"The Lovasz $þeta$ function, SVMs and finding large dense subgraphs"., , , и . NIPS, стр. 1169-1177. (2012)Even flying cops should think ahead., , , и . CoRR, (2018)