scientific article; zbMATH DE number 1033260
From MaRDI portal
Publication:4344098
zbMath0883.68020MaRDI QIDQ4344098
Publication date: 13 July 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) 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)
Related Items (20)
Newman polynomials with prescribed vanishing and integer sets with distinct subset sums ⋮ Heuristic and exact algorithms for the spanning tree detection problem ⋮ Practical Wavelet Tree Construction ⋮ Towards a Realistic Analysis of Some Popular Sorting Algorithms ⋮ ALGORITHMS FOR FRACTAL DIMENSION CALCULATION ⋮ The two variable per inequality abstract domain ⋮ Cycle-aware minimization of acyclic deterministic finite-state automata ⋮ Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints ⋮ Maximum Flows and Minimum Cuts in the Plane ⋮ Analysis of swaps in radix selection ⋮ Shift-and-merge technique for the DP solution of the time-constrained backpacker problem ⋮ Unnamed Item ⋮ Maximum flows and minimum cuts in the plane ⋮ Efficient implementation of the Pivot algorithm for self-avoiding walks ⋮ Exact deterministic representation of Markovian SIR epidemics on networks with and without loops ⋮ A constant-time dynamic storage allocator for real-time systems ⋮ Scheduling unit length jobs with parallel nested machine processing set restrictions ⋮ Heuristic and exact algorithms for the precedence-constrained knapsack problem ⋮ In-memory hash tables for accumulating text vocabularies ⋮ Finding all the negative cycles in a directed graph
This page was built for publication:
