default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastian Maneth
Person information
- affiliation: University of Bremen, Germany
- affiliation (former): University of Edinburgh, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j46]Sebastian Maneth, Helmut Seidl, Martin Vu
:
Functionality of compositions of top-down tree transducers is decidable. Inf. Comput. 296: 105131 (2024)- [j45]Sebastian Maneth, Helmut Seidl:
Checking in polynomial time whether or not a regular tree language is deterministic top-down. Inf. Process. Lett. 184: 106449 (2024) - [c71]Rishabh Vallabh Varsha Haria, Amin El Abed, Sebastian Maneth:
User Identification via Free Roaming Eye Tracking Data. HCI (62) 2024: 352-364 - [c70]Paul Gallot, Sebastian Maneth, Keisuke Nakano, Charles Peyrat:
Deciding Linear Height and Linear Size-To-Height Increase of Macro Tree Transducers. ICALP 2024: 138:1-138:20 - [c69]Sebastian Maneth, Martin Vu:
Attributed Tree Transducers for Partial Functions. CIAA 2024: 221-233 - [i40]Rishabh Vallabh Varsha Haria, Amin El Abed, Sebastian Maneth:
User Identification via Free Roaming Eye Tracking Data. CoRR abs/2403.09415 (2024) - [i39]Sebastian Maneth, Martin Vu:
Attributed Tree Transducers for Partial Functions. CoRR abs/2406.06141 (2024) - 2023
- [j44]Sebastian Maneth, Helmut Seidl, Martin Vu:
Definability Results for Top-Down Tree Transducers. Int. J. Found. Comput. Sci. 34(2&3): 253-287 (2023) - [j43]Sebastian Maneth:
Preface. Int. J. Found. Comput. Sci. 34(8): 902 (2023) - [j42]Sebastian Maneth, Helmut Seidl:
Deciding origin equivalence of weakly self-nesting macro tree transducers. Inf. Process. Lett. 180: 106332 (2023) - [j41]Kenji Hashimoto, Sebastian Maneth:
Characterizing attributed tree translations in terms of macro tree transducers. Theor. Comput. Sci. 963: 113943 (2023) - [c68]Sebastian Maneth, Martin Vu:
Deciding Whether an Attributed Translation Can Be Realized by a Top-Down Transducer. CIAA 2023: 230-241 - [i38]Sebastian Maneth, Helmut Seidl:
Checking in Polynomial Time whether or not a Regular Tree Language is Deterministic Top-Down. CoRR abs/2306.00573 (2023) - [i37]Sebastian Maneth, Martin Vu:
Deciding whether an Attributed Translation can be realized by a Top-Down Transducer. CoRR abs/2306.04326 (2023) - [i36]Charles Peyrat, Paul Gallot, Sebastian Maneth, Keisuke Nakano:
Deciding Linear Height and Linear Size-to-Height Increase for Macro Tree Transducers. CoRR abs/2307.16500 (2023) - 2022
- [j40]Sahar Mahdie Klim Al Zaidawi, Martin H. U. Prinzler, Jonas Lührs, Sebastian Maneth:
An extensive study of user identification via eye movements across multiple datasets. Signal Process. Image Commun. 108: 116804 (2022) - [c67]Sebastian Maneth, Helmut Seidl, Martin Vu:
How to Decide Functionality of Compositions of Top-Down Tree Transducers. CAI 2022: 175-191 - [c66]Rishabh Vallabh Varsha Haria, Sahar Mahdie Klim Al Zaidawi, Sebastian Maneth:
Predicting Gender via Eye Movements. HCI (48) 2022: 91-100 - [i35]Rishabh Vallabh Varsha Haria, Sahar Mahdie Klim Al Zaidawi, Sebastian Maneth:
Predicting Gender via Eye Movements. CoRR abs/2206.07442 (2022) - [i34]Sebastian Maneth, Helmut Seidl, Martin Vu:
How to decide Functionality of Compositions of Top-Down Tree Transducers. CoRR abs/2209.01044 (2022) - [i33]Kenji Hashimoto, Sebastian Maneth:
Characterizing Attributed Tree Translations in Terms of Macro Tree Transducers. CoRR abs/2209.07090 (2022) - 2021
- [j39]Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth:
Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity. Acta Informatica 58(1-2): 95-152 (2021) - [j38]Markus Lohrey, Sebastian Maneth:
Largest common prefix of a regular tree language. J. Comput. Syst. Sci. 115: 235-245 (2021) - [c65]Sebastian Maneth, Helmut Seidl, Martin Vu:
Definability Results for Top-Down Tree Transducers. DLT 2021: 291-303 - [c64]Martin H. U. Prinzler, Christoph Schröder, Sahar Mahdie Klim Al Zaidawi, Gabriel Zachmann, Sebastian Maneth:
Visualizing Prediction Correctness of Eye Tracking Classifiers. ETRA Short Papers 2021: 10:1-10:7 - [c63]Peter Leupold, Sebastian Maneth:
Deciding Top-Down Determinism of Regular Tree Languages. FCT 2021: 341-353 - [e5]Sebastian Maneth:
Implementation and Application of Automata - 25th International Conference, CIAA 2021, Virtual Event, July 19-22, 2021, Proceedings. Lecture Notes in Computer Science 12803, Springer 2021, ISBN 978-3-030-79120-9 [contents] - [i32]Sebastian Maneth, Helmut Seidl, Martin Vu:
Definability Results for Top-Down Tree Transducers. CoRR abs/2105.14860 (2021) - [i31]Peter Leupold, Sebastian Maneth:
Deciding Top-Down Determinism of Regular Tree Languages. CoRR abs/2107.03174 (2021) - [i30]Sahar Mahdie Klim Al Zaidawi, Martin H. U. Prinzler, Jonas Lührs, Sebastian Maneth:
An Extensive Study of User Identification via Eye Movements across Multiple Datasets. CoRR abs/2111.05901 (2021) - 2020
- [j37]Sebastian Maneth, Fabian Peternek:
Constant delay traversal of grammar-compressed graphs with bounded rank. Inf. Comput. 273: 104520 (2020) - [j36]Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber:
Grammar-Based Compression of Unranked Trees. Theory Comput. Syst. 64(1): 141-176 (2020) - [c62]Christoph Schröder, Sahar Mahdie Klim Al Zaidawi, Martin H. U. Prinzler, Sebastian Maneth, Gabriel Zachmann:
Robustness of Eye Movement Biometrics Against Varying Stimuli and Varying Trajectory Length. CHI 2020: 1-7 - [c61]Sebastian Maneth, Helmut Seidl:
When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic? ICALP 2020: 134:1-134:18 - [c60]Sahar Mahdie Klim Al Zaidawi, Martin H. U. Prinzler, Christoph Schröder, Gabriel Zachmann, Sebastian Maneth:
Gender Classification of Prepubescent Children via Eye Movements with Reading Stimuli. ICMI Companion 2020: 1-6
2010 – 2019
- 2019
- [c59]Markus Lohrey, Sebastian Maneth:
Largest Common Prefix of a Regular Tree Language. FCT 2019: 95-108 - [c58]Helmut Seidl, Raphaela Palenta, Sebastian Maneth:
Deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time. FoSSaCS 2019: 488-504 - [c57]Sebastian Maneth:
Static Garbage Collection. CIAA 2019: 3-9 - [r1]Sebastian Maneth:
Grammar-Based Compression. Encyclopedia of Big Data Technologies 2019 - [i29]Helmut Seidl, Raphaela Palenta, Sebastian Maneth:
Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time. CoRR abs/1902.03858 (2019) - [i28]Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth:
Linear Bounded Composition of Tree-Walking Tree Transducers: Linear Size Increase and Complexity. CoRR abs/1904.09203 (2019) - [i27]Sebastian Maneth, Fabian Peternek:
Constant Delay Traversal of Grammar-Compressed Graphs with Bounded Rank. CoRR abs/1907.10444 (2019) - 2018
- [j35]Markus Lohrey, Sebastian Maneth, Carl Philipp Reh:
Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees. Algorithmica 80(7): 2082-2105 (2018) - [j34]Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot:
Decision problems of tree transducers with origin. Inf. Comput. 261: 311-335 (2018) - [j33]Sebastian Maneth, Helmut Seidl:
Balancedness of MSO transductions in polynomial time. Inf. Process. Lett. 133: 26-32 (2018) - [j32]Sebastian Maneth, Fabian Peternek:
Grammar-based graph compression. Inf. Syst. 76: 19-45 (2018) - [j31]Helmut Seidl, Sebastian Maneth, Gregor Kemper:
Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable. J. ACM 65(4): 21:1-21:30 (2018) - [j30]Joost Engelfriet, Andreas Maletti, Sebastian Maneth:
Multiple context-free tree grammars: Lexicalization and characterization. Theor. Comput. Sci. 728: 29-99 (2018) - [c56]Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber:
Grammar-Based Compression of Unranked Trees. CSR 2018: 118-131 - [c55]Sebastian Maneth, Fabian Peternek:
Constant Delay Traversal of Compressed Graphs. DCC 2018: 32-41 - [i26]Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber:
Grammar-based Compression of Unranked Trees. CoRR abs/1802.05490 (2018) - 2017
- [j29]Sebastian Maneth, Alexandra Poulovassilis:
Data Science. Comput. J. 60(3): 285-286 (2017) - [j28]Michael Benedikt, Joost Engelfriet, Sebastian Maneth:
Determinacy and rewriting of functional top-down and MSO tree transformations. J. Comput. Syst. Sci. 85: 57-73 (2017) - [j27]Benoît Groz, Sebastian Maneth:
Efficient testing and matching of deterministic regular expressions. J. Comput. Syst. Sci. 89: 372-399 (2017) - [c54]Markus Lohrey, Sebastian Maneth, Carl Philipp Reh:
Compression of Unordered XML Trees. ICDT 2017: 18:1-18:17 - [c53]Sorcha Gilroy, Adam Lopez, Sebastian Maneth, Pijus Simonaitis:
(Re)introducing Regular Graph Languages. MOL 2017: 100-113 - [c52]Sorcha Gilroy, Adam Lopez, Sebastian Maneth:
Parsing Graphs with Regular Graph Grammars. *SEM 2017: 199-208 - [i25]Sebastian Maneth, Fabian Peternek:
Grammar-Based Graph Compression. CoRR abs/1704.05254 (2017) - [i24]Joost Engelfriet, Andreas Maletti, Sebastian Maneth:
Multiple Context-Free Tree Grammars: Lexicalization and Characterization. CoRR abs/1707.03457 (2017) - [i23]Emmanuel Filiot, Sebastian Maneth, Helmut Seidl:
Formal Methods of Transformations (Dagstuhl Seminar 17142). Dagstuhl Reports 7(4): 23-37 (2017) - 2016
- [j26]Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
Look-ahead removal for total deterministic top-down tree transducers. Theor. Comput. Sci. 616: 18-58 (2016) - [c51]Markus Lohrey, Sebastian Maneth, Carl Philipp Reh:
Traversing Grammar-Compressed Trees with Constant Delay. DCC 2016: 546-555 - [c50]Sebastian Maneth, Fabian Peternek:
Compressing graphs by grammars. ICDE 2016: 109-120 - [c49]Stefan Böttcher, Rita Hartel, Thomas Jacobs, Sebastian Maneth:
Incremental updates on compressed XML. ICDE 2016: 1026-1037 - [c48]Tim Furche, Jinsong Guo, Sebastian Maneth, Christian Schallhart:
Robust and Noise Resistant Wrapper Induction. SIGMOD Conference 2016: 773-784 - [p2]Helmut Seidl, Sebastian Maneth, Gregor Kemper, Joost Engelfriet:
Equivalence - Combinatorics, Algebra, Proofs. Dependable Software Systems Engineering 2016: 202-243 - [i22]Philip Bille, Markus Lohrey, Sebastian Maneth, Gonzalo Navarro:
Computation over Compressed Structured Data (Dagstuhl Seminar 16431). Dagstuhl Reports 6(10): 99-119 (2016) - 2015
- [j25]Sebastian Maneth:
A Survey on Decidable Equivalence Problems for Tree Transducers. Int. J. Found. Comput. Sci. 26(8): 1069-1100 (2015) - [j24]Mireille Bousquet-Mélou, Markus Lohrey, Sebastian Maneth, Eric Nöth:
XML Compression via Directed Acyclic Graphs. Theory Comput. Syst. 57(4): 1322-1371 (2015) - [j23]Diego Arroyuelo, Francisco Claude, Sebastian Maneth, Veli Mäkinen, Gonzalo Navarro, Kim Nguyen, Jouni Sirén, Niko Välimäki:
Fast in-memory XPath search using compressed indexes. Softw. Pract. Exp. 45(3): 399-434 (2015) - [c47]Stefan Böttcher, Rita Hartel, Thomas Jacobs, Sebastian Maneth:
OnlineRePair: A Recompressor for XML Structures. DCC 2015: 439 - [c46]Helmut Seidl, Sebastian Maneth, Gregor Kemper:
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. FOCS 2015: 943-962 - [c45]Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot:
Decision Problems of Tree Transducers with Origin. ICALP (2) 2015: 209-221 - [c44]Markus Lohrey, Sebastian Maneth, Fabian Peternek:
Compressed Tree Canonization. ICALP (2) 2015: 337-349 - [c43]Sebastian Maneth, Alberto Ordóñez Pereira, Helmut Seidl:
Transforming XML Streams with References. SPIRE 2015: 33-45 - [e4]Sebastian Maneth:
Data Science - 30th British International Conference on Databases, BICOD 2015, Edinburgh, UK, July 6-8, 2015, Proceedings. Lecture Notes in Computer Science 9147, Springer 2015, ISBN 978-3-319-20423-9 [contents] - [i21]Markus Lohrey, Sebastian Maneth, Fabian Peternek:
Compressed Tree Canonization. CoRR abs/1502.04625 (2015) - [i20]Helmut Seidl, Sebastian Maneth, Gregor Kemper:
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable. CoRR abs/1503.09163 (2015) - [i19]Sebastian Maneth, Fabian Peternek:
A Survey on Methods and Systems for Graph Compression. CoRR abs/1504.00616 (2015) - [i18]Markus Lohrey, Sebastian Maneth, Carl Philipp Reh:
Traversing Grammar-Compressed Trees with Constant Delay. CoRR abs/1511.02141 (2015) - 2014
- [c42]Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
How to Remove the Look-Ahead of Top-Down Tree Transducers. Developments in Language Theory 2014: 103-115 - [c41]Shizuya Hakuta, Sebastian Maneth, Keisuke Nakano, Hideya Iwasaki:
XQuery streaming by Forest Transducers. ICDE 2014: 952-963 - [c40]Sebastian Maneth:
Equivalence Problems for Tree Transducers: A Brief Survey. AFL 2014: 74-93 - 2013
- [j22]Markus Lohrey, Sebastian Maneth, Roy Mennicke:
XML tree structure compression using RePair. Inf. Syst. 38(8): 1150-1167 (2013) - [c39]Markus Lohrey, Sebastian Maneth, Eric Noeth:
XML compression via DAGs. ICDT 2013: 69-80 - [c38]Michael Benedikt, Joost Engelfriet, Sebastian Maneth:
Determinacy and Rewriting of Top-Down and MSO Tree Transformations. MFCS 2013: 146-158 - [c37]Sebastian Maneth, Tom Sebastian:
XPath Node Selection over Grammar-Compressed Trees. TTATT 2013: 38-48 - [e3]Sebastian Maneth:
Proceedings Second International Workshop on Trends in Tree Automata and Tree Transducers, TTATT 2013, Hanoi, Vietnam, 19/10/2013. EPTCS 134, 2013 [contents] - [i17]Mireille Bousquet-Mélou, Markus Lohrey, Sebastian Maneth, Eric Noeth:
XML Compression via DAGs. CoRR abs/1309.5927 (2013) - [i16]Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
Look-Ahead Removal for Top-Down Tree Transducers. CoRR abs/1311.2400 (2013) - [i15]Shizuya Hakuta, Sebastian Maneth, Keisuke Nakano, Hideya Iwasaki:
XQuery Streaming by Forest Transducers. CoRR abs/1311.6570 (2013) - [i14]Sebastian Maneth, Helmut Seidl:
Tree Transducers and Formal Methods (Dagstuhl Seminar 13192). Dagstuhl Reports 3(5): 1-18 (2013) - [i13]Sebastian Maneth, Gonzalo Navarro:
Indexes and Computation over Compressed Structured Data (Dagstuhl Seminar 13232). Dagstuhl Reports 3(6): 22-37 (2013) - 2012
- [j21]Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß:
Parameter reduction and automata evaluation for grammar-compressed trees. J. Comput. Syst. Sci. 78(5): 1651-1669 (2012) - [c36]Benoît Groz, Sebastian Maneth, Slawek Staworko:
Deterministic regular expressions in linear time. PODS 2012: 49-60 - [c35]Sebastian Maneth:
Dictionary-Based Tree Compression (Invited Talk). RTA 2012: 5-5 - [p1]Sebastian Maneth, Sylvia Friese, Helmut Seidl:
Type Checking of Tree Walking Transducers. Modern Applications of Automata Theory 2012: 325-372 - 2011
- [j20]Sylvia Friese, Helmut Seidl, Sebastian Maneth:
Earliest Normal Form and Minimization for Bottom-up Tree Transducers. Int. J. Found. Comput. Sci. 22(7): 1607-1623 (2011) - [j19]Omer Giménez, Guillem Godoy, Sebastian Maneth:
Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete. SIAM J. Comput. 40(2): 446-464 (2011) - [c34]Markus Lohrey, Sebastian Maneth, Roy Mennicke:
Tree Structure Compression with RePair. DCC 2011: 353-362 - [c33]Adrià Gascón, Sebastian Maneth, Lander Ramos:
First-Order Unification on Compressed Terms. RTA 2011: 51-60 - 2010
- [j18]Sebastian Maneth, Kim Nguyen:
XPath Whole Query Optimization. Proc. VLDB Endow. 3(1): 882-893 (2010) - [j17]Sebastian Maneth:
Preface. Theor. Comput. Sci. 411(38-39): 3403 (2010) - [c32]Sylvia Friese, Helmut Seidl, Sebastian Maneth:
Minimization of Deterministic Bottom-Up Tree Transducers. Developments in Language Theory 2010: 185-196 - [c31]Diego Arroyuelo, Francisco Claude, Sebastian Maneth, Veli Mäkinen, Gonzalo Navarro, Kim Nguyen, Jouni Sirén, Niko Välimäki:
Fast in-memory XPath search using compressed indexes. ICDE 2010: 417-428 - [c30]Aurélien Lemay, Sebastian Maneth, Joachim Niehren:
A learning algorithm for top-down XML transformations. PODS 2010: 285-296 - [i12]Sebastian Maneth, Kim Nguyen:
XPath Whole Query Optimization. CoRR abs/1003.4353 (2010) - [i11]Markus Lohrey, Sebastian Maneth, Roy Mennicke:
Tree structure compression with RePair. CoRR abs/1007.5406 (2010) - [i10]Sebastian Maneth, Tom Sebastian:
Fast and Tiny Structural Self-Indexes for XML. CoRR abs/1012.5696 (2010)
2000 – 2009
- 2009
- [j16]Keisuke Nakano, Sebastian Maneth:
Computing the Cost of Typechecking of Composition of Macro Tree Transducers. Inf. Media Technol. 4(4): 846-856 (2009) - [j15]Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
Deciding equivalence of top-down XML transformations in polynomial time. J. Comput. Syst. Sci. 75(5): 271-286 (2009) - [c29]George Katsirelos, Sebastian Maneth, Nina Narodytska, Toby Walsh:
Restricted Global Grammar Constraints. CP 2009: 501-508 - [c28]Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß:
Parameter Reduction in Grammar-Compressed Trees. FoSSaCS 2009: 212-226 - [e2]Sebastian Maneth:
Implementation and Application of Automata, 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009. Proceedings. Lecture Notes in Computer Science 5642, Springer 2009, ISBN 978-3-642-02978-3 [contents] - [i9]George Katsirelos, Sebastian Maneth, Nina Narodytska, Toby Walsh:
Restricted Global Grammar Constraints. CoRR abs/0906.5233 (2009) - [i8]Diego Arroyuelo, Francisco Claude, Sebastian Maneth, Veli Mäkinen, Gonzalo Navarro, Kim Nguyen, Jouni Sirén, Niko Välimäki:
Fast In-Memory XPath Search over Compressed Text and Tree Indexes. CoRR abs/0907.2089 (2009) - [i7]Kazuhiro Inaba, Sebastian Maneth:
The Complexity of Translation Membership for Macro Tree Transducers. CoRR abs/0910.2315 (2009) - [i6]Omer Giménez, Guillem Godoy, Sebastian Maneth:
Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete. CoRR abs/0911.3674 (2009) - 2008
- [j14]Giorgio Busatto, Markus Lohrey, Sebastian Maneth:
Efficient memory representation of XML document trees. Inf. Syst. 33(4-5): 456-474 (2008) - [j13]Jens Teubner, Torsten Grust, Sebastian Maneth, Sherif Sakr:
Dependable cardinality forecasts for XQuery. Proc. VLDB Endow. 1(1): 463-477 (2008) - [c27]Sebastian Maneth, Nikolay Mihaylov, Sherif Sakr:
XML Tree Structure Compression. DEXA Workshops 2008: 243-247 - [c26]Guillem Godoy, Sebastian Maneth, Sophie Tison:
Classes of Tree Homomorphisms with Decidable Preservation of Regularity. FoSSaCS 2008: 127-141 - [c25]Kazuhiro Inaba, Sebastian Maneth:
The Complexity of Tree Transducer Output Languages. FSTTCS 2008: 244-255 - [c24]Sebastian Maneth, Keisuke Nakano:
XML Type Checking for Macro Tree Transducers with Holes. PLAN-X 2008 - [c23]Kazuhiro Inaba, Haruo Hosoya, Sebastian Maneth:
Multi-Return Macro Tree Transducers. CIAA 2008: 102-111 - [e1]Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter:
Structure-Based Compression of Complex Massive Data, 22.06. - 27.06.2008. Dagstuhl Seminar Proceedings 08261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [i5]Angela Bonifati, Gregory Leighton, Veli Mäkinen, Sebastian Maneth, Gonzalo Navarro, Andrea Pugliese:
An In-Memory XQuery/XPath Engine over a Compressed Structured Text Representation. Structure-Based Compression of Complex Massive Data 2008 - [i4]Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter:
08261 Abstracts Collection - Structure-Based Compression of Complex Massive Data. Structure-Based Compression of Complex Massive Data 2008 - [i3]Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojciech Rytter:
08261 Executive Summary - Structure-Based Compression of Complex Massive Data. Structure-Based Compression of Complex Massive Data 2008 - 2007
- [c22]Damien K. Fisher, Sebastian Maneth:
Structural Selectivity Estimation for XML Documents. ICDE 2007: 626-635 - [c21]Sebastian Maneth, Thomas Perst, Helmut Seidl:
Exact XML Type Checking in Polynomial Time. ICDT 2007: 254-268 - [c20]Sebastian Maneth, Helmut Seidl:
Deciding Equivalence of Top-Down XML Transformations in Polynomial Time. PLAN-X 2007: 73-79 - [c19]Irini Fundulaki, Sebastian Maneth:
Formalizing XML access control for update operations. SACMAT 2007: 169-174 - 2006
- [j12]Joost Engelfriet, Sebastian Maneth:
The equivalence problem for deterministic MSO tree transducers is decidable. Inf. Process. Lett. 100(5): 206-212 (2006) - [j11]Markus Lohrey, Sebastian Maneth:
The complexity of tree automata and XPath on grammar-compressed trees. Theor. Comput. Sci. 363(2): 196-210 (2006) - [c18]Burak Emir, Sebastian Maneth, Martin Odersky:
Scalable Programming Abstractions for XML Services. Research Results of the DICS Program 2006: 103-126 - [i2]Sebastian Maneth, Thomas Perst, Helmut Seidl:
Exact XML Type Checking in Polynomial Time. Universität Trier, Mathematik/Informatik, Forschungsbericht 06-04 (2006) - 2005
- [c17]Giorgio Busatto, Markus Lohrey, Sebastian Maneth:
Efficient Memory Representation of XML Documents. DBPL 2005: 199-216 - [c16]Joost Engelfriet, Sebastian Maneth:
The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable. FSTTCS 2005: 495-504 - [c15]Sebastian Maneth, Alexandru Berlea, Thomas Perst, Helmut Seidl:
XML type checking with macro tree transducers. PODS 2005: 283-294 - [c14]Markus Lohrey, Sebastian Maneth:
Tree Automata and XPath on Compressed Trees. CIAA 2005: 225-237 - [i1]Joost Engelfriet, Sebastian Maneth:
The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable. CoRR abs/cs/0506014 (2005) - 2004
- [c13]Sebastian Maneth, Giorgio Busatto:
Tree Transducers and Tree Compressions. FoSSaCS 2004: 363-377 - 2003
- [j10]Joost Engelfriet, Sebastian Maneth:
A comparison of pebble tree transducers with macro tree transducers. Acta Informatica 39(9): 613-698 (2003) - [j9]Joost Engelfriet, Sebastian Maneth:
Macro Tree Translations of Linear Size Increase are MSO Definable. SIAM J. Comput. 32(4): 950-1006 (2003) - [c12]Sebastian Maneth:
The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase. FSTTCS 2003: 326-337 - 2002
- [j8]Geert Jan Bex, Sebastian Maneth, Frank Neven:
A formal model for an expressive fragment of XSLT. Inf. Syst. 27(1): 21-39 (2002) - [j7]Joost Engelfriet, Sebastian Maneth:
Output String Languages of Compositions of Deterministic Macro Tree Transducers. J. Comput. Syst. Sci. 64(2): 350-395 (2002) - [c11]Sebastian Maneth:
The Complexity of Compositions of Deterministic Tree Transducers. FSTTCS 2002: 265-276 - [c10]Joost Engelfriet, Sebastian Maneth:
Two-Way Finite State Transducers with Nested Pebbles. MFCS 2002: 234-244 - 2001
- [c9]Joost Engelfriet, Sebastian Maneth:
Hierarchies of String Languages Generated by Deterministic Tree Transducers. Developments in Language Theory 2001: 228-238 - 2000
- [j6]Zoltán Fülöp, Sebastian Maneth:
Domains of partial attributed tree transducers. Inf. Process. Lett. 73(5-6): 175-180 (2000) - [c8]Geert Jan Bex, Sebastian Maneth, Frank Neven:
A Formal Model for an Expressive Fragment of XSLT. Computational Logic 2000: 1137-1151 - [c7]Joost Engelfriet, Sebastian Maneth:
Characterizing and Deciding MSO-Definability of Macro Tree Transductions. STACS 2000: 542-554
1990 – 1999
- 1999
- [j5]Sebastian Maneth:
Cooperating Distributed Hyperedge Replacement Grammars. Grammars 1(3): 193-208 (1999) - [j4]Joost Engelfriet, Sebastian Maneth:
Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations. Inf. Comput. 154(1): 34-91 (1999) - [c6]Sebastian Maneth, Frank Neven:
Structured Document Transformations Based on XSL. DBPL 1999: 80-98 - [c5]Sebastian Maneth:
String Languages Generated by Total Deterministic Macro Tree Transducers. FoSSaCS 1999: 258-272 - [c4]Zoltán Fülöp, Sebastian Maneth:
A Characterization of ETOL Tree Languages by Cooperating Regular Tree Grammars. Grammatical Models of Multi-Agent Systems 1999: 182-192 - 1998
- [j3]Sebastian Maneth:
The Generating Power of Total Deterministic Tree Transducers. Inf. Comput. 147(2): 111-144 (1998) - [j2]Sebastian Maneth, Heiko Vogler:
Attributed Context-Free Hypergraph Grammars. J. Autom. Lang. Comb. 3(2): 105-147 (1998) - [j1]Heinz Faßbender, Sebastian Maneth:
A Strict Border for the Decidability of E-Unification for Recursive Functions. J. Funct. Log. Program. 1998(4) (1998) - [c3]Sebastian Maneth:
Cooperating Distributed Hyperedge Replacement Grammars. MFCS Workshop on Grammar Systems 1998: 149-161 - [c2]Joost Engelfriet, Sebastian Maneth:
Tree Languages Generated be Context-Free Graph Grammars. TAGT 1998: 15-29 - 1996
- [c1]Heinz Faßbender, Sebastian Maneth:
A Strict Border for the Decidability of E-Unification for Recursive Functions. ALP 1996: 194-208
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 2024-09-13 01:41 CEST 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:
