( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Sharing, Memoization, and Polynomial Time.

, и . STACS, том 30 из LIPIcs, стр. 62-75. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)

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.

Martin Brückner

Vergleichende Untersuchungen zur Inzidenz apoptotischer und proliferativer Veränderungen kultivierter, humaner Knochenzellen von Ober- und Unterkiefer auf maschinenbearbeitetem, reinem Titan über 25 Tage. Uni Leipzig, (2009)

Martin Breitenfeldt

Mass measurements on short-lived Cd and Ag nuclides at the online mass spectrometer ISOLTRAP. Uni Greifswald, (2009)

Martin Faes

Analyse der mehrskaligen Transportmechanismen beim laminaren Mischen mittels laseroptischer und numerischer Methoden. Uni Hannover, (2009)

Martin Klug

The late Quaternary environmental and climatic history of North-East Greenland, inferred from coastal lakes. Uni Köln, (2009)

Martin Hille

Providentia Dei, Reich und Kirche: Weltbild und Stimmungsprofil altgläubiger Chronisten 1517 - 1618. Uni Passau, habilitation, (2007)
 

Другие публикации лиц с тем же именем

A Haskell Library for Term Rewriting., , и . CoRR, (2013)Complexity of Acyclic Term Graph Rewriting., и . FSCD, том 52 из LIPIcs, стр. 10:1-10:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Quantum Expectation Transformers for Cost Analysis., , , , и . LICS, стр. 10:1-10:13. ACM, (2022)Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs., , , , и . Proc. ACM Program. Lang., 8 (OOPSLA1): 784-809 (2024)Automating sized-type inference for complexity analysis., и . Proc. ACM Program. Lang., 1 (ICFP): 43:1-43:29 (2017)POP* and Semantic Labeling Using SAT.. ESSLLI Student Sessions, том 6211 из Lecture Notes in Computer Science, стр. 155-166. Springer, (2009)On Kernel's Safety in the Spectre Era (Extended Version)., , и . CoRR, (2024)Complexity Analysis by Graph Rewriting., и . FLOPS, том 6009 из Lecture Notes in Computer Science, стр. 257-271. Springer, (2010)Tyrolean Complexity Tool: Features and Usage., и . RTA, том 21 из LIPIcs, стр. 71-80. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Closing the Gap Between Runtime Complexity and Polytime Computability., и . RTA, том 6 из LIPIcs, стр. 33-48. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)