Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks
- Antonio Fernández Anta,
- José Luis López-Presa,
- M. Araceli Lorenzo,
- Pilar Manzano,
- Juan Martinez-Romo,
- Alberto Mozo,
- Christopher Thraves
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model (Blesa et al. in MFCS, Lecture Notes in Computer Science, vol. 3618, pp. 144–155, 2005) by considering the possibility that the router clocks in the network are not ...
Weighted Logics for Unranked Tree Automata
We define a weighted monadic second order logic for unranked trees and the concept of weighted unranked tree automata, and we investigate the expressive power of these two concepts. We show that weighted tree automata and a syntactically restricted ...
Weighted Picture Automata and Weighted Logics
We investigate formal power series on pictures. These are functions that map pictures to elements of a semiring and provide an extension of two-dimensional languages to a quantitative setting. We establish a notion of a weighted MSO logics over ...
Improved Results for a Memory Allocation Problem
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. This problem was recently introduced by Chung et al. (Theory Comput. Syst. ...
Fixpoint Logics over Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph definitions also allow to specify graphs of exponential size using polynomial ...
RFID Authentication Efficient Proactive Information Security within Computational Security
We consider repeated communication sessions between a RFID Tag (e.g., Radio Frequency Identification, RFID Tag) and a RFID Verifier. A proactive information theoretic security scheme is proposed. The scheme is based on the assumption that the ...
Parallelizing Time with Polynomial Circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing time t random access Turing machines, a model at least as powerful as ...
New Results on the Most Significant Bit of Integer Multiplication
Integer multiplication as one of the basic arithmetic functions has been in the focus of several complexity theoretical investigations and ordered binary decision diagrams (OBDDs) are one of the most common dynamic data structures for Boolean functions. ...
An Almost Quadratic Time Algorithm for Sparse Spliced Alignment
The sparse spliced alignment problem consists of finding a chain of zero or more exons from O(n) prescribed candidate exons of a DNA sequence of length O(n) that is most similar to a known related gene sequence of length n. This study improves the ...
Privacy in Non-private Environments
We study private computations in information-theoretical settings on networks that are not 2-connected. Non-2-connected networks are “non-private” in the sense that most functions cannot privately be computed on them. We relax the notion of privacy by ...