default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefano Quer
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
[j39]Gustavo Ramirez Espinosa
, Pietro Chiavassa, Edoardo Giusto, Stefano Quer, Bartolomeo Montrucchio, Maurizio Rebaudengo:
Improving Data Quality of Low-Cost Light-Scattering PM Sensors: Toward Automatic Air Quality Monitoring in Urban Environments. IEEE Internet Things J. 11(17): 28409-28420 (2024)- [c48]Giuseppe Stracquadanio, Sourav Medya, Stefano Quer, Debjit Pal:
VeriBug: An Attention-Based Framework for Bug Localization in Hardware Designs. DATE 2024: 1-2 - [c47]Andrea Calabrese, Stefano Quer, Giovanni Squillero, Alberto Tonda:
Towards an Evolutionary Approach for Exploting Core Knowledge in Artificial Intelligence. GECCO Companion 2024: 259-262 - [c46]Lorenzo Cardone, Salvatore Di Martino, Stefano Quer:
Efficiently Computing Maximum Clique of Sparse Graphs with Many-Core Graphical Processing Units. ICSOFT 2024: 539-546 - [i4]Giuseppe Stracquadanio, Sourav Medya, Stefano Quer, Debjit Pal:
VeriBug: An Attention-based Framework for Bug-Localization in Hardware Designs. CoRR abs/2401.09494 (2024) - 2023
- [j38]Francesco Angione, Davide Appello, Paolo Bernardi, Andrea Calabrese, Stefano Quer, Matteo Sonza Reorda, Vincenzo Tancorre, Roberto Ugioli:
A Toolchain to Quantify Burn-In Stress Effectiveness on Large Automotive System-on-Chips. IEEE Access 11: 105655-105676 (2023) - [j37]Alessandro Borione, Lorenzo Cardone, Andrea Calabrese, Stefano Quer:
An Experimental Evaluation of Graph Coloring Heuristics on Multi- and Many-Core Architectures. IEEE Access 11: 125226-125243 (2023) - [j36]Lorenzo Cardone, Stefano Quer:
The Multi-Maximum and Quasi-Maximum Common Subgraph Problem. Comput. 11(4): 69 (2023) - [j35]Matteo Orlando, Lorenzo Bottaccioli, Stefano Quer, Massimo Poncino, Sara Vinco, Edoardo Patti:
A Framework for Economic and Environmental Benefit Through Renewable Energy Community. IEEE Syst. J. 17(4): 5626-5635 (2023) - [j34]Marco Castangia, Nicola Barletta, Christian Camarda, Stefano Quer, Enrico Macii, Edoardo Patti:
Clustering Appliance Operation Modes With Unsupervised Deep Learning Techniques. IEEE Trans. Ind. Informatics 19(7): 8196-8204 (2023) - [c45]Andrea Calabrese, Lorenzo Cardone, Salvatore Licata, Marco Porro, Stefano Quer:
A Web Scraping Algorithm to Improve the Computation of the Maximum Common Subgraph. ICSOFT 2023: 197-206 - 2022
- [j33]Davide Appello, Paolo Bernardi, Andrea Calabrese, Giorgio Pollaccia, Stefano Quer, Vincenzo Tancorre, Roberto Ugioli:
Parallel Multithread Analysis of Extremely Large Simulation Traces. IEEE Access 10: 56440-56457 (2022) - [j32]Matteo Orlando, Abouzar Estebsari, Enrico Pons, Marco Pau, Stefano Quer, Massimo Poncino, Lorenzo Bottaccioli, Edoardo Patti:
A Smart Meter Infrastructure for Smart Grid IoT Applications. IEEE Internet Things J. 9(14): 12529-12541 (2022) - [c44]Francesco Angione, Paolo Bernardi, Andrea Calabrese, Lorenzo Cardone, A. Niccoletti, Davide Piumatti, Stefano Quer, Davide Appello, Vincenzo Tancorre, Roberto Ugioli:
An innovative Strategy to Quickly Grade Functional Test Programs. ITC 2022: 355-364 - [d1]Bartolomeo Montrucchio, Edoardo Giusto, Mohammad Ghazi Vakili, Stefano Quer, Renato Ferrero, Claudio Fornaro:
A Densely-Deployed, High Sampling Rate, Open-Source Air Pollution Monitoring WSN. IEEE DataPort, 2022
- 2021
- [j31]Stefano Quer, Luz Amanda Garcia:
Modules and Techniques for Motion Planning: An Industrial Perspective. Sensors 21(2): 420 (2021) - [c43]Davide Appello, Paolo Bernardi, Andrea Calabrese, Stefano Littardi, Giorgio Pollaccia, Stefano Quer, Vincenzo Tancorre, Roberto Ugioli:
Accelerated Analysis of Simulation Dumps through Parallelization on Multicore Architectures. DDECS 2021: 69-74 - [c42]Andrea Calabrese, Stefano Quer, Giovanni Squillero:
Smart Techniques for Flying-probe Testing. ICSOFT 2021: 285-293 - 2020
- [j30]Stefano Quer, Andrea Marcelli, Giovanni Squillero:
The Maximum Common Subgraph Problem: A Parallel and Multi-Engine Approach. Comput. 8(2): 48 (2020) - [j29]Stefano Quer, Andrea Calabrese:
Graph Reachability on Parallel Many-Core Architectures. Comput. 8(4): 103 (2020) - [j28]Bartolomeo Montrucchio, Edoardo Giusto, Mohammad Ghazi Vakili, Stefano Quer, Renato Ferrero, Claudio Fornaro:
A Densely-Deployed, High Sampling Rate, Open-Source Air Pollution Monitoring WSN. IEEE Trans. Veh. Technol. 69(12): 15786-15799 (2020) - [c41]Stefano Quer:
A Parallel Many-core CUDA-based Graph Labeling Computation. ICSOFT 2020: 597-605
2010 – 2019
- 2019
- [c40]Tatsuya Harada, Antonio Tejero-de-Pablos, Stefano Quer, Francesco Savarese:
Service Robots: A Unified Framework for Detecting, Opening and Navigating Through Doors. ICSOFT (Selected Papers) 2019: 179-204 - [c39]Francesco Savarese, Antonio Tejero-de-Pablos, Stefano Quer, Tatsuya Harada:
Detecting, Opening and Navigating through Doors: A Unified Framework for Human Service Robots. ICSOFT 2019: 416-427 - [i3]Andrea Marcelli, Stefano Quer, Giovanni Squillero:
The Maximum Common Subgraph Problem: A Portfolio Approach. CoRR abs/1908.06418 (2019) - 2018
- [j27]Alessandro Garbo, Stefano Quer:
A Fast MPEG's CDVS Implementation for GPU Featured in Mobile Devices. IEEE Access 6: 52027-52046 (2018) - [j26]Gianpiero Cabodi, Paolo Camurati, Carmelo Loiacono, Marco Palena, Paolo Pasini, Denis Patti, Stefano Quer:
To split or to group: from divide-and-conquer to sub-task sharing for verifying multiple properties in model checking. Int. J. Softw. Tools Technol. Transf. 20(3): 313-325 (2018) - 2017
- [j25]Gianpiero Cabodi, Alessandro Garbo, Carmelo Loiacono, Stefano Quer, Gianluca Francini:
Efficient Complex High-Precision Computations on GPUs without Precision Loss. J. Circuits Syst. Comput. 26(12): 1750187:1-1750187:38 (2017) - [j24]Alessandro Garbo, Stefano Quer:
Moving Object Detection in Heterogeneous Conditions in Embedded Systems. Sensors 17(7): 1546 (2017) - 2016
- [j23]Andrea Bottino, Alessandro Garbo, Carmelo Loiacono, Stefano Quer:
Street Viewer: An Autonomous Vision Based Traffic Tracking System. Sensors 16(6): 813 (2016) - [j22]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
A graph-labeling approach for efficient cone-of-influence computation in model-checking problems with multiple properties. Softw. Pract. Exp. 46(4): 493-511 (2016) - [c38]Nicolas Boria, Gianpiero Cabodi, Paolo Camurati, Marco Palena, Paolo Pasini, Stefano Quer:
A 7/2-Approximation Algorithm for the Maximum Duo-Preservation String Mapping Problem. CPM 2016: 11:1-11:8 - [i2]Nicolas Boria, Gianpiero Cabodi, Paolo Camurati, Marco Palena, Paolo Pasini, Stefano Quer:
A Greedy Approach to Answer Reachability Queries on DAGs. CoRR abs/1611.02506 (2016) - 2015
- [c37]Alessandro Garbo, Carmelo Loiacono, Stefano Quer, Massimo Balestri, Gianluca Francini:
CDVS feature selection on embedded systems. ICME Workshops 2015: 1-6 - 2014
- [j21]Gianpiero Cabodi, Carmelo Loiacono, Marco Palena, Paolo Pasini, Denis Patti, Stefano Quer, Danilo Vendraminetto, Armin Biere, Keijo Heljanko:
Hardware Model Checking Competition 2014: An Analysis and Comparison of Solvers and Benchmarks. J. Satisf. Boolean Model. Comput. 9(1): 135-172 (2014) - [j20]Stefano Quer:
Model checking evaluation of airplane landing trajectories. Int. J. Softw. Tools Technol. Transf. 16(6): 753-773 (2014) - [c36]Gianpiero Cabodi, Paolo Pasini, Stefano Quer, Danilo Vendraminetto:
Tightening BDD-based approximate reachability with SAT-based clause generalization∗. DATE 2014: 1-6 - 2013
- [j19]Gianpiero Cabodi, Sergio Nocco, Stefano Quer:
Thread-based multi-engine model checking for multicore platforms. ACM Trans. Design Autom. Electr. Syst. 18(3): 36:1-36:28 (2013) - [c35]Carmelo Loiacono, Marco Palena, Paolo Pasini, Denis Patti, Stefano Quer, Stefano Ricossa, Danilo Vendraminetto, Jason Baumgartner:
Fast cone-of-influence computation and estimation in problems with multiple properties. DATE 2013: 803-806 - 2011
- [j18]Gianpiero Cabodi, Sergio Nocco, Stefano Quer:
Benchmarking a model checker for algorithmic improvements and tuning for performance. Formal Methods Syst. Des. 39(2): 205-227 (2011) - [c34]Gianpiero Cabodi, Sergio Nocco, Stefano Quer:
Interpolation sequences revisited. DATE 2011: 316-322 - 2010
- [j17]Gianpiero Cabodi, Luz Amanda Garcia, Marco Murciano, Sergio Nocco, Stefano Quer:
Partitioning Interpolant-Based Verification for Effective Unbounded Model Checking. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 29(3): 382-395 (2010) - [j16]Sergio Nocco, Stefano Quer:
A Novel SAT-Based Approach to the Task Graph Cost-Optimal Scheduling Problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 29(12): 2027-2040 (2010)
2000 – 2009
- 2009
- [j15]Gianpiero Cabodi, Sergio Nocco, Stefano Quer:
Strengthening Model Checking Techniques With Inductive Invariants. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 28(1): 154-158 (2009) - [c33]Gianpiero Cabodi, Paolo Camurati, Luz Amanda Garcia, Marco Murciano, Sergio Nocco, Stefano Quer:
Speeding up model checking by exploiting explicit and hidden verification constraints. DATE 2009: 1686-1691 - 2008
- [j14]Viviana Bruno, Luz Amanda Garcia, Sergio Nocco, Stefano Quer:
Stressing Symbolic Scheduling Techniques within Aircraft Maintenance Optimization. J. Satisf. Boolean Model. Comput. 5(1-4): 83-110 (2008) - [j13]Sergio Nocco, Stefano Quer:
A Probabilistic and Approximated Approach to Circuit-Based Formal Verification. J. Satisf. Boolean Model. Comput. 5(1-4): 111-132 (2008) - [j12]Gianpiero Cabodi, Marco Murciano, Sergio Nocco, Stefano Quer:
Boosting interpolation with dynamic localized abstraction and redundancy removal. ACM Trans. Design Autom. Electr. Syst. 13(1): 3:1-3:20 (2008) - [c32]Gianpiero Cabodi, Paolo Camurati, Luz Amanda Garcia, Marco Murciano, Sergio Nocco, Stefano Quer:
Trading-Off SAT Search and Variable Quantifications for Effective Unbounded Model Checking. FMCAD 2008: 1-8 - 2007
- [c31]Gianpiero Cabodi, Sergio Nocco, Stefano Quer:
Boosting the role of inductive invariants in model checking. DATE 2007: 1319-1324 - 2006
- [c30]Gianpiero Cabodi, Marco Murciano, Sergio Nocco, Stefano Quer:
Stepping forward with interpolants in unbounded model checking. ICCAD 2006: 772-778 - 2005
- [j11]Gianpiero Cabodi, Alex Kondratyev, Luciano Lavagno, Sergio Nocco, Stefano Quer, Yosinori Watanabe:
A BMC-based formulation for the scheduling problem of hardware systems. Int. J. Softw. Tools Technol. Transf. 7(2): 102-117 (2005) - [j10]Gianpiero Cabodi, Sergio Nocco, Stefano Quer:
Are BDDs still alive within sequential verification? Int. J. Softw. Tools Technol. Transf. 7(2): 129-142 (2005) - [c29]Gianpiero Cabodi, Marco Crivellari, Sergio Nocco, Stefano Quer:
Circuit Based Quantification: Back to State Set Manipulation within Unbounded Model Checking. DATE 2005: 688-689 - 2004
- [j9]Gianpiero Cabodi, Sergio Nocco, Stefano Quer:
Improving SAT-based Bounded Model Checking by Means of BDD-based Approximate Traversals. J. Univers. Comput. Sci. 10(12): 1696-1730 (2004) - [c28]Gabriel P. Bischoff, Karl S. Brace, Gianpiero Cabodi, Sergio Nocco, Stefano Quer:
Exploiting Target Enlargement and Dynamic Abstraction within Mixed BDD and SAT Invariant Checking. BMC@CAV 2004: 33-49 - 2003
- [c27]Gianpiero Cabodi, Sergio Nocco, Stefano Quer:
Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals. DATE 2003: 10898-10905 - [c26]Gianpiero Cabodi, Sergio Nocco, Stefano Quer, Alex Kondratyev, Luciano Lavagno, Yosinori Watanabe:
A BMC-formulation for the scheduling problem in highly constrained hardware Systems. BMC@CAV 2003: 623-638 - 2002
- [c25]Gianpiero Cabodi, Sergio Nocco, Stefano Quer:
Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification. CAV 2002: 471-484 - [c24]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
Can BDDs compete with SAT solvers on bounded model checking? DAC 2002: 117-122 - [c23]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
Dynamic Scheduling and Clustering in Symbolic Image Computation. DATE 2002: 150-156 - [c22]Luciano Lavagno, Mihai T. Lazarescu, Stefano Quer, Sergio Nocco, Claudio Passerone, Gianpiero Cabodi:
A Symbolic Approach for the Combined Solution of Scheduling and Allocation. ISSS 2002: 237-242 - 2001
- [j8]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
Reachability analysis of large circuits using disjunctive partitioning and partial iterative squaring. J. Syst. Archit. 47(2): 163-179 (2001) - [c21]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
Biasing symbolic search by means of dynamic activity profiles. DATE 2001: 9-15 - 2000
- [j7]Stefano Quer, Gianpiero Cabodi, Paolo Camurati, Luciano Lavagno, Ellen Sentovich, Robert K. Brayton:
Verification of Similar FSMs by Mixing Incremental Re-encoding, Reachability Analysis, and Combinational Checks. Formal Methods Syst. Des. 17(2): 107-134 (2000) - [j6]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
Symbolic forward/backward traversals of large finite state machines. J. Syst. Archit. 46(12): 1137-1158 (2000) - [j5]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
Improving symbolic reachability analysis by means of activityprofiles. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(9): 1065-1075 (2000) - [c20]Gianpiero Cabodi, Stefano Quer, Fabio Somenzi:
Optimizing sequential verification by retiming transformations. DAC 2000: 601-606
1990 – 1999
- 1999
- [j4]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
Improving the efficiency of BDD-based operators by means of partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18(5): 545-556 (1999) - [c19]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
Improving Symbolic Traversals by Means of Activity Profiles. DAC 1999: 306-311 - [c18]Valeria Bertacco, Maurizio Damiani, Stefano Quer:
Cycle-Based Symbolic Simulation of Gate-Level Synchronous Circuits. DAC 1999: 391-396 - [c17]Gianpiero Cabodi, Paolo Camurati, Claudio Passerone, Stefano Quer:
Computing Timed Transition Relations for Sequential Cycle-Based Simulation. DATE 1999: 8-12 - 1998
- [j3]Gianpiero Cabodi, Stefano Quer, Paolo Camurati:
Memory Optimization in Function and Set Manipulation with BDDs. Softw. Pract. Exp. 28(1): 99-120 (1998) - [j2]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
Auxiliary variables for BDD-based representation and manipulation of Boolean functions. ACM Trans. Design Autom. Electr. Syst. 3(3): 309-340 (1998) - [j1]Luca Benini, Giovanni De Micheli, Enrico Macii, Massimo Poncino, Stefano Quer:
Power optimization of core-based systems by address bus encoding. IEEE Trans. Very Large Scale Integr. Syst. 6(4): 554-562 (1998) - [i1]Gianpiero Cabodi, Stefano Quer, Christoph Meinel, Harald Sack, Anna Slobodová, Christian Stangier:
Binary Decision Diagrams and the Multiple Variable Order Problem. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-22 (1998) - 1997
- [c16]Gianpiero Cabodi, Paolo Camurati, Antonio Lioy, Massimo Poncino, Stefano Quer:
A parallel approach to symbolic traversal based on set partitioning. CHARME 1997: 167-184 - [c15]Gianpiero Cabodi, Paolo Camurati, Luciano Lavagno, Stefano Quer:
Disjunctive Partitioning and Partial Iterative Squaring: An Effective Approach for Symbolic Traversal of Large Circuits. DAC 1997: 728-733 - [c14]Gianpiero Cabodi, Paolo Camurati, Luciano Lavagno, Stefano Quer:
Verification and synthesis of counters based on symbolic techniques. ED&TC 1997: 176-181 - [c13]Luca Benini, Giovanni De Micheli, Enrico Macii, Massimo Poncino, Stefano Quer:
System-level power optimization of special purpose applications: the beach solution. ISLPED 1997: 24-29 - 1996
- [c12]Gianpiero Cabodi, Paolo Camurati, Luciano Lavagno, Stefano Quer, Robert K. Brayton, Ellen Sentovich:
Incremental re-encoding for symbolic traversal of product machines. EURO-DAC 1996: 158-163 - [c11]Stefano Quer, Gianpiero Cabodi, Paolo Camurati:
Decomposed symbolic forward traversals of large finite state machines. EURO-DAC 1996: 170-175 - [c10]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
Improved reachability analysis of large finite state machines. ICCAD 1996: 354-360 - [c9]Gianpiero Cabodi, Luciano Lavagno, Enrico Macii, Massimo Poncino, Stefano Quer, Paolo Camurati, Ellen Sentovich:
Enhancing FSM Traversal by Temporary Re-Encoding. ICCD 1996: 6-11 - 1995
- [c8]Gianpiero Cabodi, Stefano Quer, Paolo Camurati:
Transforming boolean relations by symbolic encoding. CHARME 1995: 161-170 - [c7]Gianpiero Cabodi, Stefano Quer, Paolo Camurati:
Computing subsets of equivalence classes for large FSMs. EURO-DAC 1995: 288-293 - 1994
- [c6]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
Auxiliary Variables for Extending Symbolic Traversal Techniques to Data Paths. DAC 1994: 289-293 - [c5]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
Symbolic exploration of large circuits with enhanced forward/backward traversals. EURO-DAC 1994: 22-27 - [c4]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
Symbolic traversals of data paths with auxiliary variables. Great Lakes Symposium on VLSI 1994: 93-96 - [c3]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
Efficient State Space Pruning in Symbolic Backward Traversal. ICCD 1994: 230-235 - [c2]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
Detecting hard faults with combined approximate forward/backward symbolic techniques. ISCAS 1994: 299-302 - [c1]Gianpiero Cabodi, Paolo Camurati, Stefano Quer:
Full-Symbolic ATPG for Large Circuits. ITC 1994: 980-988
Coauthor Index
[j26] [j25] [j22] [c38] [i2] [j21] [c36] [j19] [j18] [c34] [j17] [j15] [c33] [j12] [c32] [c31] [c30] [j11] [j10] [c29] [j9] [c28] [c27] [c26] [c25] [c24] [c23] [c22] [j8] [c21] [j7] [j6] [j5] [c20] [j4] [c19] [c17] [j3] [j2] [i1] [c16] [c15] [c14] [c12] [c11] [c10] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [c1]
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-01 20:41 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:
