Titlebook: ;

Filibuster

More general parallel tree contraction: Register allocation and broadcasting in a tree, their original framework. We discuss applications to the following problems: (1) Register allocation, i.e., computing the number of registers needed to evaluate a given expression if all intermediate results must be kept in registers; and (2) Broadcasting in a tree, i.e., computing the number of st

enmesh

AGONY

clarify

放肆的我

palpitate

Switchbox routing in VLSI design: Closing the complexity gap, problems which are important from both the theoretical and the practical point of view. Up to now, switchbox routing has been known to be solvable in polynomial time when there are only 2-terminal nets, and to be NP-complete in case there exist nets involving at least five terminals. Our main resul

不发音

Detecting diamond necklaces in labeled dags,ially ordered set of process states. The debugging of control flows (sequences of process states) of these executions is based on the satisfaction of predicates by process states. A process state that satisfies a predicate inherits its label. It follows that, in this context, a distributed execution

凝视

作茧自缚

向外

Hypergraphs and decision trees,ree for the membership question of .. must have height at least .. In this talk we discuss a recent result by Grigoriev, Karpinski and Yao [GKY], which gives an exponential lower bound to ..(..) for any fixed ., and hence to the size of any fixed degree (ternary) algebraic decision tree for solving