Markus Jalsenius

According to our database, Markus Jalsenius authored at least 21 papers between 2006 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Time Bounds for Streaming Problems.

Raphaël Clifford, Markus Jalsenius, Benjamin Sach

Theory Comput., 2019

2016

Cell-Probe Lower Bounds for Bit Stream Computation.

Raphaël Clifford, Markus Jalsenius, Benjamin Sach

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

The complexity of computation in bit streams.

Raphaël Clifford, Markus Jalsenius, Benjamin Sach

CoRR, 2015

Cell-probe bounds for online edit distance and other pattern matching problems.

Raphaël Clifford, Markus Jalsenius, Benjamin Sach

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

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

Parameterized Matching in the Streaming Model.

Markus Jalsenius, Benny Porat, Benjamin Sach

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Tight Cell-Probe Bounds for Online Hamming Distance Computation.

Raphaël Clifford, Markus Jalsenius, Benjamin Sach

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Sampling colourings of the triangular lattice.

Markus Jalsenius

Random Struct. Algorithms, 2012

The Complexity of Flood Filling Games.

Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach

Theory Comput. Syst., 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

Pattern Matching in Multiple Streams.

Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Streaming Pattern Matching with Relabelling

Raphaël Clifford, Markus Jalsenius, Benjamin Sach

CoRR, 2011

Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model.

Raphaël Clifford, Markus Jalsenius

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Space Lower Bounds for Online Pattern Matching.

Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010

The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract)

Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby

CoRR, 2010

The Complexity of Approximating Bounded-Degree Boolean #CSP.

Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

The Complexity of Flood Filling Games.

David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

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

Strong Spatial Mixing and Rapid Mixing with Five Colours for the Kagome Lattice.

Markus Jalsenius

LMS J. Comput. Math., 2009

2008

A Systematic Scan for 7-colourings of the Grid.

Markus Jalsenius, Kasper Pedersen

Int. J. Found. Comput. Sci., 2008

2006

Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z².

Leslie Ann Goldberg, Markus Jalsenius, Russell Martin, Mike Paterson

LMS J. Comput. Math., 2006