default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTopi Talvitie
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j4]Robert Ganian, Thekla Hamm, Topi Talvitie
:
An efficient algorithm for counting Markov equivalent DAGs. Artif. Intell. 304: 103648 (2022)- 2021
- [j3]Mikko E. Toivonen, Topi Talvitie, Chang Rajani, Arto Klami:
Visible Light Spectrum Extraction from Diffraction Images by Deconvolution and the Cepstrum. J. Imaging 7(9): 166 (2021) - 2020
- [c13]Johan Pensar, Topi Talvitie, Antti Hyttinen, Mikko Koivisto:
A Bayesian Approach for Estimating Causal Effects from Observational Data. AAAI 2020: 5395-5402 - [c12]Robert Ganian, Thekla Hamm, Topi Talvitie:
An Efficient Algorithm for Counting Markov Equivalent DAGs. AAAI 2020: 10136-10143 - [c11]Topi Talvitie, Pekka Parviainen:
Learning Bayesian Networks with Cops and Robbers. PGM 2020: 473-484
2010 – 2019
- 2019
- [b1]Topi Talvitie:
Counting and Sampling Directed Acyclic Graphs for Learning Bayesian Networks. University of Helsinki, Finland, 2019 - [j2]Topi Talvitie, Ralf Eggeling, Mikko Koivisto:
Learning Bayesian networks with local structure, mixed variables, and exact algorithms. Int. J. Approx. Reason. 115: 69-95 (2019) - [c10]Topi Talvitie, Mikko Koivisto:
Counting and Sampling Markov Equivalent Directed Acyclic Graphs. AAAI 2019: 7984-7991 - [c9]Topi Talvitie, Aleksis Vuoksenmaa, Mikko Koivisto:
Exact Sampling of Directed Acyclic Graphs from Modular Distributions. UAI 2019: 965-974 - 2018
- [c8]Topi Talvitie, Kustaa Kangas, Teppo Mikael Niinimäki, Mikko Koivisto:
Counting Linear Extensions in Practice: MCMC Versus Exponential Monte Carlo. AAAI 2018: 1431-1438 - [c7]Topi Talvitie, Kustaa Kangas, Teppo Mikael Niinimäki, Mikko Koivisto:
A Scalable Scheme for Counting Linear Extensions. IJCAI 2018: 5119-5125 - [c6]Topi Talvitie, Ralf Eggeling, Mikko Koivisto:
Finding Optimal Bayesian Networks with Local Structure. PGM 2018: 451-462 - 2017
- [c5]Topi Talvitie, Teppo Mikael Niinimäki, Mikko Koivisto:
The Mixing of Markov Chains on Linear Extensions in Practice. IJCAI 2017: 524-530 - 2016
- [j1]Valentin Polishchuk, Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Günter Rote, Lena Schlipf, Topi Talvitie:
Shortest path to a segment and quickest visibility queries. J. Comput. Geom. 7(2): 77-100 (2016) - 2015
- [c4]Topi Talvitie:
Visualizing Quickest Visibility Maps. SoCG 2015: 26-28 - [c3]Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Günter Rote, Lena Schlipf, Topi Talvitie:
Shortest Path to a Segment and Quickest Visibility Queries. SoCG 2015: 658-673 - [c2]Sylvester David Eriksson-Bique, John Hershberger, Valentin Polishchuk, Bettina Speckmann, Subhash Suri, Topi Talvitie, Kevin Verbeek, Hakan Yildiz:
Geometric k Shortest Paths. SODA 2015: 1616-1625 - 2014
- [c1]John Hershberger, Valentin Polishchuk, Bettina Speckmann, Topi Talvitie:
Geometric kth Shortest Paths: the Applet. SoCG 2014: 96
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
