Sciweavers

FSTTCS
2009
Springer
14 years 2 months ago
Kolmogorov Complexity in Randomness Extraction
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandra...
FSTTCS
2009
Springer
14 years 2 months ago
Nash Equilibrium in Generalised Muller Games
We suggest that extending Muller games with preference ordering for players is a natural way to reason about unbounded duration games. In this context, we look at the standard solu...
Soumya Paul, Sunil Easaw Simon
FSTTCS
2009
Springer
14 years 2 months ago
Functionally Private Approximations of Negligibly-Biased Estimators
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
André Madeira, S. Muthukrishnan
FSTTCS
2009
Springer
14 years 2 months ago
Arithmetic Circuits and the Hadamard Product of Polynomials
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...
FSTTCS
2009
Springer
14 years 2 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
FSTTCS
2009
Springer
14 years 2 months ago
The Wadge Hierarchy of Max-Regular Languages
Recently, Mikołaj Boja´nczyk introduced a class of max-regular languages, an extension of regular languages of infinite words preserving many of its usual properties. This new c...
Jérémie Cabessa, Jacques Duparc, Ale...
FSTTCS
2009
Springer
14 years 2 months ago
Using Elimination Theory to construct Rigid Matrices
The rigidity of a matrix A for target rank r is the minimum number of entries of A that
Kumar Abhinav, Satyanarayana V. Lokam, Vijay M. Pa...
FCT
2009
Springer
14 years 2 months ago
Closure Operators for Order Structures
We argue that closure operators are fundamental tools for the study of relationships between order structures and their sequence representations. We also propose and analyse a clos...
Ryszard Janicki, Dai Tri Man Le, Nadezhda Zubkova
FCT
2009
Springer
14 years 2 months ago
Small Weakly Universal Turing Machines
We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an infinitely repeate...
Turlough Neary, Damien Woods
FCT
2009
Springer
14 years 2 months ago
Earliest Query Answering for Deterministic Nested Word Automata
Olivier Gauwin, Joachim Niehren, Sophie Tison