Results 51 to 60 of about 4,724 (119)

Deterministic parallel algorithms for bilinear objective functions

open access: yes, 2018
Many randomized algorithms can be derandomized efficiently using either the method of conditional expectations or probability spaces with low independence. A series of papers, beginning with work by Luby (1988), showed that in many cases these techniques
Harris, David G.
core  

Computer-Aided Saturation Mutagenesis of Arabidopsis thaliana Ent-Copalyl Diphosphate Synthase. [PDF]

open access: yesInterdiscip Sci, 2020
Szymczyk P   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy