default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Mayr
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
[c65]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke
:
Memoryless Strategies in Stochastic Reachability Games. Taming the Infinities of Concurrency 2024: 225-242- [c64]Mohan Dantam, Richard Mayr:
Finite-Memory Strategies for Almost-Sure Energy-MeanPayoff Objectives in MDPs. ICALP 2024: 133:1-133:17 - [i30]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Memoryless Strategies in Stochastic Reachability Games. CoRR abs/2401.13390 (2024) - [i29]Mohan Dantam, Richard Mayr:
Finite-memory Strategies for Almost-sure Energy-MeanPayoff Objectives in MDPs. CoRR abs/2404.14522 (2024) - [i28]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Strategy Complexity of B\"uchi Objectives in Concurrent Stochastic Games. CoRR abs/2404.15483 (2024) - 2023
- [j22]Richard Mayr, Eric Munday:
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs. Log. Methods Comput. Sci. 19(1) (2023) - [c63]Mohan Dantam, Richard Mayr:
Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games. MFCS 2023: 38:1-38:15 - [i27]Mohan Dantam, Richard Mayr:
Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games. CoRR abs/2307.05762 (2023) - 2022
- [i26]Richard Mayr, Eric Munday:
Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs. CoRR abs/2203.07079 (2022) - [i25]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. CoRR abs/2203.12024 (2022) - 2021
- [c62]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Transience in Countable MDPs. CONCUR 2021: 11:1-11:15 - [c61]Richard Mayr, Eric Munday:
Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs. CONCUR 2021: 12:1-12:15 - [c60]Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak:
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. FoSSaCS 2021: 427-447 - [i24]Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak:
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP. CoRR abs/2101.06989 (2021) - [i23]Richard Mayr, Eric Munday:
Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs. CoRR abs/2107.03287 (2021) - 2020
- [c59]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Strategy Complexity of Parity Objectives in Countable MDPs. CONCUR 2020: 39:1-39:17 - [c58]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke, Dominik Wojtczak:
How to Play in Infinite MDPs (Invited Talk). ICALP 2020: 3:1-3:18 - [i22]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Strategy Complexity of Parity Objectives in Countable MDPs. CoRR abs/2007.05065 (2020) - [i21]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Transience in Countable MDPs. CoRR abs/2012.13739 (2020)
2010 – 2019
- 2019
- [j21]Lorenzo Clemente, Richard Mayr:
Efficient reduction of nondeterministic automata with application to language inclusion testing. Log. Methods Comput. Sci. 15(1) (2019) - [c57]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Büchi Objectives in Countable MDPs. ICALP 2019: 119:1-119:14 - [i20]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Patrick Totzke:
Büchi Objectives in Countable MDPs. CoRR abs/1904.11573 (2019) - 2018
- [j20]Antonín Kucera, Richard Mayr:
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata. J. Comput. Syst. Sci. 91: 82-103 (2018) - [j19]Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell:
Model Checking Flat Freeze LTL on One-Counter Automata. Log. Methods Comput. Sci. 14(4) (2018) - [c56]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke:
Universal Safety for Timed Petri Nets is PSPACE-complete. CONCUR 2018: 6:1-6:15 - [i19]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, Patrick Totzke:
Universal Safety for Timed Petri Nets is PSPACE-complete. CoRR abs/1806.08170 (2018) - 2017
- [c55]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak:
Parity objectives in countable MDPs. LICS 2017: 1-11 - [c54]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak:
On strong determinacy of countable stochastic games. LICS 2017: 1-12 - [c53]Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak:
MDPs with energy-parity objectives. LICS 2017: 1-12 - [i18]Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak:
MDPs with Energy-Parity Objectives. CoRR abs/1701.02546 (2017) - [i17]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak:
Parity Objectives in Countable MDPs. CoRR abs/1704.04490 (2017) - [i16]Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak:
On Strong Determinacy of Countable Stochastic Games. CoRR abs/1704.05003 (2017) - [i15]Lorenzo Clemente, Richard Mayr:
Efficient reduction of nondeterministic automata with application to language inclusion testing. CoRR abs/1711.09946 (2017) - 2016
- [j18]Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke:
Simulation Problems Over One-Counter Nets. Log. Methods Comput. Sci. 12(1) (2016) - [j17]Richard Mayr, Patrick Totzke:
Branching-Time Model Checking Gap-Order Constraint Systems. Fundam. Informaticae 143(3-4): 339-353 (2016) - [c52]Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell:
Model Checking Flat Freeze LTL on One-Counter Automata. CONCUR 2016: 29:1-29:14 - [c51]Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston:
Qualitative Analysis of VASS-Induced MDPs. FoSSaCS 2016: 319-334 - [c50]Ricardo Almeida, Lukás Holík, Richard Mayr:
Reduction of Nondeterministic Tree Automata. TACAS 2016: 717-735 - [i14]Antonia Lechner, Richard Mayr, Joël Ouaknine, Amaury Pouly, James Worrell:
Model Checking Flat Freeze LTL on One-Counter Automata. CoRR abs/1606.02643 (2016) - 2015
- [i13]Ricardo Almeida, Lukás Holík, Richard Mayr:
Reduction of Nondeterministic Tree Automata. CoRR abs/1512.08823 (2015) - [i12]Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston:
Qualitative Analysis of VASS-Induced MDPs. CoRR abs/1512.08824 (2015) - 2014
- [j16]Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg:
Stochastic Parity Games on Lossy Channel Systems. Log. Methods Comput. Sci. 10(4) (2014) - [c49]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke:
Infinite-state energy games. CSL-LICS 2014: 7:1-7:10 - [i11]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, Patrick Totzke:
Infinite-State Energy Games. CoRR abs/1405.0628 (2014) - 2013
- [j15]Parosh Aziz Abdulla, Richard Mayr:
Priced Timed Petri Nets. Log. Methods Comput. Sci. 9(4) (2013) - [c48]Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston:
Solving Parity Games on Integer Vectors. CONCUR 2013: 106-120 - [c47]Richard Mayr:
Returning Lost Elements in the Sales Process: Manum Dare. ERP Future 2013: 19-26 - [c46]Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke:
Simulation Over One-counter Nets is PSPACE-Complete. FSTTCS 2013: 515-526 - [c45]Piotr Hofman, Richard Mayr, Patrick Totzke:
Decidability of Weak Simulation on One-Counter Nets. LICS 2013: 203-212 - [c44]Richard Mayr, Lorenzo Clemente:
Advanced automata minimization. POPL 2013: 63-74 - [c43]Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg:
Stochastic Parity Games on Lossy Channel Systems. QEST 2013: 338-354 - [c42]Richard Mayr, Patrick Totzke:
Branching-Time Model Checking Gap-Order Constraint Systems. RP 2013: 171-182 - [i10]Piotr Hofman, Richard Mayr, Patrick Totzke:
Decidability of Weak Simulation on One-counter Nets. CoRR abs/1304.4104 (2013) - [i9]Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, Sven Sandberg:
Stochastic Parity Games on Lossy Channel Systems. CoRR abs/1305.5228 (2013) - [i8]Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston:
Solving Parity Games on Integer Vectors. CoRR abs/1306.2806 (2013) - [i7]Richard Mayr, Patrick Totzke:
Branching-Time Model Checking Gap-Order Constraint Systems. CoRR abs/1307.4207 (2013) - [i6]Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke:
Simulation Over One-counter Nets is PSPACE-Complete. CoRR abs/1310.6303 (2013) - 2012
- [c41]Parosh Aziz Abdulla, Richard Mayr:
Petri Nets with Time and Cost. Infinity 2012: 9-24 - [i5]Lorenzo Clemente, Richard Mayr:
Advanced Automata Minimization. CoRR abs/1210.6624 (2012) - 2011
- [j14]Steffen Heber, Richard Mayr, Jens Stoye:
Common Intervals of Multiple Permutations. Algorithmica 60(2): 175-206 (2011) - [c40]Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar:
Advanced Ramsey-Based Büchi Automata Inclusion Testing. CONCUR 2011: 187-202 - [c39]Parosh Aziz Abdulla, Richard Mayr:
Computing Optimal Coverability Costs in Priced Timed Petri Nets. LICS 2011: 399-408 - [i4]Parosh Aziz Abdulla, Richard Mayr:
Computing Optimal Coverability Costs in Priced Timed Petri Nets. CoRR abs/1104.0617 (2011) - 2010
- [j13]Antonín Kucera, Richard Mayr:
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes. Inf. Comput. 208(7): 772-796 (2010) - [c38]Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar:
Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing. CAV 2010: 132-147 - [c37]Lorenzo Clemente, Richard Mayr:
Multipebble Simulations for Alternating Automata - (Extended Abstract). CONCUR 2010: 297-312 - [c36]Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Richard Mayr, Tomás Vojnar:
When Simulation Meets Antichains. TACAS 2010: 158-174
2000 – 2009
- 2009
- [c35]Parosh Aziz Abdulla, Richard Mayr:
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. FoSSaCS 2009: 348-363 - [c34]Stefan Göller, Richard Mayr, Anthony Widjaja To:
On the Computational Complexity of Verifying One-Counter Processes. LICS 2009: 235-244 - 2008
- [c33]Parosh Aziz Abdulla, Noomene Ben Henda, Luca de Alfaro, Richard Mayr, Sven Sandberg:
Stochastic Games with Lossy Channels. FoSSaCS 2008: 35-49 - 2007
- [j12]Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr:
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness. Log. Methods Comput. Sci. 3(1) (2007) - [j11]Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr:
Decisive Markov Chains. Log. Methods Comput. Sci. 3(4) (2007) - [i3]Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr:
Decisive Markov Chains. CoRR abs/0706.2585 (2007) - 2006
- [j10]Antonín Kucera, Javier Esparza, Richard Mayr:
Model Checking Probabilistic Pushdown Automata. Log. Methods Comput. Sci. 2(1) (2006) - [c32]Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg:
Eager Markov Chains. ATVA 2006: 24-38 - [c31]Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr, Sven Sandberg:
Limiting Behavior of Markov Chains with Eager Attractors. QEST 2006: 253-264 - [i2]Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr:
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness. CoRR abs/cs/0611048 (2006) - 2005
- [j9]Richard Mayr:
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard. Theor. Comput. Sci. 330(3): 553-575 (2005) - [c30]Javier Esparza, Antonín Kucera, Richard Mayr:
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances. LICS 2005: 117-126 - [c29]Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr:
Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property. LICS 2005: 127-136 - [i1]Javier Esparza, Antonín Kucera, Richard Mayr:
Model Checking Probabilistic Pushdown Automata. CoRR abs/cs/0508003 (2005) - 2004
- [c28]Parosh Aziz Abdulla, Pritha Mahata, Richard Mayr:
Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets. FSTTCS 2004: 58-70 - [c27]Antonín Kucera, Richard Mayr:
A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata. IFIP TCS 2004: 395-408 - [c26]Javier Esparza, Antonín Kucera, Richard Mayr:
Model Checking Probabilistic Pushdown Automata. LICS 2004: 12-21 - [c25]Stefan Leue, Richard Mayr, Wei Wei:
A Scalable Incomplete Test for Message Buffer Overflow in Promela Models. SPIN 2004: 216-233 - [c24]Stefan Leue, Richard Mayr, Wei Wei:
A Scalable Incomplete Test for the Boundedness of UML RT Models. TACAS 2004: 327-341 - 2003
- [j8]Ahmed Bouajjani, Peter Habermehl, Richard Mayr:
Automatic verification of recursive procedures with one integer parameter. Theor. Comput. Sci. 295: 85-106 (2003) - [j7]Richard Mayr:
Undecidable problems in unreliable computations. Theor. Comput. Sci. 297(1-3): 337-354 (2003) - [c23]Richard Mayr:
Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes. ICALP 2003: 570-583 - [c22]Richard Mayr:
Weak Bisimilarity and Regularity of Context-Free Processes is EXPTIME-hard. EXPRESS 2003: 153-172 - [e2]Antonín Kucera, Richard Mayr:
4th International Workshop on Verification of Infinite-State Systems (CONCUR 2002 Satellite Workshop), Infinity 2002, Brno, Czech Republic, August 24, 2002. Electronic Notes in Theoretical Computer Science 68(6), Elsevier 2003 [contents] - 2002
- [j6]Antonín Kucera, Richard Mayr:
Simulation Preorder over Simple Process Algebras. Inf. Comput. 173(2): 184-198 (2002) - [j5]Antonín Kucera, Richard Mayr:
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. Theor. Comput. Sci. 270(1-2): 677-700 (2002) - [c21]Antonín Kucera, Richard Mayr:
Why Is Simulation Harder than Bisimulation? CONCUR 2002: 594-610 - [c20]Antonín Kucera, Richard Mayr:
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. MFCS 2002: 433-445 - [c19]Antonín Kucera, Richard Mayr:
Preface. INFINITY 2002: 107-108 - 2001
- [j4]Richard Mayr:
Decidability of model checking with the temporal logic EF. Theor. Comput. Sci. 256(1-2): 31-62 (2001) - [j3]Petr Jancar, Antonín Kucera, Richard Mayr:
Deciding bisimulation-like equivalences with finite-state processes. Theor. Comput. Sci. 258(1-2): 409-433 (2001) - [c18]Ahmed Bouajjani, Peter Habermehl, Richard Mayr:
Automatic Verification of Recursive Procedures with One Integer Parameter. MFCS 2001: 198-211 - [c17]Richard Mayr:
Introduction - Verification of Parameterized Systems - VEPAS 2001. VEPAS 2001: 401-402 - [e1]Richard Mayr:
Verification of Parameterized Systems, VEPAS 2001, Satellite Workshop of ICALP 2001, Crete, Greece, July 13, 2001. Electronic Notes in Theoretical Computer Science 50(4), Elsevier 2001 [contents] - 2000
- [j2]Richard Mayr:
Process Rewrite Systems. Inf. Comput. 156(1-2): 264-286 (2000) - [c16]Richard Mayr:
On the Complexity of Bisimulation Problems for Basic Parallel Processes. ICALP 2000: 329-341 - [c15]Richard Mayr:
On the Complexity of Bisimulation Problems for Pushdown Automata. IFIP TCS 2000: 474-488 - [c14]Richard Mayr:
Undecidable Problems in Unreliable Computations. LATIN 2000: 377-386
1990 – 1999
- 1999
- [c13]Antonín Kucera, Richard Mayr:
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. CONCUR 1999: 368-382 - [c12]Antonín Kucera, Richard Mayr:
Simulation Preorder on Simple Process Algebras. ICALP 1999: 503-512 - [c11]Javier Esparza, Alain Finkel, Richard Mayr:
On the Verification of Broadcast Protocols. LICS 1999: 352-359 - [c10]Ahmed Bouajjani, Richard Mayr:
Model Checking Lossy Vector Addition Systems. STACS 1999: 323-333 - 1998
- [b1]Richard Mayr:
Decidability and complexity of model checking problems for infinite state systems. Technical University Munich, Germany, 1998, pp. 1-190 - [j1]Richard Mayr, Tobias Nipkow:
Higher-Order Rewrite Systems and Their Confluence. Theor. Comput. Sci. 192(1): 3-29 (1998) - [c9]Petr Jancar, Antonín Kucera, Richard Mayr:
Deciding Bisimulation-Like Equivalences with Finite-State Processes. ICALP 1998: 200-211 - [c8]Richard Mayr:
Strict Lower Bounds for Model Checking BPA. MFCS Workshop on Concurrency 1998: 147-158 - 1997
- [c7]Richard Mayr:
Model Checking PA-Processes. CONCUR 1997: 332-346 - [c6]Richard Mayr, Annette Schelten:
Polynomial Time Approximation Schemes for Geometric Optimization Problems in Euclidean Metric Spaces. Lectures on Proof Verification and Approximation Algorithms 1997: 313-324 - [c5]Richard Mayr:
Tableau Methods for PA-Processes. TABLEAUX 1997: 276-290 - [c4]Richard Mayr:
Combining Petri Nets and PA-Processes. TACS 1997: 547-561 - [c3]Richard Mayr:
Process rewrite systems. EXPRESS 1997: 185-205 - 1996
- [c2]Richard Mayr:
Weak Bisimulation and Model Checking for Basic Parallel Processes. FSTTCS 1996: 88-99 - [c1]Richard Mayr:
Semantic reachability. INFINITY 1996: 18-28
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-08-05 21:19 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:
