( en | de | ru )

 

Disambiguation of "Martinsson, Anders"

Author of the publication

copydeleteadd this publication to your clipboard
An Optimal Decentralized (Δ + 1)-Coloring Algorithm.

, , , , , , and . ESA, volume 173 of LIPIcs, page 17:1-17:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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. You can also use the button next to the name to display some publications already assigned to the person.

Gunilla Martinsson

Jochen Anders

Eduard Anders

Lothar Anders

Friedrich Anders

 

Other publications of authors with the same name

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