Directory of Experts
Details for Dr Markus Jalsenius
| Personal details | |||
| Name | Dr Markus Jalsenius | ||
| Job title | Research Associate |
||
| Department | Department of Computer Science University of Bristol |
||
| Personal web page | http://www.cs.bris.ac.uk/home/markus/ | ||
| Contact details | This expert can be contacted via the University of Bristol Public Relations
Office. To help us deal with your request, please mention the Directory of Experts when contacting the Public Relations Office. work+44 (0)117 928 7777 email: public-relations@bristol.ac.uk |
||
| Qualifications | PhD(Liv) | ||
| Professional details | |||
| Keywords | pattern matching simulations modelling |
||
| Areas of expertise | I am researching pattern matching problems and string algorithms, both in an offline and streaming setting. For streaming, we are given a pattern and a streaming text that arrives one character at a time. The task is to report the distance between the pattern and a sliding window of the text as soon as the new character arrives. I am interested in finding fast unamortised solutions as well as proving time and space lower bounds for such problems. My PhD was on the efficiency of Markov chain simulations for sampling combinatorial structures, in particular graph colourings and so called spin configurations. I took up a postdoc position on the complexity of counting in constraint satisfaction problems (CSPs). I was researching the complexity of counting the number of satisfying solutions for CSPs, where the overall goal was to classify CSPs according to complexity, giving a characterisation for which CSPs are tractable. |
||
| Languages (other than English) |
|
||