( en | de | ru )

 

Disambiguation of "Nipkow, Tobias"

Author of the publication

copydeleteadd this publication to your clipboard
Trustworthy Graph Algorithms (Invited Talk).

, , and . MFCS, volume 138 of LIPIcs, page 1:1-1:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

Tobias Nipkow

Tobias Nipkow

Andre Nipkow

Hans Nipkow

Carl Nipkow

 

Other publications of authors with the same name

Behavioural Implementations of Non-Deterministic Data Types.. ADT, (1986)Proof Pearl: Purely Functional, Simple and Efficient Priority Search Trees and Applications to Prim and Dijkstra., and . ITP, volume 141 of LIPIcs, page 23:1-23:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Term Rewriting and All That, and . Cambridge University Press, (1998)Winskel is (almost) Right: Towards a Mechanized Semantics Textbook. Formal Aspects of Computing, 10 (2): 171--186 (November 1998)Verified Approximation Algorithms., , , and . Log. Methods Comput. Sci., (2022)A Formalization and Proof Checker for Isabelle's Metalogic., and . J. Autom. Reason., 67 (1): 1 (2023)Real-Time Double-Ended Queue Verified (Proof Pearl)., and . ITP, volume 268 of LIPIcs, page 29:1-29:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Trustworthy Graph Algorithms (Invited Talk)., , and . MFCS, volume 138 of LIPIcs, page 1:1-1:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Verification of Closest Pair of Points Algorithms., and . IJCAR (2), volume 12167 of Lecture Notes in Computer Science, page 341-357. Springer, (2020)Verified Textbook Algorithms - A Biased Survey., , and . ATVA, volume 12302 of Lecture Notes in Computer Science, page 25-53. Springer, (2020)