Sciweavers

84 search results - page 13 / 17
» icalp 2010
Sort
View
ICALP
2010
Springer
14 years 3 months ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
ICALP
2010
Springer
14 years 27 days ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
ICALP
2010
Springer
14 years 27 days ago
Sparse Reliable Graph Backbones
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David...
SODA
2010
ACM
187views Algorithms» more  SODA 2010»
14 years 8 months ago
An Improved Competitive Algorithm for Reordering Buffer Management
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
Noa Avigdor-Elgrabli, Yuval Rabani
ICALP
2010
Springer
14 years 3 months ago
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
Amir Shpilka, Ilya Volkovich