Simulating the Bitonic Sort Using P Systems
From MaRDI portal
Publication:5452056
DOI10.1007/978-3-540-77312-2_11zbMath1137.68378OpenAlexW1781602774MaRDI QIDQ5452056
Alexandru I. Tomescu, Mario J. Pérez-Jiménez, 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
Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (4)
The computational power of enzymatic numerical P systems working in the sequential mode ⋮ Kernel P systems: from modelling to verification and testing ⋮ Kernel P Systems Modelling, Testing and Verification - Sorting Case Study ⋮ Computing the Maximum Bisimulation with Spiking Neural P Systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Indexing functions and time lower bounds for sorting on a mesh-connected computer
- Computing with membranes
- Membrane computing. An introduction.
- ON SIMULATING A CLASS OF PARALLEL ARCHITECTURES
- The periodic balanced sorting network
- An optimal routing algorithm for mesh-connected Parallel computers
- Sorting on a mesh-connected parallel computer
- Bitonic Sort on a Mesh-Connected Parallel Computer
- Membrane Computing
- Membrane Computing
- Parallel Processing with the Perfect Shuffle
This page was built for publication: Simulating the Bitonic Sort Using P Systems
