Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVasco M. Manquinho
Person information
- affiliation: University of Lisbon, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j23]João Palet, Vasco M. Manquinho
, Rui Henriques:
Multiple-input neural networks for time series forecasting incorporating historical and prospective context. Data Min. Knowl. Discov. 38(1): 315-341 (2024)- [j22]Daniel Ramos, Inês Lynce, Vasco M. Manquinho, Ruben Martins, Claire Le Goues:
BatFix: Repairing language model-based transpilation. ACM Trans. Softw. Eng. Methodol. 33(6): 161 (2024) - [c57]João Cortes, Inês Lynce, Vasco M. Manquinho:
Slide&Drill, a New Approach for Multi-Objective Combinatorial Optimization. CP 2024: 8:1-8:17 - [c56]Ricardo Brancas, Miguel Terra-Neves, Miguel Ventura, Vasco M. Manquinho, Ruben Martins:
Towards Reliable SQL Synthesis: Fuzzing-Based Evaluation and Disambiguation. FASE 2024: 232-254 - [c55]Joana Coutinho, Alexandre Lemos, Miguel Terra-Neves, André Ribeiro, Vasco M. Manquinho, Rui Quintino, Bartlomiej Matejczyk:
BugOut: Automated Test Generation and Bug Detection for Low-Code. ICST 2024: 373-382 - [i21]Pedro Orvalho, Mikolás Janota, Vasco M. Manquinho:
CFaults: Model-Based Diagnosis for Fault Localization in C Programs with Multiple Test Cases. CoRR abs/2407.09337 (2024) - 2023
- [j21]Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten, Cristina Bazgan, Inês Lynce, Vasco M. Manquinho, José Rui Figueira:
Exact and approximate determination of the Pareto front using Minimal Correction Subsets. Comput. Oper. Res. 153: 106153 (2023) - [c54]Pedro Orvalho, Jelle Piepenbrock, Mikolás Janota, Vasco M. Manquinho:
Graph Neural Networks for Mapping Variables Between Programs. ECAI 2023: 1811-1818 - [c53]Daniel Ramos, Hailie Mitchell, Inês Lynce, Vasco M. Manquinho, Ruben Martins, Claire Le Goues:
MELT: Mining Effective Lightweight Transformations from Pull Requests. ASE 2023: 1516-1528 - [c52]Pedro Orvalho, Vasco M. Manquinho, Ruben Martins:
UpMax: User Partitioning for MaxSAT. SAT 2023: 19:1-19:13 - [c51]João Cortes, Inês Lynce, Vasco M. Manquinho:
New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization. TACAS (2) 2023: 55-73 - [i20]Pedro Orvalho, Vasco M. Manquinho, Ruben Martins:
UpMax: User partitioning for MaxSAT. CoRR abs/2305.16191 (2023) - [i19]Pedro Orvalho, Jelle Piepenbrock, Mikolás Janota, Vasco M. Manquinho:
Graph Neural Networks For Mapping Variables Between Programs - Extended Version. CoRR abs/2307.13014 (2023) - [i18]Daniel Ramos, Hailie Mitchell, Inês Lynce, Vasco M. Manquinho, Ruben Martins, Claire Le Goues:
MELT: Mining Effective Lightweight Transformations from Pull Requests. CoRR abs/2308.14687 (2023) - [i17]Aidan Z. H. Yang, Ricardo Brancas, Pedro Esteves, Sofia Aparicio, João Pedro Nadkarni, Miguel Terra-Neves, Vasco M. Manquinho, Ruben Martins:
On Repairing Natural Language to SQL Queries. CoRR abs/2310.03866 (2023) - 2022
- [j20]Tiago Almeida, Vasco M. Manquinho:
Constraint-based electoral districting using a new compactness measure: An application to Portugal. Comput. Oper. Res. 146: 105892 (2022) - [j19]Leonor Silva, Magda Resende, Helena Galhardas, Vasco M. Manquinho, Inês Lynce:
DeepData: Machine learning in the marine ecosystems. Expert Syst. Appl. 206: 117841 (2022) - [j18]Thomas James Z. Tiam-Lee, Rui Henriques, Vasco M. Manquinho:
Associative Analysis of Inefficiencies and Station Activity Levels in Emergency Response. ISPRS Int. J. Geo Inf. 11(7): 356 (2022) - [c50]Thomas James Z. Tiam-Lee, Rui Henriques, José Costa, Vasco M. Manquinho, Helena Galhardas:
Consolidation of Massive Medical Emergency Events With Heterogeneous Situational Context Data Sources. EDBT/ICDT Workshops 2022 - [c49]Miguel Cabral, Mikolás Janota, Vasco M. Manquinho:
SAT-Based Leximax Optimisation Algorithms. SAT 2022: 29:1-29:19 - [c48]Pedro Orvalho, Mikolás Janota, Vasco M. Manquinho:
MultIPAs: applying program transformations to introductory programming assignments for data augmentation. ESEC/SIGSOFT FSE 2022: 1657-1661 - [i16]Ricardo Brancas, Miguel Terra-Neves, Miguel Ventura, Vasco M. Manquinho, Ruben Martins:
CUBES: A Parallel Synthesizer for SQL Using Examples. CoRR abs/2203.04995 (2022) - [i15]Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten, Cristina Bazgan, Inês Lynce, Vasco M. Manquinho, José Rui Figueira:
Exact and approximate determination of the Pareto set using minimal correction subsets. CoRR abs/2204.06908 (2022) - [i14]João Cortes, Inês Lynce, Vasco M. Manquinho:
New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization. CoRR abs/2204.10856 (2022) - [i13]Pedro Orvalho, Mikolás Janota, Vasco M. Manquinho:
C-Pack of IPAs: A C90 Program Benchmark of Introductory Programming Assignments. CoRR abs/2206.08768 (2022) - [i12]Pedro Orvalho, Mikolás Janota, Vasco M. Manquinho:
InvAASTCluster: On Applying Invariant-Based Program Clustering to Introductory Programming Assignments. CoRR abs/2206.14175 (2022) - 2021
- [j17]Andreia P. Guerreiro, Vasco M. Manquinho, José Rui Figueira:
Exact hypervolume subset selection through incremental computations. Comput. Oper. Res. 136: 105471 (2021) - [c47]Mikolás Janota, António Morgado, José Fragoso Santos, Vasco M. Manquinho:
The Seesaw Algorithm: Function Optimization Using Implicit Hitting Sets. CP 2021: 31:1-31:16 - [c46]Ansong Ni, Daniel Ramos, Aidan Z. H. Yang, Inês Lynce, Vasco M. Manquinho, Ruben Martins, Claire Le Goues:
SOAR: A Synthesis Approach for Data Science API Refactoring. ICSE 2021: 112-124 - [c45]Ansong Ni, Daniel Ramos, Aidan Z. H. Yang, Inês Lynce, Vasco M. Manquinho, Ruben Martins, Claire Le Goues:
Replication of SOAR: A Synthesis Approach for Data Science API Refactoring. ICSE (Companion Volume) 2021: 190-191 - [c44]Leonor Silva, Helena Galhardas, Vasco M. Manquinho, Rui Henriques:
UNIANO: robust and efficient anomaly consensus in time series sensitive to cross-correlated anomaly profiles. SDM 2021: 324-332 - [c43]Changjian Zhang, Ryan Wagner, Pedro Orvalho, David Garlan, Vasco M. Manquinho, Ruben Martins, Eunsuk Kang:
AlloyMax: bringing maximum satisfaction to relational specifications. ESEC/SIGSOFT FSE 2021: 155-167 - [p4]Olivier Roussel, Vasco M. Manquinho:
Pseudo-Boolean and Cardinality Constraints. Handbook of Satisfiability 2021: 1087-1129 - [i11]Ansong Ni, Daniel Ramos, Aidan Z. H. Yang, Inês Lynce, Vasco M. Manquinho, Ruben Martins, Claire Le Goues:
SOAR: A Synthesis Approach for Data Science API Refactoring. CoRR abs/2102.06726 (2021) - 2020
- [j16]Pedro Orvalho, Miguel Terra-Neves, Miguel Ventura, Ruben Martins, Vasco M. Manquinho:
SQUARES : A SQL Synthesizer Using Query Reverse Engineering. Proc. VLDB Endow. 13(12): 2853-2856 (2020) - [c42]Daniel Ramos, Jorge Pereira, Inês Lynce, Vasco M. Manquinho, Ruben Martins:
UNCHARTIT: An Interactive Framework for Program Recovery from Charts. ASE 2020: 175-186
2010 – 2019
- 2019
- [j15]Miguel Terra-Neves, Inês Lynce, Vasco M. Manquinho:
Virtual machine consolidation using constraint-based multi-objective optimization. J. Heuristics 25(3): 339-375 (2019) - [c41]Miguel Terra-Neves, Nuno Machado, Inês Lynce, Vasco M. Manquinho:
Concurrency Debugging with MaxSMT. AAAI 2019: 1608-1616 - [c40]Andreia P. Guerreiro, Miguel Terra-Neves, Inês Lynce, José Rui Figueira, Vasco M. Manquinho:
Constraint-Based Techniques in Stochastic Local Search MaxSAT Solving. CP 2019: 232-250 - [c39]Pedro Orvalho, Miguel Terra-Neves, Miguel Ventura, Ruben Martins, Vasco M. Manquinho:
Encodings for Enumeration-Based Program Synthesis. CP 2019: 583-599 - [c38]Miguel Terra-Neves, Inês Lynce, Vasco M. Manquinho:
Integrating Pseudo-Boolean Constraint Reasoning in Multi-Objective Evolutionary Algorithms. IJCAI 2019: 1184-1190 - [i10]Ruben Martins, Saurabh Joshi, Vasco M. Manquinho, Inês Lynce:
Reflections on "Incremental Cardinality Constraints for MaxSAT". CoRR abs/1910.04643 (2019) - 2018
- [c37]Miguel Terra-Neves, Inês Lynce, Vasco M. Manquinho:
Enhancing Constraint-Based Multi-Objective Combinatorial Optimization. AAAI 2018: 6649-6656 - [c36]Miguel Terra-Neves, Inês Lynce, Vasco M. Manquinho:
Stratification for Constraint-Based Multi-Objective Combinatorial Optimization. IJCAI 2018: 1376-1382 - [c35]Miguel Terra-Neves, Inês Lynce, Vasco M. Manquinho:
Multi-Objective Optimization Through Pareto Minimal Correction Subsets. IJCAI 2018: 5379-5383 - [c34]Pedro L. Varela, Inês Lynce, Vasco M. Manquinho, Claudine Chaouiya, Pedro T. Monteiro:
Stable States of Boolean Regulatory Networks Composed Over Hexagonal Grids. SASB 2018: 113-130 - [p3]Inês Lynce, Vasco M. Manquinho, Ruben Martins:
Parallel Maximum Satisfiability. Handbook of Parallel Constraint Reasoning 2018: 61-99 - 2017
- [c33]Mikolás Janota, Radu Grigore, Vasco M. Manquinho:
On the Quest for an Acyclic Graph. RCRA@AI*IA 2017: 33-44 - [c32]Filipe Gouveia, Pedro T. Monteiro, Vasco M. Manquinho, Inês Lynce:
Logic-Based Encodings for Ricochet Robots. EPIA 2017: 657-669 - [c31]Miguel Terra-Neves, Inês Lynce, Vasco M. Manquinho:
Introducing Pareto Minimal Correction Subsets. SAT 2017: 195-211 - [i9]Mikolas Janota, Radu Grigore, Vasco M. Manquinho:
On the Quest for an Acyclic Graph. CoRR abs/1708.01745 (2017) - 2016
- [c30]Xujie Si, Xin Zhang, Vasco M. Manquinho, Mikolás Janota, Alexey Ignatiev, Mayur Naik:
On Incremental Core-Guided MaxSAT Solving. CP 2016: 473-482 - [c29]Miguel Terra-Neves, Inês Lynce, Vasco M. Manquinho:
Non-Portfolio Approaches for Distributed Maximum Satisfiability. ICTAI 2016: 436-443 - 2015
- [j14]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Deterministic Parallel MaxSAT Solving. Int. J. Artif. Intell. Tools 24(3): 1550005:1-1550005:25 (2015) - [j13]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Improving linear search algorithms with model-based approaches for MaxSAT solving. J. Exp. Theor. Artif. Intell. 27(5): 673-701 (2015) - [c28]Saurabh Joshi, Ruben Martins, Vasco M. Manquinho:
Generalized Totalizer Encoding for Pseudo-Boolean Constraints. CP 2015: 200-209 - [c27]Miguel Neves, Ruben Martins, Mikolás Janota, Inês Lynce, Vasco M. Manquinho:
Exploiting Resolution-Based Representations for MaxSAT Solving. SAT 2015: 272-286 - [i8]Miguel Neves, Ruben Martins, Mikolás Janota, Inês Lynce, Vasco M. Manquinho:
Exploiting Resolution-based Representations for MaxSAT Solving. CoRR abs/1505.02405 (2015) - [i7]Miguel Neves, Inês Lynce, Vasco M. Manquinho:
DistMS: A Non-Portfolio Distributed Solver for Maximum Satisfiability. CoRR abs/1505.02408 (2015) - [i6]Saurabh Joshi, Ruben Martins, Vasco M. Manquinho:
Generalized Totalizer Encoding for Pseudo-Boolean Constraints. CoRR abs/1507.05920 (2015) - 2014
- [j12]Miguel Miranda, Inês Lynce, Vasco M. Manquinho:
Inferring phylogenetic trees using pseudo-Boolean optimization. AI Commun. 27(3): 229-243 (2014) - [j11]Ruben Martins, Saurabh Joshi, Vasco M. Manquinho, Inês Lynce:
On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving. J. Satisf. Boolean Model. Comput. 9(1): 59-81 (2014) - [c26]Ruben Martins, Saurabh Joshi, Vasco M. Manquinho, Inês Lynce:
Incremental Cardinality Constraints for MaxSAT. CP 2014: 531-548 - [c25]Alexey Ignatiev, António Morgado, Vasco M. Manquinho, Inês Lynce, João Marques-Silva:
Progression in Maximum Satisfiability. ECAI 2014: 453-458 - [c24]João Marques-Silva, Alexey Ignatiev, António Morgado, Vasco M. Manquinho, Inês Lynce:
Efficient Autarkies. ECAI 2014: 603-608 - [c23]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Open-WBO: A Modular MaxSAT Solver, . SAT 2014: 438-445 - [i5]Ruben Martins, Saurabh Joshi, Vasco M. Manquinho, Inês Lynce:
Incremental Cardinality Constraints for MaxSAT. CoRR abs/1408.4628 (2014) - 2013
- [c22]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Community-Based Partitioning for MaxSAT Solving. SAT 2013: 182-191 - 2012
- [j10]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Parallel search for maximum satisfiability. AI Commun. 25(2): 75-95 (2012) - [j9]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
An overview of parallel SAT solving. Constraints An Int. J. 17(3): 304-347 (2012) - [j8]Mikolás Janota, Inês Lynce, Vasco M. Manquinho, João Marques-Silva:
PackUp: Tools for Package Upgradability Solving. J. Satisf. Boolean Model. Comput. 8(1/2): 89-94 (2012) - [c21]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
On Partitioning for Maximum Satisfiability. ECAI 2012: 913-914 - [c20]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Clause Sharing in Parallel MaxSAT. LION 2012: 455-460 - [i4]Rui Henriques, Inês Lynce, Vasco M. Manquinho:
On When and How to use SAT to Mine Frequent Itemsets. CoRR abs/1207.6253 (2012) - 2011
- [c19]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Exploiting Cardinality Encodings in Parallel Maximum Satisfiability. ICTAI 2011: 313-320 - 2010
- [j7]João Delgado, Inês Lynce, Vasco M. Manquinho:
Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes. J. Comput. Biol. 17(9): 1243-1265 (2010) - [j6]Wei-Chung Kao, Wei-Shun Chuang, Shiu-Ting Lin, Chien-Mo James Li, Vasco M. Manquinho:
DFT and Minimum Leakage Pattern Generation for Static Power Reduction During Test and Burn-In. IEEE Trans. Very Large Scale Integr. Syst. 18(3): 392-400 (2010) - [c18]Ruben Martins, Vasco M. Manquinho, Inês Lynce:
Improving Search Space Splitting for Parallel SAT Solving. ICTAI (1) 2010: 336-343 - [c17]Vasco M. Manquinho, Ruben Martins, Inês Lynce:
Improving Unsatisfiability-Based Algorithms for Boolean Optimization. SAT 2010: 181-193 - [i3]Nuno P. Lopes, Levent Aksoy, Vasco M. Manquinho, José Monteiro:
Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability. CoRR abs/1011.2685 (2010)
2000 – 2009
- 2009
- [c16]João Delgado, Inês Lynce, Vasco M. Manquinho:
Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes Using Pseudo-Boolean Optimization. RECOMB-CG 2009: 138-149 - [c15]Vasco M. Manquinho, João Marques-Silva, Jordi Planes:
Algorithms for Weighted Boolean Optimization. SAT 2009: 495-508 - [p2]Olivier Roussel, Vasco M. Manquinho:
Pseudo-Boolean and Cardinality Constraints. Handbook of Satisfiability 2009: 695-733 - [i2]Vasco M. Manquinho, João Marques-Silva, Jordi Planes:
Algorithms for Weighted Boolean Optimization. CoRR abs/0903.0843 (2009) - 2008
- [j5]Ewald Speckenmeyer, Armando Tacchella, Vasco M. Manquinho, Chu Min Li:
Guest Editors Conclusion. J. Satisf. Boolean Model. Comput. 4(2-4) (2008) - [c14]Federico Heras, Vasco M. Manquinho, João Marques-Silva:
On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization. FLAIRS 2008: 71-76 - [c13]João Marques-Silva, Inês Lynce, Vasco M. Manquinho:
Symmetry Breaking for Maximum Satisfiability. LPAR 2008: 1-15 - [c12]José Faustino Fragoso Femenin dos Santos, Vasco M. Manquinho:
Learning Techniques for Pseudo-Boolean Solving. LPAR Workshops 2008 - [c11]João Marques-Silva, Vasco M. Manquinho:
Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms. SAT 2008: 225-230 - [p1]Inês Lynce, Vasco M. Manquinho, João Marques-Silva:
Backtracking. Wiley Encyclopedia of Computer Science and Engineering 2008 - [i1]João Marques-Silva, Inês Lynce, Vasco M. Manquinho:
Symmetry Breaking for Maximum Satisfiability. CoRR abs/0804.0599 (2008) - 2006
- [j4]Vasco M. Manquinho, Olivier Roussel:
The First Evaluation of Pseudo-Boolean Solvers (PB'05). J. Satisf. Boolean Model. Comput. 2(1-4): 103-143 (2006) - [j3]Vasco M. Manquinho, João Marques-Silva:
On Using Cutting Planes in Pseudo-Boolean Optimization. J. Satisf. Boolean Model. Comput. 2(1-4): 209-219 (2006) - [c10]António Morgado, Paulo J. Matos, Vasco M. Manquinho, João Marques-Silva:
Counting Models in Integer Domains. SAT 2006: 410-423 - 2005
- [c9]Vasco M. Manquinho, João Marques-Silva:
Effective Lower Bounding Techniques for Pseudo-Boolean Optimization. DATE 2005: 660-665 - [c8]Vasco M. Manquinho, João Marques-Silva:
Satisfiability-Based Algorithms for Pseudo-Boolean Optimization Using Gomory Cuts and Search Restarts. ICTAI 2005: 150-155 - [c7]Vasco M. Manquinho, João Marques-Silva:
On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization. SAT 2005: 451-458 - 2004
- [j2]Vasco M. Manquinho, João P. Marques Silva:
Satisfiability-Based Algorithms for Boolean Optimization. Ann. Math. Artif. Intell. 40(3-4): 353-372 (2004) - [c6]Vasco M. Manquinho, João Marques-Silva:
Integration of Lower Bound Estimates in Pseudo-Boolean Optimization. ICTAI 2004: 742-748 - [c5]Vasco M. Manquinho, João Marques-Silva:
Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization. SAT 2004 - 2002
- [j1]Vasco M. Manquinho, João P. Marques Silva:
Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 21(5): 505-516 (2002) - 2000
- [c4]Vasco M. Manquinho, João Marques-Silva:
On Solving Boolean Optimization with Satisfiability-Based Algorithms. AI&M 2000 - [c3]Vasco M. Manquinho, João Marques-Silva:
On Using Satisfiability-Based Pruning Techniques in Covering Algorithms. DATE 2000: 356-363 - [c2]Vasco M. Manquinho, João Marques-Silva:
Search Pruning Conditions for Boolean Optimization. ECAI 2000: 103-107
1990 – 1999
- 1997
- [c1]Vasco M. Manquinho, Paulo F. Flores, João P. Marques Silva, Arlindo L. Oliveira:
Prime Implicant Computation Using Satisfiability Algorithms. ICTAI 1997: 232-239
Coauthor Index
Mikolás Janota
aka: Mikolas Janota
aka: Mikolas Janota
[j22] [c57] [j21] [c53] [c51] [i18] [j19] [i15] [i14] [c46] [c45] [i11] [c42] [j15] [c41] [c40] [c38] [i10] [c37] [c36] [c35] [c34] [p3] [c32] [c31] [c29] [j14] [j13] [c27] [i8] [i7] [j12] [j11] [c26] [c25] [c24] [c23] [i5] [c22] [j10] [j9] [j8] [c21] [c20] [i4] [c19] [j7] [c18] [c17] [c16] [c13] [p1] [i1]
João Marques-Silva 0001
aka: João P. Marques Silva
aka: João P. Marques Silva
a service of 
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-07 01:00 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:
