Sciweavers

Share
8 search results - page 2 / 2
» Improved output-sensitive quantum algorithms for Boolean mat...
Sort
View
CCGRID
2011
IEEE
8 years 6 months ago
Small Discrete Fourier Transforms on GPUs
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
S. Mitra, A. Srinivasan
FOCS
2009
IEEE
9 years 9 months ago
Regularity Lemmas and Combinatorial Algorithms
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
Nikhil Bansal, Ryan Williams
APPROX
2015
Springer
28views Algorithms» more  APPROX 2015»
3 years 10 months ago
Correlation in Hard Distributions in Communication Complexity
We study the effect that the amount of correlation in a bipartite distribution has on the communication complexity of a problem under that distribution. We introduce a new family...
Ralph Bottesch, Dmitry Gavinsky, Hartmut Klauck
books