3228 search results - page 502 / 646 » Computationally Sound Proofs |
PERVASIVE
2004
Springer
14 years 2 months ago
2004
Springer
Ensuring authenticity and integrity are important tasks when dealing with goods. While in the past seal wax was used to ensure the integrity, electronic devices are now able to tak...
STACS
2004
Springer
14 years 2 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explici...
SPAA
2000
ACM
14 years 1 months ago
2000
ACM
The computer industry is currently examining the use of strong synchronization operations such as double compareand-swap (DCAS) as a means of supporting non-blocking synchronizati...