default search action
Peter Schneider-Kamp
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c61]Peter Schneider-Kamp
, Anton Danholt Lautrup
Synthesizers: A Meta-Framework for Generating and Evaluating High-Fidelity Tabular Synthetic Data. ICSOFT 2024: 177-184 - [c60]Luís Cruz-Filipe, Peter Schneider-Kamp:
Minimizing Sorting Networks at the Sub-Comparator Level. LPAR 2024: 36-50 - [i35]Anton Danholt Lautrup, Tobias Hyrup, Arthur Zimek, Peter Schneider-Kamp:
SynthEval: A Framework for Detailed Utility and Privacy Evaluation of Tabular Synthetic Data. CoRR abs/2404.15821 (2024) - [i34]Dan Saattrup Nielsen, Kenneth Enevoldsen, Peter Schneider-Kamp:
Encoder vs Decoder: Comparative Analysis of Encoder and Decoder Language Models on Multilingual NLU Tasks. CoRR abs/2406.13469 (2024) - [i33]Jacob Nielsen, Peter Schneider-Kamp:
BitNet b1.58 Reloaded: State-of-the-art Performance Also on Smaller Networks. CoRR abs/2407.09527 (2024) - 2023
- [i32]Tobias Hyrup, Anton Danholt Lautrup, Arthur Zimek, Peter Schneider-Kamp:
Sharing is CAIRing: Characterizing Principles and Assessing Properties of Universal Privacy Evaluation for Synthetic Tabular Data. CoRR abs/2312.12216 (2023) - 2022
- [j20]Lea Matlekovic
Microservices for autonomous UAV inspection with UAV simulation as a service. Simul. Model. Pract. Theory 119: 102548 (2022) - [c59]Rui Zhang
A Simple Meta-path-free Framework for Heterogeneous Network Embedding. CIKM 2022: 2600-2609 - [c58]Rui Zhang
Unsupervised Representation Learning on Attributed Multiplex Network. CIKM 2022: 2610-2619 - [c57]Juan Marín-Vega, Michael Sloth, Peter Schneider-Kamp
DRHDR: A Dual branch Residual Network for Multi-Bracket High Dynamic Range Imaging. CVPR Workshops 2022: 843-851 - [c56]Eduardo Pérez-Pellitero, Sibi Catley-Chandar, Richard Shaw, Ales Leonardis, Radu Timofte
NTIRE 2022 Challenge on High Dynamic Range Imaging: Methods and Results. CVPR Workshops 2022: 1008-1022 - [c55]Marcos V. Conde
Reversed Image Signal Processing and RAW Reconstruction. AIM 2022 Challenge Report. ECCV Workshops (3) 2022: 3-26 - [c54]Peter Schneider-Kamp
Approximate Dictionary Searching at a Scale using Ternary Search Trees and Implicit Levenshtein Automata. ICSOFT 2022: 657-662 - [i31]Lea Matlekovic, Peter Schneider-Kamp:
From Monolith to Microservices: Software Architecture for Autonomous UAV Infrastructure Inspection. CoRR abs/2204.02342 (2022) - [i30]Eduardo Pérez-Pellitero, Sibi Catley-Chandar, Richard Shaw, Ales Leonardis, Radu Timofte
NTIRE 2022 Challenge on High Dynamic Range Imaging: Methods and Results. CoRR abs/2205.12633 (2022) - [i29]Juan Marín-Vega, Michael Sloth, Peter Schneider-Kamp, Richard Röttger:
DRHDR: A Dual branch Residual Network for Multi-Bracket High Dynamic Range Imaging. CoRR abs/2206.04124 (2022) - [i28]Marcos V. Conde, Radu Timofte, Yibin Huang, Jingyang Peng, Chang Chen, Cheng Li, Eduardo Pérez-Pellitero, Fenglong Song, Furui Bai, Shuai Liu, Chaoyu Feng, Xiaotao Wang, Lei Lei, Yu Zhu, Chenghua Li, Yingying Jiang, Yong A, Peisong Wang, Cong Leng, Jian Cheng, Xiaoyu Liu, Zhicun Yin, Zhilu Zhang, Junyi Li, Ming Liu, Wangmeng Zuo, Jun Jiang, Jinha Kim, Yue Zhang, Beiji Zou, Zhikai Zong, Xiaoxiao Liu, Juan Marín-Vega, Michael Sloth, Peter Schneider-Kamp, Richard Röttger, Furkan Kinli, Baris Özcan
Reversed Image Signal Processing and RAW Reconstruction. AIM 2022 Challenge Report. CoRR abs/2210.11153 (2022) - 2021
- [j19]Jonas Herskind Sejr, Peter Schneider-Kamp
Surrogate Object Detection Explainer (SODEx) with YOLOv4 and LIME. Mach. Learn. Knowl. Extr. 3(3): 662-671 (2021) - [c53]Golizheh Mehrooz, Peter Schneider-Kamp
Web Application for Planning, Monitoring, and Controlling Autonomous Inspection Drones. MECO 2021: 1-6 - 2020
- [c52]Naeem Ayoub
Real-time On-board Detection of Components and Faults in an Autonomous UAV System for Power Line Inspection. DeLTA 2020: 68-75 - [c51]Golizheh Mehrooz, Peter Schneider-Kamp
Optimal Path Planning for Drone Inspections of Linear Infrastructures. GISTAM 2020: 326-336 - [c50]Rui Zhang
Improving Semantic Similarity of Words by Retrofitting Word Vectors in Sense Level. ICAART (2) 2020: 108-119 - [c49]Jonas Herskind Sejr, Arthur Zimek
Explainable Detection of Zero Day Web Attacks. ICDIS 2020: 71-78 - [i27]Andrea Lekkas, Peter Schneider-Kamp, Isabelle Augenstein:
Multi-Sense Language Modelling. CoRR abs/2012.05776 (2020)
2010 – 2019
- 2019
- [j18]Luís Cruz-Filipe
Formally Verifying the Solution to the Boolean Pythagorean Triples Problem. J. Autom. Reason. 63(3): 695-722 (2019) - [j17]Michael Codish
Sorting networks: To the end and back again. J. Comput. Syst. Sci. 104: 184-201 (2019) - [c48]Golizheh Mehrooz, Emad Ebeid
System Design of an Open-Source Cloud-Based Framework for Internet of Drones Application. DSD 2019: 572-579 - [c47]Sangramsing Kayte
A Mixed Neural Network and Support Vector Machine Model for Tender Creation in the European Union TED Database. KMIS 2019: 139-145 - 2018
- [j16]Luís Cruz-Filipe
Active integrity constraints for general-purpose knowledge bases. Ann. Math. Artif. Intell. 83(3-4): 213-246 (2018) - 2017
- [j15]Michael Codish
Optimizing sorting algorithms by using sorting networks. Formal Aspects Comput. 29(3): 559-579 (2017) - [j14]Jürgen Giesl
Analyzing Program Termination and Complexity Automatically with AProVE. J. Autom. Reason. 58(1): 3-31 (2017) - [j13]Thomas Ströder, Jürgen Giesl
Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic. J. Autom. Reason. 58(1): 33-65 (2017) - [j12]Luís Cruz-Filipe
Formally Proving Size Optimality of Sorting Networks. J. Autom. Reason. 59(4): 425-454 (2017) - [j11]Daniel Bundala, Michael Codish
Optimal-depth sorting networks. J. Comput. Syst. Sci. 84: 185-204 (2017) - [c46]Luís Cruz-Filipe
Efficient Certified RAT Verification. CADE 2017: 220-236 - [c45]Luís Cruz-Filipe
How to Get More Out of Your Oracles. ITP 2017: 164-170 - [c44]Luís Cruz-Filipe, Peter Schneider-Kamp
Formally Proving the Boolean Pythagorean Triples Conjecture. LPAR 2017: 509-522 - [c43]Luís Cruz-Filipe
Efficient Certified Resolution Proof Checking. TACAS (1) 2017: 118-135 - 2016
- [j10]Michael Codish
Sorting nine inputs requires twenty-five comparisons. J. Comput. Syst. Sci. 82(3): 551-563 (2016) - [c42]Luís Cruz-Filipe
Active Integrity Constraints for Multi-context Systems. EKAW 2016: 98-112 - [c41]Luís Cruz-Filipe
Integrity Constraints for General-Purpose Knowledge Bases. FoIKS 2016: 235-254 - [i26]Luís Cruz-Filipe, Isabel Nunes, Peter Schneider-Kamp:
Integrity Constraints for General-Purpose Knowledge Bases. CoRR abs/1601.04980 (2016) - [i25]Luís Cruz-Filipe, Graça Gaspar, Isabel Nunes, Peter Schneider-Kamp:
Active Integrity Constraints for Multi-Context Systems. CoRR abs/1609.06019 (2016) - [i24]Luís Cruz-Filipe, João Marques-Silva, Peter Schneider-Kamp:
Efficient Certified Resolution Proof Checking. CoRR abs/1610.06984 (2016) - [i23]Luís Cruz-Filipe, Marijn Heule, Warren A. Hunt Jr., Matt Kaufmann, Peter Schneider-Kamp:
Efficient Certified RAT Verification. CoRR abs/1612.02353 (2016) - 2015
- [c40]Luís Cruz-Filipe
repAIrC: A Tool for Ensuring Data Consistency. KMIS 2015: 17-26 - [c39]Luís Cruz-Filipe
Active Integrity Constraints: From Theory to Implementation. IC3K 2015: 399-420 - [c38]Luís Cruz-Filipe
Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker. ITP 2015: 154-169 - [c37]Michael Codish
Sorting Networks: The End Game. LATA 2015: 664-675 - [c36]Michael Codish
Applying Sorting Networks to Synthesize Optimized Sorting Libraries. LOPSTR 2015: 127-142 - [c35]Luís Cruz-Filipe
Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof. CICM 2015: 55-70 - [i22]Luís Cruz-Filipe, Peter Schneider-Kamp:
Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker. CoRR abs/1502.05209 (2015) - [i21]Luís Cruz-Filipe, Peter Schneider-Kamp:
Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof. CoRR abs/1502.08008 (2015) - [i20]Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp:
Applying Sorting Networks to Synthesize Optimized Sorting Libraries. CoRR abs/1505.01962 (2015) - [i19]Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers, Mike Müller, Peter Schneider-Kamp:
Sorting Networks: to the End and Back Again. CoRR abs/1507.01428 (2015) - [i18]Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp:
When Six Gates are Not Enough. CoRR abs/1508.05737 (2015) - [i17]Luís Cruz-Filipe, Michael Franz, Artavazd Hakhverdyan, Marta Ludovico, Isabel Nunes, Peter Schneider-Kamp:
repAIrC: A Tool for Ensuring Data Consistency by Means of Active Integrity Constraints. CoRR abs/1510.03989 (2015) - 2014
- [c34]Jürgen Giesl
Proving Termination of Programs Automatically with AProVE. IJCAR 2014: 184-191 - [c33]Thomas Ströder, Jürgen Giesl
Proving Termination and Memory Safety for Programs with Pointer Arithmetic. IJCAR 2014: 208-223 - [c32]Felix Palludan Hargreaves, Daniel Merkle, Peter Schneider-Kamp
Group communication patterns for high performance computing in scala. FHPC@ICFP 2014: 75-85 - [c31]Michael Codish
Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten). ICTAI 2014: 186-193 - [c30]Michael Codish
The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes. SYNASC 2014: 359-366 - [i16]Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp:
The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes. CoRR abs/1404.0948 (2014) - [i15]Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp:
Twenty-Five Comparators is Optimal when Sorting Nine Inputs (and Twenty-Nine for Ten). CoRR abs/1405.5754 (2014) - [i14]Felix Palludan Hargreaves, Daniel Merkle, Peter Schneider-Kamp:
Group Communication Patterns for High Performance Computing in Scala. CoRR abs/1406.6163 (2014) - [i13]Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp:
Sorting Networks: the End Game. CoRR abs/1411.6408 (2014) - [i12]Daniel Bundala, Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp, Jakub Závodný:
Optimal-Depth Sorting Networks. CoRR abs/1412.5302 (2014) - 2012
- [j9]Michael Codish
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs. J. Autom. Reason. 49(1): 53-93 (2012) - [c29]Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp
Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs. LOPSTR 2012: 1 - [c28]Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs. PPDP 2012: 1-12 - 2011
- [j8]Carsten Fuhs, Jürgen Giesl
Proving Termination by Dependency Pairs and Inductive Theorem Proving. J. Autom. Reason. 47(2): 133-160 (2011) - [j7]Jürgen Giesl
Automated termination proofs for haskell by term rewriting. ACM Trans. Program. Lang. Syst. 33(2): 7:1-7:39 (2011) - [j6]Manh Thang Nguyen, Danny De Schreye
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs. Theory Pract. Log. Program. 11(1): 33-63 (2011) - [c27]Thomas Ströder, Fabian Emmes, Peter Schneider-Kamp
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog. LOPSTR 2011: 237-252 - [c26]Michael Codish
Optimal Base Encodings for Pseudo-Boolean Constraints. TACAS 2011: 189-204 - [e1]Peter Schneider-Kamp, Michael Hanus:
Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 20-22, 2011, Odense, Denmark. ACM 2011, ISBN 978-1-4503-0776-5 [contents] - 2010
- [j5]Peter Schneider-Kamp
Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving. Künstliche Intell. 24(1): 79-81 (2010) - [j4]Peter Schneider-Kamp
Automated termination analysis for logic programs with cut. Theory Pract. Log. Program. 10(4-6): 365-381 (2010) - [c25]Thomas Ströder, Peter Schneider-Kamp
Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. LOPSTR 2010: 184-199 - [c24]Carsten Fuhs, Peter Schneider-Kamp:
Optimizing the AES S-Box using SAT. IWIL@LPAR 2010: 64-70 - [c23]Michael Codish
Lazy Abstraction for Size-Change Termination. LPAR (Yogyakarta) 2010: 217-232 - [c22]Carsten Fuhs, Peter Schneider-Kamp
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT. SAT 2010: 71-84 - [c21]René Thiemann
Loops under Strategies ... Continued. IWS 2010: 51-65 - [i11]Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann:
Automated Termination Analysis for Logic Programs with Cut. CoRR abs/1007.4908 (2010) - [i10]Michael Codish, Yoav Fekete, Carsten Fuhs, Peter Schneider-Kamp:
Optimal Base Encodings for Pseudo-Boolean Constraints. CoRR abs/1007.4935 (2010)
2000 – 2009
- 2009
- [j3]Peter Schneider-Kamp
Automated termination proofs for logic programs by term rewriting. ACM Trans. Comput. Log. 11(1): 2:1-2:52 (2009) - [c20]Stephan Swiderski, Michael Parting, Jürgen Giesl
Termination Analysis by Dependency Pairs and Inductive Theorem Proving. CADE 2009: 322-338 - [c19]Peter Schneider-Kamp
The Dependency Triple Framework for Termination of Logic Programs. LOPSTR 2009: 37-51 - [c18]Carsten Fuhs, Jürgen Giesl
Proving Termination of Integer Term Rewriting. RTA 2009: 32-47 - [i9]Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, Stephan Falke:
Termination of Integer Term Rewriting. Interaction versus Automation: The two Faces of Deduction 2009 - [i8]Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, Peter Schneider-Kamp:
Inductive Theorem Proving meets Dependency Pairs. Interaction versus Automation: The two Faces of Deduction 2009 - [i7]Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp:
Polytool: polynomial interpretations as a basis for termination analysis of Logic programs. CoRR abs/0912.4360 (2009) - 2008
- [b1]Peter Schneider-Kamp:
Static termination analysis for prolog using term rewriting and SAT solving. RWTH Aachen University, Germany, 2008, pp. 1-174 - [j2]René Thiemann
Adding constants to string rewriting. Appl. Algebra Eng. Commun. Comput. 19(1): 27-38 (2008) - [c17]Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto, Jürgen Giesl
Search Techniques for Rational Polynomial Orders. AISC/MKM/Calculemus 2008: 109-124 - [c16]Beatriz Alarcón, Fabian Emmes, Carsten Fuhs, Jürgen Giesl
Improving Context-Sensitive Dependency Pairs. LPAR 2008: 636-651 - [c15]Carsten Fuhs, Jürgen Giesl, Aart Middeldorp
Maximal Termination. RTA 2008: 110-125 - [c14]René Thiemann
Deciding Innermost Loops. RTA 2008: 366-380 - [i6]Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann:
Automated Termination Proofs for Logic Programs by Term Rewriting. CoRR abs/0803.0014 (2008) - 2007
- [c13]Jürgen Giesl
Proving Termination by Bounded Increase. CADE 2007: 443-459 - [c12]Peter Schneider-Kamp, René Thiemann
Proving Termination Using Recursive Path Orders and SAT Solving. FroCoS 2007: 267-282 - [c11]Manh Thang Nguyen, Jürgen Giesl, Peter Schneider-Kamp
Termination Analysis of Logic Programs Based on Dependency Graphs. LOPSTR 2007: 8-22 - [c10]Carsten Fuhs, Jürgen Giesl
SAT Solving for Termination Analysis with Polynomial Interpretations. SAT 2007: 340-354 - [i5]Jürgen Giesl, Peter Schneider-Kamp, René Thiemann, Stephan Swiderski, Manh Thang Nguyen, Danny De Schreye, Alexander Serebrenik:
Termination of Programs using Term Rewriting and SAT Solving. Deduction and Decision Procedures 2007 - [i4]Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl:
Implementing RPO and POLO using SAT. Deduction and Decision Procedures 2007 - [i3]René Thiemann, Jürgen Giesl, Peter Schneider-Kamp:
Decision Procedures for Loop Detection. Deduction and Decision Procedures 2007 - 2006
- [j1]Jürgen Giesl
Mechanizing and Improving Dependency Pairs. J. Autom. Reason. 37(3): 155-203 (2006) - [c9]Jürgen Giesl
Automatic Termination Proofs in the Dependency Pair Framework. IJCAR 2006: 281-286 - [c8]Peter Schneider-Kamp, Jürgen Giesl
Automated Termination Analysis for Logic Programs by Term Rewriting. LOPSTR 2006: 177-193 - [c7]Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann
SAT Solving for Argument Filterings. LPAR 2006: 30-44 - [c6]Jürgen Giesl
Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. RTA 2006: 297-312 - [i2]Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl:
SAT Solving for Argument Filterings. CoRR abs/cs/0605074 (2006) - 2005
- [c5]Jürgen Giesl, René Thiemann
Proving and Disproving Termination of Higher-Order Functions. FroCoS 2005: 216-231 - [i1]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp:
Proving and Disproving Termination in the Dependency Pair Framework. Deduction and Applications 2005 - 2004
- [c4]René Thiemann
Improved Modular Termination Proofs Using Dependency Pairs. IJCAR 2004: 75-90 - [c3]Jürgen Giesl
The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. LPAR 2004: 301-331 - [c2]Jürgen Giesl, René Thiemann
Automated Termination Proofs with AProVE. RTA 2004: 210-220 - 2003
- [c1]Jürgen Giesl
Improving Dependency Pairs. LPAR 2003: 167-182
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-20 21:00 CET 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: