PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Urban, Christian"

Author of the publication

copydeleteadd this publication to your clipboard
Multifrequency EPR Study and Density Functional g-Tensor Calculations of Persistent Organorhenium Radical Complexes

, , , , , , , , , , , , and . Journal of the American Chemical Society, 124 (35): 10563--10571 (2002)
DOI: 10.1021/ja025829n

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.

Hon. -Prof. Dr. Georg Urban University of Stuttgart

Urban Knuples University of Stuttgart

Dr. rer. nat. Susanne Urban University of Stuttgart

Prof. Dr. Dieter Urban University of Stuttgart

Dr. Matea Urbanek University of Stuttgart

 

Other publications of authors with the same name

Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof., and . RTA, volume 5117 of Lecture Notes in Computer Science, page 409-424. Springer, (2008)A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions (Proof Pearl)., , and . ITP, volume 6898 of Lecture Notes in Computer Science, page 341-356. Springer, (2011)A New Foundation for Nominal Isabelle., and . ITP, volume 6172 of Lecture Notes in Computer Science, page 35-50. Springer, (2010)A Formal Model and Correctness Proof for an Access Control Policy Framework., , and . CPP, volume 8307 of Lecture Notes in Computer Science, page 292-307. Springer, (2013)Quotients revisited for Isabelle/HOL., and . SAC, page 1639-1644. ACM, (2011)Modelling Homogeneous Generative Meta-Programming., , and . ECOOP, volume 74 of LIPIcs, page 5:1-5:23. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Mechanizing the metatheory of LF., , and . ACM Trans. Comput. Log., 12 (2): 15:1-15:42 (2011)Nominal logic programming., and . ACM Trans. Program. Lang. Syst., 30 (5): 26:1-26:47 (2008)Strong Normalisation of Cut-Elimination in Classical Logic., and . Fundam. Inform., 45 (1-2): 123-155 (2001)Formal SOS-Proofs for the Lambda-Calculus., and . Electr. Notes Theor. Comput. Sci., (2009)