We consider the following problem in a stream model: Given a sequence a = a1, a2, . . . , am wich each ai ∈ [n] = {1, . . . , n} and m > n, find a duplicate in the sequence, ...
This paper summarizes the results of our first participation at ResPubliQA. Lacking a true question answering system, we relied on our traditional search engine to find the answers...
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word ha...
Attackers often take advantage of vulnerabilities in benign software, and the authors of benign software must search their code for bugs in hopes of finding vulnerabilities before...
Juan Caballero, Pongsin Poosankam, Stephen McCaman...
We consider the round robin (RR) scheduling policy where the server processes each job in its buffer for at most a fixed quantum, q, in a round-robin fashion. The processor sharin...