( en | de | ru )

 

Disambiguation of "Kaski, Petteri"

Author of the publication

copydeleteadd this publication to your clipboard
Trustworthy Monte Carlo.

, , and . NeurIPS, (2022)

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.

Petteri Kaski

Petteri Elsner

Petteri Laihonen

 

Other publications of authors with the same name

Circumspect descent prevails in solving random constraint satisfaction problems., , , , , , and . Proc. Natl. Acad. Sci. USA, 105 (40): 15253-15257 (2008)The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid., and . SODA, page 2333-2345. SIAM, (2021)The Asymptotic Rank Conjecture and the Set Cover Conjecture are not Both True., and . CoRR, (2023)The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid., and . CoRR, (2020)The shortest even cycle problem is tractable., , and . STOC, page 117-130. ACM, (2022)The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments., and . Des. Codes Cryptogr., 35 (3): 271-285 (2005)Enumeration of 2-(9, 3, lambda) Designs and Their Resolutions., and . Des. Codes Cryptogr., 27 (1-2): 131-137 (2002)The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True., and . STOC, page 859-870. ACM, (2024)Counting Connected Subgraphs with Maximum-Degree-Aware Sieving., , , and . ISAAC, volume 123 of LIPIcs, page 17:1-17:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs., , and . Ad Hoc Sens. Wirel. Networks, 6 (3-4): 239-263 (2008)