„certifying algorithms“

Suchergebnisse

18 Treffer

• Verifying Datalog Reasoning with Lean
  Tantow, Johannes ; Gerlach, Lukas ; Mennicke, Stephan ; Krötzsch, Markus 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Practically Feasible Proof Logging for Pseudo-Boolean Optimization
  Koops, Wietze ; Le Berre, Daniel ; Myreen, Magnus O. ; Nordström, Jakob ; Oertel, Andy ; Tan, Yong Kiam ; Vinyals, Marc 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability
  Berg, Jeremias ; Bogaerts, Bart ; Nordström, Jakob ; Oertel, Andy ; Paxian, Tobias ; Vandesande, Dieter 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Contraction-Recursive Algorithm for Treewidth
  Tamaki, Hisao 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Efficient Algorithms for Certifying Lower Bounds on the Discrepancy of Random Matrices
  Venkat, Prayaag 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Certified CNF Translations for Pseudo-Boolean Solving
  Gocht, Stephan ; Martins, Ruben ; Nordström, Jakob ; Oertel, Andy 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Heuristic Computation of Exact Treewidth
  Tamaki, Hisao 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Trustworthy Graph Algorithms (Invited Talk)
  Abdulaziz, Mohammad ; Mehlhorn, Kurt ; Nipkow, Tobias 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On Nondeterministic Derandomization of Freivalds' Algorithm: Consequences, Avenues and Algorithmic Progress
  Künnemann, Marvin 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271)
  Chudnovsky, Maria ; Paulusma, Daniel ; Schaudt, Oliver
• Algorithm Engineering (Dagstuhl Seminar 13391)
  Goldberg, Andrew V. ; Italiano, Giuseppe F. ; Johnson, David S. ; Wagner, Dorothea
• An Introduction to Certifying Algorithms
  Alkassar, Eyad ; Böhme, Sascha ; Mehlhorn, Kurt ; Rizkallah, Christine ; Schweitzer, Pascal
• Exact, approximative, robust and certifying algorithms on particular graph classes – 07211 abstracts collection ; Dagstuhl seminar
  Brandstädt, Andreas ; Jansen, Klaus ; Kratsch, Dieter ; Spinrad, Jeremy P. 2007 [Internat. Begegnungs- und Forschungszentrum für Informatik]
• Certifying 3-Edge-Connectivity
  Mehlhorn, Kurt ; Neumann, Adrian ; Schmidt, Jens M.
• Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs
  Beisegel, Jesse ; Köhler, Ekkehard ; Scheffler, Robert ; Strehler, Martin
• An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
  Elmasry, Amr ; Mehlhorn, Kurt ; Schmidt, Jens M.
• Certifying Equality With Limited Interaction
  Brody, Joshua ; Chakrabarti, Amit ; Kondapally, Ranganath ; Woodruff, David P. ; Yaroslavtsev, Grigory
• A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints
  Subramani, K. ; Wojciechowski, Piotr