Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Schneider, Johannes"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the dual post correspondence problem
Joel D. Day
,
Daniel Reidenbach
,
Johannes C. Schneider
International Journal of Foundations of Computer Science
25
(8), 2014, pp. 1033-1048
Symmetry breaking depending on the chromatic number or the neighborhood growth
Johannes Schneider
,
Michael Elkin
,
Roger Wattenhofer
Theoretical Computer Science
509
, 2013, pp. 40-50
Restricted ambiguity of erasing morphisms
Daniel Reidenbach
,
Johannes C. Schneider
Theoretical Computer Science
412
(29), 2011, pp. 3510-3523
Bounds on contention management algorithms
Johannes Schneider
,
Roger Wattenhofer
Theoretical Computer Science
412
(32), 2011, pp. 4151-4160
Morphically primitive words
Daniel Reidenbach
,
Johannes C. Schneider
Theoretical Computer Science
410
(21-23), 2009, pp. 2148-2161
Bounds on contention management algorithms
Johannes Schneider
,
Roger Wattenhofer
Lecture Notes in Computer Science
5878
, 2009, pp. 441-451
Unambiguous morphic images of strings
Dominik D. Freydenberger
,
Daniel Reidenbach
,
Johannes C. Schneider
International Journal of Foundations of Computer Science
17
(3), 2006, pp. 601-628