BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
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 DBLP: McKenzie:Pierre

Contributed to:

LICS 20152015
ICALP (2) 20142014
DLT 20122012
DLT 20122013
CSL 20082008
ICALP 20002000
LICS 19991999
ICALP 19891989

Wrote 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.
Extensional Uniformity for Boolean Circuits (PM, MT, HV), pp. 64–78.
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.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.