default search action
György Vaszil
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j57]Anna Kuczik, György Vaszil:
Simple variants of non-cooperative polymorphic P systems. J. Membr. Comput. 6(3): 179-192 (2024) - [j56]Erzsébet Csuhaj-Varjú, György Vaszil:
Variants of distributed reaction systems. Nat. Comput. 23(2): 269-284 (2024) - [j55]Erzsébet Csuhaj-Varjú, György Vaszil
:
Networks of Watson-Crick D0L systems with communication by substrings. Theor. Comput. Sci. 995: 114493 (2024) - [c49]György Vaszil:
Describing Computations of Membrane Systems with Petri Nets (invited paper). ITAT 2024: 14 - [c48]Patrik Adrián, György Vaszil:
A GLR-like Parsing Algorithm for Three-Valued Interpretations of Boolean Grammars with Strong Negation. NCMA 2024: 27-43 - 2023
- [j54]György Vaszil, Claudio Zandron, Gexiang Zhang:
Preface. Nat. Comput. 22(1): 1-2 (2023) - [e8]Henning Bordihn
Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings. Lecture Notes in Computer Science 13918, Springer 2023, ISBN 978-3-031-34325-4 [contents] - 2022
- [j53]Erzsébet Csuhaj-Varjú, Pál Dömösi, György Vaszil:
Preface. Int. J. Found. Comput. Sci. 33(3&4): 175-178 (2022) - [j52]Péter Battyányi, Tamás Mihálydeák, György Vaszil:
Rough-Set-Like Approximation Spaces for Formal Languages. J. Autom. Lang. Comb. 27(1-3): 79-90 (2022) - [j51]Attila Bagossy
Controlled reversibility in communicating reaction systems. Theor. Comput. Sci. 926: 3-20 (2022) - [e7]Yo-Sub Han
Descriptional Complexity of Formal Systems - 24th IFIP WG 1.02 International Conference, DCFS 2022, Debrecen, Hungary, August 29-31, 2022, Proceedings. Lecture Notes in Computer Science 13439, Springer 2022, ISBN 978-3-031-13256-8 [contents] - [e6]Jérôme Durand-Lose
Machines, Computations, and Universality - 9th International Conference, MCU 2022, Debrecen, Hungary, August 31 - September 2, 2022, Proceedings. Lecture Notes in Computer Science 13419, Springer 2022, ISBN 978-3-031-13501-9 [contents] - [e5]Henning Bordihn, Géza Horváth, György Vaszil:
Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, NCMA 2022, Debrecen, Hungary, August 26-27, 2022. EPTCS 367, 2022 [contents] - 2021
- [j50]Henning Bordihn
Reversible parallel communicating finite automata systems. Acta Informatica 58(4): 263-279 (2021) - [c47]András Murvai, György Vaszil:
String Assembling Systems and Watson-Crick Finite Automata. ITAT 2021: 210-216 - 2020
- [j49]Erzsébet Csuhaj-Varjú, György Vaszil:
On Languages of P Automata. Fundam. Informaticae 171(1-4): 133-149 (2020) - [j48]Henning Bordihn, György Vaszil:
Deterministic Lindenmayer Systems with Dynamic Control of Parallelism. Int. J. Found. Comput. Sci. 31(1): 37-51 (2020) - [j47]Attila Bagossy, György Vaszil
Simulating reversible computation with reaction systems. J. Membr. Comput. 2(3): 179-193 (2020) - [j46]Péter Battyányi, György Vaszil
Description of membrane systems with time Petri nets: promoters/inhibitors, membrane dissolution, and priorities. J. Membr. Comput. 2(4): 341-354 (2020) - [j45]Bogdan Aman
Local time membrane systems and time Petri nets. Theor. Comput. Sci. 805: 175-192 (2020) - [c46]Attila Bagossy, György Vaszil:
Transition Graphs of Reversible Reaction Systems. Int. Conf. on Membrane Computing 2020: 1-16
2010 – 2019
- 2019
- [c45]Péter Battyányi
Membrane Systems and Multiset Approximation: The Cases of Inner and Boundary Rule Application. IJCRS 2019: 239-252 - [c44]Péter Battyányi
Generalized Membrane Systems with Dynamical Structure, Petri Nets, and Multiset Approximation Spaces. UCNC 2019: 15-29 - 2018
- [j44]Henning Bordihn, Benedek Nagy, György Vaszil:
Preface: Non-classical models of automata and applications VIII. RAIRO Theor. Informatics Appl. 52(2-3-4): 87-88 (2018) - [j43]Dávid Angyal, Benedek Nagy, György Vaszil:
On the Complexity of a Mildly Context-Sensitive Language Class. J. Autom. Lang. Comb. 23(1-3): 5-18 (2018) - [j42]Kristóf Kántor, György Vaszil:
On the classes of languages characterized by generalized P colony automata. Theor. Comput. Sci. 724: 35-44 (2018) - [c43]Erzsébet Csuhaj-Varjú, Kristóf Kántor, György Vaszil:
Deterministic Parsing with P Colony Automata. Enjoying Natural Computing 2018: 88-98 - [c42]Lucie Ciencialová
APCol Systems with Verifier Agents. Int. Conf. on Membrane Computing 2018: 95-107 - 2017
- [j41]Erzsébet Csuhaj-Varjú, Rudolf Freund, György Vaszil:
Watson-Crick T0L Systems and Red-Green Register Machines. Fundam. Informaticae 155(1-2): 111-129 (2017) - [j40]Florin Manea, Bianca Truthe
TCS Special Issue on Languages and Combinatorics in Theory and Nature. Theor. Comput. Sci. 682: 2-4 (2017) - [c41]Kristóf Kántor, György Vaszil:
Generalized P Colony Automata and Their Relation to P Automata. Int. Conf. on Membrane Computing 2017: 167-182 - [e4]Erzsébet Csuhaj-Varjú, Pál Dömösi, György Vaszil:
Proceedings 15th International Conference on Automata and Formal Languages, AFL 2017, Debrecen, Hungary, September 4-6, 2017. EPTCS 252, 2017 [contents] - 2016
- [j39]Henning Bordihn, György Vaszil:
On Lindenmayer Systems with Dynamic Control of Parallelism. J. Autom. Lang. Comb. 21(1-2): 27-40 (2016) - [j38]Bogdan Aman
Simulating P systems with membrane dissolution in a chemical calculus. Nat. Comput. 15(4): 521-532 (2016) - [c40]Péter Battyányi
Chemical Term Reduction with Active P Systems. Int. Conf. on Membrane Computing 2016: 136-150 - [e3]Henning Bordihn, Rudolf Freund, Benedek Nagy, György Vaszil:
Eighth Workshop on Non-Classical Models of Automata and Applications, NCMA 2016, Debrecen, Hungary, August 29-30, 2016. Proceedings. books@ocg.at 321, Österreichische Computer Gesellschaft 2016, ISBN 978-3-903035-10-2 [contents] - 2015
- [j37]Martin Kutrib
Deterministic One-Way Turing Machines with Sublinear Space. Fundam. Informaticae 136(1-2): 139-155 (2015) - [j36]Erzsébet Csuhaj-Varjú, Marian Gheorghe
Spatially Localised Membrane Systems. Fundam. Informaticae 138(1-2): 193-205 (2015) - [c39]Erzsébet Csuhaj-Varjú, Rudolf Freund, György Vaszil:
A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems. MCU 2015: 31-44 - [c38]Ákos Balaskó, Erzsébet Csuhaj-Varjú, György Vaszil:
Dynamically Changing Environment for Generalized Communicating P Systems. Int. Conf. on Membrane Computing 2015: 92-105 - [c37]Tamás Mihálydeák
Regulating Rule Application with Membrane Boundaries in P Systems. Int. Conf. on Membrane Computing 2015: 304-320 - 2014
- [j35]Péter Battyányi
Describing Membrane Computations with a Chemical Calculus. Fundam. Informaticae 134(1-2): 39-50 (2014) - [j34]Erzsébet Csuhaj-Varjú, György Vaszil:
P Automata with Restricted Power. Int. J. Found. Comput. Sci. 25(4): 391-408 (2014) - [j33]Kristóf Kántor, György Vaszil:
Generalized P Colony Automata. J. Autom. Lang. Comb. 19(1-4): 145-156 (2014) - 2013
- [c36]Erzsébet Csuhaj-Varjú, György Vaszil:
On Counter Machines versus dP Automata. Int. Conf. on Membrane Computing 2013: 138-150 - [c35]Martin Kutrib, Julien Provillard, György Vaszil, Matthias Wendlandt:
Deterministic one-way Turing machines with sublinear space bounds. NCMA 2013: 195-208 - [c34]Erzsébet Csuhaj-Varjú, György Vaszil:
On the Power of P Automata. UCNC 2013: 55-66 - [e2]Erzsébet Csuhaj-Varjú, Marian Gheorghe, Grzegorz Rozenberg, Arto Salomaa, György Vaszil:
Membrane Computing - 13th International Conference, CMC 2012, Budapest, Hungary, August 28-31, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7762, Springer 2013, ISBN 978-3-642-36750-2 [contents] - 2012
- [c33]György Vaszil:
On the Nonterminal Complexity of Tree Controlled Grammars. Languages Alive 2012: 265-272 - 2011
- [j32]Erzsébet Csuhaj-Varjú, Tomás Masopust
Blackhole Pushdown Automata. Fundam. Informaticae 112(2-3): 137-156 (2011) - [j31]Erzsébet Csuhaj-Varjú, Marion Oswald, György Vaszil:
Pc Grammar Systems with Clusters of Components. Int. J. Found. Comput. Sci. 22(1): 203-212 (2011) - [j30]Jürgen Dassow, György Vaszil:
On the Number of Active Symbols in Lindenmayer Systems. Int. J. Found. Comput. Sci. 22(1): 223-235 (2011) - [c32]Maurice H. ter Beek
Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence. Computation, Cooperation, and Life 2011: 70-89 - [c31]György Vaszil:
On the Parallelizability of Languages Accepted by P Automata. Computation, Cooperation, and Life 2011: 170-178 - [c30]Erzsébet Csuhaj-Varjú, György Vaszil:
On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems. DCFS 2011: 121-134 - [c29]György Vaszil:
Variants of Distributed P Automata and the Efficient Parallelizability of Languages. Int. Conf. on Membrane Computing 2011: 51-61 - [c28]Erzsébet Csuhaj-Varjú, György Vaszil:
Finite dP Automata versus Multi-head Finite Automata. Int. Conf. on Membrane Computing 2011: 120-138 - [i1]Erzsébet Csuhaj-Varjú, György Vaszil:
Expanding Formal Language and Automata Theory: Bio-inspired Computational Models. ERCIM News 2011(85): 26 (2011) - 2010
- [j29]Erzsébet Csuhaj-Varjú, Jürgen Dassow, György Vaszil:
Variants of Competence-Based Derivations in CD Grammar Systems. Int. J. Found. Comput. Sci. 21(4): 549-569 (2010) - [j28]Erzsébet Csuhaj-Varjú, György Vaszil:
Scattered context grammars generate any recursively enumerable language with two nonterminals. Inf. Process. Lett. 110(20): 902-907 (2010) - [j27]Erzsébet Csuhaj-Varjú, György Vaszil:
On the Descriptional Complexity of Context-Free Non-returning PC Grammar Systems. J. Autom. Lang. Comb. 15(1/2): 91-105 (2010) - [j26]Erzsébet Csuhaj-Varjú, György Vaszil:
P automata. Scholarpedia 5(4): 9344 (2010) - [c27]Erzsébet Csuhaj-Varjú, György Vaszil, Sergey Verlan
On Generalized Communicating P Systems with One Symbol. Int. Conf. on Membrane Computing 2010: 160-174 - [c26]Erzsébet Csuhaj-Varjú, Tomás Masopust, György Vaszil:
Blackhole State-Controlled Regulated Pushdown Automata. NCMA 2010: 45-56
2000 – 2009
- 2009
- [j25]Lucie Ciencialová
Variants of P Colonies with Very Simple Cell Structure. Int. J. Comput. Commun. Control 4(3): 224-233 (2009) - [j24]Katalin Anna Lázár, Erzsébet Csuhaj-Varjú, András Lörincz
Dynamically formed Clusters of Agents in Eco-Grammar Systems. Int. J. Found. Comput. Sci. 20(2): 293-311 (2009) - [c25]Erzsébet Csuhaj-Varjú, György Vaszil:
On the Size Complexity of Non-Returning Context-Free PC Grammar Systems. DCFS 2009: 91-100 - 2008
- [j23]Erzsébet Csuhaj-Varjú, Antonio Di Nola, Gheorghe Paun, Mario J. Pérez-Jiménez, György Vaszil:
Editing Configurations of P Systems. Fundam. Informaticae 82(1-2): 29-46 (2008) - [j22]Erzsébet Csuhaj-Varjú, Gheorghe Paun, György Vaszil:
Tissue-Like P Systems with Dynamically Emerging Requests. Int. J. Found. Comput. Sci. 19(3): 729-745 (2008) - [j21]Erzsébet Csuhaj-Varjú, György Vaszil:
Preface. Int. J. Found. Comput. Sci. 19(5): 1181-1182 (2008) - [j20]Erzsébet Csuhaj-Varjú, György Vaszil:
(Mem)brane automata. Theor. Comput. Sci. 404(1-2): 52-60 (2008) - [c24]György Vaszil:
Automata-like Membrane Systems - A Natural Way to Describe Complex Phenomena. DCFS 2008: 26-37 - [c23]Erzsébet Csuhaj-Varjú, Jürgen Dassow, György Vaszil:
Some New Modes of Competence-Based Derivations in CD Grammar Systems. Developments in Language Theory 2008: 228-239 - 2007
- [j19]Erzsébet Csuhaj-Varjú, Gheorghe Paun, György Vaszil:
Grammar Systems versus Membrane Computing: The Case of CD Grammar Systems. Fundam. Informaticae 76(3): 271-292 (2007) - [j18]Maurice H. ter Beek
On Competence in CD Grammar Systems with Parallel Rewriting. Int. J. Found. Comput. Sci. 18(6): 1425-1439 (2007) - [j17]György Vaszil:
Non-returning PC Grammar Systems Generate any Recursively Enumerable Language with Eight Context-Free Components. J. Autom. Lang. Comb. 12(1-2): 307-315 (2007) - [j16]Erzsébet Csuhaj-Varjú, Maurice Margenstern, György Vaszil, Sergey Verlan
On small universal antiport P systems. Theor. Comput. Sci. 372(2-3): 152-164 (2007) - [j15]Erzsébet Csuhaj-Varjú, Ion Petre
Self-assembly of strings and languages. Theor. Comput. Sci. 374(1-3): 74-81 (2007) - [c22]Erzsébet Csuhaj-Varjú, György Vaszil:
On a Variant of Parallel Communicating Grammar Systems with Communication by Command. Formal Models, Languages and Applications 2007: 46-64 - [c21]Henning Bordihn, György Vaszil:
Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems. FCT 2007: 113-124 - [c20]Henning Bordihn, György Vaszil:
On leftmost derivations in CD grammar systems. LATA 2007: 187-198 - [c19]Erzsébet Csuhaj-Varjú, György Vaszil:
P Systems with String Objects and with Communication by Request. Workshop on Membrane Computing 2007: 228-239 - 2006
- [j14]Erzsébet Csuhaj-Varjú, Oscar H. Ibarra, György Vaszil:
On the Computational Complexity of P Automata. Nat. Comput. 5(2): 109-126 (2006) - [c18]Jürgen Dassow, György Vaszil:
On the Number of Active Symbols in Lindenmayer Systems. DCFS 2006: 130-140 - [c17]Jürgen Dassow, György Vaszil:
Ciliate Bio-operations on Finite String Multisets. Developments in Language Theory 2006: 168-179 - [c16]Erzsébet Csuhaj-Varjú, Maurice Margenstern, György Vaszil:
P Colonies with a Bounded Number of Cells and Programs. Workshop on Membrane Computing 2006: 352-366 - [c15]Jürgen Dassow, György Vaszil:
P Finite Automata and Regular Languages over Countably Infinite Alphabets. Workshop on Membrane Computing 2006: 367-381 - 2005
- [j13]György Vaszil:
On the descriptional complexity of some rewriting mechanisms regulated by context conditions. Theor. Comput. Sci. 330(2): 361-373 (2005) - [c14]György Vaszil:
Non-returning PC Grammar Systems Generate Any Recursively Enumerable Language with Eight Context-free Components. DCFS 2005: 227-235 - 2004
- [c13]Maurice H. ter Beek, Erzsébet Csuhaj-Varjú, Markus Holzer
On Competence in CD Grammar Systems. Developments in Language Theory 2004: 76-88 - [c12]Erzsébet Csuhaj-Varjú, Oscar H. Ibarra, György Vaszil:
On the Computational Complexity of P Automata. DNA 2004: 76-89 - [c11]Erzsébet Csuhaj-Varjú, György Vaszil:
Reducing the Size of Extended Gemmating Systems. Workshop on Membrane Computing 2004: 296-308 - [c10]György Vaszil:
On the Size of P Systems with Minimal Symport/Antiport. Workshop on Membrane Computing 2004: 404-413 - 2003
- [j12]Erzsébet Csuhaj-Varjú, Gheorghe Paun, György Vaszil:
PC grammar systems with five context-free components generate all recursively enumerable languages. Theor. Comput. Sci. 299(1-3): 785-794 (2003) - [c9]György Vaszil:
On the Generative Capacity of Parallel Communicating Extended Lindenmayer Systems. Grammars and Automata for String Processing 2003: 99-110 - [c8]György Vaszil:
On the Number of Conditional Productions in Simple Semi-conditional Grammars. DCFS 2003: 210-220 - [c7]Erzsébet Csuhaj-Varjú, Victor Mitrana
Distributed Pushdown Automata Systems: Computational Power. Developments in Language Theory 2003: 218-229 - [c6]Daniela Besozzi, Giancarlo Mauri, György Vaszil, Claudio Zandron:
Collapsing Hierarchies of Parallel Rewriting P Systems without Target Conflicts. Workshop on Membrane Computing 2003: 55-69 - [e1]Erzsébet Csuhaj-Varjú, Chandra M. R. Kintala, Detlef Wotschke, György Vaszil:
5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12 - 14, 2003. Proceedings. MTA SZTAKI, Hungarian Academy of Sciences, Budapest, Hungary 2003, ISBN 963-311-356-3 [contents] - 2002
- [j11]Erzsébet Csuhaj-Varjú, György Vaszil:
Parallel Communicating Grammar Systems with Incomplete Information Communication. Grammars 5(3): 153-176 (2002) - [j10]Erzsébet Csuhaj-Varjú, György Vaszil:
Parallel communicating grammar systems with bounded resources. Theor. Comput. Sci. 276(1-2): 205-219 (2002) - [c5]Erzsébet Csuhaj-Varjú, György Vaszil:
P Automata or Purely Communicating Accepting P Systems. WMC-CdeA 2002: 219-233 - 2001
- [j9]Erzsébet Csuhaj-Varjú, György Vaszil:
On context-free parallel communicating grammar systems: synchronization, communication, and normal forms. Theor. Comput. Sci. 255(1-2): 511-538 (2001) - [c4]Erzsébet Csuhaj-Varjú, György Vaszil:
Parallel Communicating Grammar Systems with Incomplete Information Communication. Developments in Language Theory 2001: 359-368 - 2000
- [j8]Henning Bordihn, Jürgen Dassow, György Vaszil:
Parallel Communicating Grammar Systems As Language Analyzers. Grammars 3(1): 1-20 (2000) - [j7]Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Victor Mitrana
Parallel Communicating Pushdown Automata Systems. Int. J. Found. Comput. Sci. 11(4): 633-650 (2000) - [j6]György Vaszil:
Further Remarks on Parallel Communicating Grammar Systems without a Master. J. Autom. Lang. Comb. 5(1): 59-75 (2000)
1990 – 1999
- 1999
- [j5]György Vaszil:
Communication in Parallel Communicating Lindenmayer Systems. Grammars 1(3): 255-270 (1999) - [j4]Erzsébet Csuhaj-Varjú, György Vaszil:
On the Computational Completeness of Context-Free Parallel Communicating Grammar Systems. Theor. Comput. Sci. 215(1-2): 349-358 (1999) - [c3]Henning Bordihn, Jürgen Dassow, György Vaszil:
Grammar Systems as Language Analyzers and Recursively Enumerable Languages. FCT 1999: 136-147 - [c2]György Vaszil:
On Parallel Communicating Lindemayer Systems. Grammatical Models of Multi-Agent Systems 1999: 99-112 - 1998
- [j3]György Vaszil:
On Simulating Non-Returning PC Grammar Systems with Returning Systems. Theor. Comput. Sci. 209(1-2): 319-329 (1998) - [c1]György Vaszil:
Communication in Parallel Communicating Lindenmayer Systems (Extended Abstract). MFCS Workshop on Grammar Systems 1998: 139-147 - 1997
- [j2]György Vaszil:
Various Communications in PC Grammar Systems. Acta Cybern. 13(2): 173-196 (1997) - 1996
- [j1]György Vaszil:
PCGSs Without a Master. Comput. Artif. Intell. 15(2-3): 185-198 (1996)
Coauthor Index
[j56] [j55] [j53] [j49] [c43] [c42] [j41] [e4] [j36] [c39] [c38] [j34] [c36] [c34] [e2] [j32] [j31] [c32] [c30] [c28] [i1] [j29] [j28] [j27] [j26] [c27] [c26] [j25] [j24] [c25] [j23] [j22] [j21] [j20] [c23] [j19] [j18] [j16] [j15] [c22] [c19] [j14] [c16] [c13] [c12] [c11] [j12] [c7] [e1] [j11] [j10] [c5] [j9] [c4] [j7] [j4]
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-12-10 21:45 CET 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: