|
|
|
|
|
|
|
|
|
|
|
 |
|
 |
|
Publications by Maximilian Schlund
|
|
 |
|
 |
To appear | |
Georg Bachmeier, Michael Luttenberger, and Maximilian Schlund. Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity. In LATA, Lecture Notes in Computer Science, pages ??–??, March To appear. |
|
|
M. Luttenberger and M. Schlund. Convergence of Newton's Method over Commutative Semirings. Information and Computation, ?(?):??–??, To appear. |
|
2014 | |
M. Schlund and M. Luttenberger. Regular Expressions for Provenance. In Proceedings of the 6th USENIX Workshop on the Theory and Practice of Provenance, June 2014. |
|
|
M. Schlund, M. Luttenberger, and J. Esparza. Fast and Accurate Unlexicalized Parsing via Structural Annotations. In Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, volume 2: Short Papers, pages 164–168, Gothenburg, Sweden, April 2014. Association for Computational Linguistics. |
|
|
Javier Esparza, Michael Luttenberger, and Maximilian Schlund. A brief history of Strahler numbers. In LATA, pages 1–13, 2014. |
|
|
Javier Esparza, Michael Luttenberger, and Maximilian Schlund. FPsolve: A generic solver for fixpoint equations over semirings. In CIAA, pages 1–15, 2014. |
|
2013 | |
M. Schlund, M. Terepeta, and M. Luttenberger. Putting Newton into Practice: A Solver for Polynomial Equations over Semirings. In LPAR 2013, volume 8312 of Lecture Notes in Computer Science, pages 727–734, December 2013. |
|
|
M. Luttenberger and M. Schlund. Convergence of Newton's Method over Commutative Semirings. In LATA, volume 7810 of Lecture Notes in Computer Science, pages 407–418, April 2013. |
|
2011 | |
J. Esparza, M. Leucker, and M. Schlund. Learning workflow Petri nets. Fundamenta Informaticae, 113(3-4):205–228, 2011. |
|
|
|
|
|
|
|
|
|
Contact
