Markus Jalsenius

35 papers A* 2A 3B 2Misc 1Journal 26Unranked 1

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