Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Markus
    Last name: Jalsenius
    DBLP: 13/5557
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 32 of 32  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Raphaël Clifford, Markus Jalsenius, Benjamin Sach.
    Cell-Probe Lower Bounds for Bit Stream Computation.
    24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark 2016 (0) 2016
    Conference paper
    Raphaël Clifford, Markus Jalsenius, Benjamin Sach.
    Cell-probe bounds for online edit distance and other pattern matching problems.
    Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015 2015 (0) 2015
    Journal article
    Raphaël Clifford, Markus Jalsenius, Benjamin Sach.
    The complexity of computation in bit streams.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Raphaël Clifford, Markus Jalsenius, Benjamin Sach.
    Cell-Probe Bounds for Online Edit Distance and Other Pattern Matching Problems.
    CoRR 2014, Volume 0 (0) 2014
    Journal article
    Raphaël Clifford, Markus Jalsenius, Benjamin Sach.
    Time Bounds for Streaming Problems.
    CoRR 2014, Volume 0 (0) 2014
    Journal article
    Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach.
    Space lower bounds for online pattern matching.
    Theor. Comput. Sci. 2013, Volume 483 (0) 2013
    Conference paper
    Markus Jalsenius, Benny Porat, Benjamin Sach.
    Parameterized Matching in the Streaming Model.
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Conference paper
    Raphaël Clifford, Markus Jalsenius, Benjamin Sach.
    Tight Cell-Probe Bounds for Online Hamming Distance Computation.
    Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013 2013 (0) 2013
    Conference paper
    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. 2013, Volume 42 (0) 2013
    Journal article
    Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach.
    The Complexity of Flood Filling Games.
    Theory Comput. Syst. 2012, Volume 50 (0) 2012
    Conference paper
    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. 2012, Volume 78 (0) 2012
    Conference paper
    Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach.
    Pattern Matching in Multiple Streams.
    Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Markus Jalsenius.
    Sampling colourings of the triangular lattice.
    Random Struct. Algorithms 2012, Volume 40 (0) 2012
    Conference paper
    Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach.
    Pattern Matching in Multiple Streams
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Raphaël Clifford, Markus Jalsenius, Benjamin Sach.
    Tight Cell-Probe Bounds for Online Hamming Distance Computation
    CoRR 2012, Volume 0 (0) 2012
    Journal article
    Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby.
    The complexity of approximating bounded-degree Boolean #CSP.
    Inf. Comput. 2012, Volume 220 (0) 2012
    Journal article
    Raphaël Clifford, Markus Jalsenius.
    Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Raphaël Clifford, Markus Jalsenius.
    Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model.
    Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I 2011 (0) 2011
    Conference paper
    Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach.
    Space Lower Bounds for Online Pattern Matching.
    Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings 2011 (0) 2011
    Journal article
    Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach.
    Space Lower Bounds for Online Pattern Matching
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    Raphaël Clifford, Markus Jalsenius, Benjamin Sach.
    Streaming Pattern Matching with Relabelling
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    Ayelet Butman, Peter Clifford, Raphaël Clifford, Markus Jalsenius, Noa Lewenstein, Benny Porat, Ely Porat, Benjamin Sach.
    Pattern Matching under Polynomial Transformation
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    Andrei Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby.
    The complexity of weighted and unweighted #CSP
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach.
    The Complexity of Flood Filling Games.
    Fun with Algorithms, 5th International Conference, FUN 2010, Ischia, Italy, June 2-4, 2010. Proceedings 2010 (0) 2010
    Journal article
    David Arthur, Raphaël Clifford, Markus Jalsenius, Ashley Montanaro, Benjamin Sach.
    The Complexity of Flood Filling Games
    CoRR 2010, Volume 0 (0) 2010
    Journal article
    Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby.
    The Complexity of Approximating Bounded-Degree Boolean #CSP (Extended Abstract)
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby.
    The Complexity of Approximating Bounded-Degree Boolean #CSP.
    27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France 2010 (0) 2010
    Conference paper
    Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby.
    The Complexity of Approximating Bounded-Degree Boolean #CSP
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Andrei Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby.
    The complexity of weighted Boolean #CSP with mixed signs.
    Theor. Comput. Sci. 2009, Volume 410 (0) 2009
    Conference paper
    Andrei Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby.
    The Complexity of Weighted Boolean #CSP with Mixed Signs
    CoRR 2008, Volume 0 (0) 2008
    Conference paper
    Markus Jalsenius, Kasper Pedersen.
    A Systematic Scan for 7-colourings of the Grid.
    Int. J. Found. Comput. Sci. 2008, Volume 19 (0) 2008
    Conference paper
    Markus Jalsenius.
    Strong Spatial Mixing and Rapid Mixing with Five Colours for the Kagome Lattice.
    CoRR 2007, Volume 0 (0) 2007
    Show item 1 to 32 of 32  

    Your query returned 32 matches in the database.