| Year |
Citation |
Score |
| 2018 |
Blondin M, Finkel A, McKenzie P. Handling infinitely branching well-structured transition systems Information & Computation. 258: 28-49. DOI: 10.1016/J.Ic.2017.11.001 |
0.37 |
|
| 2018 |
Allender E, Krebs A, McKenzie P. Better Complexity Bounds for Cost Register Automata Theory of Computing Systems. 63: 367-385. DOI: 10.1007/S00224-018-9871-4 |
0.377 |
|
| 2018 |
Cadilhac M, Krebs A, McKenzie P. The Algebraic Theory of Parikh Automata Theory of Computing Systems \/ Mathematical Systems Theory. 62: 1241-1268. DOI: 10.1007/S00224-017-9817-2 |
0.636 |
|
| 2013 |
Cadilhac M, Finkel A, McKenzie P. Unambiguous constrained automata International Journal of Foundations of Computer Science. 24: 1099-1116. DOI: 10.1142/S0129054113400339 |
0.582 |
|
| 2012 |
Cook S, McKenzie P, Wehr D, Braverman M, Santhanam R. Pebbles and branching programs for tree evaluation Acm Transactions On Computation Theory. 3. DOI: 10.1145/2077336.2077337 |
0.311 |
|
| 2012 |
Cadilhac M, Finkel A, McKenzie P. Bounded Parikh automata International Journal of Foundations of Computer Science. 23: 1691-1709. DOI: 10.1142/S0129054112400709 |
0.638 |
|
| 2012 |
Cadilhac M, Finkel A, McKenzie P. Affine Parikh automata Rairo - Theoretical Informatics and Applications. 46: 511-545. DOI: 10.1051/Ita/2012013 |
0.582 |
|
| 2012 |
Blondin M, McKenzie P. The complexity of intersecting finite automata having few final states Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7353: 31-42. DOI: 10.1007/S00037-014-0089-9 |
0.374 |
|
| 2010 |
McKenzie P, Thomas M, Vollmer H. Extensional Uniformity for Boolean Circuits Siam Journal On Computing. 39: 3186-3206. DOI: 10.1137/080741811 |
0.308 |
|
| 2007 |
McKenzie P, Wagner KW. The complexity of membership problems for circuits over sets of natural numbers Computational Complexity. 16: 211-244. DOI: 10.1007/S00037-007-0229-6 |
0.366 |
|
| 2006 |
Gál A, Koucký M, McKenzie P. Incremental branching programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3967: 178-190. DOI: 10.1007/S00224-007-9049-Y |
0.323 |
|
| 2004 |
Finkel A, McKenzie P, Picaronny C. A well-structured framework for analysing petri net extensions Information and Computation. 195: 1-29. DOI: 10.1016/J.Ic.2004.01.005 |
0.402 |
|
| 2003 |
Jenner B, Köbler J, McKenzie P, Torán J. Completeness results for graph isomorphism Journal of Computer and System Sciences. 66: 549-566. DOI: 10.1016/S0022-0000(03)00042-4 |
0.333 |
|
| 2001 |
Barrington DM, Kadau P, Lange KJ, McKenzie P. On the Complexity of Some Problems on Groups Input as Multiplication Tables Journal of Computer and System Sciences. 63: 186-200. DOI: 10.1006/Jcss.2001.1764 |
0.369 |
|
| 2001 |
Lautemann C, McKenzie P, Schwentick T, Vollmer H. The descriptive complexity approach to LOGCFL Journal of Computer and System Sciences. 62: 629-652. DOI: 10.1006/Jcss.2000.1742 |
0.403 |
|
| 2000 |
McKenzie P, Vollmer H, Wagner KW. Arithmetic circuits and polynomial replacement systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1974: 164-175. DOI: 10.1137/S009753970139207X |
0.354 |
|
| 2000 |
Holzer M, McKenzie P. Alternating and empty alternating auxiliary stack automata? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1893: 415-425. DOI: 10.1016/S0304-3975(02)00326-2 |
0.337 |
|
| 1999 |
Raz R, McKenzie P. Separation of the monotone NC hierarchy Combinatorica. 19: 403-435. DOI: 10.1007/S004930050062 |
0.326 |
|
| 1998 |
Caussinus H, McKenzie P, Thérien D, Vollmer H. Nondeterministic NC1 Computation Journal of Computer and System Sciences. 57: 200-212. |
0.307 |
|
| 1997 |
Beaudry M, McKenzie P, Péladeau P, Thérien D. Finite Monoids: From Word to Circuit Evaluation Siam Journal On Computing. 26: 138-152. DOI: 10.1137/S0097539793249530 |
0.354 |
|
| 1996 |
Jenner B, McKenzie P, Thérien D. Logspace and Logtime Leaf Languages Information & Computation. 129: 21-33. DOI: 10.1006/Inco.1996.0071 |
0.423 |
|
| 1995 |
Beaudry M, McKenzie P. Circuits, matrices, and nonassociative computation Journal of Computer and System Sciences. 50: 441-455. DOI: 10.1006/Jcss.1995.1035 |
0.375 |
|
| 1993 |
Bédard F, Lemieux F, McKenzie P. Extensions to Barrington's M-program model Theoretical Computer Science. 107: 31-61. DOI: 10.1016/0304-3975(93)90253-P |
0.377 |
|
| 1992 |
Beaudry M, McKenzie P, Thérien D. The Membership Problem in Aperiodic Transformation Monoids Journal of the Acm (Jacm). 39: 599-616. DOI: 10.1145/146637.146661 |
0.388 |
|
| 1991 |
McKenzie P, Péladeau P, Therien D. NC1: The automata-theoretic viewpoint Computational Complexity. 1: 330-359. DOI: 10.1007/Bf01212963 |
0.459 |
|
| 1987 |
McKenzie P, Cook SA. The parallel complexity of Abelian permutation group problems Siam Journal On Computing. 16: 880-909. DOI: 10.1137/0216058 |
0.355 |
|
| 1987 |
Cook SA, McKenzie P. Problems complete for deterministic logarithmic space Journal of Algorithms. 8: 385-394. DOI: 10.1016/0196-6774(87)90018-6 |
0.353 |
|
| 1984 |
McKenzie P. Permutations of bounded degree generate groups of polynomial diameter Information Processing Letters. 19: 253-254. DOI: 10.1016/0020-0190(84)90062-0 |
0.307 |
|
| Show low-probability matches. |