2924 search results - page 102 / 585 » Lower Bounds in Distributed Computing |
78
Voted
VMV
2008
15 years 2 months ago
2008
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
110
Voted
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
102
click to vote
PODC
1999
ACM
15 years 5 months ago
1999
ACM
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
99
Voted
GC
2007
Springer
15 years 17 days ago
2007
Springer
We determine lower and upper bounds for the size of a hyperplane of the dual polar space DW(5, q). In some cases, we also determine all hyperplanes attaining these bounds.
91
Voted
CRYPTO
2006
Springer
15 years 4 months ago
2006
Springer
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...