Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Arnold Beckmann
@inproceedings{DBLP:conf/semco/BedenB23,
author = {Sadeer Beden and
Arnold Beckmann},
title = {Towards an Ontological Framework for Integrating Domain Expert Knowledge
with Random Forest Classification},
booktitle = {17th {IEEE} International Conference on Semantic Computing, {ICSC}
2023, Laguna Hills, CA, USA, February 1-3, 2023},
pages = {221--224},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/ICSC56153.2023.00043},
doi = {10.1109/ICSC56153.2023.00043},
timestamp = {Wed, 29 Mar 2023 11:16:50 +0200},
biburl = {https://dblp.org/rec/conf/semco/BedenB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cii/CaoBB22,
author = {Qiushi Cao and
Sadeer Beden and
Arnold Beckmann},
title = {A core reference ontology for steelmaking process knowledge modelling
and information management},
journal = {Comput. Ind.},
volume = {135},
pages = {103574},
year = {2022},
url = {https://doi.org/10.1016/j.compind.2021.103574},
doi = {10.1016/J.COMPIND.2021.103574},
timestamp = {Wed, 26 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cii/CaoBB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rcim/CaoZSRBBG22,
author = {Qiushi Cao and
Cecilia Zanni{-}Merk and
Ahmed Samet and
Christoph Reich and
Fran{\c{c}}ois de Bertrand de Beuvron and
Arnold Beckmann and
Cinzia Giannetti},
title = {{KSPMI:} {A} Knowledge-based System for Predictive Maintenance in
Industry 4.0},
journal = {Robotics Comput. Integr. Manuf.},
volume = {74},
pages = {102281},
year = {2022},
url = {https://doi.org/10.1016/j.rcim.2021.102281},
doi = {10.1016/J.RCIM.2021.102281},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rcim/CaoZSRBBG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kes/LakshmananBBPG22,
author = {Kayal Lakshmanan and
Eugenio Borghini and
Arnold Beckmann and
Cameron Pleydell{-}Pearce and
Cinzia Giannetti},
editor = {Matteo Cristani and
Carlos Toro and
Cecilia Zanni{-}Merk and
Robert J. Howlett and
Lakhmi C. Jain},
title = {Data modelling and Remaining Useful Life estimation of rolls in a
steel making cold rolling process},
booktitle = {Knowledge-Based and Intelligent Information {\&} Engineering Systems:
Proceedings of the 26th International Conference KES-2022, Verona,
Italy and Virtual Event, 7-9 September 2022},
series = {Procedia Computer Science},
volume = {207},
pages = {1057--1066},
publisher = {Elsevier},
year = {2022},
url = {https://doi.org/10.1016/j.procs.2022.09.161},
doi = {10.1016/J.PROCS.2022.09.161},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/kes/LakshmananBBPG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-03054,
author = {Fahad F. Alhabardi and
Arnold Beckmann and
Bogdan Lazar and
Anton Setzer},
title = {Verification of Bitcoin's Smart Contracts in Agda using Weakest Preconditions
for Access Control},
journal = {CoRR},
volume = {abs/2203.03054},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.03054},
doi = {10.48550/ARXIV.2203.03054},
eprinttype = {arXiv},
eprint = {2203.03054},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-03054.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-04832,
author = {Arnold Beckmann and
Yoriyuki Yamagata},
title = {On proving consistency of equational theories in Bounded Arithmetic},
journal = {CoRR},
volume = {abs/2203.04832},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.04832},
doi = {10.48550/ARXIV.2203.04832},
eprinttype = {arXiv},
eprint = {2203.04832},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-04832.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/information/BedenCB21,
author = {Sadeer Beden and
Qiushi Cao and
Arnold Beckmann},
title = {{SCRO:} {A} Domain Ontology for Describing Steel Cold Rolling Processes
towards Industry 4.0},
journal = {Inf.},
volume = {12},
number = {8},
pages = {304},
year = {2021},
url = {https://doi.org/10.3390/info12080304},
doi = {10.3390/INFO12080304},
timestamp = {Thu, 09 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/information/BedenCB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icfnds/BeckmannSA21,
author = {Arnold Beckmann and
Jo{\~{a}}o Santos and
Indirajith Vijai Ananth},
title = {Modeling and Computing Available Rights for Algorithmic Licensing
of Movies based on Blockchain},
booktitle = {{ICFNDS} 2021: The 5th International Conference on Future Networks
{\&} Distributed Systems, Dubai United Arab Emirates, December
15 - 16, 2021},
pages = {795--802},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3508072.3508224},
doi = {10.1145/3508072.3508224},
timestamp = {Wed, 20 Apr 2022 14:48:33 +0200},
biburl = {https://dblp.org/rec/conf/icfnds/BeckmannSA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icphys/BedenCB21,
author = {Sadeer Beden and
Qiushi Cao and
Arnold Beckmann},
title = {Semantic Asset Administration Shells in Industry 4.0: {A} Survey},
booktitle = {4th {IEEE} International Conference on Industrial Cyber-Physical Systems,
{ICPS} 2021, Victoria, BC, Canada, May 10-12, 2021},
pages = {31--38},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ICPS49255.2021.9468266},
doi = {10.1109/ICPS49255.2021.9468266},
timestamp = {Tue, 20 Jul 2021 15:32:47 +0200},
biburl = {https://dblp.org/rec/conf/icphys/BedenCB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/types/AlhabardiBLS21,
author = {Fahad F. Alhabardi and
Arnold Beckmann and
Bogdan Lazar and
Anton Setzer},
editor = {Henning Basold and
Jesper Cockx and
Silvia Ghilezan},
title = {Verification of Bitcoin Script in Agda Using Weakest Preconditions
for Access Control},
booktitle = {27th International Conference on Types for Proofs and Programs, {TYPES}
2021, June 14-18, 2021, Leiden, The Netherlands (Virtual Conference)},
series = {LIPIcs},
volume = {239},
pages = {1:1--1:25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.TYPES.2021.1},
doi = {10.4230/LIPICS.TYPES.2021.1},
timestamp = {Thu, 04 Aug 2022 11:31:27 +0200},
biburl = {https://dblp.org/rec/conf/types/AlhabardiBLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/access/MilneBK20,
author = {Alexander J. M. Milne and
Arnold Beckmann and
Pardeep Kumar},
title = {Cyber-Physical Trust Systems Driven by Blockchain},
journal = {{IEEE} Access},
volume = {8},
pages = {66423--66437},
year = {2020},
url = {https://doi.org/10.1109/ACCESS.2020.2984675},
doi = {10.1109/ACCESS.2020.2984675},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/access/MilneBK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BeckmannB19,
author = {Arnold Beckmann and
Sam Buss},
title = {On transformations of constant depth propositional proofs},
journal = {Ann. Pure Appl. Log.},
volume = {170},
number = {10},
pages = {1176--1187},
year = {2019},
url = {https://doi.org/10.1016/j.apal.2019.05.002},
doi = {10.1016/J.APAL.2019.05.002},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apal/BeckmannB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computability/BeckmannBFMT19,
author = {Arnold Beckmann and
Sam Buss and
Sy{-}David Friedman and
Moritz M{\"{u}}ller and
Neil Thapen},
title = {Feasible set functions have small circuits},
journal = {Comput.},
volume = {8},
number = {1},
pages = {67--98},
year = {2019},
url = {https://doi.org/10.3233/COM-180096},
doi = {10.3233/COM-180096},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computability/BeckmannBFMT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/BeckmannP18,
author = {Arnold Beckmann and
Norbert Preining},
title = {Hyper Natural Deduction for G{\"{o}}del Logic - {A} natural deduction
system for parallel reasoning},
journal = {J. Log. Comput.},
volume = {28},
number = {6},
pages = {1125--1187},
year = {2018},
url = {https://doi.org/10.1093/logcom/exy019},
doi = {10.1093/LOGCOM/EXY019},
timestamp = {Mon, 10 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/logcom/BeckmannP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/soco/BeckmannP17,
author = {Arnold Beckmann and
Norbert Preining},
title = {Deciding logics of linear Kripke frames with scattered end pieces},
journal = {Soft Comput.},
volume = {21},
number = {1},
pages = {191--197},
year = {2017},
url = {https://doi.org/10.1007/s00500-016-2400-y},
doi = {10.1007/S00500-016-2400-Y},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/soco/BeckmannP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/BeckmannB17,
author = {Arnold Beckmann and
Sam Buss},
title = {The {NP} Search Problems of Frege and Extended Frege Proofs},
journal = {{ACM} Trans. Comput. Log.},
volume = {18},
number = {2},
pages = {11:1--11:19},
year = {2017},
url = {https://doi.org/10.1145/3060145},
doi = {10.1145/3060145},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tocl/BeckmannB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wollic/BeckmannR17,
author = {Arnold Beckmann and
Jean{-}Jos{\'{e}} Razafindrakoto},
editor = {Juliette Kennedy and
Ruy J. G. B. de Queiroz},
title = {Total Search Problems in Bounded Arithmetic and Improved Witnessing},
booktitle = {Logic, Language, Information, and Computation - 24th International
Workshop, WoLLIC 2017, London, UK, July 18-21, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10388},
pages = {31--47},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-662-55386-2\_3},
doi = {10.1007/978-3-662-55386-2\_3},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wollic/BeckmannR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BeckmannBFMT16,
author = {Arnold Beckmann and
Sam Buss and
Sy{-}David Friedman and
Moritz M{\"{u}}ller and
Neil Thapen},
title = {Cobham recursive set functions},
journal = {Ann. Pure Appl. Log.},
volume = {167},
number = {3},
pages = {335--369},
year = {2016},
url = {https://doi.org/10.1016/j.apal.2015.12.005},
doi = {10.1016/J.APAL.2015.12.005},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/BeckmannBFMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cie/2016,
editor = {Arnold Beckmann and
Laurent Bienvenu and
Natasa Jonoska},
title = {Pursuit of the Universal - 12th Conference on Computability in Europe,
CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9709},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-40189-8},
doi = {10.1007/978-3-319-40189-8},
isbn = {978-3-319-40188-1},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/BeckmannBF15,
author = {Arnold Beckmann and
Samuel R. Buss and
Sy{-}David Friedman},
title = {Safe Recursive Set Functions},
journal = {J. Symb. Log.},
volume = {80},
number = {3},
pages = {730--762},
year = {2015},
url = {https://doi.org/10.1017/jsl.2015.26},
doi = {10.1017/JSL.2015.26},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/BeckmannBF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/BeckmannP15,
author = {Arnold Beckmann and
Norbert Preining},
title = {Separating intermediate predicate logics of well-founded and dually
well-founded structures by monadic sentences},
journal = {J. Log. Comput.},
volume = {25},
number = {3},
pages = {527--547},
year = {2015},
url = {https://doi.org/10.1093/logcom/exu016},
doi = {10.1093/LOGCOM/EXU016},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/logcom/BeckmannP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BeckmannP15,
author = {Arnold Beckmann and
Norbert Preining},
title = {Hyper Natural Deduction},
booktitle = {30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2015, Kyoto, Japan, July 6-10, 2015},
pages = {547--558},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/LICS.2015.57},
doi = {10.1109/LICS.2015.57},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/BeckmannP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cie/2015,
editor = {Arnold Beckmann and
Victor Mitrana and
Mariya Ivanova Soskova},
title = {Evolving Computability - 11th Conference on Computability in Europe,
CiE 2015, Bucharest, Romania, June 29 - July 3, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9136},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-20028-6},
doi = {10.1007/978-3-319-20028-6},
isbn = {978-3-319-20027-9},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/BeckmannB14,
author = {Arnold Beckmann and
Samuel R. Buss},
title = {Improved witnessing and local improvement principles for second-order
bounded arithmetic},
journal = {{ACM} Trans. Comput. Log.},
volume = {15},
number = {1},
pages = {2:1--2:35},
year = {2014},
url = {https://doi.org/10.1145/2559950},
doi = {10.1145/2559950},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/BeckmannB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/BeckmannPT14,
author = {Arnold Beckmann and
Pavel Pudl{\'{a}}k and
Neil Thapen},
title = {Parity Games and Propositional Proofs},
journal = {{ACM} Trans. Comput. Log.},
volume = {15},
number = {2},
pages = {17:1--17:30},
year = {2014},
url = {https://doi.org/10.1145/2579822},
doi = {10.1145/2579822},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/BeckmannPT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cie/2014,
editor = {Arnold Beckmann and
Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Klaus Meer},
title = {Language, Life, Limits - 10th Conference on Computability in Europe,
CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8493},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08019-2},
doi = {10.1007/978-3-319-08019-2},
isbn = {978-3-319-08018-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/Ambos-SpiesBCL13,
author = {Klaus Ambos{-}Spies and
Arnold Beckmann and
Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Benedikt L{\"{o}}we},
title = {Computability in Europe 2009},
journal = {J. Log. Comput.},
volume = {23},
number = {4},
pages = {727--728},
year = {2013},
url = {https://doi.org/10.1093/logcom/exr051},
doi = {10.1093/LOGCOM/EXR051},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/logcom/Ambos-SpiesBCL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BeckmannPT13,
author = {Arnold Beckmann and
Pavel Pudl{\'{a}}k and
Neil Thapen},
editor = {Krishnendu Chatterjee and
Jir{\'{\i}} Sgall},
title = {Parity Games and Propositional Proofs},
booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International
Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8087},
pages = {111--122},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40313-2\_12},
doi = {10.1007/978-3-642-40313-2\_12},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BeckmannPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PudlakBT13,
author = {Pavel Pudl{\'{a}}k and
Arnold Beckmann and
Neil Thapen},
title = {Parity Games and Propositional Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-092}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/092},
eprinttype = {ECCC},
eprint = {TR13-092},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/PudlakBT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Ambos-SpiesBBL12,
author = {Klaus Ambos{-}Spies and
Arnold Beckmann and
Samuel R. Buss and
Benedikt L{\"{o}}we},
title = {Computability in Europe 2009},
journal = {Ann. Pure Appl. Log.},
volume = {163},
number = {5},
pages = {483--484},
year = {2012},
url = {https://doi.org/10.1016/j.apal.2011.06.006},
doi = {10.1016/J.APAL.2011.06.006},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Ambos-SpiesBBL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/BeckmannL12,
author = {Arnold Beckmann and
Benedikt L{\"{o}}we},
title = {Computability in Europe 2008},
journal = {J. Log. Comput.},
volume = {22},
number = {2},
pages = {163--164},
year = {2012},
url = {https://doi.org/10.1093/logcom/exq010},
doi = {10.1093/LOGCOM/EXQ010},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/logcom/BeckmannL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BeckmannML12,
author = {Arnold Beckmann and
Wolfgang Merkle and
Benedikt L{\"{o}}we},
title = {Computability in Europe 2009},
journal = {Theory Comput. Syst.},
volume = {51},
number = {1},
pages = {1--3},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9375-y},
doi = {10.1007/S00224-011-9375-Y},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BeckmannML12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hvc/JamesBR12,
author = {Phillip James and
Arnold Beckmann and
Markus Roggenbach},
editor = {Armin Biere and
Amir Nahir and
Tanja E. J. Vos},
title = {Using Domain Specific Languages to Support Verification in the Railway
Domain},
booktitle = {Hardware and Software: Verification and Testing - 8th International
Haifa Verification Conference, {HVC} 2012, Haifa, Israel, November
6-8, 2012. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7857},
pages = {274--275},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-39611-3\_26},
doi = {10.1007/978-3-642-39611-3\_26},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/hvc/JamesBR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BeckmannL11,
author = {Arnold Beckmann and
Benedikt L{\"{o}}we},
title = {Computability in Europe 2008},
journal = {Theory Comput. Syst.},
volume = {48},
number = {3},
pages = {614--616},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9251-1},
doi = {10.1007/S00224-010-9251-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BeckmannL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeckmannB11,
author = {Arnold Beckmann and
Samuel R. Buss},
title = {Corrected upper bounds for free-cut elimination},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5433--5445},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.053},
doi = {10.1016/J.TCS.2011.05.053},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeckmannB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/BeckmannDL10,
author = {Arnold Beckmann and
Costas Dimitracopoulos and
Benedikt L{\"{o}}we},
title = {Computability in Europe 2008},
journal = {Arch. Math. Log.},
volume = {49},
number = {2},
pages = {119--121},
year = {2010},
url = {https://doi.org/10.1007/s00153-009-0166-y},
doi = {10.1007/S00153-009-0166-Y},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/BeckmannDL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/AehligB10,
author = {Klaus Aehlig and
Arnold Beckmann},
title = {On the computational complexity of cut-reduction},
journal = {Ann. Pure Appl. Log.},
volume = {161},
number = {6},
pages = {711--736},
year = {2010},
url = {https://doi.org/10.1016/j.apal.2009.06.004},
doi = {10.1016/J.APAL.2009.06.004},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/AehligB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jml/BeckmannB09,
author = {Arnold Beckmann and
Samuel R. Buss},
title = {Polynomial Local Search in the Polynomial Hierarchy and Witnessing
in Fragments of Bounded Arithmetic},
journal = {J. Math. Log.},
volume = {9},
number = {1},
year = {2009},
url = {https://doi.org/10.1142/S0219061309000847},
doi = {10.1142/S0219061309000847},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jml/BeckmannB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wollic/Beckmann09,
author = {Arnold Beckmann},
editor = {Hiroakira Ono and
Makoto Kanazawa and
Ruy J. G. B. de Queiroz},
title = {A Characterisation of Definable {NP} Search Problems in Peano Arithmetic},
booktitle = {Logic, Language, Information and Computation, 16th International Workshop,
WoLLIC 2009, Tokyo, Japan, June 21-24, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5514},
pages = {1--12},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02261-6\_1},
doi = {10.1007/978-3-642-02261-6\_1},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wollic/Beckmann09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BeckmannL08,
author = {Arnold Beckmann and
Benedikt L{\"{o}}we},
title = {Computability in Europe 2006},
journal = {Theory Comput. Syst.},
volume = {43},
number = {3-4},
pages = {295--297},
year = {2008},
url = {https://doi.org/10.1007/s00224-007-9045-2},
doi = {10.1007/S00224-007-9045-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BeckmannL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/order/BeckmannGP08,
author = {Arnold Beckmann and
Martin Goldstern and
Norbert Preining},
title = {Continuous Fra{\"{\i}}ss{\'{e}} Conjecture},
journal = {Order},
volume = {25},
number = {4},
pages = {281--298},
year = {2008},
url = {https://doi.org/10.1007/s11083-008-9094-4},
doi = {10.1007/S11083-008-9094-4},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/order/BeckmannGP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeckmannBL08,
author = {Arnold Beckmann and
Edwin J. Beggs and
Benedikt L{\"{o}}we},
title = {From G{\"{o}}del to Einstein: Computability between logic and
physics at CiE 2006},
journal = {Theor. Comput. Sci.},
volume = {394},
number = {3},
pages = {141--143},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2007.12.016},
doi = {10.1016/J.TCS.2007.12.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeckmannBL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bcs/BeckmannM08,
author = {Arnold Beckmann and
Faron Moller},
editor = {Erol Gelenbe and
Samson Abramsky and
Vladimiro Sassone},
title = {On the Complexity of Parity Games},
booktitle = {Visions of Computer Science - {BCS} International Academic Conference,
Imperial College, London, UK, 22-24 September 2008},
pages = {237--248},
publisher = {British Computer Society},
year = {2008},
url = {http://www.bcs.org/server.php?show=ConWebDoc.22905},
timestamp = {Mon, 21 Sep 2009 12:13:42 +0200},
biburl = {https://dblp.org/rec/conf/bcs/BeckmannM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/AehligB08,
author = {Klaus Aehlig and
Arnold Beckmann},
title = {On the Computational Complexity of Cut-Reduction},
booktitle = {Proceedings of the Twenty-Third Annual {IEEE} Symposium on Logic in
Computer Science, {LICS} 2008, 24-27 June 2008, Pittsburgh, PA, {USA}},
pages = {284--293},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/LICS.2008.9},
doi = {10.1109/LICS.2008.9},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/AehligB08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cie/2008,
editor = {Arnold Beckmann and
Costas Dimitracopoulos and
Benedikt L{\"{o}}we},
title = {Logic and Theory of Algorithms, 4th Conference on Computability in
Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5028},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69407-6},
doi = {10.1007/978-3-540-69407-6},
isbn = {978-3-540-69405-2},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/BeckmannP07,
author = {Arnold Beckmann and
Norbert Preining},
title = {Linear Kripke frames and G{\"{o}}del logics},
journal = {J. Symb. Log.},
volume = {72},
number = {1},
pages = {26--44},
year = {2007},
url = {https://doi.org/10.2178/jsl/1174668382},
doi = {10.2178/JSL/1174668382},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/BeckmannP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/BeckmannLN07,
author = {Arnold Beckmann and
Benedikt L{\"{o}}we and
Dag Normann},
title = {Logical Approaches to Computational Barriers: CiE 2006},
journal = {J. Log. Comput.},
volume = {17},
number = {6},
pages = {1021--1023},
year = {2007},
url = {https://doi.org/10.1093/logcom/exm031},
doi = {10.1093/LOGCOM/EXM031},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/logcom/BeckmannLN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Beckmann07,
author = {Arnold Beckmann},
editor = {Jacques Duparc and
Thomas A. Henzinger},
title = {Proofs, Programs and Abstract Complexity},
booktitle = {Computer Science Logic, 21st International Workshop, {CSL} 2007, 16th
Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15,
2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4646},
pages = {4--5},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74915-8\_3},
doi = {10.1007/978-3-540-74915-8\_3},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/Beckmann07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/AehligB07,
author = {Klaus Aehlig and
Arnold Beckmann},
editor = {Jacques Duparc and
Thomas A. Henzinger},
title = {Propositional Logic for Circuit Classes},
booktitle = {Computer Science Logic, 21st International Workshop, {CSL} 2007, 16th
Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15,
2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4646},
pages = {512--526},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74915-8\_38},
doi = {10.1007/978-3-540-74915-8\_38},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csl/AehligB07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0712-1499,
author = {Klaus Aehlig and
Arnold Beckmann},
title = {On the computational complexity of cut-reduction},
journal = {CoRR},
volume = {abs/0712.1499},
year = {2007},
url = {http://arxiv.org/abs/0712.1499},
eprinttype = {arXiv},
eprint = {0712.1499},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0712-1499.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cie/2006,
editor = {Arnold Beckmann and
Ulrich Berger and
Benedikt L{\"{o}}we and
John V. Tucker},
title = {Logical Approaches to Computational Barriers, Second Conference on
Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3988},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11780342},
doi = {10.1007/11780342},
isbn = {3-540-35466-2},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BeckmannAM05,
author = {Arnold Beckmann and
Jeremy Avigad and
Georg Moser},
title = {Preface},
journal = {Ann. Pure Appl. Log.},
volume = {136},
number = {1-2},
pages = {1--2},
year = {2005},
url = {https://doi.org/10.1016/j.apal.2005.05.001},
doi = {10.1016/J.APAL.2005.05.001},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apal/BeckmannAM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BeckmannB05,
author = {Arnold Beckmann and
Samuel R. Buss},
title = {Separation results for the size of constant-depth propositional proofs},
journal = {Ann. Pure Appl. Log.},
volume = {136},
number = {1-2},
pages = {30--55},
year = {2005},
url = {https://doi.org/10.1016/j.apal.2005.05.002},
doi = {10.1016/J.APAL.2005.05.002},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/BeckmannB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/Beckmann05,
author = {Arnold Beckmann},
title = {Uniform Proof Complexity},
journal = {J. Log. Comput.},
volume = {15},
number = {4},
pages = {433--446},
year = {2005},
url = {https://doi.org/10.1093/logcom/exi035},
doi = {10.1093/LOGCOM/EXI035},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/logcom/Beckmann05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/BeckmannJ05,
author = {Arnold Beckmann and
Jan Johannsen},
title = {An unexpected separation result in Linearly Bounded Arithmetic},
journal = {Math. Log. Q.},
volume = {51},
number = {2},
pages = {191--200},
year = {2005},
url = {https://doi.org/10.1002/malq.200410019},
doi = {10.1002/MALQ.200410019},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/BeckmannJ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Beckmann04,
author = {Arnold Beckmann},
title = {Preservation theorems and restricted consistency statements in bounded
arithmetic},
journal = {Ann. Pure Appl. Log.},
volume = {126},
number = {1-3},
pages = {255--280},
year = {2004},
url = {https://doi.org/10.1016/j.apal.2003.11.003},
doi = {10.1016/J.APAL.2003.11.003},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Beckmann04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Beckmann03,
author = {Arnold Beckmann},
title = {Dynamic ordinal analysis},
journal = {Arch. Math. Log.},
volume = {42},
number = {4},
pages = {303--334},
year = {2003},
url = {https://doi.org/10.1007/s00153-002-0169-4},
doi = {10.1007/S00153-002-0169-4},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Beckmann03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BeckmannPB03,
author = {Arnold Beckmann and
Chris Pollett and
Samuel R. Buss},
title = {Ordinal notations and well-orderings in bounded arithmetic},
journal = {Ann. Pure Appl. Log.},
volume = {120},
number = {1-3},
pages = {197--223},
year = {2003},
url = {https://doi.org/10.1016/S0168-0072(02)00066-0},
doi = {10.1016/S0168-0072(02)00066-0},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/BeckmannPB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BeckmannBP03,
author = {Arnold Beckmann and
Samuel R. Buss and
Chris Pollett},
title = {Erratum to "Ordinal notations and well-orderings in bounded arithmetic"
[Annals of Pure and Applied Logic 120 {(2003)} 197-223]},
journal = {Ann. Pure Appl. Log.},
volume = {123},
number = {1-3},
pages = {291},
year = {2003},
url = {https://doi.org/10.1016/S0168-0072(03)00039-3},
doi = {10.1016/S0168-0072(03)00039-3},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/BeckmannBP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-034,
author = {Arnold Beckmann},
title = {Height restricted constant depth {LK}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-034}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-034/index.html},
eprinttype = {ECCC},
eprint = {TR03-034},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Beckmann02,
author = {Arnold Beckmann},
title = {A non-well-founded primitive recursive tree provably well-founded
for co-r.e. sets},
journal = {Arch. Math. Log.},
volume = {41},
number = {3},
pages = {251--257},
year = {2002},
url = {https://doi.org/10.1007/s001530100107},
doi = {10.1007/S001530100107},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Beckmann02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Beckmann02,
author = {Arnold Beckmann},
title = {Proving Consistency of Equational Theories in Bounded Arithmetic},
journal = {J. Symb. Log.},
volume = {67},
number = {1},
pages = {279--296},
year = {2002},
url = {https://doi.org/10.2178/jsl/1190150044},
doi = {10.2178/JSL/1190150044},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Beckmann02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Beckmann02,
author = {Arnold Beckmann},
title = {Notations for exponentiation},
journal = {Theor. Comput. Sci.},
volume = {288},
number = {1},
pages = {3--19},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00143-8},
doi = {10.1016/S0304-3975(01)00143-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Beckmann02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Beckmann02,
author = {Arnold Beckmann},
editor = {Julian C. Bradfield},
title = {Resolution Refutations and Propositional Proofs with Height-Restrictions},
booktitle = {Computer Science Logic, 16th International Workshop, {CSL} 2002, 11th
Annual Conference of the EACSL, Edinburgh, Scotland, UK, September
22-25, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2471},
pages = {599--612},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45793-3\_40},
doi = {10.1007/3-540-45793-3\_40},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/Beckmann02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lpar/Beckmann02,
author = {Arnold Beckmann},
editor = {Matthias Baaz and
Andrei Voronkov},
title = {A Note on Universal Measures for Weak Implicit Computational Complexity},
booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning, 9th
International Conference, {LPAR} 2002, Tbilisi, Georgia, October 14-18,
2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2514},
pages = {53--67},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36078-6\_4},
doi = {10.1007/3-540-36078-6\_4},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/lpar/Beckmann02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Beckmann01,
author = {Arnold Beckmann},
title = {Exact Bounds for Lengths of Reductions in Typed lambda-Calculus},
journal = {J. Symb. Log.},
volume = {66},
number = {3},
pages = {1277--1285},
year = {2001},
url = {https://doi.org/10.2307/2695106},
doi = {10.2307/2695106},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Beckmann01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/BeckmannW00,
author = {Arnold Beckmann and
Andreas Weiermann},
title = {Characterizing the elementary recursive functions by a fragment of
G{\"{o}}del's {T}},
journal = {Arch. Math. Log.},
volume = {39},
number = {7},
pages = {475--491},
year = {2000},
url = {https://doi.org/10.1007/s001530050160},
doi = {10.1007/S001530050160},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/BeckmannW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/BeckmannW00,
author = {Arnold Beckmann and
Andreas Weiermann},
title = {Analyzing G{\"{o}}del's \emph{T} Via Expanded Head Reduction
Trees},
journal = {Math. Log. Q.},
volume = {46},
number = {4},
pages = {517--536},
year = {2000},
url = {https://doi.org/10.1002/1521-3870(200010)46:4\&\#60;517::AID-MALQ517\&\#62;3.0.CO;2-A},
doi = {10.1002/1521-3870(200010)46:4\&\#60;517::AID-MALQ517\&\#62;3.0.CO;2-A},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/BeckmannW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BeckmannP98,
author = {Arnold Beckmann and
Wolfram Pohlers},
title = {Applications of Cut-Free Infinitary Derivations to Generalized Recursion
Theory},
journal = {Ann. Pure Appl. Log.},
volume = {94},
number = {1-3},
pages = {7--19},
year = {1998},
url = {https://doi.org/10.1016/S0168-0072(97)00063-8},
doi = {10.1016/S0168-0072(97)00063-8},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/BeckmannP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/BeckmannW96,
author = {Arnold Beckmann and
Andreas Weiermann},
title = {A term rewriting characterization of the polytime functions and related
complexity classes},
journal = {Arch. Math. Log.},
volume = {36},
number = {1},
pages = {11--30},
year = {1996},
url = {https://doi.org/10.1007/s001530050054},
doi = {10.1007/S001530050054},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/BeckmannW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 02:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
