<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Topi Talvitie | AC Group | TU Wien</title><link>https://ac.notready.eu/author/topi-talvitie/</link><atom:link href="https://ac.notready.eu/author/topi-talvitie/index.xml" rel="self" type="application/rss+xml"/><description>Topi Talvitie</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Sat, 01 Jan 2022 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Topi Talvitie</title><link>https://ac.notready.eu/author/topi-talvitie/</link></image><item><title>An efficient algorithm for counting Markov equivalent DAGs</title><link>https://ac.notready.eu/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags-2/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags-2/</guid><description/></item><item><title>An Efficient Algorithm for Counting Markov Equivalent DAGs</title><link>https://ac.notready.eu/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/an-efficient-algorithm-for-counting-markov-equivalent-dags/</guid><description/></item></channel></rss>