PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Furst, Merrick L."

Author of the publication

copydeleteadd this publication to your clipboard
Parity, Circuits, and the Polynomial-Time Hierarchy

, , and . FOCS, page 260-270. IEEE Computer Society, (1981)

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.

L. Ahlgrimm

Holger Fürst University of Stuttgart

Lambert Theisen University of Stuttgart

Annika Liebgott

Automated reference-free assessment of MR image quality using an active learning approach: Comparison of Support Vector Machine versus Deep Neural Network classification, , , , , , , and . Proceedings of the International Society for Magnetic Resonance in Medicine (ISMRM), Honolulu, Hawaii, USA, (April 2017)
Automated reference-free assessment of MR image quality using an active learning approach: Comparison of Support Vector Machine versus Deep Neural Network classification, , , , , , , and . Proceedings of the International Society for Magnetic Resonance in Medicine (ISMRM), Honolulu, Hawaii, USA, (April 2017)An easy-to-use image labeling platform for automatic Magnetic Resonance Image Quality Assessment, , , , , , and . Proceedings of the IEEE International Symposium on Biomedical Imaging (ISBI), Melbourne, Australia, (April 2017)Automated image quality assessment in whole-body MRI, , , , , , , , and . Proceedings of the Radiological Society of North America (RSNA), Chicago, USA, (November 2016)

Univ. -Prof. Dr. Remco Ingmar Leine University of Stuttgart

 

Other publications of authors with the same name

Polynomial-Time Algorithms for Permutation Groups, , and . FOCS, page 36-41. IEEE Computer Society, (1980)Weakly learning DNF and characterizing statistical query learning using Fourier analysis., , , , , and . STOC, page 253-262. ACM, (1994)Pseudorandom Number Generation and Space Complexity., , and . FCT, volume 158 of Lecture Notes in Computer Science, page 171-176. Springer, (1983)PSPACE survives three-bit bottlenecks., and . Computational Complexity Conference, IEEE Computer Society, (1987)Computing Short Generator Sequences, and . Inf. Comput., 72 (2): 117-132 (February 1987)Fast Planning Through Planning Graph Analysis., and . Artif. Intell., 90 (1-2): 281-300 (1997)ThreadsTM: how to restructure a computer science curriculum for a flat world., , and . SIGCSE, page 420-424. ACM, (2007)Using influence and persuasion to shape player experiences., , , and . Sandbox@SIGGRAPH, page 23-30. ACM, (2009)Succinct Certificates for Almost All Subset Sum Problems., and . SIAM J. Comput., 18 (3): 550-558 (1989)Cryptographic Primitives Based on Hard Learning Problems., , , and . CRYPTO, volume 773 of Lecture Notes in Computer Science, page 278-291. Springer, (1993)