Yu. Ofman coauthored the 1962 paper Multiplication of many-digital numbers by automatic computers by A. Karatsuba and Yu. Ofman. The work reduces a multiplication of large integers to three smaller multiplications rather than four, yielding the divide-and-conquer recurrence behind Karatsuba multiplication. It is an early example where an algebraic rearrangement changes an algorithm's asymptotic cost.^[ref]

Donald Michie described “memo” functions in “Memo” Functions and Machine Learning by Donald Michie. Remembering the result of a completed function call can avoid repeating the same computation later. This idea underlies memoization, where a computer program stores results keyed by the arguments whose values determined them. Reuse requires that those arguments still identify the same result; hidden changing state can invalidate the assumption.^[ref]

F. Thomson Leighton is a coauthor of Mathematics for Computer Science by Eric Lehman and others. The text develops proofs, graph theory, counting and probability as tools for analyzing algorithms and discrete structures. Its presentation ties formal arguments to computing questions, such as using indicator random variables and linearity of expectation to evaluate a complicated random count.^[ref]

Eric Lehman is a coauthor of Mathematics for Computer Science by Eric Lehman and others. The text develops discrete mathematical tools for computer science, including proof techniques, graph theory, counting and probability. Its analysis of indicator variables provides a reusable route from a complicated random count to a sum of simple event probabilities.^[ref]

Albert R. Meyer is a coauthor of Mathematics for Computer Science by Eric Lehman and others, which develops proofs, discrete structures and probability for reasoning about computation. Its treatment connects mathematical induction, graph models and counting to algorithmic questions and program correctness.^[ref]

Jochen Liedtke developed microkernel design and implementation methods. In On micro-kernel construction by Jochen Liedtke, he argues for a small privileged core and examines the actual costs of inter-process communication and address-space changes. The paper connects an architectural decomposition to hardware-dependent effects, showing why an abstract separation of services does not by itself determine performance.^[ref]

Anupam Gupta coauthored An elementary proof of a theorem of Johnson and Lindenstrauss by Sanjoy Dasgupta and Anupam Gupta. The paper gives an elementary probabilistic proof that a finite collection of points can be mapped into a much lower-dimensional Euclidean space while approximately preserving pairwise distances. The Johnson–Lindenstrauss lemma makes dimension reduction a precise geometric guarantee rather than an assumption that all projections preserve geometry.^[ref]

Sanjoy Dasgupta coauthored An elementary proof of a theorem of Johnson and Lindenstrauss by Sanjoy Dasgupta and Anupam Gupta. The paper gives an elementary probabilistic proof that a finite collection of points can be mapped into a much lower-dimensional Euclidean space while approximately preserving pairwise distances. The Johnson–Lindenstrauss lemma makes dimension reduction a precise geometric guarantee rather than an assumption that all projections preserve geometry.^[ref]

Jeremy Wohl is credited as an author of the PNG specification, the shared technical description of a file format for raster images using lossless source coding.^[ref]

Tim Wegner is credited as an author of the PNG specification, the shared technical description of a file format for raster images using lossless source coding.^[ref]

Vladimir Vukićević is credited as an author of the PNG specification. The specification defines how raster images, compressed data and ancillary metadata are represented so that independently written encoders and decoders can exchange the same image data.^[ref]

Michael Stokes is credited as an author of the PNG specification, the shared technical description of a file format for raster images using lossless source coding.^[ref]

Andrew Smith is credited as an author of the PNG specification, the shared technical description of a file format for raster images using lossless source coding.^[ref]

Paul Schmidt is credited as an author of the PNG specification, the shared technical description of a file format for raster images using lossless source coding.^[ref]