Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2. - Leslie Ann Goldberg; Markus Jalsenius; Russell Martin; Mike Paterson (LMS J. Comput. Math., 2006)

A Systematic Scan for 7-colourings of the Grid. - Markus Jalsenius; Kasper Pedersen (Int. J. Found. Comput. Sci., 2008)

Strong Spatial Mixing and Rapid Mixing with Five Colours for the Kagome Lattice. - Markus Jalsenius (LMS J. Comput. Math., 2009)

The complexity of weighted Boolean #CSP with mixed signs. - Andrei A. Bulatov; Martin E. Dyer; Leslie Ann Goldberg; Markus Jalsenius; David Richerby (Theor. Comput. Sci., 2009)

The Complexity of Flood Filling Games. - David Arthur; Raphaël Clifford; Markus Jalsenius; Ashley Montanaro; Benjamin Sach (FUN, 2010)

The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract) - Martin E. Dyer; Leslie Ann Goldberg; Markus Jalsenius; David Richerby (CoRR, 2010)

Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model. - Raphaël Clifford; Markus Jalsenius (ICALP (1), 2011)

Streaming Pattern Matching with Relabelling - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (CoRR, 2011)

Pattern Matching in Multiple Streams. - Raphaël Clifford; Markus Jalsenius; Ely Porat; Benjamin Sach (CPM, 2012)

The complexity of approximating bounded-degree Boolean #CSP. - Martin E. Dyer; Leslie Ann Goldberg; Markus Jalsenius; David Richerby (Inf. Comput., 2012)

The complexity of weighted and unweighted #CSP. - Andrei A. Bulatov; Martin E. Dyer; Leslie Ann Goldberg; Markus Jalsenius; Mark Jerrum; David Richerby (J. Comput. Syst. Sci., 2012)

The Complexity of Flood Filling Games. - Raphaël Clifford; Markus Jalsenius; Ashley Montanaro; Benjamin Sach (Theory Comput. Syst., 2012)

Sampling colourings of the triangular lattice. - Markus Jalsenius (Random Struct. Algorithms, 2012)

Tight Cell-Probe Bounds for Online Hamming Distance Computation. - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (SODA, 2013)

Parameterized Matching in the Streaming Model. - Markus Jalsenius; Benny Porat; Benjamin Sach (STACS, 2013)

Pattern Matching under Polynomial Transformation. - Ayelet Butman; Peter Clifford; Raphaël Clifford; Markus Jalsenius; Noa Lewenstein; Benny Porat; Ely Porat; Benjamin Sach (SIAM J. Comput., 2013)

Space lower bounds for online pattern matching. - Raphaël Clifford; Markus Jalsenius; Ely Porat; Benjamin Sach (Theor. Comput. Sci., 2013)

Cell-probe bounds for online edit distance and other pattern matching problems. - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (SODA, 2015)

The complexity of computation in bit streams. - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (CoRR, 2015)

Cell-Probe Lower Bounds for Bit Stream Computation. - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (ESA, 2016)

Time Bounds for Streaming Problems. - Raphaël Clifford; Markus Jalsenius; Benjamin Sach (Theory Comput., 2019)