We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Abstract. Self-stabilizing message driven protocols are deļ¬ned and discussed. The class weakexclusion that contains many natural tasks such as -exclusion and token-passing is deļ...
Algorithms and computational complexity measures for simulating the motion of contacting bodies with friction are presented. The bodies are restricted to be perfectly rigid bodies...
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a f...
Most existing performance evaluation methods concentrate on defining separate metrics over a wide range of conditions and generating standard benchmarking video sequences for exam...
Chung-Hao Chen, Yi Yao, Andreas Koschan, Mongi Abi...