5 citations · 9 across the 5 of their papers we have counts for
7 papers
Efficient Calling Conventions for Irregular Architectures
Philipp K. Krause
We empirically evaluated thousands of different C calling conventions for irregular microcontroller architectures, and found potential for improvement over the calling conventions…
lospre in linear time
Philipp Klaus Krause
Lifetime-optimal speculative partial redundancy elimination (lospre) is the most advanced currently known redundancy elimination technique. It subsumes many previously known approa…
C for a tiny system
Philipp Klaus Krause, Nicolas Lesser
We have implemented support for Padauk microcontrollers, tiny 8-Bit devices with 60 B to 256 B of RAM, in the Small Device C Compiler (SDCC), showing that the use of (mostly) stand…
Constant-time connectivity tests
Philipp Klaus Krause
We present implementations of constant-time algorithms for connectivity tests and related problems. Some are implementations of slightly improved variants of previously known algor…
A lower bound on the tree-width of graphs with irrelevant vertices
Isolde Adler, Philipp Klaus Krause
For their famous algorithm for the disjoint paths problem, Robertson and Seymour proved that there is a function such that if the tree-width of a graph with pairs of te…
Irrelevant Vertices for the Planar Disjoint Paths Problem
Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause +3
The Disjoint Paths Problem asks, given a graph and a set of pairs of terminals , whether there is a collection of pairwise vertex-disjoi…
A lower bound for the tree-width of planar graphs with vital linkages
Isolde Adler, Philipp Klaus Krause
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s_0,t_0), ...,(s_k,t_k), whether there are k+1 pairwise disjoint paths P_0, ...,P_k, such that P_i c…