Sciweavers

SODA
2012
ACM
170views Algorithms» more  SODA 2012»
11 years 6 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
13 years 9 months ago
The round complexity of two-party random selection
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
Saurabh Sanghvi, Salil P. Vadhan
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
13 years 9 months ago
On strip packing With rotations
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
Klaus Jansen, Rob van Stee
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
13 years 9 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
13 years 9 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
STOC
2005
ACM
111views Algorithms» more  STOC 2005»
14 years 4 months ago
Tensor decomposition and approximation schemes for constraint satisfaction problems
Wenceslas Fernandez de la Vega, Marek Karpinski, R...
STOC
2005
ACM
133views Algorithms» more  STOC 2005»
14 years 4 months ago
An O(log n log log n) space algorithm for undirected st-connectivity
Abstract. We present a deterministic O(log n log log n) space algorithm for undirected stconnectivity. It is based on a space-efficient simulation of the deterministic EREW algorit...
Vladimir Trifonov
STOC
2005
ACM
145views Algorithms» more  STOC 2005»
14 years 4 months ago
On uniform amplification of hardness in NP
We continue the study of amplification of average-case complexity within NP, and we focus on the uniform case. We prove that if every problem in NP admits an efficient uniform alg...
Luca Trevisan
STOC
2005
ACM
158views Algorithms» more  STOC 2005»
14 years 4 months ago
Polynomial time quantum algorithm for the computation of the unit group of a number field
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
Arthur Schmidt, Ulrich Vollmer
STOC
2005
ACM
107views Algorithms» more  STOC 2005»
14 years 4 months ago
On obfuscating point functions
We study the problem of obfuscation in the context of point functions (also known as delta functions). A point function is a Boolean function that assumes the value 1 at exactly o...
Hoeteck Wee