Author of the publication

An On-line Algorithm for Fair-Share Node Allocations in a Cluster.

, , , and . CCGRID, page 83-91. IEEE Computer Society, (2007)

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.

Univ. -Prof. Dr. Michael Pradel University of Stuttgart

LExecutor: Learning-Guided Execution, and . Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, page 1522-1534. Association for Computing Machinery, (2023)

Univ. -Prof. Dr. rer. nat. Michael Sedlmair University of Stuttgart

Metaphorical Visualization : Mapping Data to Familiar Concepts, , , , and . CHI EA '22 : Extended Abstracts of the 2022 CHI Conference on Human Factors in Computing Systems, page 10. New York, Association for Computing Machinery, (2022)
 

Other publications of authors with the same name

Efficient Algorithms for Anonymous Byzantine Agreement., and . Theory Comput. Syst., 42 (2): 222-238 (2008)Atomic Writes for data integrity and consistency in shared storage devices for clusters., and . Future Generation Comp. Syst., 20 (4): 539-547 (2004)Byzantine Agreement.. Encyclopedia of Algorithms, (2016)Artefactual origin of biphasic cortical spike-LFP correlation.. Journal of Computational Neuroscience, 42 (1): 31-35 (2017)On the Power of Impersonation Attacks.. DISC, volume 4731 of Lecture Notes in Computer Science, page 494-495. Springer, (2007)Byzantine Agreement.. Encyclopedia of Algorithms, Springer, (2008)On Node State Reconstruction for Fault Tolerant Distributed Algorithms., and . SRDS, page 160-. IEEE Computer Society, (2002)Balance of excitation and inhibition., and . Scholarpedia, 4 (8): 7467 (2009)Randomized gossip algorithms for maintaining a distributed bulletin board with guaranteed age properties., , , and . Concurrency and Computation: Practice and Experience, 21 (15): 1907-1927 (2009)On the round complexity of Byzantine agreement without initial set-up.. Inf. Comput., 207 (12): 1351-1368 (2009)