scientific article; zbMATH DE number 108391
zbMATH Open0826.68025MaRDI QIDQ4023850FDOQ4023850
Authors: Robert Sedgewick 
Publication date: 23 January 1993
Title of this publication is not available (Why is that?)
Recommendations
linear programmingNP-completenessfast Fourier transformparallel algorithmsbranch-and-bound methoddynamical programmingsorting algorithmsprogramming language C++
Theory of programming languages (68N15) Searching and sorting (68P10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Software, source code, etc. for problems pertaining to computer science (68-04)
Cited In (31)
- Simulation of modular mechatronic systems with application to vehicle dynamics
- Supernode Binary Search Trees
- Vehicle routing and crew scheduling for metropolitan mail distribution at Australia post
- In-place self-sorting fast Fourier transform algorithm with local memory references
- Title not available (Why is that?)
- Uniform election in trees and polyominoids
- Model Checking LTL Formulae in RAISE with FDR
- Title not available (Why is that?)
- Implicit \(B\)-trees: A new data structure for the dictionary problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
- Graph methods for solving the unconstrained and constrained optimal assignment problem for locomotives on a single-line railway section
- Toward unified hybrid simulation techniques for spiking neural networks
- Title not available (Why is that?)
- Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
- Sorting, linear time and the satisfiability problem
- Network DEA: efficiency analysis of organizations with complex internal structure
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The symmetric tridiagonal eigenproblem on a shared memory multiprocessor. II
- The symmetric tridigonal eigenproblem on a shared memory multiprocessor. I
- The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules
- Building a large location table to find replicas of physics objects
- Fast algorithms through divide- and combine-and-conquer strategies
- Optimal block-tridiagonalization of matrices for coherent charge transport
- Rotation-free Bernstein-Bézier elements for thin plates and shells -- development and validation
- Parallel algorithms for red--black trees
- A mixed evolutionary-statistical analysis of an algorithm's complexity
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 Q4023850)
