925 search results - page 39 / 185 » Connectivity on Complete Lattices |
163
click to vote
SIROCCO
1997
15 years 3 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
123
Voted
JOC
2002
15 years 1 months ago
2002
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
160
click to vote
WG
2010
Springer
15 years 9 days ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
105
click to vote
JUCS
2008
15 years 1 months ago
2008
: Since all the algebras connected to logic have, more or less explicitely, an associated order relation, it follows that they have two presentations, dual to each other. We classi...
114
click to vote
JUCS
2007
15 years 1 months ago
2007
: Since all the algebras connected to logic have, more or less explicitely, an associated order relation, it follows that they have two presentations, dual to each other. We classi...