Mikko Koivisto

ORCID

Publication Activity (10 Years)

Years Active: 2003-2023
Publications (10 Years): 42

Top Venues

Publications

Juha Harviainen, Mikko Koivisto
A Faster Practical Approximation Scheme for the Permanent. AAAI (2023)
Juha Harviainen, Kseniya Rychkova, Mikko Koivisto
Quantum Speedups for Bayesian Network Structure Learning. CoRR (2023)
Juha Harviainen, Vaidyanathan Peruvemba Ramaswamy, Mikko Koivisto
On inference and learning with probabilistic generating circuits. UAI (2023)
Juha Harviainen, Mikko Koivisto
Revisiting Bayesian network learning with small vertex cover. UAI (2023)
Juha Harviainen, Mikko Koivisto, Petteri Kaski
Trustworthy Monte Carlo. NeurIPS (2022)
Juha Harviainen, Antti Röyskö, Mikko Koivisto
Approximating the Permanent with Deep Rejection Sampling. NeurIPS (2021)
Juha Harviainen, Antti Röyskö, Mikko Koivisto
Approximating the Permanent with Deep Rejection Sampling. CoRR (2021)
Mikko Koivisto, Antti Röyskö
Fast Multi-Subset Transform and Weighted Sums Over Acyclic Digraphs. CoRR (2020)
Jussi Viinikka, Mikko Koivisto
Layering-MCMC for Structure Learning in Bayesian Networks. UAI (2020)
Mikko Koivisto, Antti Röyskö
Fast Multi-Subset Transform and Weighted Sums over Acyclic Digraphs. SWAT (2020)
Jussi Viinikka, Antti Hyttinen, Johan Pensar, Mikko Koivisto
Towards Scalable Bayesian Learning of Causal DAGs. NeurIPS (2020)
Negin Karimi, Petteri Kaski, Mikko Koivisto
Error-Correcting and Verifiable Parallel Inference in Graphical Models. AAAI (2020)
Johan Pensar, Topi Talvitie, Antti Hyttinen, Mikko Koivisto
A Bayesian Approach for Estimating Causal Effects from Observational Data. AAAI (2020)
Kustaa Kangas, Mikko Koivisto, Sami Salonen
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions. Algorithmica 82 (8) (2020)
Jussi Viinikka, Antti Hyttinen, Johan Pensar, Mikko Koivisto
Towards Scalable Bayesian Learning of Causal DAGs. CoRR (2020)
Mikko Koivisto, Petteri Laakkonen, Juho Lauri
NP-completeness results for partitioning a graph into total dominating sets. Theor. Comput. Sci. 818 (2020)
Ralf Eggeling, Ivo Grosse, Mikko Koivisto
Algorithms for learning parsimonious context trees. Mach. Learn. 108 (6) (2019)
Topi Talvitie, Aleksis Vuoksenmaa, Mikko Koivisto
Exact Sampling of Directed Acyclic Graphs from Modular Distributions. UAI (2019)
Topi Talvitie, Ralf Eggeling, Mikko Koivisto
Learning Bayesian networks with local structure, mixed variables, and exact algorithms. Int. J. Approx. Reason. 115 (2019)
Ralf Eggeling, Jussi Viinikka, Aleksis Vuoksenmaa, Mikko Koivisto
On Structure Priors for Learning Bayesian Networks. AISTATS (2019)
Topi Talvitie, Mikko Koivisto
Counting and Sampling Markov Equivalent Directed Acyclic Graphs. AAAI (2019)
Topi Talvitie, Ralf Eggeling, Mikko Koivisto
Finding Optimal Bayesian Networks with Local Structure. PGM (2018)
Jussi Viinikka, Ralf Eggeling, Mikko Koivisto
Intersection-Validation: A Method for Evaluating Structure Learning without Ground Truth. AISTATS (2018)
Topi Talvitie, Kustaa Kangas, Teppo Mikael Niinimäki, Mikko Koivisto
Counting Linear Extensions in Practice: MCMC Versus Exponential Monte Carlo. AAAI (2018)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. IEEE Trans. Inf. Theory 64 (2) (2018)
Topi Talvitie, Kustaa Kangas, Teppo Mikael Niinimäki, Mikko Koivisto
A Scalable Scheme for Counting Linear Extensions. IJCAI (2018)
Brandon M. Malone, Kustaa Kangas, Matti Järvisalo, Mikko Koivisto, Petri Myllymäki
Empirical hardness of finding optimal Bayesian network structures: algorithm selection and runtime prediction. Mach. Learn. 107 (1) (2018)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. ISAAC (2018)
Kustaa Kangas, Petteri Kaski, Janne H. Korhonen, Mikko Koivisto
On the Number of Connected Sets in Bounded Degree Graphs. Electron. J. Comb. 25 (4) (2018)
Kustaa Kangas, Mikko Koivisto, Sami Salonen
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions. IPEC (2018)
Topi Talvitie, Teppo Mikael Niinimäki, Mikko Koivisto
The Mixing of Markov Chains on Linear Extensions in Practice. IJCAI (2017)
Mikko Koivisto, Petteri Laakkonen, Juho Lauri
NP-completeness Results for Partitioning a Graph into Total Dominating Sets. COCOON (2017)
Brandon M. Malone, Kustaa Kangas, Matti Järvisalo, Mikko Koivisto, Petri Myllymäki
AS-ASL: Algorithm Selection with Auto-sklearn. OASC (2017)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Narrow sieves for parameterized paths and packings. J. Comput. Syst. Sci. 87 (2017)
Ralf Eggeling, Mikko Koivisto
Pruning Rules for Learning Parsimonious Context Trees. UAI (2016)
Teppo Niinimaki, Pekka Parviainen, Mikko Koivisto
Structure Discovery in Bayesian Networks by Sampling Partial Orders. J. Mach. Learn. Res. 17 (2016)
Kustaa Kangas, Teemu Hankala, Teppo Mikael Niinimäki, Mikko Koivisto
Counting Linear Extensions of Sparse Posets. IJCAI (2016)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. CoRR (2016)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto, Jesper Nederlof, Pekka Parviainen
Fast Zeta Transforms for Lattices with Few Irreducibles. ACM Trans. Algorithms 12 (1) (2016)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs. ISIT (2016)
Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
Separating OR, SUM, and XOR circuits. J. Comput. Syst. Sci. 82 (5) (2016)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Dense Subset Sum May Be the Hardest. STACS (2016)
Ralf Eggeling, Mikko Koivisto, Ivo Grosse
Dealing with small data: On the generalization of context trees. ICML (2015)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Subset Sum in the Absence of Concentration. STACS (2015)
Kustaa Kangas, Teppo Mikael Niinimäki, Mikko Koivisto
Averaging of Decomposable Graphs by Dynamic Programming and Sampling. UAI (2015)
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
On finding optimal polytrees. Theor. Comput. Sci. 592 (2015)
Per Austrin, Mikko Koivisto, Petteri Kaski, Jesper Nederlof
Dense Subset Sum may be the hardest. CoRR (2015)
Brandon M. Malone, Kustaa Kangas, Matti Järvisalo, Mikko Koivisto, Petri Myllymäki
Predicting the Hardness of Learning Bayesian Networks. AAAI (2014)
Kustaa Kangas, Mikko Koivisto, Teppo Mikael Niinimäki
Learning Chordal Markov Networks by Dynamic Programming. NIPS (2014)
Petteri Kaski, Mikko Koivisto, Janne H. Korhonen, Igor S. Sergeev
Fast monotone summation over disjoint sets. Inf. Process. Lett. 114 (5) (2014)
Kustaa Kangas, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
On the Number of Connected Sets in Bounded Degree Graphs. WG (2014)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jussi Määttä
Space--Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm CoRR (2013)
Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
Separating OR, SUM, and XOR Circuits CoRR (2013)
Teppo Niinimaki, Mikko Koivisto
Treedy: A Heuristic for Counting and Sampling Subsets. CoRR (2013)
Pekka Parviainen, Mikko Koivisto
Finding optimal Bayesian networks using precedence constraints. J. Mach. Learn. Res. 14 (1) (2013)
Teppo Niinimaki, Mikko Koivisto
Treedy: A Heuristic for Counting and Sampling Subsets. UAI (2013)
Per Austrin, Petteri Kaski, Mikko Koivisto, Jussi Määttä
Space-Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm. ICALP (1) (2013)
Teppo Mikael Niinimäki, Mikko Koivisto
Annealed Importance Sampling for Structure Learning in Bayesian Networks. IJCAI (2013)
Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Homomorphic Hashing for Sparse Coefficient Extraction. IPEC (2012)
Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
Fast Monotone Summation over Disjoint Sets CoRR (2012)
Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
Fast Monotone Summation over Disjoint Sets. IPEC (2012)
Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
Finding Efficient Circuits for Ensemble Computation. SAT (2012)
Pekka Parviainen, Mikko Koivisto
Exact Structure Discovery in Bayesian Networks with Less Space CoRR (2012)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
The traveling salesman problem in bounded degree graphs. ACM Trans. Algorithms 8 (2) (2012)
Teppo Niinimaki, Pekka Parviainen, Mikko Koivisto
Partial Order MCMC for Structure Discovery in Bayesian Networks CoRR (2012)
Petteri Kaski, Mikko Koivisto, Jesper Nederlof
Homomorphic Hashing for Sparse Coefficient Extraction CoRR (2012)
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
On Finding Optimal Polytrees CoRR (2012)
Andreas Björklund, Mikko Koivisto, Thore Husfeldt, Jesper Nederlof, Petteri Kaski, Pekka Parviainen
Fast zeta transforms for lattices with few irreducibles. SODA (2012)
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
On Finding Optimal Polytrees. AAAI (2012)
Mikko Koivisto
Advances in exact Bayesian structure discovery in Bayesian networks. CoRR (2012)
Teppo Niinimaki, Pekka Parviainen, Mikko Koivisto
Partial Order MCMC for Structure Discovery in Bayesian Networks. UAI (2011)
Pekka Parviainen, Mikko Koivisto
Ancestor Relations in the Presence of Unobserved Variables. ECML/PKDD (2) (2011)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Covering and packing in linear space. Inf. Process. Lett. 111 (21-22) (2011)
Pekka Parviainen, Mikko Koivisto
Bayesian structure discovery in Bayesian networks with less space. AISTATS (2010)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Evaluation of permanents in rings and semirings. Inf. Process. Lett. 110 (20) (2010)
Mikko Koivisto, Pekka Parviainen
A Space-Time Tradeoff for Permutation Problems. SODA (2010)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Covering and Packing in Linear Space. ICALP (1) (2010)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Narrow sieves for parameterized paths and packings CoRR (2010)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Trimmed Moebius Inversion and Graphs of Bounded Degree. Theory Comput. Syst. 47 (3) (2010)
Mikko Koivisto, Valentin Polishchuk
Geodesic diameter of a polygonal domain in O(n^4 log n) time CoRR (2010)
Mikko Koivisto
Partitioning into Sets of Bounded Cardinality. IWPEC (2009)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Counting Paths and Packings in Halves. ESA (2009)
Pekka Parviainen, Mikko Koivisto
Exact Structure Discovery in Bayesian Networks with Less Space. UAI (2009)
Andreas Björklund, Thore Husfeldt, Mikko Koivisto
Set Partitioning via Inclusion-Exclusion. SIAM J. Comput. 39 (2) (2009)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Counting Paths and Packings in Halves CoRR (2009)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
On evaluation of permanents CoRR (2009)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
The fast intersection transform with applications to counting paths CoRR (2008)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
The Travelling Salesman Problem in Bounded Degree Graphs. ICALP (1) (2008)
Pasi Rastas, Jussi Kollin, Mikko Koivisto
Fast Bayesian Haplotype Inference Via Context Tree Weighting. WABI (2008)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Computing the Tutte Polynomial in Vertex-Exponential Time. FOCS (2008)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Trimmed Moebius Inversion and Graphs of Bounded Degree CoRR (2008)
Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch, Petteri Kaski, Mikko Koivisto, Lukasz Kowalik, Yoshio Okamoto, Johan M. M. van Rooij, Ryan Williams
08431 Open Problems - Moderately Exponential Time Algorithms. Moderately Exponential Time Algorithms (2008)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Trimmed Moebius Inversion and Graphs of Bounded Degree. STACS (2008)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Fourier meets möbius: fast subset convolution. STOC (2007)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Computing the Tutte polynomial in vertex-exponential time CoRR (2007)
Mikko Koivisto
Optimal 2-constraint satisfaction via sum-product algorithms. Inf. Process. Lett. 98 (1) (2006)
Mikko Koivisto
Advances in Exact Bayesian Structure Discovery in Bayesian Networks. UAI (2006)
Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Fourier meets Möbius: fast subset convolution CoRR (2006)
Mikko Koivisto
An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion. FOCS (2006)
Jussi Kollin, Mikko Koivisto
Bayesian Learning with Mixtures of Trees. ECML (2006)

Mikko Koivisto.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mikko Koivisto