default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMargus Veanes
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
[c78]Ekaterina Zhuchko, Margus Veanes, Gabriel Ebner:
Lean Formalization of Extended Regular Expression Matching with Lookarounds. CPP 2024: 118-131- [c77]Margus Veanes:
On Symbolic Derivatives and Transition Regexes. LPAR Complementary Volume 2024: 152-162 - [i7]Ian Erik Varatalu, Margus Veanes, Juhan-Peep Ernits:
RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement and Lookarounds. CoRR abs/2407.20479 (2024) - 2023
- [j23]Dan Moseley
, Mario Nishio, Jose Perez Rodriguez, Olli Saarikivi, Stephen Toub, Margus Veanes, Tiki Wan, Eric Xu:
Derivative Based Nonbacktracking Real-World Regex Matching with Backtracking Semantics. Proc. ACM Program. Lang. 7(PLDI): 1026-1049 (2023) - [c76]Caleb Stanford, Margus Veanes:
Incremental Dead State Detection in Logarithmic Time. CAV (2) 2023: 241-264 - [i6]Caleb Stanford, Margus Veanes:
Incremental Dead State Detection in Logarithmic Time. CoRR abs/2301.05308 (2023) - [i5]Ian Erik Varatalu, Margus Veanes, Juhan-Peep Ernits:
Derivative Based Extended Regular Expression Matching Supporting Intersection, Complement and Lookarounds. CoRR abs/2309.14401 (2023) - [i4]Margus Veanes, Thomas Ball, Gabriel Ebner, Olli Saarikivi:
Symbolic Automata: ω-Regularity Modulo Theories. CoRR abs/2310.02393 (2023) - 2022
- [c75]Lenka Turonová, Lukás Holík, Ivan Homoliak, Ondrej Lengál, Margus Veanes, Tomás Vojnar:
Counting in Regexes Considered Harmful: Exposing ReDoS Vulnerability of Nonbacktracking Matchers. USENIX Security Symposium 2022: 4165-4182 - 2021
- [j22]Loris D'Antoni, Margus Veanes:
Automata modulo theories. Commun. ACM 64(5): 86-95 (2021) - [c74]Caleb Stanford, Margus Veanes, Nikolaj S. Bjørner:
Symbolic Boolean derivatives for efficiently solving extended regular expression constraints. PLDI 2021: 620-635 - 2020
- [j21]Lenka Turonová, Lukás Holík, Ondrej Lengál, Olli Saarikivi, Margus Veanes, Tomás Vojnar:
Regex matching with counting-set automata. Proc. ACM Program. Lang. 4(OOPSLA): 218:1-218:30 (2020) - [d3]Lukás Holík, Ondrej Lengál, Olli Saarikivi, Lenka Turonová, Margus Veanes, Tomás Vojnar:
Dataset for the OOPSLA'20 paper "Regex Matching with Counting-Set Automata". Zenodo, 2020
- [d2]Lukás Holík, Ondrej Lengál, Olli Saarikivi, Lenka Turonová, Margus Veanes, Tomás Vojnar:
Dataset for the OOPSLA'20 paper "Regex Matching with Counting-Set Automata". Zenodo, 2020 - [d1]Lukás Holík, Ondrej Lengál, Olli Saarikivi, Lenka Turonová, Margus Veanes, Tomás Vojnar:
Artifact for the OOPSLA'20 paper "Regex Matching with Counting-Set Automata". Zenodo, 2020
2010 – 2019
- 2019
- [c73]Lukás Holík, Ondrej Lengál, Olli Saarikivi, Lenka Turonová, Margus Veanes, Tomás Vojnar:
Succinct Determinisation of Counting Automata via Sphere Construction. APLAS 2019: 468-489 - [c72]Guoqing Harry Xu, Margus Veanes, Michael Barnett, Madan Musuvathi, Todd Mytkowicz, Ben Zorn, Huan He, Haibo Lin:
Niijima: sound and automated computation consolidation for efficient multilingual data-parallel pipelines. SOSP 2019: 306-321 - [c71]Olli Saarikivi, Margus Veanes, Tiki Wan, Eric Xu:
Symbolic Regex Matcher. TACAS (1) 2019: 372-378 - [i3]Lukás Holík, Ondrej Lengál, Olli Saarikivi, Lenka Turonová, Margus Veanes, Tomás Vojnar:
Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report). CoRR abs/1910.01996 (2019) - 2018
- [c70]Lukás Holík, Ondrej Lengál, Juraj Síc, Margus Veanes, Tomás Vojnar:
Simulation Algorithms for Symbolic Automata. ATVA 2018: 109-125 - [c69]Hellis Tamm, Margus Veanes:
Theoretical Aspects of Symbolic Automata. SOFSEM 2018: 428-441 - [e4]Gilles Barthe, Konstantin Korovin, Stephan Schulz, Martin Suda, Geoff Sutcliffe, Margus Veanes:
LPAR-22 Workshop and Short Paper Proceedings, Awassa, Ethiopia, 16-21 November 2018. Kalpa Publications in Computing 9, EasyChair 2018 [contents] - [e3]Gilles Barthe, Geoff Sutcliffe, Margus Veanes:
LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 16-21 November 2018. EPiC Series in Computing 57, EasyChair 2018 [contents] - [i2]Lukás Holík, Ondrej Lengál, Juraj Síc, Margus Veanes, Tomás Vojnar:
Simulation Algorithms for Symbolic Automata (Technical Report). CoRR abs/1807.08487 (2018) - 2017
- [j20]Lucas Silva Figueiredo, David Molnar, Margus Veanes, Benjamin Livshits:
Prepose: Privacy, Security, and Reliability for Gesture-Based Programming. IEEE Secur. Priv. 15(2): 14-23 (2017) - [j19]Margus Veanes, Nikolaj S. Bjørner, Lev Nachmanson, Sergey Bereg:
Monadic Decomposition. J. ACM 64(2): 14:1-14:28 (2017) - [c68]Loris D'Antoni, Margus Veanes:
The Power of Symbolic Automata and Transducers. CAV (1) 2017: 47-67 - [c67]Olli Saarikivi, Margus Veanes:
Minimization of Symbolic Transducers. CAV (2) 2017: 176-196 - [c66]Margus Veanes:
Symbolic Automata Theory with Applications (Invited Talk). CSL 2017: 7:1-7:3 - [c65]Olli Saarikivi, Margus Veanes:
Translating C# to Branching Symbolic Transducers. LPAR (Short Presentations) 2017: 86-99 - [c64]Olli Saarikivi, Margus Veanes, Todd Mytkowicz, Madan Musuvathi:
Fusing effectful comprehensions. PLDI 2017: 17-32 - [c63]Loris D'Antoni, Margus Veanes:
Monadic second-order logic on finite sequences. POPL 2017: 232-245 - [c62]Loris D'Antoni, Margus Veanes:
Forward Bisimulations for Nondeterministic Symbolic Finite Automata. TACAS (1) 2017: 518-534 - 2016
- [c61]Loris D'Antoni, Margus Veanes:
Minimization of Symbolic Tree Automata. LICS 2016: 873-882 - [c60]Lucas Silva Figueiredo, Benjamin Livshits, David Molnar, Margus Veanes:
Prepose: Privacy, Security, and Reliability for Gesture-Based Programming. IEEE Symposium on Security and Privacy 2016: 122-137 - 2015
- [j18]Loris D'Antoni, Margus Veanes:
Extended symbolic finite automata and transducers. Formal Methods Syst. Des. 47(1): 93-119 (2015) - [j17]Margus Veanes, Nikolaj S. Bjørner:
Symbolic tree automata. Inf. Process. Lett. 115(3): 418-424 (2015) - [j16]Loris D'Antoni, Margus Veanes, Benjamin Livshits, David Molnar:
Fast: A Transducer-Based Language for Tree Manipulation. ACM Trans. Program. Lang. Syst. 38(1): 1:1-1:32 (2015) - [c59]Margus Veanes, Nikolaj S. Bjørner:
Equivalence of Finite-Valued Symbolic Finite Transducers. Ershov Memorial Conference 2015: 276-290 - [c58]Loris D'Antoni, Margus Veanes:
Symbolic WS1S. LPAR (short papers) 2015: 59-66 - [c57]Margus Veanes, Todd Mytkowicz, David Molnar, Benjamin Livshits:
Data-Parallel String-Manipulating Programs. POPL 2015: 139-152 - [c56]Robert A. Cochran, Loris D'Antoni, Benjamin Livshits, David Molnar, Margus Veanes:
Program Boosting: Program Synthesis via Crowd-Sourcing. POPL 2015: 677-688 - 2014
- [c55]Margus Veanes, Nikolaj S. Bjørner, Lev Nachmanson, Sergey Bereg:
Monadic Decomposition. CAV 2014: 628-645 - [c54]Margus Veanes:
Symbolic String Transformations with Regular Lookahead and Rollback. Ershov Memorial Conference 2014: 335-350 - [c53]Konstantin Korovin, Margus Veanes:
Skolemization Modulo Theories. ICMS 2014: 303-306 - [c52]Loris D'Antoni, Margus Veanes, Benjamin Livshits, David Molnar:
Fast: a transducer-based language for tree manipulation. PLDI 2014: 384-394 - [c51]Loris D'Antoni, Margus Veanes:
Minimization of symbolic automata. POPL 2014: 541-554 - 2013
- [c50]Loris D'Antoni, Margus Veanes:
Equivalence of Extended Symbolic Finite Transducers. CAV 2013: 624-639 - [c49]Loris D'Antoni, Alan M. Dunn, Suman Jana, Tadayoshi Kohno, Benjamin Livshits, David Molnar, Alexander Moshchuk, Eyal Ofek, Franziska Roesner, T. Scott Saponas, Margus Veanes, Helen J. Wang:
Operating System Support for Augmented Reality Applications. HotOS 2013 - [c48]Margus Veanes, Nikolaj S. Bjørner, Lev Nachmanson, Sergey Bereg:
Effectively Monadic Predicates. LPAR (short papers) 2013: 97-103 - [c47]Loris D'Antoni, Margus Veanes:
Static Analysis of String Encoders and Decoders. VMCAI 2013: 209-228 - [c46]Margus Veanes:
Applications of Symbolic Finite Automata. CIAA 2013: 16-23 - [e2]Margus Veanes, Luca Viganò:
Tests and Proofs - 7th International Conference, TAP@STAF 2013, Budapest, Hungary, June 16-20, 2013. Proceedings. Lecture Notes in Computer Science 7942, Springer 2013, ISBN 978-3-642-38915-3 [contents] - [i1]Thierry Jéron, Margus Veanes, Burkhart Wolff:
Symbolic Methods in Testing (Dagstuhl Seminar 13021). Dagstuhl Reports 3(1): 1-29 (2013) - 2012
- [j15]Margus Veanes, Nikolaj S. Bjørner:
Alternating simulation and IOCO. Int. J. Softw. Tools Technol. Transf. 14(4): 387-405 (2012) - [c45]Nikolaj S. Bjørner, Vijay Ganesh, Raphaël Michel, Margus Veanes:
SMT-LIB Sequences and Regular Expressions. SMT@IJCAR 2012: 77-87 - [c44]Margus Veanes, Pieter Hooimeijer, Benjamin Livshits, David Molnar, Nikolaj S. Bjørner:
Symbolic finite state transducers: algorithms and applications. POPL 2012: 137-150 - [c43]Thomas Ball, Nikolaj S. Bjørner, Leonardo Mendonça de Moura, Kenneth L. McMillan, Margus Veanes:
Beyond First-Order Satisfaction: Fixed Points, Interpolants, Automata and Polynomials. SPIN 2012: 1-6 - [c42]Margus Veanes, Nikolaj S. Bjørner:
Symbolic Automata: The Toolkit. TACAS 2012: 472-477 - 2011
- [j14]Margus Veanes, Nikolaj S. Bjørner:
Foundations of Finite Symbolic Tree Transducers. Bull. EATCS 105: 141-173 (2011) - [c41]Margus Veanes, Nikolaj S. Bjørner:
Symbolic Tree Transducers. Ershov Memorial Conference 2011: 377-393 - [c40]Pieter Hooimeijer, Benjamin Livshits, David Molnar, Prateek Saxena, Margus Veanes:
Fast and Precise Sanitizer Analysis with BEK. USENIX Security Symposium 2011 - [c39]Pieter Hooimeijer, Margus Veanes:
An Evaluation of Automata Algorithms for String Analysis. VMCAI 2011: 248-262 - 2010
- [j13]Margus Veanes, Jonathan Jacky:
Composing model programs for analysis. J. Log. Algebraic Methods Program. 79(7): 467-482 (2010) - [c38]Margus Veanes, Peli de Halleux, Nikolai Tillmann:
Rex: Symbolic Regular Expression Explorer. ICST 2010: 498-507 - [c37]Margus Veanes, Nikolai Tillmann, Jonathan de Halleux:
Qex: Symbolic SQL Query Explorer. LPAR (Dakar) 2010: 425-446 - [c36]Margus Veanes, Nikolaj S. Bjørner, Leonardo Mendonça de Moura:
Symbolic Automata Constraint Solving. LPAR (Yogyakarta) 2010: 640-654 - [c35]Margus Veanes, Nikolaj S. Bjørner:
Alternating Simulation and IOCO. ICTSS 2010: 47-62
2000 – 2009
- 2009
- [j12]Margus Veanes, Nikolaj S. Bjørner, Yuri Gurevich, Wolfram Schulte:
Symbolic Bounded Model Checking of Abstract State Machines. Int. J. Softw. Informatics 3(2-3): 149-170 (2009) - [c34]Margus Veanes, Nikolaj S. Bjørner:
Symbolic Bounded Conformance Checking of Model Programs. Ershov Memorial Conference 2009: 388-400 - [c33]Margus Veanes, Pavel Grigorenko, Peli de Halleux, Nikolai Tillmann:
Symbolic Query Exploration. ICFEM 2009: 49-68 - [c32]Margus Veanes, Nikolaj S. Bjørner:
Input-Output Model Programs. ICTAC 2009: 322-335 - [c31]Juhan P. Ernits, Rivo Roo, Jonathan Jacky, Margus Veanes:
Model-Based Testing of Web Applications Using NModel. TestCom/FATES 2009: 211-216 - 2008
- [c30]Margus Veanes, Ando Saabas:
Using Satisfiability Modulo Theories to Analyze Abstract State Machines (Abstract). ABZ 2008: 355 - [c29]Margus Veanes, Nikolaj S. Bjørner, Alexander Raschke:
An SMT Approach to Bounded Reachability Analysis of Model Programs. FORTE 2008: 53-68 - [c28]Margus Veanes, Wolfram Schulte:
Protocol Modeling with Model Program Composition. FORTE 2008: 324-339 - [c27]Margus Veanes, Colin Campbell, Wolfgang Grieskamp, Wolfram Schulte, Nikolai Tillmann, Lev Nachmanson:
Model-Based Testing of Object-Oriented Reactive Systems with Spec Explorer. Formal Methods and Testing 2008: 39-76 - [c26]Margus Veanes, Ando Saabas:
On Bounded Reachability of Programs with Set Comprehensions. LPAR 2008: 305-317 - 2007
- [j11]Yuri Gurevich, Margus Veanes, Charles Wallace:
Can abstract state machines be useful in language theory? Theor. Comput. Sci. 376(1-2): 17-29 (2007) - [c25]Margus Veanes, Juhan P. Ernits, Colin Campbell:
State Isomorphism in Model Programs with Abstract Data Structures. FORTE 2007: 112-127 - [c24]Margus Veanes, Colin Campbell, Wolfram Schulte:
Composition of Model Programs. FORTE 2007: 128-142 - [c23]Johannes Helander, Risto Serg, Margus Veanes, Pritam Roy:
Adapting Futures: Scalability for Real-World Computing. RTSS 2007: 105-118 - [e1]Alexandre Petrenko, Margus Veanes, Jan Tretmans, Wolfgang Grieskamp:
Testing of Software and Communicating Systems, 19th IFIP TC6/WG6.1 International Conference, TestCom 2007, 7th International Workshop, FATES 2007, Tallinn, Estonia, June 26-29, 2007, Proceedings. Lecture Notes in Computer Science 4581, Springer 2007, ISBN 978-3-540-73065-1 [contents] - 2006
- [c22]Margus Veanes, Pritam Roy, Colin Campbell:
Online Testing with Reinforcement Learning. FATES/RV 2006: 240-253 - 2005
- [c21]Colin Campbell, Margus Veanes:
State Exploration with Multiple State Groupings. Abstract State Machines 2005: 119-130 - [c20]Andreas Blass, Yuri Gurevich, Lev Nachmanson, Margus Veanes:
Play to Test. FATES 2005: 32-46 - [c19]Colin Campbell, Wolfgang Grieskamp, Lev Nachmanson, Wolfram Schulte, Nikolai Tillmann, Margus Veanes:
Testing Concurrent Object-Oriented Systems with Spec Explorer. FM 2005: 542-547 - [c18]Colin Campbell, Margus Veanes, Jiale Huo, Alexandre Petrenko:
Multiplexing of Partially Ordered Events. TestCom 2005: 97-110 - [c17]Wolfgang Grieskamp, Nikolai Tillmann, Colin Campbell, Wolfram Schulte, Margus Veanes:
Action Machines - Towards a Framework for Model Composition, Exploration and Conformance Testing Based on Symbolic Computation. QSIC 2005: 72-82 - [c16]Margus Veanes, Colin Campbell, Wolfram Schulte, Nikolai Tillmann:
Online testing with model programs. ESEC/SIGSOFT FSE 2005: 273-282 - 2004
- [j10]Wolfgang Grieskamp, Nikolai Tillmann, Margus Veanes:
Instrumenting scenarios in a model-driven development environment. Inf. Softw. Technol. 46(15): 1027-1036 (2004) - [j9]Uwe Glässer, Yuri Gurevich, Margus Veanes:
Abstract Communication Model for Distributed Systems. IEEE Trans. Software Eng. 30(7): 458-472 (2004) - [c15]Lev Nachmanson, Margus Veanes, Wolfram Schulte, Nikolai Tillmann, Wolfgang Grieskamp:
Optimal strategies for testing nondeterministic systems. ISSTA 2004: 55-64 - 2003
- [c14]Wolfgang Grieskamp, Lev Nachmanson, Nikolai Tillmann, Margus Veanes:
Test Case Generation from AsmL Specifications. Abstract State Machines 2003: 413 - [c13]Michael Barnett, Wolfgang Grieskamp, Lev Nachmanson, Wolfram Schulte, Nikolai Tillmann, Margus Veanes:
Towards a Tool Environment for Model-Based Testing with AsmL. FATES 2003: 252-266 - [c12]Michael Barnett, Wolfgang Grieskamp, Wolfram Schulte, Nikolai Tillmann, Margus Veanes:
Validating Use-Cases with the AsmL Test Tool. QSIC 2003: 238-246 - 2002
- [c11]Margus Veanes:
Modeling Software: From Theory to Practice. FSTTCS 2002: 37-46 - [c10]Uwe Glässer, Yuri Gurevich, Margus Veanes:
High-Level Executable Specification of the Universal Plug and Play Architecture. HICSS 2002: 283 - [c9]Uwe Glässer, Margus Veanes:
Universal Plug and Play Machine Models. DIPES 2002: 21-30 - [c8]Wolfgang Grieskamp, Yuri Gurevich, Wolfram Schulte, Margus Veanes:
Generating finite state machines from abstract state machines. ISSTA 2002: 112-122 - 2000
- [j8]Jordi Levy, Margus Veanes:
On the Undecidability of Second-Order Unification. Inf. Comput. 159(1-2): 125-150 (2000) - [j7]Harald Ganzinger, Florent Jacquemard, Margus Veanes:
Rigid Reachability, The Non-Symmetric Form of Rigid E-Unification. Int. J. Found. Comput. Sci. 11(1): 3-27 (2000) - [j6]Margus Veanes:
Farmer's Theorem revisited. Inf. Process. Lett. 74(1-2): 47-53 (2000) - [j5]Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov:
Decidability and complexity of simultaneous rigid E-unification with one variable and related results. Theor. Comput. Sci. 243(1-2): 167-184 (2000) - [c7]Michael Barnett, Egon Börger, Yuri Gurevich, Wolfram Schulte, Margus Veanes:
Using Abstract State Machines at Microsoft: A Case Study. Abstract State Machines 2000: 367-379
1990 – 1999
- 1999
- [j4]Yuri Gurevich, Margus Veanes:
Logic with Equality: Partisan Corroboration and Shifted Pairing. Inf. Comput. 152(2): 205-235 (1999) - [c6]Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes:
Decidable Fragments of Simultaneous Rigid Reachability. ICALP 1999: 250-260 - [c5]Harald Ganzinger, Christoph Meyer, Margus Veanes:
The Two-Variable Guarded Fragment with Transitive Relations. LICS 1999: 24-34 - 1998
- [c4]Harald Ganzinger, Florent Jacquemard, Margus Veanes:
Rigid Reachability. ASIAN 1998: 4-21 - [c3]Margus Veanes:
The Relation Between Second-Order Unification and Simultaneous Rigid E-Unification. LICS 1998: 264-275 - [c2]Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov:
The Decidability of Simultaneous Rigid E-Unification with One Variable. RTA 1998: 181-195 - 1997
- [c1]Margus Veanes:
The Undecidability of Simultaneous Rigid E-Unification with Two Variables. Kurt Gödel Colloquium 1997: 305-318 - 1996
- [j3]Margus Veanes, Jonas Barklund:
On the Number of Edges in Cycletrees. Inf. Process. Lett. 57(4): 225-229 (1996) - [j2]Margus Veanes, Jonas Barklund:
Construction of Natural Cycletrees. Inf. Process. Lett. 60(6): 313-318 (1996) - [j1]Margus Veanes, Jonas Barklund:
Natural Cycletrees: Flexible Interconnection Graphs. J. Parallel Distributed Comput. 33(1): 44-54 (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-09-21 02:39 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:
