Torsten Stüber

According to our database, Torsten Stüber authored at least 10 papers between 2008 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2019

Mathematical Analysis and Algorithms for Federated Byzantine Agreement Systems.

André Gaul, Ismail Khoffi, Jörg Liesen, Torsten Stüber

CoRR, 2019

2012

A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids.

Zoltán Fülöp, Torsten Stüber, Heiko Vogler

Theory Comput. Syst., 2012

State-Split for Hypergraphs with an Application to Tree Adjoining Grammars.

Johannes Osterholzer, Torsten Stüber

Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms, 2012

2011

Multioperator Weighted Monadic Datalog.

Torsten Stüber

Proceedings of the Ausgezeichnete Informatikdissertationen 2011, 2011

Multioperator Weighted Monadic Datalog.

Torsten Stüber

PhD thesis, 2011

2010

Weighted finite automata over strong bimonoids.

Manfred Droste, Torsten Stüber, Heiko Vogler

Inf. Sci., 2010

n-Best Parsing Revisited.

Matthias Büchse, Daniel Geisler, Torsten Stüber, Heiko Vogler

Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, 2010

2009

Decomposition of Weighted multioperator Tree Automata.

Torsten Stüber, Heiko Vogler, Zoltán Fülöp

Int. J. Found. Comput. Sci., 2009

Monadic Datalog Tree Transducers.

Matthias Büchse, Torsten Stüber

Proceedings of the Language and Automata Theory and Applications, 2009

2008

Weighted monadic datalog.

Torsten Stüber, Heiko Vogler

Theor. Comput. Sci., 2008