Author of the publication

New Results on Test-Cost Minimization in Database Migration.

, , , and . ALGOCLOUD, volume 13084 of Lecture Notes in Computer Science, page 38-55. Springer, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Reachability in choice networks., , and . Discret. Optim., 48 (Part 1): 100761 (May 2023)Erratum to: Analyzing restricted fragments of the theory of linear arithmetic., , and . Ann. Math. Artif. Intell., 79 (4): 371-392 (2017)New Results in Priority-Based Bin Packing., , and . ALGOCLOUD, volume 13799 of Lecture Notes in Computer Science, page 58-72. Springer, (2022)A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems., , , , and . CALDAM, volume 10743 of Lecture Notes in Computer Science, page 45-58. Springer, (2018)Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints., , and . FAW, volume 10823 of Lecture Notes in Computer Science, page 300-314. Springer, (2018)Finding read-once refutations in 2CNF formulas and variants - a parameterized perspective., and . ISAIM, (2020)New Results on Cutting Plane Proofs for Horn Constraint Systems., , and . FSTTCS, volume 150 of LIPIcs, page 43:1-43:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Strict Archimedean t-norms and t-conorms as universal approximators., , and . Int. J. Approx. Reason., 18 (3-4): 239-249 (1998)Analyzing restricted fragments of the theory of linear arithmetic., , and . Ann. Math. Artif. Intell., 79 (1-3): 245-266 (2017)Tree-Like Unit Refutations in Horn Constraint Systems., and . LATA, volume 12638 of Lecture Notes in Computer Science, page 226-237. Springer, (2021)