The following pages link to Pierre McKenzie (Q208763):
Displayed 50 items.
- The complexity of intersecting finite automata having few final states (Q347114) (← links)
- \(NC^ 1\): The automata-theoretic viewpoint (Q685708) (← links)
- The algebraic theory of Parikh automata (Q722218) (← links)
- Incremental branching programs (Q929291) (← links)
- The complexity of solitaire (Q1034532) (← links)
- Permutations of bounded degree generate groups of polynomial diameter (Q1060843) (← links)
- Parallel algorithms for solvable permutation groups (Q1111023) (← links)
- Oracle branching programs and Logspace versus \(P^*\) (Q1183604) (← links)
- Extensions to Barrington's M-program model (Q1208406) (← links)
- Verifying identical communicating processes is undecidable (Q1269916) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- Completeness results for graph isomorphism. (Q1401960) (← links)
- The complexity of tensor calculus (Q1413648) (← links)
- Reversible space equals deterministic space (Q1567403) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- A well-structured framework for analysing Petri net extensions (Q1763373) (← links)
- Logspace and logtime leaf languages (Q1817219) (← links)
- Alternating and empty alternating auxiliary stack automata. (Q1874397) (← links)
- Circuits, matrices, and nonassociative computation (Q1894452) (← links)
- Separation of the monotone NC hierarchy (Q1977414) (← links)
- Better complexity bounds for cost register automata (Q1999991) (← links)
- The complexity of membership problems for circuits over sets of natural numbers (Q2474202) (← links)
- Corrigendum to ``Completeness results for graph isomorphism'' (Q2495413) (← links)
- The many faces of a translation (Q2581761) (← links)
- (Q2754205) (← links)
- Bounded Parikh Automata (Q2789518) (← links)
- BOUNDED PARIKH AUTOMATA (Q2841977) (← links)
- The Algebraic Theory of Parikh Automata (Q2850003) (← links)
- The Complexity of Intersecting Finite Automata Having Few Final States (Q2907484) (← links)
- The Lower Reaches of Circuit Uniformity (Q2912758) (← links)
- Fractional pebbling and thrifty branching programs (Q2920118) (← links)
- Pebbles and Branching Programs for Tree Evaluation (Q2947557) (← links)
- Unambiguous Constrained Automata (Q3167499) (← links)
- Few Product Gates But Many Zeros (Q3182922) (← links)
- Branching Programs for Tree Evaluation (Q3182923) (← links)
- Incremental Branching Programs (Q3434693) (← links)
- The Complexity of Solitaire (Q3525567) (← links)
- Worst Case Nonzero-Error Interactive Communication (Q3604685) (← links)
- Problems complete for deterministic logarithmic space (Q3787477) (← links)
- The Parallel Complexity of Abelian Permutation Group Problems (Q3792240) (← links)
- (Q3975161) (← links)
- (Q4249530) (← links)
- (Q4251062) (← links)
- (Q4258575) (← links)
- (Q4281558) (← links)
- The membership problem in aperiodic transformation monoids (Q4302805) (← links)
- Finite Monoids: From Word to Circuit Evaluation (Q4337437) (← links)
- (Q4418682) (← links)
- (Q4472442) (← links)
- (Q4536353) (← links)