Simulating the Bitonic Sort Using P Systems
From MaRDI portal
Publication:5452056
Recommendations
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1951581 (Why is no real title available?)
- scientific article; zbMATH DE number 2013802 (Why is no real title available?)
- An optimal routing algorithm for mesh-connected Parallel computers
- Bitonic Sort on a Mesh-Connected Parallel Computer
- Computing with membranes
- Indexing functions and time lower bounds for sorting on a mesh-connected computer
- Membrane Computing
- Membrane Computing
- Membrane computing. An introduction.
- ON SIMULATING A CLASS OF PARALLEL ARCHITECTURES
- Parallel Processing with the Perfect Shuffle
- Sorting on a mesh-connected parallel computer
- The periodic balanced sorting network
Cited in
(7)- Kernel P systems modelling, testing and verification -- sorting case study
- Bitonic sorters of minimal depth
- Kernel P systems: from modelling to verification and testing
- scientific article; zbMATH DE number 2013802 (Why is no real title available?)
- A static sorting algorithm for \(P\) sytems with mobile catalysts
- Computing the Maximum Bisimulation with Spiking Neural P Systems
- The computational power of enzymatic numerical P systems working in the sequential mode
This page was built for publication: Simulating the Bitonic Sort Using P Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452056)