• Corpus ID: 60621753

# Introduction to Algorithms, third edition

```@inproceedings{Cormen2009IntroductionTA,
title={Introduction to Algorithms, third edition},
author={Thomas H. Cormen and Charles E. Leiserson and Ronald L. Rivest and Clifford Stein},
year={2009}
}```
• Published 31 July 2009
• Computer Science
If you had to buy just one text on algorithms, Introduction to Algorithms is a magnificent choice. The book begins by considering the mathematical foundations of the analysis of algorithms and maintains this mathematical rigor throughout the work. The tools developed in these opening sections are then applied to sorting, data structures, graphs, and a variety of selected algorithms including computational geometry, string algorithms, parallel models of computation, fast Fourier transforms (FFTs…
2,798 Citations
Time in the Analysis of Algorithms
• Computer Science
• 2012
This chapter starts with the classic Turing machine model and with the very abstract notion of time used to measure the computational complexity of Turing machines, on which the definition of complexity classes rests.
On the asymptotic properties of functions and programs ∗
A complete but easy-to-understand proof of the theorem that its time complexity is Θ(n lgn) because the running time of a program is generally proportional to this measure.
Strings and Sequences
• Computer Science
• 2013
The original metaphor that illuminates the inner workings of the Knuth-Morris-Pratt substring search algorithm is presented and leads to a clean implementation that easily avoids off-by-one errors.
Tighter Fourier Transform Lower Bounds
The main result shows that a factor \(b\) speedup implies existence of not just one but \(b\)-ill conditioned bottlenecks occurring at \(\Omega (n) different steps, each causing information from independent (orthogonal) components of the input to either overflow or underflow.
Generic functional parallel algorithms: scan and FFT
This paper presents generic functional formulations for two important and well-known classes of parallel algorithms: parallel scan (generalized prefix sum) and fast Fourier transform (FFT).
My JuliaCon proceeding
This work shows computational methods to generate the 2D/3D space partition induced by a collection of 1D/2D/ 3D geometric objects and how to compute Boolean operations between solid models generated by this approach, reducing them to standard tables of Boolean values.
Multiplying boolean Polynomials with Frobenius Partitions in Additive Fast Fourier Transform
• Computer Science, Mathematics
ArXiv
• 2018
We show a new algorithm and its implementation for multiplying bit-polynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a natural set for
Further analysis of the remedian algorithm
• Computer Science
Theor. Comput. Sci.
• 2013
Faster Multiplication for Long Binary Polynomials
• Computer Science, Mathematics
ArXiv
• 2017
This work sets new speed records for multiplying long polynomials over finite fields of characteristic two and employs a tower field construction because the multipliers in the additive FFT naturally fall into small subfields, which leads to speed-ups using table-lookup instructions in modern CPUs.
PyAlg: An Algorithm Learning Platform
The aim of this project was to develop a unified interface covering essential aspects of algorithm learning: algorithm libraries, visualization, and benchmarking; the developed tool, named PyAlg, is a learning platform that can be used in studying, teaching, and analysing algorithms.