default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSasha Rubin
Person information
- affiliation: University of Sydney, School of Computer Science, NSW, Australia
- affiliation (former): University of Naples "Federico II", Italy
- affiliation (former): Vienna University of Technology, Faculty of Informatics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c63]Augusto B. Corrêa, Giuseppe De Giacomo, Malte Helmert, Sasha Rubin:
Planning with Object Creation. ICAPS 2024: 104-113- [c62]Benjamin Aminof, Giuseppe De Giacomo, Gianmarco Parretti, Sasha Rubin:
Effective Approach to LTLf Best-Effort Synthesis in Multi-Tier Environments. IJCAI 2024: 3232-3240 - [i21]Nathalie Bertrand, Pranav Ghorpade, Sasha Rubin, Bernhard Scholz, Pavle Subotic:
Reusable Formal Verification of DAG-based Consensus Protocols. CoRR abs/2407.02167 (2024) - 2023
- [j20]Bastien Maubert, Aniello Murano, Sasha Rubin:
Logical aspects of multi-agent systems. Ann. Math. Artif. Intell. 91(4): 373-374 (2023) - [c61]Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin:
Reactive Synthesis of Dominant Strategies. AAAI 2023: 6228-6235 - [c60]Benjamin Aminof, Giuseppe De Giacomo, Antonio Di Stasio, Hugo Francon, Sasha Rubin, Shufang Zhu:
sc ltlf Synthesis Under Environment Specifications for Reachability and Safety Properties. EUMAS 2023: 263-279 - [c59]Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin, Florian Zuleger:
Stochastic Best-Effort Strategies for Borel Goals. LICS 2023: 1-13 - [c58]Giovanni Pagliarini, Andrea Paradiso, Sasha Rubin, Guido Sciavicco, Ionel Eduard Stan:
Heuristic Minimization Modulo Theory of Modal Decision Trees Class-Formulas. OVERLAY@AI*IA 2023: 49-53 - [i20]Benjamin Aminof, Giuseppe De Giacomo, Antonio Di Stasio, Hugo Francon, Sasha Rubin, Shufang Zhu:
LTLf Synthesis Under Environment Specifications for Reachability and Safety Properties. CoRR abs/2308.15184 (2023) - [i19]Benjamin Aminof, Sasha Rubin, Francesco Spegni, Florian Zuleger:
Parameterized Model-checking of Discrete-Timed Networks and Symmetric-Broadcast Systems. CoRR abs/2310.02466 (2023) - 2022
- [j19]Benjamin Aminof, Aniello Murano
, Sasha Rubin, Florian Zuleger:
Verification of agent navigation in partially-known environments. Artif. Intell. 308: 103724 (2022) - [c57]Niku Gorji, Sasha Rubin:
Sufficient Reasons for Classifier Decisions in the Presence of Domain Constraints. AAAI 2022: 5660-5667 - [c56]Sophie Pinchinat, Sasha Rubin, François Schwarzentruber:
Formula Synthesis in Propositional Dynamic Logic with Shuffle. AAAI 2022: 9902-9909 - [c55]Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin, Florian Zuleger:
Beyond Strong-Cyclic: Doing Your Best in Stochastic Environments. IJCAI 2022: 2525-2531 - [c54]Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, Sasha Rubin, Moshe Y. Vardi:
Public and Private Affairs in Strategic Reasoning. KR 2022 - 2021
- [j18]Julian Gutierrez, Aniello Murano, Giuseppe Perelli, Sasha Rubin, Thomas Steeples, Michael J. Wooldridge:
Equilibria for games with combined qualitative and quantitative objectives. Acta Informatica 58(6): 585-610 (2021) - [j17]Wiebe van der Hoek, Bastien Maubert, Aniello Murano, Sasha Rubin:
Preface. Inf. Comput. 276: 104551 (2021) - [j16]Raphaël Berthon, Bastien Maubert, Aniello Murano, Sasha Rubin, Moshe Y. Vardi:
Strategy Logic with Imperfect Information. ACM Trans. Comput. Log. 22(1): 5:1-5:51 (2021) - [j15]Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre:
Alternating Tree Automata with Qualitative Semantics. ACM Trans. Comput. Log. 22(1): 7:1-7:24 (2021) - [c53]Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin:
Best-Effort Synthesis: Doing Your Best Is Not Harder Than Giving Up. IJCAI 2021: 1766-1772 - [c52]Francesco Belardinelli, Sophia Knight, Alessio Lomuscio, Bastien Maubert, Aniello Murano, Sasha Rubin:
Reasoning About Agents That May Know Other Agents' Strategies. IJCAI 2021: 1787-1793 - [c51]Benjamin Aminof, Giuseppe De Giacomo, Alessio Lomuscio, Aniello Murano, Sasha Rubin:
Synthesizing Best-effort Strategies under Multiple Environment Specifications. KR 2021: 42-51 - [p2]Sasha Rubin:
Automatic structures. Handbook of Automata Theory (II.) 2021: 1031-1070 - [i18]Niku Gorji, Sasha Rubin:
Sufficient reasons for classifier decisions in the presence of constraints. CoRR abs/2105.06001 (2021) - 2020
- [j14]Francesco Belardinelli, Alessio Lomuscio, Aniello Murano, Sasha Rubin:
Verification of multi-agent systems with public actions against strategy logic. Artif. Intell. 285: 103302 (2020) - [j13]Aniello Murano, Mimmo Parente, Sasha Rubin, Loredana Sorrentino:
Model-checking graded computation-tree logic with finite path semantics. Theor. Comput. Sci. 806: 577-586 (2020) - [j12]Aniello Murano, Sasha Rubin:
Preface. Theor. Comput. Sci. 815: 246 (2020) - [c50]Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin:
Stochastic Fairness and Language-Theoretic Fairness in Planning in Nondeterministic Domains. ICAPS 2020: 20-28 - [c49]Benjamin Aminof, Giuseppe De Giacomo, Alessio Lomuscio, Aniello Murano, Sasha Rubin:
Synthesizing strategies under expected and exceptional environment behaviors. IJCAI 2020: 1674-1680 - [c48]Giuseppe De Giacomo, Antonio Di Stasio, Francesco Fuggitti, Sasha Rubin:
Pure-Past Linear Temporal and Dynamic Logic on Finite Traces. IJCAI 2020: 4959-4965 - [c47]Blai Bonet, Giuseppe De Giacomo, Hector Geffner, Fabio Patrizi, Sasha Rubin:
High-level Programming via Generalized Planning and LTL Synthesis. KR 2020: 152-161 - [c46]Aniello Murano, Sasha Rubin, Martin Zimmermann:
Optimal Strategies in Weighted Limit Games. GandALF 2020: 114-130 - [i17]Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre:
Alternating Tree Automata with Qualitative Semantics. CoRR abs/2002.03664 (2020) - [i16]Raphaël Berthon, Bastien Maubert, Aniello Murano, Sasha Rubin, Moshe Y. Vardi:
Strategy Logic with Imperfect Information. CoRR abs/2003.04730 (2020) - [i15]Julian Gutierrez, Aniello Murano, Giuseppe Perelli, Sasha Rubin, Thomas Steeples, Michael J. Wooldridge:
Equilibria for Games with Combined Qualitative and Quantitative Objectives. CoRR abs/2008.05643 (2020) - [i14]Aniello Murano, Sasha Rubin, Martin Zimmermann:
Optimal Strategies in Weighted Limit Games (full version). CoRR abs/2008.11562 (2020)
2010 – 2019
- 2019
- [c45]Benjamin Aminof, Giuseppe De Giacomo, Aniello Murano, Sasha Rubin:
Planning under LTL Environment Specifications. ICAPS 2019: 31-39 - [c44]Aurèle Barrière, Bastien Maubert, Aniello Murano, Sasha Rubin:
Reasoning about Changes of Observational Power in Logics of Knowledge and Time. AAMAS 2019: 971-979 - [c43]Bastien Maubert, Aniello Murano, Pasquale Perillo, Sasha Rubin, Alessio Spasiano:
Towards a Tool for LTL Synthesis with Bounded-Energy Constraints. ICTCS 2019: 229-234 - [c42]Benjamin Aminof, Marta Kwiatkowska, Bastien Maubert, Aniello Murano, Sasha Rubin:
Probabilistic Strategy Logic. IJCAI 2019: 32-38 - [c41]Francesco Belardinelli, Alessio Lomuscio, Aniello Murano, Sasha Rubin:
Imperfect Information in Alternating-Time Temporal Logic on Finite Traces. PRIMA 2019: 469-477 - [i13]Raphaël Berthon, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Jean-François Raskin, Sasha Rubin:
Monadic Second-Order Logic with Path-Measure Quantifier is Undecidable. CoRR abs/1901.04349 (2019) - [i12]Blai Bonet, Giuseppe De Giacomo, Hector Geffner, Sasha Rubin:
Generalized Planning: Non-Deterministic Abstractions and Trajectory Constraints. CoRR abs/1909.12135 (2019) - [i11]Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin:
Stochastic Fairness and Language-Theoretic Fairness in Planning on Nondeterministic Domains. CoRR abs/1912.11203 (2019) - 2018
- [j11]Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, Helmut Veith:
Parameterized model checking of rendezvous systems. Distributed Comput. 31(3): 187-222 (2018) - [j10]Benjamin Aminof, Vadim Malvone, Aniello Murano, Sasha Rubin:
Graded modalities in Strategy Logic. Inf. Comput. 261: 634-649 (2018) - [j9]Benjamin Aminof, Aniello Murano, Sasha Rubin:
CTL* with graded path modalities. Inf. Comput. 262: 1-21 (2018) - [c40]Francesco Belardinelli, Alessio Lomuscio, Aniello Murano, Sasha Rubin:
Decidable Verification of Multi-agent Systems with Bounded Private Actions. AAMAS 2018: 1865-1867 - [c39]Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, Sasha Rubin:
Quantifying Bounds in Strategy Logic. CSL 2018: 23:1-23:23 - [c38]Loredana Sorrentino, Sasha Rubin, Aniello Murano:
Graded CTL* over Finite Paths. ICTCS 2018: 152-161 - [c37]Francesco Belardinelli, Alessio Lomuscio, Aniello Murano, Sasha Rubin:
Alternating-time Temporal Logic on Finite Traces. IJCAI 2018: 77-83 - [c36]Giuseppe De Giacomo, Sasha Rubin:
Automata-Theoretic Foundations of FOND Planning for LTLf and LDLf Goals. IJCAI 2018: 4729-4735 - [c35]Benjamin Aminof, Giuseppe De Giacomo, Aniello Murano, Sasha Rubin:
Synthesis under Assumptions. KR 2018: 615-616 - [c34]Aurèle Barrière, Bastien Maubert, Aniello Murano, Sasha Rubin:
Changing Observations in Epistemic Temporal Logic. KR 2018: 621-622 - [c33]Benjamin Aminof, Sasha Rubin, Ilina Stoilkovska, Josef Widder, Florian Zuleger:
Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction. VMCAI 2018: 1-24 - [i10]Aurèle Barrière, Bastien Maubert, Aniello Murano, Sasha Rubin:
Changing Observations in Epistemic Temporal Logic. CoRR abs/1805.06881 (2018) - [i9]Raphaël Berthon, Bastien Maubert, Aniello Murano, Sasha Rubin, Moshe Y. Vardi:
Strategy Logic with Imperfect Information. CoRR abs/1805.12592 (2018) - [i8]Benjamin Aminof, Giuseppe De Giacomo, Aniello Murano, Sasha Rubin:
Planning and Synthesis Under Assumptions. CoRR abs/1807.06777 (2018) - 2017
- [j8]Benjamin Aminof, Sasha Rubin:
First-cycle games. Inf. Comput. 254: 195-216 (2017) - [c32]Francesco Belardinelli, Alessio Lomuscio, Aniello Murano, Sasha Rubin:
Verification of Multi-agent Systems with Imperfect Information and Public Actions. AAMAS 2017: 1268-1276 - [c31]Francesco Belardinelli, Alessio Lomuscio, Aniello Murano, Sasha Rubin:
Verification of Broadcasting Multi-Agent Systems against an Epistemic Strategy Logic. IJCAI 2017: 91-97 - [c30]Blai Bonet, Giuseppe De Giacomo, Hector Geffner, Sasha Rubin:
Generalized Planning: Non-Deterministic Abstractions and Trajectory Constraints. IJCAI 2017: 873-879 - [c29]Julian Gutierrez, Aniello Murano, Giuseppe Perelli, Sasha Rubin, Michael J. Wooldridge:
Nash Equilibria in Concurrent Games with Lexicographic Preferences. IJCAI 2017: 1067-1073 - [c28]Raphaël Berthon, Bastien Maubert, Aniello Murano, Sasha Rubin, Moshe Y. Vardi:
Strategy logic with imperfect information. LICS 2017: 1-12 - [e1]Dario Della Monica, Aniello Murano, Sasha Rubin, Luigi Sauro:
Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), Naples, Italy, September 26-28, 2017. CEUR Workshop Proceedings 1949, CEUR-WS.org 2017 [contents] - 2016
- [j7]Roderick Bloem, Swen Jacobs, Ayrat Khalimov, Igor Konnov, Sasha Rubin, Helmut Veith, Josef Widder:
Decidability in Parameterized Verification. SIGACT News 47(2): 53-64 (2016) - [c27]Benjamin Aminof, Vadim Malvone, Aniello Murano, Sasha Rubin:
Graded Strategy Logic: Reasoning about Uniqueness of Nash Equilibria. AAMAS 2016: 698-706 - [c26]Benjamin Aminof, Aniello Murano, Sasha Rubin, Florian Zuleger:
Automatic Verification of Multi-Agent Systems in Parameterised Grid-Environments. AAMAS 2016: 1190-1199 - [c25]Benjamin Aminof, Sasha Rubin:
Model Checking Parameterised Multi-token Systems via the Composition Method. IJCAR 2016: 499-515 - [c24]Giuseppe De Giacomo, Aniello Murano, Sasha Rubin, Antonio Di Stasio:
Imperfect-Information Games and Generalized Planning. IJCAI 2016: 1037-1043 - [c23]Benjamin Aminof, Aniello Murano, Sasha Rubin, Florian Zuleger:
Prompt Alternating-Time Epistemic Logics. KR 2016: 258-267 - [c22]Benjamin Aminof, Vadim Malvone, Aniello Murano, Sasha Rubin:
Extended Graded Modalities in Strategy Logic. SR 2016: 1-14 - [i7]Benjamin Aminof, Sasha Rubin, Francesco Spegni, Florian Zuleger:
Liveness of Parameterized Timed Networks. CoRR abs/1609.04176 (2016) - 2015
- [b1]Roderick Bloem, Swen Jacobs, Ayrat Khalimov, Igor Konnov, Sasha Rubin, Helmut Veith, Josef Widder:
Decidability of Parameterized Verification. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2015, ISBN 978-3-031-00883-2 - [c21]Sasha Rubin:
Parameterised Verification of Autonomous Mobile-Agents in Static but Unknown Environments. AAMAS 2015: 199-208 - [c20]Benjamin Aminof, Sasha Rubin, Florian Zuleger, Francesco Spegni:
Liveness of Parameterized Timed Networks. ICALP (2) 2015: 375-387 - [c19]Benjamin Aminof, Aniello Murano, Sasha Rubin:
On CTL* with Graded Path Modalities. LPAR 2015: 281-296 - [c18]Benjamin Aminof, Sasha Rubin, Florian Zuleger:
On the Expressive Power of Communication Primitives in Parameterised Systems. LPAR 2015: 313-328 - [c17]Sasha Rubin, Florian Zuleger, Aniello Murano, Benjamin Aminof:
Verification of Asynchronous Mobile-Robots in Partially-Known Environments. PRIMA 2015: 185-200 - [c16]Aniello Murano, Giuseppe Perelli, Sasha Rubin:
Multi-agent Path Planning in Known Dynamic Environments. PRIMA 2015: 218-231 - 2014
- [j6]Andrey Grinshpun, Pakawat Phalitnonkiat, Sasha Rubin, Andrei Tarfulea:
Alternating traps in Muller and parity games. Theor. Comput. Sci. 521: 73-91 (2014) - [c15]Benjamin Aminof, Tomer Kotek, Sasha Rubin, Francesco Spegni, Helmut Veith:
Parameterized Model Checking of Rendezvous Systems. CONCUR 2014: 109-124 - [c14]Benjamin Aminof, Swen Jacobs, Ayrat Khalimov, Sasha Rubin:
Parameterized Model Checking of Token-Passing Systems. VMCAI 2014: 262-281 - [c13]Benjamin Aminof, Sasha Rubin:
First Cycle Games. SR 2014: 83-90 - [i6]Benjamin Aminof, Aniello Murano, Sasha Rubin:
Satisfiability and Model Checking of CTL* with Graded Path Modalities. CoRR abs/1410.7551 (2014) - 2013
- [c12]Krishnendu Chatterjee, Siddhesh Chaubal, Sasha Rubin:
How to Travel between Languages. LATA 2013: 214-225 - [i5]Andrey Grinshpun, Pakawat Phalitnonkiat, Sasha Rubin, Andrei Tarfulea:
Alternating Traps in Muller and Parity Games. CoRR abs/1303.3777 (2013) - [i4]Benjamin Aminof, Swen Jacobs, Ayrat Khalimov, Sasha Rubin:
Parameterized Model Checking of Token-Passing Systems. CoRR abs/1311.4425 (2013) - 2012
- [c11]Alexander Rabinovich, Sasha Rubin:
Interpretations in Trees with Countably Many Branches. LICS 2012: 551-560 - [c10]Alex Kruckman, Sasha Rubin, John Sheridan, Ben Zax:
A Myhill-Nerode theorem for automata with advice. GandALF 2012: 238-246 - 2011
- [p1]Vince Bárány, Erich Grädel, Sasha Rubin:
Automata-based presentations of infinite structures. Finite and Algorithmic Model Theory 2011: 1-76
2000 – 2009
- 2008
- [j5]Sasha Rubin:
Automata Presenting Structures: A Survey of the Finite String Case. Bull. Symb. Log. 14(2): 169-209 (2008) - [c9]Tobias Ganzow, Sasha Rubin:
Order-Invariant MSO is Stronger than Counting MSO in the Finite. STACS 2008: 313-324 - [c8]Lukasz Kaiser, Sasha Rubin, Vince Bárány:
Cardinality and counting quantifiers on omega-automatic structures. STACS 2008: 385-396 - [i3]Lukasz Kaiser, Sasha Rubin, Vince Bárány:
Cardinality and counting quantifiers on omega-automatic structures. CoRR abs/0802.2866 (2008) - 2007
- [j4]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan:
Automatic Structures: Richness and Limitations. Log. Methods Comput. Sci. 3(2) (2007) - [i2]Tobias Ganzow, Sasha Rubin:
Order-Invariant MSO is Stronger than Counting MSO in the Finite. CoRR abs/0706.3723 (2007) - [i1]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan:
Automatic Structures: Richness and Limitations. CoRR abs/cs/0703064 (2007) - 2005
- [j3]Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan:
Automatic linear orders and trees. ACM Trans. Comput. Log. 6(4): 675-700 (2005) - [c7]Bakhadyr Khoussainov, Sasha Rubin:
Decidability of Term Algebras Extending Partial Algebras. CSL 2005: 292-308 - 2004
- [c6]Doron Bustan, Sasha Rubin, Moshe Y. Vardi:
Verifying omega-Regular Properties of Markov Chains. CAV 2004: 189-201 - [c5]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan:
Automatic Structures: Richness and Limitations. LICS 2004: 44-53 - [c4]Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan:
Definability and Regularity in Automatic Structures. STACS 2004: 440-451 - 2003
- [j2]Bakhadyr Khoussainov, Sasha Rubin:
Automatic Structures: Overview and Future Directions. J. Autom. Lang. Comb. 8(2): 287-301 (2003) - [c3]Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan:
On Automatic Partial Orders. LICS 2003: 168-177 - 2002
- [c2]Hajime Ishihara, Bakhadyr Khoussainov, Sasha Rubin:
Some Results on Automatic Structures. LICS 2002: 235- - 2001
- [j1]Bakhadyr Khoussainov, Sasha Rubin:
Graphs with Automatic Presentations over a Unary Alphabet. J. Autom. Lang. Comb. 6(4): 467-480 (2001)
1990 – 1999
- 1999
- [c1]Sasha Rubin:
Finite Automata and Well Ordered Sets. New Zealand Computer Science Research Students' Conference 1999: 86-93
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-21 21:29 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:
