Author of the publication

Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture.

, , , , , and . FPT, page 421-424. IEEE, (2004)

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.

Dr. -Ing. Daniel Holder University of Stuttgart

Anpassbare Mensch-Maschine-Schnittstellen zwischen Adaptivität und Individualisierung, , , , and . Stuttgarter Symposium für Produktentwicklung SSP 2023 : Tagungsband zur Konferenz, Stuttgart, 25. Mai 2023, page 524-535. Stuttgart, Fraunhofer IAO, (2023)

Daniel Kempf University of Stuttgart

GALÆXI Scaling, , , , , , , , and . Dataset, (2024)Related to: Kempf, Daniel et al. “GALÆXI: Solving complex compressible flows with high-order discontinuous Galerkin methods on accelerator-based systems.” (2024). arXiv: 2404.12703.
GALÆXI Scaling, , , , , , , , and . Dataset, (2024)Related to: Kempf, Daniel et al. “GALÆXI: Solving complex compressible flows with high-order discontinuous Galerkin methods on accelerator-based systems.” (2024). arXiv: 2404.12703.GALÆXI Verification: Convergence Tests, , , , , , , , and . Dataset, (2024)Related to: Kempf, Daniel et al. “GALÆXI: Solving complex compressible flows with high-order discontinuous Galerkin methods on accelerator-based systems.” (2024). arXiv: 2404.12703.GALÆXI Validation: Taylor-Green Vortex, , , , , , , , and . Dataset, (2024)Related to: Kempf, Daniel et al. “GALÆXI: Solving complex compressible flows with high-order discontinuous Galerkin methods on accelerator-based systems.” (2024). arXiv: 2404.12703.
 

Other publications of authors with the same name

Characterizing graphs of small carving-width., , , , and . Discrete Applied Mathematics, 161 (13-14): 1888-1893 (2013)Relative length of longest paths and longest cycles in triangle-free graphs., and . Discrete Mathematics, 308 (7): 1222-1229 (2008)Parameterizing cut sets in a graph by the number of their components., , , and . Theor. Comput. Sci., 412 (45): 6340-6350 (2011)Run-time assignment of tasks to multiple heterogeneous processors, , , , , and . 5th PROGRESS Symposium on Embedded Systems, page 185--192. STW Technology Foundation, (2004)Model Counting for CNF Formulas of Bounded Modular Treewidth., , and . Algorithmica, 76 (1): 168-194 (2016)Comparing Universal Covers in Polynomial Time., and . Theory Comput. Syst., 46 (4): 620-635 (2010)A complete complexity classification of the role assignment problem., and . Theor. Comput. Sci., 349 (1): 67-81 (2005)Cycles through specified vertices in triangle-free graphs., and . Discussiones Mathematicae Graph Theory, 27 (1): 179-191 (2007)Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number., , , and . Discussiones Mathematicae Graph Theory, 29 (1): 143-162 (2009)Obtaining Online Ecological Colourings by Generalizing First-Fit., , , and . Theory Comput. Syst., 54 (2): 244-260 (2014)