Implementing Bead-Sort with P systems

DOI10.1007/3-540-45833-6_10MaRDI QIDQ4437089zbMATH OpenFDO

Authors Joshua J. Arulanandham

Publication date 7 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2509/25090115.htm

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• A static sorting algorithm for P sytems with mobile catalysts
• Simulating the Bitonic Sort Using P Systems
• Sorting using spiking neural P systems with anti-spikes and rules on synapses
• scientific article; zbMATH DE number 1860702
• Implementing sorting networks with spiking neural P systems

Cited in

(8)

• Kernel P systems: from modelling to verification and testing
• Kernel P systems modelling, testing and verification -- sorting case study
• scientific article; zbMATH DE number 1820029 (Why is no real title available?)
• Towards “Fypercomputations” (in Membrane Computing)
• A static sorting algorithm for P sytems with mobile catalysts
• Simulating the Bitonic Sort Using P Systems
• A fast natural algorithm for searching
• Lattice based communication P systems with applications in cluster analysis

This page was built for publication: Implementing Bead-Sort with P systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4437089)