Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ICALP
2009
Springer
11 years 4 months ago
Limiting Negations in Formulas
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
Hiroki Morizumi
ICALP
2009
Springer
11 years 4 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
ICALP
2009
Springer
11 years 4 months ago
Factoring Groups Efficiently
We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two su...
Neeraj Kayal, Timur Nezhmetdinov
ICALP
2009
Springer
11 years 4 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro
ICALP
2009
Springer
11 years 4 months ago
Improved Bounds for Flow Shop Scheduling
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
Monaldo Mastrolilli, Ola Svensson
ICALP
2009
Springer
11 years 4 months ago
The Ehrenfeucht-Silberger Problem
We consider repetitions in words and solve a longstanding open problem about the relation between the period and the length of its longest unbordered factor. A word u is called bor...
Stepan Holub, Dirk Nowotka
ICALP
2009
Springer
11 years 4 months ago
External Sampling
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...
ICALP
2009
Springer
11 years 4 months ago
Fast FAST
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
Noga Alon, Daniel Lokshtanov, Saket Saurabh
ICALP
2009
Springer
11 years 4 months ago
Online Computation with Advice
Adi Rosén, Amos Korman, Pierre Fraigniaud, ...
ICALP
2009
Springer
11 years 4 months ago
Distortion Is Fixed Parameter Tractable
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
books