Mikko Koivisto

Available identifiers

zbMath Open koivisto.mikkoWikidataQ58126706 ScholiaQ58126706MaRDI QIDQ269492

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6059197	2023-11-02	Paper
https://portal.mardi4nfdi.de/entity/Q5091007	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5009467	2021-08-04	Paper
A faster tree-decomposition based algorithm for counting linear extensions	2020-08-12	Paper
NP-completeness results for partitioning a graph into total dominating sets	2020-04-07	Paper
Learning Bayesian networks with local structure, mixed variables, and exact algorithms	2020-02-26	Paper
Algorithms for learning parsimonious context trees	2019-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q5743488	2019-05-10	Paper
On the number of connected sets in bounded degree graphs	2018-11-22	Paper
Fast Zeta Transforms for Lattices with Few Irreducibles	2018-10-30	Paper
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs	2018-06-27	Paper
Dense Subset Sum may be the hardest	2018-01-24	Paper
NP-completeness results for partitioning a graph into total dominating sets	2017-10-23	Paper
Narrow sieves for parameterized paths and packings	2017-05-24	Paper
https://portal.mardi4nfdi.de/entity/Q2954983	2017-01-24	Paper
https://portal.mardi4nfdi.de/entity/Q2810856	2016-06-06	Paper
Separating OR, SUM, and XOR circuits	2016-04-18	Paper
On finding optimal polytrees	2015-10-08	Paper
On the Number of Connected Sets in Bounded Degree Graphs	2015-09-09	Paper
https://portal.mardi4nfdi.de/entity/Q2933845	2014-12-08	Paper
The traveling salesman problem in bounded degree graphs	2014-09-09	Paper
https://portal.mardi4nfdi.de/entity/Q5417641	2014-05-22	Paper
Fast monotone summation over disjoint sets	2014-04-15	Paper
Finding Efficient Circuits for Ensemble Computation	2013-08-12	Paper
Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm	2013-08-06	Paper
Covering and packing in linear space	2013-04-04	Paper
https://portal.mardi4nfdi.de/entity/Q4910710	2013-03-19	Paper
Homomorphic Hashing for Sparse Coefficient Extraction	2013-01-07	Paper
Fast Monotone Summation over Disjoint Sets	2013-01-07	Paper
Evaluation of permanents in rings and semirings	2012-03-27	Paper
https://portal.mardi4nfdi.de/entity/Q3093195	2011-10-12	Paper
Trimmed Moebius inversion and graphs of bounded degree	2010-10-06	Paper
Covering and Packing in Linear Space	2010-09-07	Paper
Set Partitioning via Inclusion-Exclusion	2010-04-29	Paper
Optimal 2-constraint satisfaction via sum-product algorithms	2010-01-18	Paper
Partitioning into Sets of Bounded Cardinality	2010-01-14	Paper
Counting Paths and Packings in Halves	2009-10-29	Paper
Fourier meets M\"{o}bius: fast subset convolution	2009-01-05	Paper
The Travelling Salesman Problem in Bounded Degree Graphs	2008-08-28	Paper
https://portal.mardi4nfdi.de/entity/Q5456817	2008-04-14	Paper
Parent Assignment Is Hard for the MDL, AIC, and NML Costs	2007-09-14	Paper
Algorithmic Learning Theory	2005-08-18	Paper
Theory Is Forever	2005-01-18	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Mikko Koivisto