default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomás Masopust
Tomáš Masopust
Person information
- unicode name: Tomáš Masopust
- affiliation: TU Dresden, International Center For Computational Logic
- affiliation: Academy of Sciences of the Czech Republic, Institute of Mathematics
SPARQL queries 
🛈 Please note that only 62% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j46]Jan Komenda
, Tomás Masopust:
Supervisory Control of Modular Discrete-Event Systems Under Partial Observation: Normality. IEEE Trans. Autom. Control. 69(6): 3796-3807 (2024)- [i41]Tomás Masopust, Petr Osicka:
On the Complexity of Initial-and-Final-State Opacity for Discrete Event Systems. CoRR abs/2402.17000 (2024) - 2023
- [j45]Jirí Balun, Tomás Masopust:
Verifying weak and strong k-step opacity in discrete-event systems. Autom. 155: 111153 (2023) - [j44]Jan Komenda, Tomás Masopust:
Hierarchical Supervisory Control Under Partial Observation: Normality. IEEE Trans. Autom. Control. 68(12): 7286-7298 (2023) - [c36]Jirí Balun, Tomás Masopust, Petr Osicka:
Speed Me up If You Can: Conditional Lower Bounds on Opacity Verification. MFCS 2023: 16:1-16:15 - [i40]Jan Komenda, Tomás Masopust:
Supervisory Control of Modular Discrete-Event Systems under Partial Observation: Normality. CoRR abs/2302.10666 (2023) - [i39]Jirí Balun, Tomás Masopust, Petr Osicka:
Speed Me up if You Can: Conditional Lower Bounds on Opacity Verification. CoRR abs/2304.09920 (2023) - 2022
- [j43]Yingying Liu, Jan Komenda, Tomás Masopust, Zhiwu Li:
Modular control of discrete-event systems using similarity. Autom. 142: 110431 (2022) - [c35]Jirí Balun, Tomás Masopust:
On Transformations among Opacity Notions. SMC 2022: 3012-3017 - [i38]Jan Komenda, Tomás Masopust:
Hierarchical and Modular Supervisory Control under Partial Observation: Normality. CoRR abs/2203.01444 (2022) - [i37]Jirí Balun, Tomás Masopust:
Verifying Weak and Strong k-Step Opacity in Discrete-Event Systems. CoRR abs/2204.01286 (2022) - 2021
- [j42]Jirí Balun, Tomás Masopust:
On verification of D-detectability for discrete event systems. Autom. 133: 109884 (2021) - [j41]Jirí Balun, Tomás Masopust:
Comparing the notions of opacity for discrete-event systems. Discret. Event Dyn. Syst. 31(4): 553-582 (2021) - [j40]Tomás Masopust, Markus Krötzsch:
Partially Ordered Automata and Piecewise Testability. Log. Methods Comput. Sci. 17(2) (2021) - [i36]Jirí Balun, Tomás Masopust:
Comparing the Notions of Opacity for Discete-Event Systems. CoRR abs/2102.02889 (2021) - [i35]Jirí Balun, Tomás Masopust:
K-Step Opacity in Discrete Event Systems: Verification, Complexity, and Relations. CoRR abs/2109.02158 (2021) - 2020
- [j39]Tomás Masopust:
Critical Observability for Automata and Petri Nets. IEEE Trans. Autom. Control. 65(1): 341-346 (2020) - [j38]Spyros A. Reveliotis, Tomás Masopust:
Efficient Liveness Assessment for Traffic States in Open, Irreversible, Dynamically Routed, Zone-Controlled Guidepath-Based Transport Systems. IEEE Trans. Autom. Control. 65(7): 2883-2898 (2020)
2010 – 2019
- 2019
- [j37]Tomás Masopust, Xiang Yin:
Complexity of detectability, opacity and A-diagnosability for modular discrete event systems. Autom. 101: 290-295 (2019) - [j36]Stepan Holub, Tomás Masopust, Michaël Thomazo:
On the height of towers of subsequences and prefixes. Inf. Comput. 265: 77-93 (2019) - [j35]Liyong Lin, Tomás Masopust, Walter Murray Wonham, Rong Su:
Automatic Generation of Optimal Reductions of Distributions. IEEE Trans. Autom. Control. 64(3): 896-911 (2019) - [c34]Spyros A. Reveliotis, Tomás Masopust:
Some new results on the state liveness of open guidepath-based traffic systems. MED 2019: 398-404 - [i34]Tomás Masopust, Markus Krötzsch:
Partially Ordered Automata and Piecewise Testability. CoRR abs/1907.13115 (2019) - [i33]Jan Komenda, Tomás Masopust:
Conditions for Hierarchical Supervisory Control under Partial Observation. CoRR abs/1912.07309 (2019) - [i32]Jirí Balun, Tomás Masopust:
On Verification of Strong Periodic D-Detectability for Discrete Event Systems. CoRR abs/1912.07312 (2019) - [i31]Jirí Balun, Tomás Masopust:
On Opacity Verification for Discrete-Event Systems. CoRR abs/1912.07314 (2019) - 2018
- [j34]Tomás Masopust:
Complexity of deciding detectability in discrete event systems. Autom. 93: 257-261 (2018) - [j33]Tomás Masopust:
Complexity of Infimal Observable Superlanguages. IEEE Trans. Autom. Control. 63(1): 249-254 (2018) - [j32]Tomás Masopust:
Complexity of Verifying Nonblockingness in Modular Supervisory Control. IEEE Trans. Autom. Control. 63(2): 602-607 (2018) - [j31]Tomás Masopust:
Separability by piecewise testable languages is PTime-complete. Theor. Comput. Sci. 711: 109-114 (2018) - [c33]Tomás Masopust, Markus Krötzsch:
Deciding Universality of ptNFAs is PSpace-Complete. SOFSEM 2018: 413-427 - [i30]Tomás Masopust, Xiang Yin:
Deciding Detectability for Labeled Petri Nets. CoRR abs/1802.02087 (2018) - [i29]Liyong Lin, Tomás Masopust, Walter Murray Wonham, Rong Su:
Automatic Generation of Optimal Reductions of Distributions. CoRR abs/1803.11034 (2018) - [i28]Tomás Masopust:
Critical Observability for Automata and Petri Nets. CoRR abs/1808.00261 (2018) - 2017
- [j30]Jan Komenda, Tomás Masopust:
Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication. Discret. Event Dyn. Syst. 27(4): 585-608 (2017) - [j29]Markus Krötzsch, Tomás Masopust, Michaël Thomazo:
Complexity of universality and related problems for partially ordered NFAs. Inf. Comput. 255: 177-192 (2017) - [j28]Tomás Masopust, Michaël Thomazo:
On Boolean combinations forming piecewise testable languages. Theor. Comput. Sci. 682: 165-179 (2017) - [i27]Tomás Masopust:
Complexity of Verifying Nonblockingness in Modular Supervisory Control. CoRR abs/1703.05011 (2017) - [i26]Tomás Masopust:
Complexity of Infimal Observable Superlanguages. CoRR abs/1703.05016 (2017) - [i25]Tomás Masopust:
Separability by Piecewise Testable Languages is PTime-Complete. CoRR abs/1704.07856 (2017) - [i24]Tomás Masopust, Markus Krötzsch:
Universality of Confluent, Self-Loop Deterministic Partially Ordered NFAs is Hard. CoRR abs/1704.07860 (2017) - [i23]Stepan Holub, Tomás Masopust, Michaël Thomazo:
On the Height of Towers of Subsequences and Prefixes. CoRR abs/1705.02813 (2017) - [i22]Tomás Masopust:
Complexity of Deciding Detectability in Discrete Event Systems. CoRR abs/1710.02516 (2017) - [i21]Tomás Masopust, Xiang Yin:
Complexity of Detectability, Opacity and A-Diagnosability for Modular Discrete Event Systems. CoRR abs/1710.02877 (2017) - 2016
- [j27]Jan Komenda, Tomás Masopust:
Distributed computation of supremal conditionally controllable sublanguages. Int. J. Control 89(2): 424-436 (2016) - [c32]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
Distributed computation of maximally permissive supervisors in three-level relaxed coordination control of discrete-event systems. CDC 2016: 441-446 - [c31]Markus Krötzsch, Tomás Masopust, Michaël Thomazo:
On the Complexity of Universality for Partially Ordered NFAs. MFCS 2016: 61:1-61:14 - [c30]Tomás Masopust:
Piecewise Testable Languages and Nondeterministic Automata. MFCS 2016: 67:1-67:14 - [c29]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
Control of an engineering-structured multilevel discrete-event system. WODES 2016: 103-108 - [i20]Tomás Masopust:
Piecewise Testable Languages and Nondeterministic Automata. CoRR abs/1603.00361 (2016) - [i19]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
On a Distributed Computation of Supervisors in Modular Supervisory Control. CoRR abs/1609.01458 (2016) - [i18]Markus Krötzsch, Tomás Masopust, Michaël Thomazo:
Complexity of Universality and Related Problems for Partially Ordered NFAs. CoRR abs/1609.03460 (2016) - 2015
- [j26]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
Coordination control of discrete-event systems revisited. Discret. Event Dyn. Syst. 25(1-2): 65-94 (2015) - [c28]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
Multilevel coordination control of partially observed modular DES. ACC 2015: 384-389 - [c27]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
Relative observability in coordination control. CASE 2015: 75-80 - [c26]Tomás Masopust, Michaël Thomazo:
On the Complexity of k-Piecewise Testability and the Depth of Automata. DLT 2015: 364-376 - [i17]Jan Komenda, Tomás Masopust:
On the Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control. CoRR abs/1512.03267 (2015) - 2014
- [c25]Jan Komenda, Tomás Masopust:
Decentralized supervisory control with communicating supervisors based on top-down coordination control. CDC 2014: 5149-5155 - [c24]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
Bottom-up approach to multilevel supervisory control with coordination. ECC 2014: 2715-2720 - [c23]Stepan Holub, Galina Jirásková, Tomás Masopust:
On Upper and Lower Bounds on the Length of Alternating Towers. MFCS (1) 2014: 315-326 - [i16]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
Maximally Permissive Coordination Supervisory Control - Towards Necessary and Sufficient Conditions. CoRR abs/1403.4762 (2014) - [i15]Jan Komenda, Tomás Masopust:
Decentralized Supervisory Control with Communicating Supervisors Based on Top-Down Coordination Control. CoRR abs/1403.5170 (2014) - [i14]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
A Note on Relative Observability in Coordination Control. CoRR abs/1404.2195 (2014) - [i13]Galina Jirásková, Tomás Masopust:
On Upper and Lower Bounds on the Length of Alternating Towers. CoRR abs/1404.4495 (2014) - [i12]Stepan Holub, Tomás Masopust, Michaël Thomazo:
Alternating Towers and Piecewise Testable Separators. CoRR abs/1409.3943 (2014) - [i11]Tomás Masopust, Michaël Thomazo:
On $k$-piecewise testability (preliminary report). CoRR abs/1412.1641 (2014) - 2013
- [j25]Tomás Masopust:
A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata. Int. J. Found. Comput. Sci. 24(3): 319-328 (2013) - [c22]Jan Komenda, Tomás Masopust:
A bridge between decentralized and coordination control. Allerton 2013: 966-972 - [c21]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
Multilevel coordination control of modular DES. CDC 2013: 6323-6328 - [c20]Galina Jirásková, Tomás Masopust:
On the State Complexity of the Reverse of - and -Trivial Regular Languages. DCFS 2013: 136-147 - [c19]Wojciech Czerwinski, Wim Martens, Tomás Masopust:
Efficient Separability of Regular Languages by Subsequences and Suffixes. ICALP (2) 2013: 150-161 - [p4]Stefan Haar, Tomás Masopust:
Languages, Decidability, and Complexity. Control of Discrete-Event Systems 2013: 23-43 - [p3]Tomás Masopust, Jan H. van Schuppen:
Supervisory Control with Complete Observations. Control of Discrete-Event Systems 2013: 45-64 - [p2]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
Supervisory Control of Distributed Discrete-Event Systems. Control of Discrete-Event Systems 2013: 107-126 - [p1]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
Coordination Control of Distributed Discrete-Event Systems. Control of Discrete-Event Systems 2013: 147-167 - [i10]Wojciech Czerwinski, Wim Martens, Tomás Masopust:
Efficient Separability of Regular Languages by Subsequences and Suffixes. CoRR abs/1303.0966 (2013) - [i9]Galina Jirásková, Tomás Masopust:
On the State Complexity of the Reverse of R- and J-trivial Regular Languages. CoRR abs/1304.0733 (2013) - [i8]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
Coordination Control of Discrete-Event Systems Revisited. CoRR abs/1307.4332 (2013) - 2012
- [j24]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
Supervisory control synthesis of discrete-event systems using a coordination scheme. Autom. 48(2): 247-254 (2012) - [j23]Tomás Masopust:
A note on controllability of deterministic context-free systems. Autom. 48(8): 1934-1937 (2012) - [j22]Jürgen Dassow, Tomás Masopust:
On restricted context-free grammars. J. Comput. Syst. Sci. 78(1): 293-304 (2012) - [j21]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
On conditional decomposability. Syst. Control. Lett. 61(12): 1260-1268 (2012) - [j20]Galina Jirásková, Tomás Masopust:
On a structural property in the state complexity of projected regular languages. Theor. Comput. Sci. 449: 93-105 (2012) - [c18]Galina Jirásková, Tomás Masopust:
On Properties and State Complexity of Deterministic State-Partition Automata. IFIP TCS 2012: 164-178 - [c17]Galina Jirásková, Tomás Masopust:
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs. CIAA 2012: 229-239 - [c16]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
On algorithms and extensions of coordination control of discrete-event systems. WODES 2012: 245-250 - [i7]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
On Conditional Decomposability. CoRR abs/1201.1733 (2012) - [i6]Tomás Masopust:
A Note on Undecidability of Observation Consistency for Non-Regular Languages. CoRR abs/1201.1754 (2012) - [i5]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
On Algorithms and Extensions of Coordination Control of Discrete-Event Systems. CoRR abs/1207.6200 (2012) - [i4]Tomás Masopust:
A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata. CoRR abs/1208.5002 (2012) - 2011
- [j19]Zbynek Krivka, Tomás Masopust:
Cooperating Distributed Grammar Systems with Random Context Grammars as Components. Acta Cybern. 20(2): 269-283 (2011) - [j18]Olivier Boutin, Jan Komenda, Tomás Masopust, Nicola Pambakian, Jan H. van Schuppen, Pia L. Kempker, André C. M. Ran:
Control of Distributed Systems: Tutorial and Overview. Eur. J. Control 17(5-6): 579-602 (2011) - [j17]Erzsébet Csuhaj-Varjú, Tomás Masopust, György Vaszil:
Blackhole Pushdown Automata. Fundam. Informaticae 112(2-3): 137-156 (2011) - [j16]Galina Jirásková, Tomás Masopust:
Complexity in Union-Free Regular Languages. Int. J. Found. Comput. Sci. 22(7): 1639-1653 (2011) - [j15]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator. Syst. Control. Lett. 60(7): 492-502 (2011) - [c15]Olivier Boutin, Jan Komenda, Tomás Masopust, Klaus Schmidt, Jan H. van Schuppen:
Hierarchical control with partial observations: Sufficient conditions. CDC/ECC 2011: 1817-1822 - [c14]Galina Jirásková, Tomás Masopust:
State Complexity of Projected Languages. DCFS 2011: 198-211 - 2010
- [j14]Tomás Masopust:
Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals. Fundam. Informaticae 99(4): 473-480 (2010) - [j13]Tomás Masopust:
Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case. Fundam. Informaticae 104(1-2): 111-124 (2010) - [j12]Tomás Masopust:
Simple restriction in context-free rewriting. J. Comput. Syst. Sci. 76(8): 837-846 (2010) - [j11]Filip Goldefus, Tomás Masopust, Alexander Meduna:
Left-forbidding cooperating distributed grammar systems. Theor. Comput. Sci. 411(40-42): 3661-3667 (2010) - [c13]Galina Jirásková, Tomás Masopust:
Complexity in Union-Free Regular Languages. Developments in Language Theory 2010: 255-266 - [c12]Jürgen Dassow, Tomás Masopust:
On Restricted Context-Free Grammars. Developments in Language Theory 2010: 434-435 - [c11]Erzsébet Csuhaj-Varjú, Tomás Masopust, György Vaszil:
Blackhole State-Controlled Regulated Pushdown Automata. NCMA 2010: 45-56 - [c10]Jan Komenda, Tomás Masopust:
Supremal normal sublanguages in hierarchical supervisory control. WODES 2010: 111-116 - [c9]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
Synthesis of safe sublanguages satisfying global specification using coordination scheme for discrete-event systems. WODES 2010: 426-431 - [i3]Tomás Masopust:
Comparison of Two Context-Free Rewriting Systems with Simple Context-Checking Mechanisms. CoRR abs/1004.3635 (2010) - [i2]Jan Komenda, Tomás Masopust, Jan H. van Schuppen:
Supervisory Control Synthesis of Discrete-Event Systems using Coordination Scheme. CoRR abs/1007.2707 (2010)
2000 – 2009
- 2009
- [j10]Tomás Masopust, Alexander Meduna:
On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. Acta Cybern. 19(2): 537-552 (2009) - [j9]Tomás Masopust:
On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components. Int. J. Found. Comput. Sci. 20(2): 331-340 (2009) - [j8]Tomás Masopust, Alexander Meduna:
On context-free rewriting with a simple restriction and its computational completeness. RAIRO Theor. Informatics Appl. 43(2): 365-378 (2009) - [j7]Tomás Masopust:
On the descriptional complexity of scattered context grammars. Theor. Comput. Sci. 410(1): 108-112 (2009) - [c8]Zbynek Krivka, Tomás Masopust:
A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking. ICTCS 2009: 129-135 - [c7]Tomás Masopust:
A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions. LATA 2009: 554-565 - [c6]Tomás Masopust:
Regulated Nondeterminism in PDAs: The Non-Regular Case. NCMA 2009: 181-194 - [c5]Tomás Masopust, Alexander Meduna:
Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement. DCFS 2009: 183-192 - [i1]Tomás Masopust:
Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata". CoRR abs/0905.4193 (2009) - 2008
- [j6]Tomás Masopust, Alexander Meduna, Jirí Simácek:
Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. Acta Cybern. 18(4): 783-793 (2008) - [j5]Tomás Masopust, Jirí Techet:
Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof. Discret. Math. Theor. Comput. Sci. 10(2) (2008) - [j4]Tomás Masopust, Alexander Meduna:
On Descriptional Complexity of Partially Parallel Grammars. Fundam. Informaticae 87(3-4): 407-415 (2008) - [j3]Tomás Masopust:
Descriptional complexity of multi-parallel grammars. Inf. Process. Lett. 108(2): 68-70 (2008) - [c4]Tomás Masopust, Alexander Meduna:
On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops. AFL 2008: 325-336 - 2007
- [j2]Alexander Meduna, Tomás Masopust:
Self-Regulating Finite Automata. Acta Cybern. 18(1): 135-153 (2007) - [j1]Tomás Masopust, Alexander Meduna:
Descriptional complexity of semi-conditional grammars. Inf. Process. Lett. 104(1): 29-31 (2007) - [c3]Tomás Masopust, Alexander Meduna:
Descriptional Complexity of Generalized Forbidding Grammars. DCFS 2007: 170-177 - [c2]Tomás Masopust:
A Note on the Descriptional Complexity of Semi-Conditional Grammars. Workshop on Formal Models 2007 - [c1]Tomás Masopust, Alexander Meduna:
Descriptional Complexity of Grammars Regulated by Context Conditions. LATA 2007: 403-412
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 2025-01-21 00:14 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:
