Philipp Klaus Krause

Orcid: 0000-0002-6668-7891

Affiliations:
  • Albert Ludwigs University of Freiburg, Germany


According to our database1, Philipp Klaus Krause authored at least 17 papers between 2010 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Efficient Calling Conventions for Irregular Architectures.
CoRR, 2021

lospre in linear time.
Proceedings of the SCOPES '21: 24th International Workshop on Software and Compilers for Embedded Systems, Eindhoven, The Netherlands, November 1, 2021

2020
The tree-width of C.
Discret. Appl. Math., 2020

C for a tiny system.
CoRR, 2020

Constant-time connectivity tests.
CoRR, 2020

2019
A lower bound on the tree-width of graphs with irrelevant vertices.
J. Comb. Theory, Ser. B, 2019

2018
stdcbench: A Benchmark for Small Systems.
Proceedings of the 21st International Workshop on Software and Compilers for Embedded Systems, 2018

2017
Irrelevant vertices for the planar Disjoint Paths Problem.
J. Comb. Theory, Ser. B, 2017

2016
Graph decomposition in routing and compilers.
PhD thesis, 2016

2015
Bytewise Register Allocation.
Proceedings of the 18th International Workshop on Software and Compilers for Embedded Systems, 2015

2014
The complexity of register allocation.
Discret. Appl. Math., 2014

2013
Optimal placement of bank selection instructions in polynomial time.
Proceedings of the International Workshop on Software and Compilers for Embedded Systems, 2013

Optimal Register Allocation in Polynomial Time.
Proceedings of the Compiler Construction - 22nd International Conference, 2013

2011
Tight Bounds for Linkages in Planar Graphs.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Adaptive voltage over-scaling for resilient applications.
Proceedings of the Design, Automation and Test in Europe, 2011

2010
A lower bound for the tree-width of planar graphs with vital linkages
CoRR, 2010

ftc - Floating precision texture compression.
Comput. Graph., 2010


  Loading...