( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Existence of Nash Equilibrium in Games with Resource-Bounded Players.

, , и . SAGT, том 11801 из Lecture Notes in Computer Science, стр. 139-152. Springer, (2019)

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.

Ronen Reichman

Daniel

Daniel

Daniel Dirkmann

In-vitro-Untersuchungen zum Effekt von Hypothermie und Azidose auf Variablen thrombelastometrischer Messungen der Blutgerinnung. Uni Duisburg-Essen, (2009)

Daniel Stanze

Systematische Analyse von Rezeptoren und Effektormechanismen der pulmonalen angeborenen Immunität. Uni Marburg, (2009)
 

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

New bounds for contagious sets.. Discret. Math., 312 (10): 1812-1814 (2012)Size and Depth Separation in Approximating Benign Functions with Neural Networks., , , и . COLT, том 134 из Proceedings of Machine Learning Research, стр. 4195-4223. PMLR, (2021)Smoothed Analysis on Connected Graphs., , и . APPROX-RANDOM, том 28 из LIPIcs, стр. 810-825. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Leveraging seed dictionaries to improve dictionary learning., , и . ICIP, стр. 3723-3727. IEEE, (2016)Local Treewidth of Random and Noisy Graphs with Applications to Stopping Contagion in Networks., и . APPROX/RANDOM, том 245 из LIPIcs, стр. 7:1-7:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On Percolation and NP-Hardness., , и . ICALP, том 55 из LIPIcs, стр. 80:1-80:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Inference in Sparse Graphs with Pairwise Measurements and Side Information., , и . AISTATS, том 84 из Proceedings of Machine Learning Research, стр. 1810-1818. PMLR, (2018)Contagious Sets in Expanders., , , и . SODA, стр. 1953-1987. SIAM, (2015)How Many Neurons Does it Take to Approximate the Maximum?, , и . SODA, стр. 3156-3183. SIAM, (2024)Improved Lower Bounds on the Expected Length of Longest Common Subsequences., , , , , и . CoRR, (2024)