Simulating the Bitonic Sort Using P Systems
From MaRDI portal
Publication:5452056
DOI10.1007/978-3-540-77312-2_11zbMATH Open1137.68378OpenAlexW1781602774MaRDI QIDQ5452056FDOQ5452056
Authors: Mario J. Pérez-Jiménez, Alexandru I. Tomescu, Rodica Ceterchi 
Publication date: 28 March 2008
Published in: Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77312-2_11
Recommendations
Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Title not available (Why is that?)
- Computing with membranes
- Membrane computing. An introduction.
- Parallel Processing with the Perfect Shuffle
- Bitonic Sort on a Mesh-Connected Parallel Computer
- Sorting on a mesh-connected parallel computer
- ON SIMULATING A CLASS OF PARALLEL ARCHITECTURES
- Title not available (Why is that?)
- The periodic balanced sorting network
- An optimal routing algorithm for mesh-connected Parallel computers
- Indexing functions and time lower bounds for sorting on a mesh-connected computer
- Membrane Computing
- Title not available (Why is that?)
- Membrane Computing
Cited In (7)
- Bitonic sorters of minimal depth
- Kernel P systems: from modelling to verification and testing
- Title not available (Why is that?)
- 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
- Kernel P systems modelling, testing and verification -- sorting case study
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)
