default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkus Jalsenius
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j11]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Time Bounds for Streaming Problems. Theory Comput. 15: 1-31 (2019)- 2016
- [c9]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Cell-Probe Lower Bounds for Bit Stream Computation. ESA 2016: 31:1-31:15 - 2015
- [c8]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Cell-probe bounds for online edit distance and other pattern matching problems. SODA 2015: 552-561 - [i15]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
The complexity of computation in bit streams. CoRR abs/1504.00834 (2015) - 2014
- [i14]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Cell-Probe Bounds for Online Edit Distance and Other Pattern Matching Problems. CoRR abs/1407.6559 (2014) - [i13]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Time Bounds for Streaming Problems. CoRR abs/1412.6935 (2014) - 2013
- [j10]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): 611-633 (2013) - [j9]Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach:
Space lower bounds for online pattern matching. Theor. Comput. Sci. 483: 68-74 (2013) - [c7]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Tight Cell-Probe Bounds for Online Hamming Distance Computation. SODA 2013: 664-674 - [c6]Markus Jalsenius, Benny Porat, Benjamin Sach:
Parameterized Matching in the Streaming Model. STACS 2013: 400-411 - 2012
- [j8]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The complexity of approximating bounded-degree Boolean #CSP. Inf. Comput. 220: 1-14 (2012) - [j7]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): 681-688 (2012) - [j6]Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach:
The Complexity of Flood Filling Games. Theory Comput. Syst. 50(1): 72-92 (2012) - [j5]Markus Jalsenius:
Sampling colourings of the triangular lattice. Random Struct. Algorithms 40(4): 501-533 (2012) - [c5]Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach:
Pattern Matching in Multiple Streams. CPM 2012: 97-109 - [i12]Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach:
Pattern Matching in Multiple Streams. CoRR abs/1202.3470 (2012) - [i11]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Tight Cell-Probe Bounds for Online Hamming Distance Computation. CoRR abs/1207.1885 (2012) - 2011
- [c4]Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach:
Space Lower Bounds for Online Pattern Matching. CPM 2011: 184-196 - [c3]Raphaël Clifford, Markus Jalsenius:
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model. ICALP (1) 2011: 593-604 - [i10]Raphaël Clifford, Markus Jalsenius:
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model. CoRR abs/1101.0768 (2011) - [i9]Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach:
Space Lower Bounds for Online Pattern Matching. CoRR abs/1106.4412 (2011) - [i8]Ayelet Butman, Peter Clifford, Raphaël Clifford, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach:
Pattern Matching under Polynomial Transformation. CoRR abs/1109.1494 (2011) - [i7]Raphaël Clifford, Markus Jalsenius, Benjamin Sach:
Streaming Pattern Matching with Relabelling. CoRR abs/1109.5269 (2011) - 2010
- [c2]David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach:
The Complexity of Flood Filling Games. FUN 2010: 307-318 - [c1]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Approximating Bounded-Degree Boolean #CSP. STACS 2010: 323-334 - [i6]David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach:
The Complexity of Flood Filling Games. CoRR abs/1001.4420 (2010) - [i5]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract). CoRR abs/1001.4987 (2010) - [i4]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby:
The complexity of weighted and unweighted #CSP. CoRR abs/1005.2678 (2010)
2000 – 2009
- 2009
- [j4]Markus Jalsenius:
Strong Spatial Mixing and Rapid Mixing with Five Colours for the Kagome Lattice. LMS J. Comput. Math. 12: 195-227 (2009) - [j3]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): 3949-3961 (2009) - [i3]Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Approximating Bounded-Degree Boolean #CSP. CoRR abs/0907.2663 (2009) - 2008
- [j2]Markus Jalsenius, Kasper Pedersen:
A Systematic Scan for 7-colourings of the Grid. Int. J. Found. Comput. Sci. 19(6): 1461-1477 (2008) - [i2]Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Weighted Boolean #CSP with Mixed Signs. CoRR abs/0812.4171 (2008) - 2007
- [i1]Markus Jalsenius:
Strong Spatial Mixing and Rapid Mixing with Five Colours for the Kagome Lattice. CoRR abs/math-ph/0701043 (2007) - 2006
- [j1]Leslie Ann Goldberg, Markus Jalsenius, Russell Martin, Mike Paterson:
Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z2. LMS J. Comput. Math. 9: 1-20 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
