scientific article

zbMath1158.68538MaRDI QIDQ3619797

Ronald L. Rivest, Thomas H. Cormen, Charles E. Leiserson, Clifford Stein

Publication date: 9 April 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Nonnumerical algorithms (68W05) Linear programming (90C05) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Randomized algorithms (68W20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)

Related Items (only showing first 100 items - show all)

Model checking and boolean graphs ⋮ Improved parallel solution of a triangular linear system ⋮ Efficient distribution-free learning of probabilistic concepts ⋮ Computing matrix-valued Nevanlinna-Pick interpolation ⋮ Some geometric applications of Dilworth's theorem ⋮ Constructing competitive tours from local information ⋮ A calculus for the random generation of labelled combinatorial structures ⋮ Proving theorems of the second order Lambek calculus in polynomial time ⋮ The minimum feature set problem ⋮ Average-case scalable on-line algorithms for fault replacement ⋮ Mellin transforms and asymptotics. The mergesort recurrence ⋮ The representation of permutations by trees ⋮ An optimal backtrack algorithm for tree-structured constraint satisfaction problems ⋮ An incremental concept formation approach for learning from databases ⋮ Speedup of determinism by alternation for multidimensional Turing machines ⋮ Topologically reliable approximation of composite Bézier curves ⋮ An efficient algorithm for concurrent priority queue heaps ⋮ Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems ⋮ A parallel algorithm for the generation of a permutation and applications ⋮ On the computational complexity of dynamic graph problems ⋮ The complexity of mean payoff games on graphs ⋮ Fixed-parameter tractability of graph modification problems for hereditary properties ⋮ Efficient out-of-core algorithms for linear relaxation using blocking covers ⋮ Complexity of Presburger arithmetic with fixed quantifier dimension ⋮ Improved parallel integer sorting without concurrent writing ⋮ Optimal and approximate bottleneck Steiner trees ⋮ Efficient massively parallel implementation of some combinatorial algorithms ⋮ On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees ⋮ Accelerating new product development by overcoming complexity constraints ⋮ Why it is computationally harder to reconstruct the past than to predict the future ⋮ Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations ⋮ Addition in \(\log_{2} n+O(1)\) steps on average. A simple analysis ⋮ On the solution of linear recurrence equations ⋮ Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep ⋮ Size-estimation framework with applications to transitive closure and reachability ⋮ The bulk-synchronous parallel random access machine ⋮ Exact calculations for the repeated many-one test. ⋮ Homology computation by reduction of chain complexes ⋮ An output sensitive algorithm for discrete convex hulls ⋮ Domain-independent queries on databases with external functions ⋮ Linear-time algorithms for parametric minimum spanning tree problems on planar graphs ⋮ On the approximability of some Maximum Spanning Tree Problems ⋮ Compact location problems ⋮ Auditing Boolean attributes ⋮ Analysis of a randomized rendezvous algorithm ⋮ Decision procedures for inductive Boolean functions based on alternating automata ⋮ Architecture independent parallel selection with applications to parallel priority queues ⋮ Euclidean strings ⋮ Clusters, outliers, and regression: Fixed point clusters ⋮ Verification of the Miller-Rabin probabilistic primality test. ⋮ An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. ⋮ Polynomial time algorithms for three-label point labeling. ⋮ A fast algorithm for finding the compact sets ⋮ Scheduling on a hypercube ⋮ Fast average-case pattern matching by multiplexing sparse tables ⋮ Approximate string-matching with \(q\)-grams and maximal matches ⋮ Fast computation of the Euclidean distance maps for binary images ⋮ On the complexity of blocks-world planning ⋮ A generic arc-consistency algorithm and its specializations ⋮ Stacks, queues, and deques with order-statistic operations ⋮ An optimal algorithm for finding compact sets ⋮ An optimal algorithm for the period of a strongly connected digraph ⋮ Computing fence designs for orienting parts ⋮ Transforming a single-valued transducer into a Mealy machine ⋮ On a scheduling problem of time deteriorating jobs ⋮ Spheres, molecules, and hidden surface removal ⋮ An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs ⋮ Methods for task allocation via agent coalition formation ⋮ Strictly-upward drawings of ordered search trees ⋮ Approximate maxima finding of continuous functions under restricted budget ⋮ Classifying molecular sequences using a linkage graph with their pairwise similarities ⋮ Communication complexity of fault-tolerant information diffusion ⋮ On the hardness of allocating frequencies for hybrid networks ⋮ An optimization problem in virtual endoscopy ⋮ Label placement by maximum independent set in rectangles ⋮ A dynamic programming heuristic for the \(P\)-median problem ⋮ Vectorized search for single clusters ⋮ Partial and perfect path covers of cographs ⋮ A \(2_3^2\) superstring approximation algorithm ⋮ On the complexity and approximation of syntenic distance ⋮ On the definition and the construction of pockets in macromolecules ⋮ Fast implementations of fuzzy arithmetic operations using fast Fourier transform (FFT) ⋮ Minimal connected enclosures on an embedded planar graph ⋮ Minimizing broadcast costs under edge reductions in tree networks ⋮ Fixed topology Steiner trees and spanning forests ⋮ Random sampling and greedy sparsification for matroid optimization problems ⋮ Minimizing average completion time in the presence of release dates ⋮ A survey on the complexity of tournament solutions ⋮ Analysis and synthesis of controlled delay lines ⋮ Timing conditions for linearizability in uniform counting networks ⋮ The generalized hierarchical product of graphs ⋮ Average-optimal string matching ⋮ Computation of incompressible flows with implicit finite element implementations on the Connection Machine ⋮ Determining uni-connectivity in directed graphs ⋮ Computation of the solutions of nonlinear polynomial systems ⋮ Flow in planar graphs with vertex capacities ⋮ A note on bitonic sorting ⋮ Efficient management of dynamic tables ⋮ A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets

This page was built for publication: