Sciweavers

1345 search results - page 88 / 269
» A Class of Logarithmic Integrals
Sort
View
DNA
2004
Springer
132views Bioinformatics» more  DNA 2004»
14 years 2 months ago
Error Free Self-assembly Using Error Prone Tiles
DNA self-assembly is emerging as a key paradigm for nano-technology, nano-computation, and several related disciplines. In nature, DNA self-assembly is often equipped with explicit...
Ho-Lin Chen, Ashish Goel
COMPGEOM
2010
ACM
14 years 2 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
STOC
1997
ACM
91views Algorithms» more  STOC 1997»
14 years 1 months ago
Lower Bounds for Distributed Coin-Flipping and Randomized Consensus
We examine a class of collective coin- ipping games that arises from randomized distributed algorithms with halting failures. In these games, a sequence of local coin ips is gener...
James Aspnes
PODC
2010
ACM
14 years 24 days ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer
FOCS
1995
IEEE
14 years 14 days ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan