Publications
Search

Publications :: Search

Show venue

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

    Conference
    Name: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland 2016
    URL: http://www.dagstuhl.de/dagpub/978-3-95977-016-3
    DBLP: db/conf/mfcs/mfcs2016.html
    Bookmark:

    Below you find the publications assigned to this venue.

    Show item 1 to 10 of 90  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda.
    Shortest Unique Substring Queries on Run-Length Encoded Strings.
    41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland 2016 (0) 2016
    Conference paper
    Matias David Lee, Erik P. de Vink.
    Logical Characterization of Bisimulation for Transition Relations over Probability Distributions with Internal Actions.
    41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland 2016 (0) 2016
    Conference paper
    Simon Perdrix, Quanlong Wang.
    Supplementarity is Necessary for Quantum Diagram Reasoning.
    41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland 2016 (0) 2016
    Conference paper
    Matthieu Rosenfeld.
    Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable.
    41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland 2016 (0) 2016
    Conference paper
    Will Dison, Eduard Einstein, Timothy R. Riley.
    Ackermannian Integer Compression and the Word Problem for Hydra Groups.
    41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland 2016 (0) 2016
    Conference paper
    Igor Potapov, Pavel Semukhin.
    Vector Reachability Problem in SL(2, Z).
    41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland 2016 (0) 2016
    Conference paper
    Bart M. P. Jansen, Astrid Pieterse.
    Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials.
    41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland 2016 (0) 2016
    Conference paper
    Stacey Jeffery, François Le Gall.
    Quantum Communication Complexity of Distributed Set Joins.
    41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland 2016 (0) 2016
    Conference paper
    Xiang Huang, Donald M. Stull.
    Polynomial Space Randomness in Analysis.
    41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland 2016 (0) 2016
    Conference paper
    Georgios Amanatidis, Evangelos Markakis, Krzysztof Sornat.
    Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results.
    41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland 2016 (0) 2016
    Show item 1 to 10 of 90  

    Your query returned 90 matches in the database.