| KSPMI: a knowledge-based system for predictive maintenance in industry 4.0 Q Cao, C Zanni-Merk, A Samet, C Reich, FDB De Beuvron, A Beckmann, ... Robotics and Computer-Integrated Manufacturing 74, 102281, 2022 | 79 | 2022 |
| Exact bounds for lengths of reductions in typed λ-calculus A Beckmann The Journal of Symbolic Logic 66 (3), 1277-1285, 2001 | 63 | 2001 |
| A term rewriting characterization of the polytime functions and related complexity classes A Beckmann, A Weiermann Archive for Mathematical Logic 36 (1), 11-30, 1996 | 52 | 1996 |
| Separating fragments of bounded arithmetic A Beckmann PhD thesis, Universität Münster, 1996 | 36 | 1996 |
| Dynamic ordinal analysis A Beckmann Archive for Mathematical Logic 42, 303-334, 2003 | 28 | 2003 |
| Cyber-physical trust systems driven by blockchain AJM Milne, A Beckmann, P Kumar Ieee Access 8, 66423-66437, 2020 | 26 | 2020 |
| Continuous Fraïssé conjecture A Beckmann, M Goldstern, N Preining Order 25 (4), 281-298, 2008 | 26 | 2008 |
| Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic A Beckmann, SR Buss Journal of Mathematical Logic 9 (01), 103-138, 2009 | 25 | 2009 |
| Improved Witnessing and Local Improvement Principles for Second-Order Bounded Arithmetic A Beckmann, SR Buss The Infinity Project 11, 81-114, 2012 | 24 | 2012 |
| Linear Kripke frames and Gödel logics A Beckmann, N Preining The Journal of Symbolic Logic 72 (1), 26-44, 2007 | 22 | 2007 |
| Characterising definable search problems in bounded arithmetic via proof notations A Beckmann, SR Buss Ways of proof theory, 65-134, 2010 | 21 | 2010 |
| Characterizing the elementary recursive functions by a fragment of Gödel's T A Beckmann, A Weiermann Archive for Mathematical Logic 39 (7), 475-491, 2000 | 21 | 2000 |
| Separation results for the size of constant-depth propositional proofs A Beckmann, SR Buss Annals of Pure and Applied Logic 136 (1), 30-55, 2005 | 20 | 2005 |
| Applications of cut-free infinitary derivations to generalized recursion theory A Beckmann, W Pohlers Annals of Pure and Applied Logic 94 (1-3), 7-19, 1998 | 20 | 1998 |
| Parity Games and Propositional Proofs A Beckmann, P Pudlák, N Thapen ACM Transactions on Computational Logic 15 (2), 17:1 - 17:30, 2014 | 19 | 2014 |
| A core reference ontology for steelmaking process knowledge modelling and information management Q Cao, S Beden, A Beckmann Computers in Industry 135, 103574, 2022 | 17 | 2022 |
| Semantic asset administration shells in industry 4.0: A survey S Beden, Q Cao, A Beckmann 2021 4th IEEE International Conference on Industrial Cyber-Physical Systems …, 2021 | 17 | 2021 |
| Safe recursive set functions A Beckmann, SR Buss, SD Friedman The Infinity Project 11, 313-336, 2012 | 17 | 2012 |
| Ordinal notations and well-orderings in bounded arithmetic A Beckmann, C Pollett, SR Buss Annals of Pure and Applied Logic 120 (1-3), 197-223, 2003 | 17 | 2003 |
| Proving consistency of equational theories in bounded arithmetic A Beckmann The Journal of Symbolic Logic 67 (1), 279-296, 2002 | 13 | 2002 |
Sam BussProfessor of Mathematics and Computer ScienceBestätigte E-Mail-Adresse bei ucsd.edu
