9611 search results - page 256 / 1923 » A Note on Difference Sets |
200
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
218
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
179
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
202
click to vote
AC
2000
Springer
15 years 11 months ago
2000
Springer
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
170
click to vote
CONTEXT
1999
Springer
15 years 11 months ago
1999
Springer
We survey some issues that relate to context dependence and context sensitivity in the development of software, particularly in relation to information systems by defining a range...