@article{CTT100716227,
  author = {Amin Coja-Oghlan and Mikael Onsjö and Osamu Watanabe},
  title = {Propagation connectivity of random hypergraphs},
  journal = {The Electronic Journal of Combinatorics},
  year = 2012,
}

@article{CTT100597647,
  author = {Mikael Onsjö and OSAMU WATANABE},
  title = {Finding most likely solutions},
  journal = {Theory of Computing Systems},
  year = 2009,
}

@inproceedings{CTT100615132,
  author = {Robert Berke and Mikael Onsjoe},
  title = {Propagation connectivity of random hypergraphs},
  booktitle = {Lecture Notes in Computer Science},
  year = 2009,
}

@inproceedings{CTT100615131,
  author = {Mikael Onsjoe},
  title = {Belief propagation and heavy connectivity in random graphs},
  booktitle = {},
  year = 2009,
}

@inproceedings{CTT100604585,
  author = {Mikael Onsjö and OSAMU WATANABE},
  title = {Implementation of a bit-parallel approximate string matching algorithm},
  booktitle = {},
  year = 2009,
}

@inproceedings{CTT100576152,
  author = {Mikael Onsjoe},
  title = {A graph partitioning algorithm on the planted partition model},
  booktitle = {},
  year = 2007,
}

@inproceedings{CTT100576153,
  author = {Osamu Watanabe and Mikael Onsjoe},
  title = {Finding most likely solutions},
  booktitle = {Lecture Notes in Computer Science},
  year = 2007,
}