Sciweavers

728 search results - page 121 / 146
» ideas 2009
Sort
View
POPL
2009
ACM
16 years 13 days ago
Bidirectionalization for free! (Pearl)
A bidirectional transformation consists of a function get that takes a source (document or value) to a view and a function put that takes an updated view and the original source b...
Janis Voigtländer
ASPLOS
2009
ACM
16 years 13 days ago
DMP: deterministic shared memory multiprocessing
Current shared memory multicore and multiprocessor systems are nondeterministic. Each time these systems execute a multithreaded application, even if supplied with the same input,...
Joseph Devietti, Brandon Lucia, Luis Ceze, Mark Os...
STOC
2009
ACM
161views Algorithms» more  STOC 2009»
16 years 12 days ago
List decoding tensor products and interleaved codes
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
Parikshit Gopalan, Venkatesan Guruswami, Prasad Ra...
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 12 days ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
16 years 12 days ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...