We stand with Ukraine  

Andreas Reuß

Affiliations:
  • TU Munich, Faculty of Computer Science


According to our database1, Andreas Reuß authored at least 7 papers between 2010 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Paths, tree homomorphisms and disequalities for -clauses.
[BibTeX]
[DOI]
Andreas Reuß
,
Helmut Seidl
Math. Struct. Comput. Sci., 2018

2013
Normalization of Horn clauses with disequality constraints.
[BibTeX]
[DOI]
Andreas Reuß
PhD thesis, 2013

2012
Crossing the Syntactic Barrier: Hom-Disequalities for H<sub>1</sub>-Clauses.
[BibTeX]
[DOI]
Andreas Reuß
,
Helmut Seidl
Proceedings of the Implementation and Application of Automata, 2012

Extending ${\cal H}_1$ -Clauses with Path Disequalities.
[BibTeX]
[DOI]
Helmut Seidl
,
Andreas Reuß
Proceedings of the Foundations of Software Science and Computational Structures, 2012

2011
Extending H<sub>1</sub>-clauses with disequalities.
[BibTeX]
[DOI]
Helmut Seidl
,
Andreas Reuß
Inf. Process. Lett., 2011

2010
Bottom-Up Tree Automata with Term Constraints.
[BibTeX]
[DOI]
Andreas Reuß
,
Helmut Seidl
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Program Analysis with Horn Clauses.
[BibTeX]
Andreas Reuß
Proceedings of the Joint Workshop of the German Research Training Groups in Computer Science, 2010


  Loading...