TCS
2008
13 years 11 months ago
2008
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
TCS
2008
13 years 11 months ago
2008
Multicast and broadcast are efficient ways to deliver messages to a group of recipients in a network. Due to the growing security concerns in various applications, messages are oft...
TCS
2008
13 years 11 months ago
2008
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
TCS
2008
13 years 11 months ago
2008
The comma-free codes and circular codes are two important classes of codes in code theory and in genetics. Fifty years ago before the discovery of the genetic code, a trinucleotid...
TCS
2008
13 years 11 months ago
2008
TCS
2008
13 years 11 months ago
2008
TCS
2008
13 years 11 months ago
2008
TCS
2008
13 years 11 months ago
2008
We consider a large class of sequences, called admissible sequences, which are defined by systems of (possibly nonlinear) difference equations. A procedure for recursively enumera...
TCS
2008
13 years 11 months ago
2008
Phenomenal advances in nano-technology and packaging have made it possible to develop miniaturized low-power devices that integrate sensing, special-purpose computing, and wireles...
TCS
2008
13 years 11 months ago
2008
Abstract. Cryptographic operations are essential for many security-critical systems. Reasoning about information flow in such systems is challenging because typical (noninterferenc...