Publication:3651735
From MaRDI portal
zbMath1187.68679MaRDI QIDQ3651735
Ronald L. Rivest, Charles E. Leiserson, Clifford Stein, Thomas H. Cormen
Publication date: 11 December 2009
linear programming; probabilistic analysis; randomized algorithms; multithreaded algorithms; van Emde Boas trees
68W40: Analysis of algorithms
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68W05: Nonnumerical algorithms
90C05: Linear programming
68W20: Randomized algorithms
Related Items
VIRTUAL WOODWORK: MAKING TOYS FROM GEOMETRIC MODELS, Unnamed Item, Adaptive greedy approximations, Complexity issues in vertex-colored graph pattern matching, Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics, Computing hereditary convex structures, Decision problems for convex languages, Generalized density clustering, A hybrid search method for the vehicle routing problem with time windows, On Euclidean norm approximations, \texttt{MEEP}: a flexible free-software package for electromagnetic simulations by the FDTD method, An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems, Size-energy tradeoffs for unate circuits computing symmetric Boolean functions, Finding the shortest paths by node combination, New approximation algorithms for minimum cycle bases of graphs, A generalized hypergreedy algorithm for weighted perfect matching, Route planning for agent-based information retrieval, Maximizing the weighted number of just-in-time jobs in flow shop scheduling, Optimal length resolution refutations of difference constraint systems, Approximation algorithms for treewidth, Generalised cumulative arrays in secret sharing, Optimisation of timetable-based, stochastic transit assignment models based on MSA, Hierarchical characterization of complex networks, Approximation schemes for packing with item fragmentation, Two dimensional aggregation procedure: An alternative to the matrix algebraic algorithm, Characterizing sets of jobs that admit optimal greedy-like algorithms, A decomposition scheme for single stage scheduling problems, Combinatorial optimization under uncertainty, Fast algorithms for the density finding problem, On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls, Extending STL with efficient data structures, Formal derivation of graph algorithmic programs using partition-and-recur, Transforming binary sequences using priority queues, Global minimum potential energy conformations of small molecules, Sorting, linear time and the satisfiability problem, Balancing minimum spanning trees and shortest-path trees, An optimal parallel algorithm for planar cycle separators, On approximation of dominating tree in wireless sensor networks, Computing Frobenius maps and factoring polynomials, Swap and mismatch edit distance, On the inapproximability of the exemplar conserved interval distance problem of genomes, Random binary trees: from the average case analysis to the asymptotics of distributions, An analysis of totally clairvoyant scheduling, Implicitly heterogeneous multi-stage programming, Finding longest increasing and common subsequences in streaming data, Searching for spreads and packings, Unnamed Item, Jump Number of Two-Directional Orthogonal Ray Graphs, Complexity Results for the Spanning Tree Congestion Problem, Graph Transformation by Computational Category Theory, Incremental DFA Minimisation, Efficient Top-k Queries for Orthogonal Ranges, On the Structure of Optimal Greedy Computation (for Job Scheduling), Size and Energy of Threshold Circuits Computing Mod Functions, Packaging Mathematical Structures, Using link analysis technique with a modified shortest-path algorithm to fight money laundering, On the expected maximum degree of Gabriel and Yao graphs, Estimating information amount under uncertainty: algorithmic solvability and computational complexity, Communication-Efficient Private Protocols for Longest Common Subsequence, Online Suffix Tree Construction for Streaming Sequences, Design and Engineering of External Memory Traversal Algorithms for General Graphs, Foundations of RDF Databases
