Dirk Nowotka

According to our database1, Dirk Nowotka
  • authored at least 67 papers between 1998 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
TCS Special Issue: Combinatorics on Words - WORDS 2015.
Theor. Comput. Sci., 2017

The extended equation of Lyndon and Schützenberger.
J. Comput. Syst. Sci., 2017

A note on Thue games.
Inf. Process. Lett., 2017

The Hardness of Solving Simple Word Equations.
CoRR, 2017

Detecting One-Variable Patterns.
Proceedings of the String Processing and Information Retrieval, 2017

Equations Enforcing Repetitions Under Permutations.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016
A note on Thue games.
CoRR, 2016

Detecting Unary Patterns.
CoRR, 2016

One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

On the Solvability Problem for Restricted Classes of Word Equations.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015
k-Abelian pattern matching.
J. Discrete Algorithms, 2015

Cubic patterns with permutations.
J. Comput. Syst. Sci., 2015

On Prefix/Suffix-Square Free Words.
Proceedings of the String Processing and Information Retrieval, 2015

Unary Patterns with Permutations.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014
Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111).
Dagstuhl Reports, 2014

Testing Generalised Freeness of Words.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Formal software verification for the migration of embedded code from single- to multicore systems.
Proceedings of the Software Engineering 2014, Fachtagung des GI-Fachbereichs Softwaretechnik, 25. Februar, 2014

Generalised Lyndon-Schützenberger Equations.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Communication in Massively-Parallel SAT Solving.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

k-Abelian Pattern Matching.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013
Finding Pseudo-repetitions.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Defining Requirements on Domain-Specific Languages in Model-Driven Software Engineering of Safety-Critical Systems.
Proceedings of the Software Engineering 2013 - Workshopband (inkl. Doktorandensymposium), Fachtagung des GI-Fachbereichs Softwaretechnik, 26. Februar, 2013

Formal Verification of Concurrent Embedded Software.
Proceedings of the Embedded Systems: Design, Analysis and Verification, 2013

On the Pseudoperiodic Extension of u^l = v^m w^n.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Discovering Hidden Repetitions in Words.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
The Ehrenfeucht-Silberger problem.
J. Comb. Theory, Ser. A, 2012

Unary Patterns with involution.
Int. J. Found. Comput. Sci., 2012

Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju.
Fundam. Inform., 2012

String Matching with Involutions.
Proceedings of the Unconventional Computation and Natural Computation, 2012

Fine and Wilf's Theorem and Pseudo-repetitions.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

The Avoidability of Cubes under Permutations.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

MEMICS - Memory Interval Constraint Solving of (concurrent) Machine Code.
Proceedings of the Automotive, 2012

2011
Preface.
Int. J. Found. Comput. Sci., 2011

Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081).
Dagstuhl Reports, 2011

Pattern Avoidability with Involution
Proceedings of the Proceedings 8th International Conference Words 2011, 2011

The Number of Positions Starting a Square in Binary Words.
Electr. J. Comb., 2011

2010
Maximal Intersection Queries in Randomized Input Models.
Theory Comput. Syst., 2010

Cyclically repetition-free words on small alphabets.
Inf. Process. Lett., 2010

On the Relation between Periodicity and Unbordered Factors of Finite Words.
Int. J. Found. Comput. Sci., 2010

Maximal Intersection Queries in Randomized Input Models
CoRR, 2010

2009
Klassifikationsbäume in Echtzeit.
Softwaretechnik-Trends, 2009

Äquivalenzklassen mit Zeit und Zuständen.
Proceedings of the Informatiktage 2009: Fachwissenschaftlicher Informatik-Kongress 27. und 28. März 2009, 2009

The Ehrenfeucht-Silberger Problem.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008
A note on an extension of PDL.
J. Applied Logic, 2008

Unbordered factors and Lyndon words.
Discrete Mathematics, 2008

Bordered Conjugates of Words over Large Alphabets.
Electr. J. Comb., 2008

On the Relation between Periodicity and Unbordered Factors of Finite Words.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007
Periodicity and unbordered words: A proof of the extended duval conjecture.
J. ACM, 2007

On a Non-Context-Free Extension of PDL
CoRR, 2007

Height-Deterministic Pushdown Automata.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Estimation of the Click Volume by Large Scale Regression Analysis.
Proceedings of the Computer Science, 2007

Maximal Intersection Queries in Randomized Graph Models.
Proceedings of the Computer Science, 2007

2006
On unique factorizations of primitive words.
Theor. Comput. Sci., 2006

Binary Words with Few Squares.
Bulletin of the EATCS, 2006

Periods in Extensions of Words.
Acta Inf., 2006

2005
Counting bordered and primitive words with a fixed weight.
Theor. Comput. Sci., 2005

On the equation in a free semigroup.
Theor. Comput. Sci., 2005

A characterization of periodicity of bi-infinite words.
Theor. Comput. Sci., 2005

2004
Border correlation of binary words.
J. Comb. Theory, Ser. A, 2004

Minimal Duval Extensions.
Int. J. Found. Comput. Sci., 2004

Periodicity and Unbordered Words: A Proof of Duval?s Conjecture.
Proceedings of the STACS 2004, 2004

2003
On the independence of equations in three variables.
Theor. Comput. Sci., 2003

Periodicity and Unbordered Segments of Words.
Bulletin of the EATCS, 2003

Periodicity and Unbordered Words: A Proof of the Extended Duval Conjecture
CoRR, 2003

About Duval's Conjecture.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
Density of Critical Factorizations.
ITA, 2002

1998
Program Abstraction in a Higher-Order Logic Framework.
Proceedings of the Theorem Proving in Higher Order Logics, 11th International Conference, 1998


  Loading...