Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

AnatomyBrowser: A Framework for Integration of Medical Information.

P. Golland, R. Kikinis, C. Umans, M. Halle, M. Shenton, and J. Richolt. MICCAI, volume 1496 of Lecture Notes in Computer Science, page 720-731. Springer, (1998)

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.

Christopher Mehlich University of Stuttgart

Christopher Braun University of Stuttgart

Christopher Langner University of Stuttgart

Christopher Groll University of Stuttgart

Christopher Hartmann University of Stuttgart

Other publications of authors with the same name

On sunflowers and matrix multiplication.N. Alon, A. Shpilka, and C. Umans. Computational Complexity, 22 (2): 219-243 (2013)The Minimum Equivalent DNF Problem and Shortest Implicants.C. Umans. FOCS, page 556-563. IEEE Computer Society, (1998)Fast Modular Composition in any Characteristic.K. Kedlaya, and C. Umans. FOCS, page 146-155. IEEE Computer Society, (2008)The complexity of Boolean formula minimization.D. Buchfuhrer, and C. Umans. J. Comput. Syst. Sci., 77 (1): 142-153 (2011)Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes.V. Guruswami, C. Umans, and S. Vadhan. J. ACM, 56 (4): 20:1-20:34 (2009)Pseudorandomness for Approximate Counting and SamplingR. Shaltiel, and C. Umans. Electronic Colloquium on Computational Complexity (ECCC), (2004)On beating the hybrid argument.B. Fefferman, R. Shaltiel, C. Umans, and E. Viola. Electronic Colloquium on Computational Complexity (ECCC), (2010)A Group-Theoretic Approach to Fast Matrix Multiplication.H. Cohn, and C. Umans. FOCS, page 438-449. IEEE Computer Society, (2003)Simple extractors for all min-entropies and a new pseudorandom generator.R. Shaltiel, and C. Umans. J. ACM, 52 (2): 172-216 (2005)Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms.D. Buchfuhrer, and C. Umans. Electronic Colloquium on Computational Complexity (ECCC), (2009)