Factor complexity of infinite words associated with non-simple Parry numbers.
Factor frequencies in generalized Thue-Morse words
We describe factor frequencies of the generalized Thue-Morse word defined for , as the fixed point starting in of the morphism where and where the letters are expressed modulo . We...
Factoring and testing primes in small space
We discuss how much space is sufficient to decide whether a unary given number n is a prime. We show that O(log log n) space is sufficient for a deterministic Turing machine, if it is equipped with an additional pebble movable along the input tape, and also for an alternating machine, if the space restriction applies only to its accepting computation subtrees. In other words, the language is a prime is in pebble–DSPACE(log log n) and also in accept–ASPACE(log log n). Moreover, if the given n is...
Factoring Polynomials with Rational Coefficients.
Factorisation des ensembles préfixiels
Factorisation des polynômes à plusieurs variables à coefficients entiers
Factorisation sur des polynômes de degré élevé à l’aide d’un monomorphisme
Factors involved in the performance of computations on Beowulf clusters.
Factors of generalized Rudin-Shapiro sequences. (Facteurs des suites de Rudin-Shapiro généralisées.)
Faculty information system based on open source technologies.
Fair expressions and regular languages over lists
Fairness and control
Fairness and regularity for SCCS processes
Fairness for synchronous fork-join nets
Familles de langages
Far from equilibrium computation and particle swarm optimization.
Fast algorithms for finding a subdirect decomposition and interesting congruences of finite algebras
Fast approximation of centrality.
Fast approximation of minimum multicast congestion – Implementation versus theory
The problem of minimizing the maximum edge congestion in a multicast communication network generalizes the well-known -hard multicommodity flow problem. We give the presently best theoretical approximation results as well as efficient implementations. In particular we show that for a network with edges and multicast requests, an -approximation can be computed in time, where bounds the time for computing an -approximate minimum Steiner tree. Moreover, we present a new fast heuristic that...
Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
The problem of minimizing the maximum edge congestion in a multicast communication network generalizes the well-known NP-hard multicommodity flow problem. We give the presently best theoretical approximation results as well as efficient implementations. In particular we show that for a network with m edges and k multicast requests, an r(1 + ε)(rOPT + exp(1)lnm)-approximation can be computed in O(kmε-2lnklnm) time, where β bounds the time for computing an r-approximate minimum Steiner tree. Moreover,...