2010 IEEE 51st Annual Symposium on Foundations ofâ€¦

2010

Bodlaender's Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree composition. Courcelle's Theoremâ€¦ (More)

An algorithmic meta theorem for a logic and a class C of structures states that all problems expressible in this logic can be solved efficiently for inputs from C. The prime example is Courcelleâ€™sâ€¦ (More)

The subclass of directed series-parallel graphsplays an important role in computer science. To determine whether a graph is ser es-parallel is a well studied problem in algorithmic graph theory. Fastâ€¦ (More)

We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by private protocolsâ€¦ (More)

We present two new complexity classes which are based on a complexity class C and an error probability function F. The rst, F-Err C, reeects the (weak) feasibility of problems that can be computedâ€¦ (More)

The subclass of directed series-parallel graphs plays an important role in computer science. Whether a given graph is series-parallel is a well studied problem in algorithmic graph theory, for whichâ€¦ (More)

In contrast to machine models like Turing machines or random access machines, circuits are a rigid computational model. The internal information flow of a computation is fixed in advance, independentâ€¦ (More)