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

Scout: High-Performance Heterogeneous Computing Made Simple.

J. Jablin, P. McCormick, and M. Herlihy. IPDPS Workshops, page 2093-2096. IEEE, (2011)

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.

Maurice Koch University of Stuttgart

Dataset for "How Deep Is Your Gaze? Leveraging Distance in Image-Based Gaze Analysis"M. Koch, N. Pathmanathan, D. Weiskopf, and K. Kurzhals. Dataset, (2024)Related to: Maurice Koch, Nelusa Pathmanathan, Daniel Weiskopf, and Kuno Kurzhals.2024. How Deep Is Your Gaze? Leveraging Distance in Image-Based GazeAnalysis. In 2024 Symposium on Eye Tracking Research and Applications(ETRA ’24), June 04–07, 2024, Glasgow, United Kingdom. ACM, New York,NY, USA, 7 pages. doi: 10.1145/3649902.3653349.

Maurice Wanitzek University of Stuttgart

Sandrine Maurice University of Stuttgart

Dr. rer. nat. Maurice Conrad University of Stuttgart

Maurice Paul Artelt University of Stuttgart

Other publications of authors with the same name

Applications of Combinatorial Topology to Computer Science (Dagstuhl Seminar 12121).L. Fajstrup, D. Feichtner-Kozlov, and M. Herlihy. Dagstuhl Reports, 2 (3): 50-66 (2012)Specifying Graceful Degradation.M. Herlihy, and J. Wing. IEEE Trans. Parallel Distrib. Syst., 2 (1): 93-104 (1991)Transactional Memory: A Primer for Theorists.M. Herlihy. Bulletin of the EATCS, (2009)Linearizable Counting Networks.M. Herlihy, N. Shavit, and O. Waarts. Distributed Computing, 9 (4): 193-203 (1996)Virtualizing Transactional Memory.R. Rajwar, M. Herlihy, and K. Lai. ISCA, page 494-505. IEEE Computer Society, (2005)A Tight Lower Bound for k-Set AgreementS. Chaudhuri, M. Herlihy, N. Lynch, and M. Tuttle. FOCS, page 206-215. IEEE Computer Society, (1993)A Survey on Counting Networks.C. Busch, and M. Herlihy. WDAS, volume 2 of Proceedings in Informatics, page 13-20. Carleton Scientific, (1998)Randomized Smoothing Networks.M. Herlihy, and S. Tirthapura. IPDPS, IEEE Computer Society, (2004)tm_db: A Generic Debugging Library for Transactional Programs.M. Herlihy, and Y. Lev. PACT, page 136-145. IEEE Computer Society, (2009)Asynchronous Consensus Impossibility.M. Herlihy. Encyclopedia of Algorithms, (2016)