We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
Polling systems with large deterministic setup times find many applications in production environments. The present note studies the delay distribution in exhaustive polling syst...
We conducted an industrial case study of a distributed team in the USA and the Czech Republic that used Extreme Programming. Our goal was to understand how this globally-distribut...
Lucas Layman, Laurie Williams, Daniela Damian, Hyn...
This paper provides a set-theoretic model of knowledge and unawareness, in which reasoning through theorems is employed. A new property called Awareness Leads to Knowledge shows t...
Finding a shorter addition/subtraction-chain for an integer is an important problem for many cryptographic systems based on number theory. Especially, execution time of multiplica...
Younho Lee, Heeyoul Kim, Seong-Min Hong, Hyunsoo Y...