365 search results - page 50 / 73 » On the combinatorics of Galois numbers |
117
click to vote
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
CPM
2004
Springer
15 years 5 months ago
2004
Springer
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
COCOON
2003
Springer
15 years 5 months ago
2003
Springer
In this paper, we show some properties of a pseudotriangle and present three combinatorial bounds: the ratio of the size of minimum pseudotriangulation of a point set S and the siz...
PPOPP
2005
ACM
15 years 5 months ago
2005
ACM
As the number of processors in today’s high performance computers continues to grow, the mean-time-to-failure of these computers are becoming significantly shorter than the exe...