( en | de | ru )

 

Disambiguation of "Robere, Robert"

Author of the publication

copydeleteadd this publication to your clipboard
Stabbing Planes.

, , , , , , and . Electron. Colloquium Comput. Complex., (2017)

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.

Robert Klöfkorn

Numerics for evolution equations: a general interface based design concept. Uni Freiburg, (2009)

Robert Wille

Towards a design flow for reversible logic. Uni Bremen, (2009)

Robert Braun

Referenzmodellierung: Grundlegung und Evaluation der Technik des Modell-Konfigurationsmanagements. TU Dresden, (2010)

Robert Wagner

Inkrementelle Modellsynchronisation. Uni Paderborn, (2009)

Robert Zangenfeind

Das Bedeutung-Text-Modell: Wörterbuch und Grammatik einer integralen Sprachbeschreibung. Uni München, (2009)
 

Other publications of authors with the same name

When Thinking Never Comes to a Halt: Using Formal Methods in Making Sure Your AI Gets the Job Done Good Enough., and . PT-AI, volume 376 of Synthese Library, page 43-62. Springer, (2013)Black-Box PPP is not Turing-Closed., , , and . Electron. Colloquium Comput. Complex., (2024)On Low-End Obfuscation and Learning., , , , and . ITCS, volume 251 of LIPIcs, page 23:1-23:28. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Intersection Classes in TFNP and Proof Complexity., , and . ITCS, volume 287 of LIPIcs, page 74:1-74:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity., , , , , and . FOCS, page 24-30. IEEE, (2020)Lower Bounds for (Non-Monotone) Comparator Circuits., and . ITCS, volume 151 of LIPIcs, page 58:1-58:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Automating Algebraic Proof Systems is NP-Hard., , , , , and . Electron. Colloquium Comput. Complex., (2020)The Proof Complexity of SMT Solvers., , and . CAV (2), volume 10982 of Lecture Notes in Computer Science, page 275-293. Springer, (2018)Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling., , , and . CCC, volume 137 of LIPIcs, page 18:1-18:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Separations in Proof Complexity and TFNP., , , , , , and . FOCS, page 1150-1161. IEEE, (2022)