The Art of Computer Programming, Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions (Art of Computer Programming)

294 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Fast projection onto the simplex and the l1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\pmb {l}_\mathbf {1}$$\end{ (2015, methodology): “Attention was paid to the numerical robustness as well, with all the averaged quantities like (∑y∈v y− a)/|v| computed using the Welford–Knuth running mean algorithm [14].”
A Fast Projection onto the Simplex and the l 1 Ball (2015, methodology): “Attention was paid to the numerical robustness as well, with all the averaged quantities like (∑y∈v y− a)/|v| computed using the Welford–Knuth running mean algorithm [14].”
Neural Shufﬂe-Exchange Networks − Sequence Processing in O( n log n ) Time (2019, background): “Simple sorting circuits have depth Θ(log(2) n) (Knuth, 1973).”
Two-Sided Eulerian Numbers via Balls in Boxes (2012, background): “The reader is referred to [1] or [13] for more about permutation statistics generally.”