Travelled to:1 × Canada
1 × Portugal
1 × Russia
1 × Sweden
1 × Taiwan
2 × Spain
Collaborated with:D.Reidenbach ∅ H.Fernau M.Paramasivan J.D.Day
Talks about:languag (6) regular (3) pattern (3) regex (3) class (3) automata (2) counter (2) insid (2) bound (2) nondeterminist (1)
Person: Markus L. Schmid
DBLP: Schmid:Markus_L=
Contributed to:
2015
2014201220122013
201220112010Wrote 10 papers:
- CIAA-2015-FernauPS #automaton #complexity #finite
- Jumping Finite Automata: Characterizations and Complexity (HF, MP, MLS), pp. 89–101.
- DLT-2014-DayRS #pattern matching
- Closure Properties of Pattern Languages (JDD, DR, MLS), pp. 279–290.
- DLT-2014-Schmid #regular expression
- Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing (MLS), pp. 142–153.
- CIAA-2012-ReidenbachS #automaton #bound #nondeterminism
- Automata with Modulo Counters and Nondeterministic Counter Bounds (DR, MLS), pp. 361–368.
- DLT-2012-ReidenbachS #pattern matching
- Regular and Context-Free Pattern Languages over Small Alphabets (DR, MLS), pp. 130–141.
- DLT-2012-Schmid #regular expression
- Inside the Class of REGEX Languages (MLS), pp. 73–84.
- DLT-J-2012-Schmid13 #regular expression
- Inside the Class of regex Languages (MLS), pp. 1117–1134.
- LATA-2012-ReidenbachS #bound
- Patterns with Bounded Treewidth (DR, MLS), pp. 468–479.
- LATA-2011-ReidenbachS #memory management #scheduling #word
- Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access (DR, MLS), pp. 465–476.
- CIAA-2010-ReidenbachS #polynomial #regular expression #scalability
- A Polynomial Time Match Test for Large Classes of Extended Regular Expressions (DR, MLS), pp. 241–250.