Markus Jalsenius

Available identifiers

zbMath Open jalsenius.markusMaRDI QIDQ390879

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5204820	2019-12-05	Paper
Tight Cell-Probe Bounds for Online Hamming Distance Computation	2019-05-15	Paper
Cell-Probe Lower Bounds for Bit Stream Computation	2018-03-02	Paper
Cell-probe bounds for online edit distance and other pattern matching problems	2017-10-05	Paper
https://portal.mardi4nfdi.de/entity/Q2957901	2017-01-30	Paper
Space lower bounds for online pattern matching	2014-01-09	Paper
Pattern matching under polynomial transformation	2013-07-24	Paper
The complexity of approximating bounded-degree Boolean \(\#\)CSP	2013-01-17	Paper
The complexity of flood filling games	2012-12-06	Paper
Pattern Matching in Multiple Streams	2012-08-14	Paper
Sampling colourings of the triangular lattice	2012-08-14	Paper
The complexity of weighted and unweighted \(\#\)CSP	2012-05-11	Paper
The Complexity of Approximating Bounded-Degree Boolean #CSP	2012-01-23	Paper
Strong Spatial Mixing and Rapid Mixing with Five Colours for the Kagome Lattice	2011-09-15	Paper
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model	2011-07-06	Paper
Space Lower Bounds for Online Pattern Matching	2011-06-29	Paper
The complexity of weighted Boolean \#CSP with mixed signs	2009-09-10	Paper
A SYSTEMATIC SCAN FOR 7-COLOURINGS OF THE GRID	2009-02-26	Paper
Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2	2007-04-04	Paper

Research outcomes over time

This page was built for person: Markus Jalsenius