: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
The problem of placing training symbols optimally for orthogonal frequency-division multiplexing (OFDM) and single-carrier systems is considered. The channel is assumed to be quasi...
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
Dan Dobre, Rachid Guerraoui, Matthias Majuntke, Ne...