Sciweavers

1132 search results - page 139 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
JGAA
2006
127views more  JGAA 2006»
15 years 6 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
JMLR
2006
117views more  JMLR 2006»
15 years 6 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
INFOCOM
2009
IEEE
16 years 1 months ago
Delay Guarantees for Throughput-Optimal Wireless Link Scheduling
—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...
Koushik Kar, Xiang Luo, Saswati Sarkar
FSTTCS
2009
Springer
16 years 1 months ago
Non-Local Box Complexity and Secure Function Evaluation
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...
ISW
2009
Springer
16 years 29 days ago
Nonce Generators and the Nonce Reset Problem
A nonce is a cryptographic input value which must never repeat within a given context. Nonces are important for the security of many cryptographic building blocks, such as stream c...
Erik Zenner