Markus Jalsenius

Publication Activity (10 Years)

Years Active: 2006-2019
Publications (10 Years): 2

Top Topics

Pattern Matching

Problems Involving

Top Venues

Publications

Raphaël Clifford, Markus Jalsenius, Benjamin Sach
Time Bounds for Streaming Problems. Theory Comput. 15 (2019)
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
Cell-Probe Lower Bounds for Bit Stream Computation. ESA (2016)
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
The complexity of computation in bit streams. CoRR (2015)
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
Cell-probe bounds for online edit distance and other pattern matching problems. SODA (2015)
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
Time Bounds for Streaming Problems. CoRR (2014)
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
Cell-Probe Bounds for Online Edit Distance and Other Pattern Matching Problems. CoRR (2014)
Markus Jalsenius, Benny Porat, Benjamin Sach
Parameterized Matching in the Streaming Model. STACS (2013)
Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
Space lower bounds for online pattern matching. Theor. Comput. Sci. 483 (2013)
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
Tight Cell-Probe Bounds for Online Hamming Distance Computation. SODA (2013)
Ayelet Butman, Peter Clifford, Raphaël Clifford, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach
Pattern Matching under Polynomial Transformation. SIAM J. Comput. 42 (2) (2013)
Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach
The Complexity of Flood Filling Games. Theory Comput. Syst. 50 (1) (2012)
Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
Pattern Matching in Multiple Streams CoRR (2012)
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
The complexity of approximating bounded-degree Boolean #CSP. Inf. Comput. 220 (2012)
Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby
The complexity of weighted and unweighted #CSP. J. Comput. Syst. Sci. 78 (2) (2012)
Markus Jalsenius
Sampling colourings of the triangular lattice. Random Struct. Algorithms 40 (4) (2012)
Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
Pattern Matching in Multiple Streams. CPM (2012)
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
Tight Cell-Probe Bounds for Online Hamming Distance Computation CoRR (2012)
Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
Space Lower Bounds for Online Pattern Matching. CPM (2011)
Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
Space Lower Bounds for Online Pattern Matching CoRR (2011)
Raphaël Clifford, Markus Jalsenius
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model CoRR (2011)
Raphaël Clifford, Markus Jalsenius
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model. ICALP (1) (2011)
Raphaël Clifford, Markus Jalsenius, Benjamin Sach
Streaming Pattern Matching with Relabelling CoRR (2011)
Ayelet Butman, Peter Clifford, Raphaël Clifford, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach
Pattern Matching under Polynomial Transformation CoRR (2011)
Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby
The complexity of weighted and unweighted #CSP CoRR (2010)
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract) CoRR (2010)
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
The Complexity of Approximating Bounded-Degree Boolean #CSP. STACS (2010)
David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach
The Complexity of Flood Filling Games CoRR (2010)
David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach
The Complexity of Flood Filling Games. FUN (2010)
Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
The complexity of weighted Boolean #CSP with mixed signs. Theor. Comput. Sci. 410 (38-40) (2009)
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
The Complexity of Approximating Bounded-Degree Boolean #CSP CoRR (2009)
Markus Jalsenius
Strong Spatial Mixing and Rapid Mixing with Five Colours for the Kagome Lattice. LMS J. Comput. Math. 12 (2009)
Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby
The Complexity of Weighted Boolean #CSP with Mixed Signs CoRR (2008)
Markus Jalsenius, Kasper Pedersen
A Systematic Scan for 7-colourings of the Grid. Int. J. Found. Comput. Sci. 19 (6) (2008)
Markus Jalsenius
Strong Spatial Mixing and Rapid Mixing with Five Colours for the Kagome Lattice. CoRR (2007)
Leslie Ann Goldberg, Markus Jalsenius, Russell Martin, Mike Paterson
. LMS J. Comput. Math. 9 (2006)