default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYurii Rogozhin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j25]Artiom Alhazov
, Rudolf Freund, Vladimir Rogozhin, Yurii Rogozhin:
Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors. Nat. Comput. 15(1): 51-68 (2016)- 2014
- [j24]Yurii Rogozhin, Artiom Alhazov, Liudmila Burtseva, Svetlana Cojocaru, Alexandru Colesnicov, Ludmila Malahova:
Solving Problems in Various Domains by Hybrid Models of High Performance Computations. Comput. Sci. J. Moldova 22(1): 3-20 (2014) - [j23]Artiom Alhazov, Gemma Bel Enguix, Yurii Rogozhin:
Smallest Filters in Complete Obligatory Hybrid Networks of Evolutionary Processors. J. Autom. Lang. Comb. 19(1-4): 5-16 (2014) - [j22]Sergiu Ivanov, Yurii Rogozhin, Sergey Verlan:
Small Universal Networks of Evolutionary Processors. J. Autom. Lang. Comb. 19(1-4): 133-144 (2014) - [j21]Rudolf Freund, Yurii Rogozhin, Sergey Verlan:
Generating and accepting P systems with minimal left and right insertion and deletion. Nat. Comput. 13(2): 257-268 (2014) - [c38]Artiom Alhazov, Yurii Rogozhin, Sergey Verlan:
Small Universal Devices. Computing with New Resources 2014: 249-263 - [c37]Yurii Rogozhin, Artiom Alhazov, Lyudmila Burtseva, Svetlana Cojocaru, Alexandru Colesnicov, Ludmila Malahova:
P System Computational Model as Framework for Hybrid (Membrane-Quantum) Computations. Int. Conf. on Membrane Computing 2014: 373-384 - [c36]Artiom Alhazov, Rudolf Freund, Yurii Rogozhin:
Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete. UCNC 2014: 1-13 - [e2]Artiom Alhazov, Svetlana Cojocaru, Marian Gheorghe, Yurii Rogozhin, Grzegorz Rozenberg, Arto Salomaa:
Membrane Computing - 14th International Conference, CMC 2013, Chişinău, Republic of Moldova, August 20-23, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8340, Springer 2014, ISBN 978-3-642-54238-1 [contents] - 2013
- [j20]Artiom Alhazov, Yurii Rogozhin:
One-membrane symport with few extra symbols. Int. J. Comput. Math. 90(4): 750-759 (2013) - [c35]Artiom Alhazov, Elena Boian, Svetlana Cojocaru, Alexandru Colesnicov, Ludmila Malahova, Mircea Petic, Yurii Rogozhin:
A P System Parsing Word Derivatives. UCNC 2013: 246-247 - 2012
- [j19]Artiom Alhazov, Yurii Rogozhin, Sergey Verlan:
On Small Universal Splicing Systems. Int. J. Found. Comput. Sci. 23(7): 1423-1438 (2012) - [c34]Yurii Rogozhin, Artiom Alhazov:
Turing Computability and Membrane Computing. Int. Conf. on Membrane Computing 2012: 56-77 - [c33]Artiom Alhazov, Rudolf Freund, Hilbert Heikenwälder, Marion Oswald, Yurii Rogozhin, Sergey Verlan:
Sequential P Systems with Regular Control. Int. Conf. on Membrane Computing 2012: 112-127 - [c32]Rudolf Freund, Yurii Rogozhin, Sergey Verlan:
P Systems with Minimal Left and Right Insertion and Deletion. UCNC 2012: 82-93 - 2011
- [j18]Artiom Alhazov, Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan:
P Systems with Insertion and Deletion Exo-Operations. Fundam. Informaticae 110(1-4): 13-28 (2011) - [j17]Artiom Alhazov, Marian Kogler, Maurice Margenstern, Yurii Rogozhin, Sergey Verlan:
Small Universal Tvdh and Test Tube Systems. Int. J. Found. Comput. Sci. 22(1): 143-154 (2011) - [j16]Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan:
Computational power of insertion-deletion (P) systems with rules of size two. Nat. Comput. 10(2): 835-852 (2011) - [j15]Artiom Alhazov, Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan:
P systems with minimal insertion and deletion. Theor. Comput. Sci. 412(1-2): 136-144 (2011) - [c31]Artiom Alhazov, Gemma Bel Enguix, Alexander Krassovitskiy, Yurii Rogozhin:
About Complete Obligatory Hybrid Networks of Evolutionary Processors without Substitution. IWANN (1) 2011: 441-448 - [c30]Artiom Alhazov, Alexander Krassovitskiy, Yurii Rogozhin:
Circular Post Machines and P Systems with Exo-insertion and Deletion. Int. Conf. on Membrane Computing 2011: 73-86 - [c29]Artiom Alhazov, Gemma Bel Enguix, Alexander Krassovitskiy, Yurii Rogozhin:
Complete Obligatory Hybrid Networks of Evolutionary Processors. PAAMS (Special Sessions) 2011: 275-282 - [p2]Gemma Bel Enguix, Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan:
On the Lower Bounds for Asymmetrical Insertion-deletion Languages. Biology, Computation and Linguistics 2011: 145-154 - 2010
- [j14]Artiom Alhazov, Elena Boian, Liudmila Burtseva, Constantin Ciubotaru, Svetlana Cojocaru, Alexandru Colesnicov, Valentina Demidova, Sergiu Ivanov, Veaceslav Macari, Galina Magariu, Ludmila Malahova, Vladimir Rogojin, Yurii Rogozhin, Tatiana Tofan, Sergey Verlan, Tatiana Verlan:
Investigations on Natural Computing in the Institute of Mathematics and Computer Science. Comput. Sci. J. Moldova 18(2): 101-138 (2010) - [j13]Artiom Alhazov, Constantin Ciubotaru, Sergiu Ivanov, Yurii Rogozhin:
Membrane Systems Languages Are Polynomial-Time Parsable. Comput. Sci. J. Moldova 18(2): 139-148 (2010) - [c28]Artiom Alhazov, Constantin Ciubotaru, Sergiu Ivanov, Yurii Rogozhin:
The Family of Languages Generated by Non-cooperative Membrane Systems. Int. Conf. on Membrane Computing 2010: 65-80 - [c27]Artiom Alhazov, Sergiu Ivanov, Yurii Rogozhin:
Polymorphic P Systems. Int. Conf. on Membrane Computing 2010: 81-94 - [c26]Artiom Alhazov, Yurii Rogozhin, Sergey Verlan:
A Small Universal Splicing P System. Int. Conf. on Membrane Computing 2010: 95-102 - [c25]Rudolf Freund, Marian Kogler, Yurii Rogozhin, Sergey Verlan:
Graph-Controlled Insertion-Deletion Systems. DCFS 2010: 88-98 - [p1]Artiom Alhazov, Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan:
Small Size Insertion and Deletion Systems. Scientific Applications of Language Methods 2010: 459-524
2000 – 2009
- 2009
- [j12]Artiom Alhazov, Elena Boian, Svetlana Cojocaru, Yurii Rogozhin:
Modelling Inflections in Romanian Language by P Systems with String Replication. Comput. Sci. J. Moldova 17(2): 160-178 (2009) - [j11]Artiom Alhazov, Carlos Martín-Vide, Bianca Truthe, Jürgen Dassow, Yurii Rogozhin:
On Networks of Evolutionary Processors with Nodes of Two Types. Fundam. Informaticae 91(1): 1-15 (2009) - [j10]Artiom Alhazov, Svetlana Cojocaru, Ludmila Malahova, Yurii Rogozhin:
Dictionary Search and Update by P Systems with String-Objects and Active Membranes. Int. J. Comput. Commun. Control 4(3): 206-213 (2009) - [j9]Artiom Alhazov, Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Yurii Rogozhin:
On the size of computationally complete hybrid networks of evolutionary processors. Theor. Comput. Sci. 410(35): 3188-3197 (2009) - [c24]Artiom Alhazov, Gemma Bel Enguix, Yurii Rogozhin:
Obligatory Hybrid Networks of Evolutionary Processors. ICAART 2009: 613-618 - 2008
- [j8]Artiom Alhazov, Yurii Rogozhin:
About Precise Characterization of Languages Generated by Hybrid Networks of Evolutionary Processors with One Node. Comput. Sci. J. Moldova 16(3): 364-376 (2008) - [c23]Artiom Alhazov, Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Yurii Rogozhin:
Computational Completeness of Hybrid Networks of Evolutionary Processors with Seven Nodes. DCFS 2008: 38-47 - [c22]Artiom Alhazov, Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Yurii Rogozhin:
About Universal Hybrid Networks of Evolutionary Processors of Small Size. LATA 2008: 28-39 - [c21]Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan:
Further Results on Insertion-Deletion Systems with One-Sided Contexts. LATA 2008: 333-344 - [c20]Artiom Alhazov, Liudmila Burtseva, Svetlana Cojocaru, Yurii Rogozhin:
Solving PP-Complete and #P-Complete Problems by P Systems with Active Membranes. Workshop on Membrane Computing 2008: 108-117 - [c19]Alexander Krassovitskiy, Yurii Rogozhin, Sergey Verlan:
Computational Power of P Systems with Small Size Insertion and Deletion Rules. CSP 2008: 108-117 - [c18]Sergey Verlan, Yurii Rogozhin:
New Choice for Small Universal Devices: Symport/Antiport P Systems. CSP 2008: 235-241 - 2007
- [j7]Artiom Alhazov, Yurii Rogozhin, Sergey Verlan:
Minimal Cooperation in Symport/antiport Tissue P Systems. Int. J. Found. Comput. Sci. 18(1): 163-180 (2007) - [c17]Artiom Alhazov, Carlos Martín-Vide, Yurii Rogozhin:
Networks of Evolutionary Processors with Two Nodes Are Unpredictable. LATA 2007: 521-528 - [c16]Artiom Matveevici, Yurii Rogozhin, Sergey Verlan:
Insertion-Deletion Systems with One-Sided Contexts. MCU 2007: 205-217 - [c15]Artiom Alhazov, Yurii Rogozhin:
Skin Output in P Systems with Minimal Symport/Antiport and Two Membranes. Workshop on Membrane Computing 2007: 97-112 - 2006
- [j6]Artiom Alhazov, Carlos Martín-Vide, Yurii Rogozhin:
On the number of nodes in universal networks of evolutionary processors. Acta Informatica 43(5): 331-339 (2006) - [j5]Artiom Alhazov, Yurii Rogozhin:
Generating Languages by P Systems with Minimal Symport/Antiport. Comput. Sci. J. Moldova 14(3): 299-323 (2006) - [c14]Artiom Alhazov, Yurii Rogozhin:
Towards a Characterization of P Systems with Minimal Symport/Antiport and Two Membranes. Workshop on Membrane Computing 2006: 135-153 - 2005
- [j4]Maurice Margenstern, Sergey Verlan, Yurii Rogozhin:
Time-Varying Distributed H Systems: An Overview. Fundam. Informaticae 64(1-4): 291-306 (2005) - [j3]Maurice Margenstern, Gheorghe Paun, Yurii Rogozhin, Sergey Verlan:
Context-free insertion-deletion systems. Theor. Comput. Sci. 330(2): 339-348 (2005) - [c13]Artiom Alhazov, Rudolf Freund, Yurii Rogozhin:
Computational Power of Symport/Antiport: History, Advances, and Open Problems. Workshop on Membrane Computing 2005: 1-30 - [c12]Yurii Rogozhin, Sergey Verlan:
On the Rule Complexity of Universal Tissue P Systems. Workshop on Membrane Computing 2005: 356-362 - 2004
- [c11]Artiom Alhazov, Maurice Margenstern, Vladimir Rogozhin, Yurii Rogozhin, Sergey Verlan:
Communicative P Systems with Minimal Cooperation. Workshop on Membrane Computing 2004: 161-177 - 2003
- [c10]Maurice Margenstern, Gheorghe Paun, Yurii Rogozhin, Sergey Verlan:
Context-Free Insertion-Deletion Systems. DCFS 2003: 265-273 - [c9]Maurice Margenstern, Yurii Rogozhin, Sergey Verlan:
Time-Varying Distributed H Systems with Parallel Computations: The Problem Is Solved. DNA 2003: 48-53 - [c8]Franziska Freund, Rudolf Freund, Marion Oswald, Maurice Margenstern, Yurii Rogozhin, Sergey Verlan:
P Systems with Cutting/Recombination Rules Assigned to Membranes. Workshop on Membrane Computing 2003: 191-202 - 2002
- [j2]Maurice Margenstern, Yurii Rogozhin:
Self-describing Turing machines. Fundam. Informaticae 50(3-4): 285-303 (2002) - [c7]Maurice Margenstern, Yurii Rogozhin, Sergey Verlan:
Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations. DNA 2002: 326-336 - 2001
- [c6]Maurice Margenstern, Yurii Rogozhin:
Time-Varying Distributed H Systems of Degree 1 Generate All Recursively Enumerable Languages. Words, Semigroups, and Transductions 2001: 329-339 - [c5]Maurice Margenstern, Yurii Rogozhin:
Time-varying distributd H-systems of degree 2 generate all recursively enumerable languages. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 399-407 - [c4]Manfred Kudlek, Yurii Rogozhin:
A Universal Turing Machine with 3 States and 9 Symbols. Developments in Language Theory 2001: 311-318 - [c3]Maurice Margenstern, Yurii Rogozhin:
A Universal Time-Varying Distributed H System of Degree 1. DNA 2001: 371-380 - [c2]Manfred Kudlek, Yurii Rogozhin:
New Small Universal Circular Post Machines. FCT 2001: 217-226 - [e1]Maurice Margenstern, Yurii Rogozhin:
Machines, Computations, and Universality, Third International Conference, MCU 2001, Chisinau, Moldova, May 23-27, 2001, Proceedings. Lecture Notes in Computer Science 2055, Springer 2001, ISBN 3-540-42121-1 [contents] - 2000
- [c1]Maurice Margenstern, Yurii Rogozhin:
About Time-Varying Distributed H Systems. DNA Computing 2000: 53-62
1990 – 1999
- 1996
- [j1]Yurii Rogozhin:
Small Universal Turing Machines. Theor. Comput. Sci. 168(2): 215-240 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
