Sciweavers

7840 search results - page 16 / 1568
» On generalized Ramsey numbers
Sort
View
BIRTHDAY
1997
Springer
14 years 2 days ago
Expressive Power of Unary Counters
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
Michael Benedikt, H. Jerome Keisler
GC
2007
Springer
13 years 7 months ago
Rainbows in the Hypercube
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
Maria Axenovich, Heiko Harborth, Arnfried Kemnitz,...
POPL
2006
ACM
14 years 8 months ago
Staged allocation: a compositional technique for specifying and implementing procedure calling conventions
We present staged allocation, a technique for specifying calling conventions by composing tiny allocators called stages. A specification written using staged allocation has a prec...
Reuben Olinsky, Christian Lindig, Norman Ramsey
FCT
1999
Springer
14 years 5 days ago
On Recognizable Languages in Divisibility Monoids
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
Manfred Droste, Dietrich Kuske
COCOON
2000
Springer
14 years 8 days ago
Parameterized Complexity of Finding Subgraphs with Hereditary Properties
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
Subhash Khot, Venkatesh Raman