Markus Jalsenius

From MaRDI portal
(Redirected from Person:390879)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Time bounds for streaming problems
Theory of Computing
2019-12-05Paper
Tight Cell-Probe Bounds for Online Hamming Distance Computation
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-05-15Paper
Cell-probe lower bounds for bit stream computation2018-03-02Paper
Cell-probe bounds for online edit distance and other pattern matching problems
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
2017-10-05Paper
scientific article; zbMATH DE number 6678937 (Why is no real title available?)
(available as arXiv preprint)
2017-01-30Paper
Space lower bounds for online pattern matching
Theoretical Computer Science
2014-01-09Paper
Pattern matching under polynomial transformation
SIAM Journal on Computing
2013-07-24Paper
The complexity of approximating bounded-degree Boolean \(\#\)CSP
Information and Computation
2013-01-17Paper
The complexity of flood filling games
Theory of Computing Systems
2012-12-06Paper
Pattern matching in multiple streams
Combinatorial Pattern Matching
2012-08-14Paper
Sampling colourings of the triangular lattice
Random Structures & Algorithms
2012-08-14Paper
The complexity of weighted and unweighted \(\#\)CSP
Journal of Computer and System Sciences
2012-05-11Paper
The complexity of approximating bounded-degree Boolean \#CSP2012-01-23Paper
Strong spatial mixing and rapid mixing with five colours for the Kagome lattice
LMS Journal of Computation and Mathematics
2011-09-15Paper
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model
Automata, Languages and Programming
2011-07-06Paper
Space Lower Bounds for Online Pattern Matching
Combinatorial Pattern Matching
2011-06-29Paper
The complexity of weighted Boolean \#CSP with mixed signs
Theoretical Computer Science
2009-09-10Paper
A SYSTEMATIC SCAN FOR 7-COLOURINGS OF THE GRID
International Journal of Foundations of Computer Science
2009-02-26Paper
Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2
LMS Journal of Computation and Mathematics
2007-04-04Paper
Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2
LMS Journal of Computation and Mathematics
2007-04-04Paper


Research outcomes over time


This page was built for person: Markus Jalsenius