( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Multiset-Based Self-Assembly of Graphs.

, , , и . Fundam. Informaticae, 75 (1-4): 49-75 (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Claudio Puschel

Paoloni Claudio

Claudio Wilmanns

Claudio Meiss

Claudio Narcisi

 

Другие публикации лиц с тем же именем

On a Paun's Conjecture in Membrane Systems., , и . IWINAC (1), том 4527 из Lecture Notes in Computer Science, стр. 180-192. Springer, (2007)Exploiting Membrane Features to Compute.. CiE, том 8493 из Lecture Notes in Computer Science, стр. 393-402. Springer, (2014)Deadlock Decidability in Partial Parallel P Systems., , и . DNA, том 2943 из Lecture Notes in Computer Science, стр. 55-60. Springer, (2003)Simulating counting oracles with cooperation., , , , и . J. Membr. Comput., 2 (4): 303-310 (2020)Parallel Rewriting P Systems with Deadlock., , , и . DNA, том 2568 из Lecture Notes in Computer Science, стр. 302-314. Springer, (2002)P Systems with Elementary Active Membranes: Beyond NP and coNP., , , и . Int. Conf. on Membrane Computing, том 6501 из Lecture Notes in Computer Science, стр. 338-347. Springer, (2010)Solving Numerical NP-Complete Problems with Spiking Neural P Systems., , , и . Workshop on Membrane Computing, том 4860 из Lecture Notes in Computer Science, стр. 336-352. Springer, (2007)Preface of the special issue on computational complexity and complex systems., , , и . J. Membr. Comput., 5 (3): 190-192 (сентября 2023)Depth-two P systems can simulate Turing machines with NP oracles., , , и . Theor. Comput. Sci., (2022)An Efficient Simulation of Polynomial-Space Turing Machines by P Systems with Active Membranes., , , , и . Workshop on Membrane Computing, том 5957 из Lecture Notes in Computer Science, стр. 461-478. Springer, (2009)