CSFW
2002
IEEE
14 years 5 months ago
2002
IEEE
Important properties of many protocols are liveness or availability, i.e., that something good happens now and then. In asynchronous scenarios these properties obviously depend on...
ISAAC
2003
Springer
14 years 6 months ago
2003
Springer
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
ISSAC
2004
Springer
14 years 6 months ago
2004
Springer
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
ISSAC
2004
Springer
14 years 6 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
CASES
2004
ACM
14 years 6 months ago
2004
ACM
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
EMO
2005
Springer
14 years 6 months ago
2005
Springer
We present a new analysis of the LebMeasure algorithm for calculating hypervolume. We prove that although it is polynomial in the number of points, LebMeasure is exponential in the...
CSFW
2006
IEEE
14 years 6 months ago
2006
IEEE
Recently, there has been much interest in extending models for simulation-based security in such a way that the runtime of protocols may depend on the length of their input. Findi...
STACS
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. We introduce a new class VPSPACE of families of polynomials. Roughly speaking, a family of polynomials is in VPSPACE if its coefficients can be computed in polynomial spa...
COCOON
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.
ICC
2007
IEEE
14 years 7 months ago
2007
IEEE
We propose a Polynomial-based scheme that addresses the problem of Event Region Detection (PERD) for wireless sensor networks (WSNs). Nodes of an aggregation tree perform function ...