15974 search results - page 2918 / 3195 » Object-Oriented Software Engineering |
130
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We study the problem of polynomial identity testing (PIT) for depth 2 arithmetic circuits over matrix algebra. We show that identity testing of depth 3 (ΣΠΣ) arithmetic circuit...
116
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We present a symbolic framework for refinement and composition of security protocols. ework uses the notion of ideal functionalities. These are abstract systems which are secure b...
126
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
135
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
130
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...