We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
—In this paper, we investigate the problem of maximizing the throughput, i.e., achieving capacity, of Byzantine consensus in point-to-point networks, in which each link has a cap...
We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study ...
Jason D. Hartline, Vahab S. Mirrokni, Mukund Sunda...
In this paper we address the problem of query answering and rewriting in global-as-view data integration systems, when key and inclusion dependencies are expressed on the global i...
This paper is concerned with the complexity of some natural subclasses of minimal unsatisfiable formulas. We show the DP –completeness of the classes of maximal and marginal mi...