Travelled to:1 × Denmark
1 × Japan
1 × Switzerland
1 × Taiwan
3 × Italy
Collaborated with:A.Finkel D.Thérien M.Cadilhac H.Vollmer M.Blondin M.Thomas A.Baziramwabo T.Schwentick S.Göller C.Haase
Talks about:automata (3) constrain (2) unambigu (2) circuit (2) extension (1) dimension (1) translat (1) reachabl (1) uniform (1) modular (1)
Person: Pierre McKenzie
DBLP: McKenzie:Pierre
Contributed to:
2015
2014
20122013
2008200019991989Wrote 8 papers:
- LICS-2015-BlondinFGHM #2d #reachability
- Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete (MB, AF, SG, CH, PM), pp. 32–43.
- ICALP-v2-2014-BlondinFM #branch #infinity
- Handling Infinitely Branching WSTS (MB, AF, PM), pp. 13–25.
- DLT-2012-CadilhacFM #ambiguity #automaton
- Unambiguous Constrained Automata (MC, AF, PM), pp. 239–250.
- DLT-J-2012-CadilhacFM13 #ambiguity #automaton
- Unambiguous constrained Automata (MC, AF, PM), pp. 1099–1116.
- CSL-2008-McKenzieTV
- Extensional Uniformity for Boolean Circuits (PM, MT, HV), pp. 64–78.
- ICALP-2000-McKenzieSTV
- The Many Faces of a Translation (PM, TS, DT, HV), pp. 890–901.
- LICS-1999-BaziramwaboMT #composition #logic
- Modular Temporal Logic (AB, PM, DT), pp. 344–351.
- ICALP-1989-McKenzieT #automaton #complexity
- Automata Theory Meets Circuit Complexity (PM, DT), pp. 589–602.