@inproceedings(avanzini-moser:2010,
 author       = "Martin Avanzini and Georg Moser",
 year         = "2010",
 title        = "Closing the Gap Between Runtime Complexity and Polytime Computability",
 editor       = "Christopher Lynch",
 booktitle    = "21st RTA",
 series       = "LIPIcs",
 volume       = "6",
 publisher    = "Schloss Dagstuhl",
 address      = "Germany",
 pages        = "33--48",
 doi          = "10.4230/LIPIcs.RTA.2010.33",
)
@book(baader-nipkow:98,
 author       = "Franz Baader and Tobias Nipkow",
 year         = "1998",
 title        = "Term Rewriting and All That",
 publisher    = "Cambridge University Press",
 address      = "New York, NY, USA",
)
@article(berman-karpinski-2d:02,
 author       = "Piotr Berman and Marek Karpinski and Lawrence L. Larmore and Wojciech Plandowski and Wojciech Rytter",
 year         = "2002",
 title        = "On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts",
 journal      = "J. Comput. Syst. Sci.",
 volume       = "65",
 number       = "2",
 pages        = "332--350",
 doi          = "10.1006/jcss.2002.1852",
)
@inproceedings(lohreymaneth:05,
 author       = "Giorgio Busatto and Markus Lohrey and Sebastian Maneth",
 year         = "2005",
 title        = "Efficient Memory Representation of {XML} Documents",
 booktitle    = "Proceedings of {DBPL} 2005",
 series       = "LNCS",
 volume       = "3774",
 pages        = "199--216",
 doi          = "10.1007/11601524_13",
)
@article(busatto-lohrey-maneth:08,
 author       = "Giorgio Busatto and Markus Lohrey and Sebastian Maneth",
 year         = "2008",
 title        = "Efficient Memory Representation of {XML} Document Trees",
 journal      = "Information Systems",
 volume       = "33",
 number       = "4--5",
 pages        = "456--474",
 doi          = "10.1016/j.is.2008.01.004",
)
@misc(tata:97,
 author       = "H. Comon and M. Dauchet and R. Gilleron and F. Jacquemard and D. Lugiez and S. Tison and M. Tommasi",
 year         = "1997",
 title        = "Tree Automata Techniques and Applications",
 url          = "{http://www.grappa.univ-lille3.fr/tata}",
 note         = "Release October 2002",
)
@inproceedings(gascon-godoy-schmidt-schauss:08,
 author       = "Adri{\`a} Gasc{\'o}n and Guillem Godoy and Manfred Schmidt-Schau{\ss }",
 year         = "2008",
 title        = "Context Matching for Compressed Terms",
 booktitle    = "23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008)",
 publisher    = "IEEE Computer Society",
 pages        = "93--102",
 doi          = "10.1109/LICS.2008.17",
)
@article(gascon-godoy-schmidt-schauss:TCL:2011,
 author       = "Adri{\`a} Gasc{\'o}n and Guillem Godoy and Manfred Schmidt-Schau{\ss }",
 year         = "2011",
 title        = "Unification and matching on compressed terms",
 journal      = "ACM Trans. Comput. Log.",
 volume       = "12",
 number       = "4",
 pages        = "26:1--26:37",
 url          = "http://doi.acm.org/10.1145/1970398.1970402",
)
@inproceedings(gasieniec-karpinski-plandowski-rytter-LZ:96,
 author       = "Leszek Gasieniec and Marek Karpinski and Wojciech Plandowski and Wojciech Rytter",
 year         = "1996",
 title        = "Efficient Algorithms for {L}empel-{Z}iv Encoding (Extended Abstract)",
 editor       = "Rolf G. Karlsson and Andrzej Lingas",
 booktitle    = "SWAT",
 series       = "Lecture Notes in Computer Science",
 volume       = "1097",
 publisher    = "Springer",
 pages        = "392--403",
 doi          = "10.1007/3-540-61422-2_148",
)
@inproceedings(gasieniec-karpinski-plandowski-rytter:96,
 author       = "Leszek Gasieniec and Marek Karpinski and Wojciech Plandowski and Wojciech Rytter",
 year         = "1996",
 title        = "Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract)",
 booktitle    = "7th CPM 96",
 series       = "Lecture Notes in Computer Science",
 volume       = "1075",
 publisher    = "Springer",
 pages        = "39--49",
 doi          = "10.1007/3-540-61258-0_3",
)
@inproceedings(jez-matching:2012,
 author       = "Artur Jez",
 year         = "2012",
 title        = "Faster Fully Compressed Pattern Matching by Recompression",
 booktitle    = "ICALP (1)",
 series       = "Lecture Notes in Computer Science",
 volume       = "7391",
 publisher    = "Springer",
 pages        = "533--544",
 doi          = "10.1007/978-3-642-31594-7_45",
)
@inproceedings(karpinski:95,
 author       = "Marek Karpinski and Wojciech Rytter and Ayumi Shinohara",
 year         = "1995",
 title        = "Pattern-matching for strings with short description",
 booktitle    = "CPM '95",
 series       = "LNCS",
 volume       = "937",
 publisher    = "Springer-Verlag",
 pages        = "205--214",
 doi          = "10.1007/3-540-60044-2_44",
)
@inproceedings(levyvillaretschauss:06a,
 author       = "Jordi Levy and Manfred Schmidt-Schau{\ss } and Mateu Villaret",
 year         = "2006",
 title        = "Bounded Second-Order Unification is {NP}-complete",
 booktitle    = "Term Rewriting and Applications (RTA-17)",
 series       = "LNCS",
 volume       = "4098",
 publisher    = "Springer",
 pages        = "400--414",
 doi          = "10.1007/11805618_30",
)
@article(levy-schmidt-schauss-villaret:08,
 author       = "Jordi Levy and Manfred Schmidt-Schau{\ss } and Mateu Villaret",
 year         = "2008",
 title        = "The Complexity of Monadic Second-Order Unification",
 journal      = "SIAM J. of Computing",
 volume       = "38",
 number       = "3",
 pages        = "1113--1140",
 doi          = "10.1137/050645403",
)
@inproceedings(lifshits:07,
 author       = "Yury Lifshits",
 year         = "2007",
 title        = "Processing Compressed Texts: A Tractability Border",
 booktitle    = "{CPM} 2007",
 series       = "LNCS",
 volume       = "4580",
 publisher    = "Springer",
 pages        = "228--240",
 url          = "http://dx.doi.org/10.1007/978-3-540-73437-6_24",
)
@article(lohrey-overview:12,
 author       = "Markus Lohrey",
 year         = "2012",
 title        = "Algorithmics on {SLP}-compressed strings. A survey",
 journal      = "Groups Complexity Cryptology",
 volume       = "4",
 number       = "2",
 pages        = "241--299",
 doi          = "10.1515/gcc-2012-0016",
)
@inproceedings(lohrey-maneth-schauss:09,
 author       = "Markus Lohrey and Sebastian Maneth and Manfred Schmidt-Schau{\ss }",
 year         = "2009",
 title        = "Parameter Reduction in Grammar-Compressed Trees",
 booktitle    = "12th FoSSaCS",
 series       = "LNCS",
 volume       = "5504",
 publisher    = "Springer",
 pages        = "212--226",
 doi          = "10.1007/978-3-642-00596-1_16",
)
@article(lohrey-maneth-schmidtschauss:12,
 author       = "Markus Lohrey and Sebastian Maneth and Manfred Schmidt-Schau{\ss }",
 year         = "2012",
 title        = "Parameter reduction and automata evaluation for grammar-compressed trees",
 journal      = "J. Comput. Syst. Sci.",
 volume       = "78",
 number       = "5",
 pages        = "1651--1669",
 doi          = "10.1016/j.jcss.2012.03.003",
)
@inproceedings(Plandowski:94,
 author       = "Wojciech Plandowski",
 year         = "1994",
 title        = "Testing equivalence of morphisms in context-free languages",
 booktitle    = "ESA 94",
 series       = "Lecture Notes in Computer Science",
 volume       = "855",
 pages        = "460--470",
 doi          = "10.1007/BFb0049431",
)
@inproceedings(Plandowski-Rytter:99,
 author       = "Wojciech Plandowski and Wojciech Rytter",
 year         = "1999",
 title        = "Complexity of Language Recognition Problems for Compressed Words",
 booktitle    = "Jewels are Forever",
 publisher    = "Springer",
 pages        = "262--272",
 doi          = "10.1007/978-3-642-60207-8_23",
)
@inproceedings(rytter:04,
 author       = "Wojciech Rytter",
 year         = "2004",
 title        = "Grammar {C}ompression, {LZ}-Encodings, and String Algorithms with Implicit Input",
 editor       = "J. Diaz et. al.",
 booktitle    = "ICALP 2004",
 series       = "LNCS",
 volume       = "3142",
 publisher    = "Springer-Verlag",
 pages        = "15--27",
 doi          = "10.1007/978-3-540-27836-8_5",
)
@techreport(schmidt-schauss:05-stg,
 author       = "Manfred Schmidt-Schau{\ss }",
 year         = "2005",
 title        = "Polynomial Equality Testing for Terms with Shared Substructures",
 type         = "Frank report",
 number       = "21",
 institution  = "Institut f\"ur Informatik. FB Informatik und Mathematik. Goethe-Universit\"at Frankfurt",
)
@misc(schmidt-schauss-linear-prelim:13,
 author       = "Manfred Schmidt-Schauss",
 year         = "2013",
 title        = "Linear Pattern Matching of Compressed Terms and Polynomial Rewriting",
 note         = "Accepted for publication, 2013",
)
@article(schmidt-schauss-schnitger:12,
 author       = "Manfred Schmidt-Schauss and Georg Schnitger",
 year         = "2012",
 title        = "Fast Equality Test for Straight-Line Compressed Strings",
 journal      = "Information processing letters",
 doi          = "10.1016/j.ipl.2012.01.008",
)
@article(ziv-lempel:77,
 author       = "Jacob Ziv and Abraham Lempel",
 year         = "1977",
 title        = "A Universal Algorithm for Sequential Data Compression",
 journal      = "IEEE Transactions on Information Theory",
 volume       = "23",
 number       = "3",
 pages        = "337--343",
 doi          = "10.1109/TIT.1977.1055714",
)