Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SIAMCOMP
2008
148views more  SIAMCOMP 2008»
11 years 4 hour ago
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
Abstract. To cope with the impossibility of solving agreement problems in asynchronous systems made up of n processes and prone to t process crashes, system designers tailor their ...
Achour Mostéfaoui, Sergio Rajsbaum, Michel ...
SIAMCOMP
2008
109views more  SIAMCOMP 2008»
11 years 4 hour ago
On Monotone Formula Composition of Perfect Zero-Knowledge Languages
We investigate structural properties of interactive perfect zero-knowledge (PZK) proofs. Specifically, we look into the closure properties of PZK languages under monotone boolean ...
Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe...
SIAMCOMP
2008
154views more  SIAMCOMP 2008»
11 years 4 hour ago
Cryptography in the Bounded-Quantum-Storage Model
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary's quantum memory is of bounded size. We show that oblivio...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
SIAMCOMP
2008
75views more  SIAMCOMP 2008»
11 years 1 months ago
Graph Distances in the Data-Stream Model
Joan Feigenbaum, Sampath Kannan, Andrew McGregor, ...
SIAMCOMP
2008
123views more  SIAMCOMP 2008»
11 years 1 months ago
Approximation Algorithms for Biclustering Problems
One of the main goals in the analysis of microarray data is to identify groups of genes and groups of experimental conditions (including environments, individuals, and tissues) tha...
Lusheng Wang, Yu Lin, Xiaowen Liu
SIAMCOMP
2008
121views more  SIAMCOMP 2008»
11 years 1 months ago
Closest Substring Problems with Small Distances
We study two pattern matching problems that are motivated by applications in computational biology. In the Closest Substring problem k strings s1, . . ., sk are given, and the tas...
Dániel Marx
SIAMCOMP
2008
101views more  SIAMCOMP 2008»
11 years 1 months ago
Combination Can Be Hard: Approximability of the Unique Coverage Problem
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiag...
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
11 years 1 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
SIAMCOMP
2008
133views more  SIAMCOMP 2008»
11 years 1 months ago
A Deterministic Subexponential Algorithm for Solving Parity Games
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...
Marcin Jurdzinski, Mike Paterson, Uri Zwick
books