scientific article; zbMATH DE number 1033260

MaRDI QIDQ4344098zbMATH OpenFDO

Authors Robert Sedgewick

Publication date 13 July 1997

zbMATH Keywords

algorithmsdata structuresprogram language C

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 814095
• scientific article; zbMATH DE number 108390
• scientific article; zbMATH DE number 108391
• scientific article; zbMATH DE number 1033261
• scientific article; zbMATH DE number 2027967
• scientific article; zbMATH DE number 779272
• Programming in C.
• scientific article; zbMATH DE number 194559
• scientific article; zbMATH DE number 815843

Cited in

(25)

• A constant-time dynamic storage allocator for real-time systems
• Heuristic and exact algorithms for the precedence-constrained knapsack problem
• Finding all the negative cycles in a directed graph
• Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
• In-memory hash tables for accumulating text vocabularies
• Heuristic and exact algorithms for the spanning tree detection problem
• Exact deterministic representation of Markovian SIR epidemics on networks with and without loops
• Scheduling unit length jobs with parallel nested machine processing set restrictions
• Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints
• Analysis of swaps in radix selection
• ALGORITHMS FOR FRACTAL DIMENSION CALCULATION
• Maximum flows and minimum cuts in the plane
• The xyz algorithm for fast interaction search in high-dimensional data
• Newman polynomials with prescribed vanishing and integer sets with distinct subset sums
• scientific article; zbMATH DE number 814096 (Why is no real title available?)
• Cycle-aware minimization of acyclic deterministic finite-state automata
• Practical Wavelet Tree Construction
• Towards a realistic analysis of some popular sorting algorithms
• Efficient implementation of the Pivot algorithm for self-avoiding walks
• Parallel external memory wavelet tree and wavelet matrix construction
• Discrete variable topology optimization for maximizing single/multiple natural frequencies and frequency gaps considering the topological constraint
• Fast reconstruction of an original continuous series from a recurrence plot
• Finding strong components using depth-first search
• The two variable per inequality abstract domain
• Maximum flows and minimum cuts in the plane

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4344098)