default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOfer Strichman
Ofer Shtrichman
Person information
- affiliation: Technion, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c68]Shengping Xiao, Yongkang Li, Xinyue Huang, Yicong Xu, Jianwen Li, Geguang Pu, Ofer Strichman, Moshe Y. Vardi:
Model-Guided Synthesis for LTL over Finite Traces. VMCAI (1) 2024: 186-207- 2022
- [j38]Roderick Bloem, Hana Chockler
, Masoud Ebrahimi, Ofer Strichman:
Specifiable robustness in reactive synthesis. Formal Methods Syst. Des. 60(2): 259-276 (2022) - [c67]Xiaoyu Zhang, Shengping Xiao, Jianwen Li, Geguang Pu, Ofer Strichman:
Combining BMC and Complementary Approximate Reachability to Accelerate Bug-Finding. ICCAD 2022: 126:1-126:9 - [e7]Kuldeep S. Meel, Ofer Strichman:
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel. LIPIcs 236, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-242-6 [contents] - [i7]Dor Cohen, Ofer Strichman:
Automated Repair of Neural Networks. CoRR abs/2207.08157 (2022) - [i6]Chaked R. J. Sayedoff, Ofer Strichman:
Regression verification of unbalanced recursive functions with multiple calls (long version). CoRR abs/2207.14364 (2022) - 2021
- [j37]Yair Nof, Ofer Strichman:
Real-time solving of computationally hard problems using optimal algorithm portfolios. Ann. Math. Artif. Intell. 89(7): 693-710 (2021) - [j36]Roderick Bloem, Hana Chockler, Masoud Ebrahimi, Ofer Strichman:
Vacuity in synthesis. Formal Methods Syst. Des. 57(3): 473-495 (2021) - [c66]Alexander Ivrii, Ofer Strichman:
Exploiting Isomorphic Subgraphs in SAT. FMCAD 2021: 204-211 - [i5]Alexander Ivrii, Ofer Strichman:
Exploiting Isomorphic Subgraphs in SAT (Long version). CoRR abs/2103.10267 (2021) - 2020
- [j35]Hana Chockler, Pascal Kesseli, Daniel Kroening, Ofer Strichman:
Learning the Language of Software Errors. J. Artif. Intell. Res. 67: 881-903 (2020) - [i4]Tomer Cohen, Lior Finkelman, Gal Grimberg, Gadi Shenhar, Ofer Strichman, Yonatan Strichman, Stav Yeger:
A combination of 'pooling' with a prediction model can reduce by 73% the number of COVID-19 (Corona-virus) tests. CoRR abs/2005.03453 (2020)
2010 – 2019
- 2019
- [j34]Nir Drucker, Hsi-Ming Ho, Joël Ouaknine, Michal Penn, Ofer Strichman:
Cyclic-routing of Unmanned Aerial Vehicles. J. Comput. Syst. Sci. 103: 18-45 (2019) - [c65]Roderick Bloem, Hana Chockler, Masoud Ebrahimi, Ofer Strichman:
Synthesizing Reactive Systems Using Robustness and Recovery Specifications. FMCAD 2019: 147-151 - 2018
- [j33]Dor Cohen, Ofer Strichman:
The Impact of Entropy and Solution Density on Selected SAT Heuristics. Entropy 20(9): 713 (2018) - [j32]Ofer Strichman:
Special issue: program equivalence. Formal Methods Syst. Des. 52(3): 227-228 (2018) - [i3]Shuvendu K. Lahiri, Andrzej S. Murawski, Ofer Strichman, Mattias Ulbrich:
Program Equivalence (Dagstuhl Seminar 18151). Dagstuhl Reports 8(4): 1-19 (2018) - 2017
- [j31]Ofer Strichman:
Near-Optimal Course Scheduling at the Technion. Interfaces 47(6): 537-554 (2017) - [c64]Gabriel A. Moreno, Ofer Strichman, Sagar Chaki, Radislav Vaisman:
Decision-Making with Cross-Entropy for Self-Adaptation. SEAMS@ICSE 2017: 90-101 - [c63]Roderick Bloem, Hana Chockler, Masoud Ebrahimi, Ofer Strichman:
Synthesizing Non-Vacuous Systems. VMCAI 2017: 55-72 - [e6]Ofer Strichman, Rachel Tzoref-Brill:
Hardware and Software: Verification and Testing - 13th International Haifa Verification Conference, HVC 2017, Haifa, Israel, November 13-15, 2017, Proceedings. Lecture Notes in Computer Science 10629, Springer 2017, ISBN 978-3-319-70388-6 [contents] - [i2]Dor Cohen, Ofer Strichman:
The impact of Entropy and Solution Density on selected SAT heuristics. CoRR abs/1706.05637 (2017) - 2016
- [b2]Daniel Kroening, Ofer Strichman:
Decision Procedures - An Algorithmic Point of View, Second Edition. Texts in Theoretical Computer Science. An EATCS Series, Springer 2016, ISBN 978-3-662-50496-3, pp. 1-307 - [j30]Michael Veksler, Ofer Strichman:
Learning general constraints in CSP. Artif. Intell. 238: 135-153 (2016) - [c62]Nir Drucker, Michal Penn, Ofer Strichman:
Cyclic Routing of Unmanned Aerial Vehicles. CPAIOR 2016: 125-141 - [c61]Ofer Strichman, Maor Veitsman:
Regression Verification for Unbalanced Recursive Functions. FM 2016: 645-658 - [c60]Ofer Guthmann, Ofer Strichman, Anna Trostanetski:
Minimal unsatisfiable core extraction for SMT. FMCAD 2016: 57-64 - 2015
- [j29]Dima Elenbogen, Shmuel Katz, Ofer Strichman:
Proving mutual termination. Formal Methods Syst. Des. 47(2): 204-229 (2015) - [j28]Sagar Chaki, Arie Gurfinkel, Ofer Strichman:
Regression verification for multi-threaded programs (with extensions to locks and dynamic thread creation). Formal Methods Syst. Des. 47(3): 287-301 (2015) - [j27]Radislav Vaisman, Ofer Strichman, Ilya B. Gertsbakh:
Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra. INFORMS J. Comput. 27(2): 406-415 (2015) - [c59]Martin Chapman, Hana Chockler, Pascal Kesseli, Daniel Kroening, Ofer Strichman, Michael Tautschnig:
Learning the Language of Error. ATVA 2015: 114-130 - [c58]Michael Veksler, Ofer Strichman:
Learning General Constraints in CSP. CPAIOR 2015: 410-426 - [c57]Alexander Ivrii, Vadim Ryvchin, Ofer Strichman:
Mining Backbone Literals in Incremental SAT - A New Kind of Incremental Data. SAT 2015: 88-103 - 2014
- [j26]Alexander Nadel, Vadim Ryvchin, Ofer Strichman:
Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores. J. Satisf. Boolean Model. Comput. 9(1): 27-51 (2014) - [c56]Alexander Nadel, Vadim Ryvchin, Ofer Strichman:
Ultimately Incremental SAT. SAT 2014: 206-218 - 2013
- [j25]Ofer Strichman, Daniel Kroening:
Preface to the special issue "SI: Satisfiability Modulo Theories". Formal Methods Syst. Des. 42(1): 1-2 (2013) - [j24]Hana Chockler, Arie Gurfinkel, Ofer Strichman:
Beyond vacuity: towards the strongest passing formula. Formal Methods Syst. Des. 43(3): 552-571 (2013) - [j23]Benny Godlin, Ofer Strichman:
Regression verification: proving the equivalence of similar programs. Softw. Test. Verification Reliab. 23(3): 241-258 (2013) - [c55]Sagar Chaki, Arie Gurfinkel, Ofer Strichman:
Verifying periodic programs with priority inheritance locks. FMCAD 2013: 137-144 - [c54]Alexander Nadel, Vadim Ryvchin, Ofer Strichman:
Efficient MUS extraction with resolution. FMCAD 2013: 197-200 - [c53]Batya Kenig, Avigdor Gal, Ofer Strichman:
A New Class of Lineage Expressions over Probabilistic Databases Computable in P-Time. SUM 2013: 219-232 - [c52]Sagar Chaki, Arie Gurfinkel, Soonho Kong, Ofer Strichman:
Compositional Sequentialization of Periodic Programs. VMCAI 2013: 536-554 - 2012
- [c51]Dima Elenbogen, Shmuel Katz, Ofer Strichman:
Proving Mutual Termination of Programs. Haifa Verification Conference 2012: 24-39 - [c50]Alexander Nadel, Vadim Ryvchin, Ofer Strichman:
Preprocessing in Incremental SAT. SAT 2012: 256-269 - [c49]Sagar Chaki, Arie Gurfinkel, Ofer Strichman:
Regression Verification for Multi-threaded Programs. VMCAI 2012: 119-135 - 2011
- [j22]Omer Bar-Ilan, Oded Fuhrmann, Shlomo Hoory, Ohad Shacham, Ofer Strichman:
Reducing the size of resolution proofs in linear time. Int. J. Softw. Tools Technol. Transf. 13(3): 263-272 (2011) - [j21]Laurent Fournier, Avi Ziv, Ekaterina Kutsy, Ofer Strichman:
A probabilistic analysis of coverage methods. ACM Trans. Design Autom. Electr. Syst. 16(4): 38:1-38:20 (2011) - [c48]Daniel Kroening, Joël Ouaknine, Ofer Strichman, Thomas Wahl, James Worrell:
Linear Completeness Thresholds for Bounded Model Checking. CAV 2011: 557-572 - [c47]Sagar Chaki, Arie Gurfinkel, Ofer Strichman:
Time-bounded analysis of real-time systems. FMCAD 2011: 72-80 - [c46]Vadim Ryvchin, Ofer Strichman:
Faster Extraction of High-Level Minimal Unsatisfiable Cores. SAT 2011: 174-187 - 2010
- [j20]Arie Matsliah, Ofer Strichman:
Underapproximation for model-checking based on universal circuits. Inf. Comput. 208(4): 315-326 (2010) - [c45]Michael Veksler, Ofer Strichman:
A Proof-Producing CSP Solver. AAAI 2010: 204-209 - [c44]Benny Godlin, Ofer Strichman:
Inference Rules for Proving the Equivalence of Recursive Procedures. Essays in Memory of Amir Pnueli 2010: 167-184 - [c43]Hana Chockler, Arie Gurfinkel, Ofer Strichman:
Variants of LTL Query Checking. Haifa Verification Conference 2010: 76-92 - [e5]Ofer Strichman, Stefan Szeider:
Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings. Lecture Notes in Computer Science 6175, Springer 2010, ISBN 978-3-642-14185-0 [contents]
2000 – 2009
- 2009
- [j19]Daniel Kroening, Ofer Strichman:
A framework for Satisfiability Modulo Theories. Formal Aspects Comput. 21(5): 485-494 (2009) - [j18]Hana Chockler, Ofer Strichman:
Before and after vacuity. Formal Methods Syst. Des. 34(1): 37-58 (2009) - [j17]Roman Gershman, Ofer Strichman:
HaifaSat: a SAT solver based on an Abstraction/Refinement model. J. Satisf. Boolean Model. Comput. 6(1-3): 33-51 (2009) - [j16]Randal E. Bryant, Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman, Bryan A. Brady:
An abstraction-based decision procedure for bit-vector arithmetic. Int. J. Softw. Tools Technol. Transf. 11(2): 95-104 (2009) - [c42]Ofer Strichman:
Regression Verification: Proving the Equivalence of Similar Programs. CAV 2009: 63 - [c41]Michael Ryabtsev, Ofer Strichman:
Translation Validation: From Simulink to C. CAV 2009: 696-701 - [c40]Benny Godlin, Ofer Strichman:
Regression verification. DAC 2009: 466-471 - [c39]Sagar Chaki, Arie Gurfinkel, Ofer Strichman:
Decision diagrams for linear arithmetic. FMCAD 2009: 53-60 - 2008
- [b1]Daniel Kroening, Ofer Strichman:
Decision Procedures - An Algorithmic Point of View. Texts in Theoretical Computer Science. An EATCS Series, Springer 2008, ISBN 978-3-540-74104-6, pp. 1-304 - [j15]Benny Godlin, Ofer Strichman:
Inference rules for proving the equivalence of recursive procedures. Acta Informatica 45(6): 403-439 (2008) - [j14]Sagar Chaki, Ofer Strichman:
Three optimizations for Assume-Guarantee reasoning with L*. Formal Methods Syst. Des. 32(3): 267-284 (2008) - [j13]Roman Gershman, Maya Koifman, Ofer Strichman:
An approach for extracting a small unsatisfiable core. Formal Methods Syst. Des. 33(1-3): 1-27 (2008) - [c38]Hana Chockler, Arie Gurfinkel, Ofer Strichman:
Beyond Vacuity: Towards the Strongest Passing Formula. FMCAD 2008: 1-8 - [c37]Dan Goldwasser, Ofer Strichman, Shai Fine:
A Theory-Based Decision Heuristic for DPLL(T). FMCAD 2008: 1-8 - [c36]Omer Bar-Ilan, Oded Fuhrmann, Shlomo Hoory, Ohad Shacham, Ofer Strichman:
Linear-Time Reductions of Resolution Proofs. Haifa Verification Conference 2008: 114-128 - [c35]Vadim Ryvchin, Ofer Strichman:
Local Restarts. SAT 2008: 271-276 - 2007
- [c34]Arie Matsliah, Ofer Strichman:
Underapproximation for Model-Checking Based on Random Cryptographic Constructions. CAV 2007: 339-351 - [c33]Hana Chockler, Ofer Strichman:
Easier and More Informative Vacuity Checks. MEMOCODE 2007: 189-198 - [c32]Sagar Chaki, Ofer Strichman:
Optimized L*-Based Assume-Guarantee Reasoning. TACAS 2007: 276-291 - [c31]Randal E. Bryant, Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman, Bryan A. Brady:
Deciding Bit-Vector Arithmetic with Abstraction. TACAS 2007: 358-372 - [c30]Mirron Rozanov, Ofer Strichman:
Generating Minimum Transitivity Constraints in P-time for Deciding Equality Logic. SMT@CAV 2007: 3-17 - [e4]Ofer Strichman, Armin Biere:
Proceedings of the Fourth International Workshop on Bounded Model Checking, BMC@FLoC 2006, Seattle, WA, USA, August 15, 2006. Electronic Notes in Theoretical Computer Science 174(3), Elsevier 2007 [contents] - 2006
- [j12]Yoav Rodeh, Ofer Strichman:
Building small equality graphs for deciding equality logic with uninterpreted functions. Inf. Comput. 204(1): 26-59 (2006) - [j11]Alex Groce, Sagar Chaki, Daniel Kroening, Ofer Strichman:
Error explanation with distance metrics. Int. J. Softw. Tools Technol. Transf. 8(3): 229-247 (2006) - [c29]Roman Gershman, Maya Koifman, Ofer Strichman:
Deriving Small Unsatisfiable Cores with Dominators. CAV 2006: 109-122 - [c28]Ofer Strichman, Armin Biere:
Preface. BMC@FLoC 2006: 1-2 - [e3]Armin Biere, Ofer Strichman:
Proceedings of the Third International Workshop on Bounded Model Checking, BMC@CAV 2005, Edinburgh, UK, July 11, 2005. Electronic Notes in Theoretical Computer Science 144(1), Elsevier 2006 [contents] - 2005
- [j10]Armin Biere, Ofer Strichman:
Introductory paper. Int. J. Softw. Tools Technol. Transf. 7(2): 87-88 (2005) - [j9]Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman:
Computational challenges in bounded model checking. Int. J. Softw. Tools Technol. Transf. 7(2): 174-183 (2005) - [c27]Anubhav Gupta, Ofer Strichman:
Abstraction Refinement for Bounded Model Checking. CAV 2005: 112-124 - [c26]Orly Meir, Ofer Strichman:
Yet Another Decision Procedure for Equality Logic. CAV 2005: 307-320 - [c25]Roman Gershman, Ofer Strichman:
HaifaSat: A New Robust SAT Solver. Haifa Verification Conference 2005: 76-89 - [c24]Orna Grumberg, Flavio Lerda, Ofer Strichman, Michael Theobald:
Proof-guided underapproximation-widening for multi-process systems. POPL 2005: 122-131 - [c23]Roman Gershman, Ofer Strichman:
Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas. SAT 2005: 423-429 - [c22]Ofer Strichman, Benny Godlin:
Regression Verification - A Practical Way to Verify Programs. VSTTE 2005: 496-501 - [c21]Armin Biere, Ofer Strichman:
Preface. BMC@CAV 2005: 1 - [c20]Amir Pnueli, Ofer Strichman:
Reduced Functional Consistency of Uninterpreted Functions. PDPAR@CAV 2005: 53-65 - [e2]Armin Biere, Ofer Strichman:
Proceedings of the 2nd International Workshop on Bounded Model Checking, BMC@CAV 2004, Boston, MA, USA, July 18, 2004. Electronic Notes in Theoretical Computer Science 119(2), Elsevier 2005 [contents] - 2004
- [j8]Ofer Strichman:
Accelerating Bounded Model Checking of Safety Properties. Formal Methods Syst. Des. 24(1): 5-24 (2004) - [j7]Sagar Chaki, Edmund M. Clarke, Alex Groce, Joël Ouaknine, Ofer Strichman, Karen Yorav:
Efficient Verification of Sequential and Concurrent C Programs. Formal Methods Syst. Des. 25(2-3): 129-166 (2004) - [j6]Edmund M. Clarke, Anubhav Gupta, Ofer Strichman:
SAT-based counterexample-guided abstraction refinement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(7): 1113-1123 (2004) - [c19]Muralidhar Talupur, Nishant Sinha, Ofer Strichman, Amir Pnueli:
Range Allocation for Separation Logic. CAV 2004: 148-161 - [c18]Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman:
Abstraction-Based Satisfiability Solving of Presburger Arithmetic. CAV 2004: 308-320 - [c17]Sagar Chaki, Alex Groce, Ofer Strichman:
Explaining abstract counterexamples. SIGSOFT FSE 2004: 73-82 - [c16]Edmund M. Clarke, Daniel Kroening, Joël Ouaknine, Ofer Strichman:
Completeness and Complexity of Bounded Model Checking. VMCAI 2004: 85-96 - [c15]Armin Biere, Ofer Strichman:
Preface. BMC@CAV 2004: 1- - [i1]Ofer Strichman:
Deciding Disjunctive Linear Arithmetic with SAT. CoRR cs.LO/0402002 (2004) - 2003
- [j5]Armin Biere, Alessandro Cimatti, Edmund M. Clarke, Ofer Strichman, Yunshan Zhu:
Bounded model checking. Adv. Comput. 58: 117-148 (2003) - [j4]Amir Pnueli, Yoav Rodeh, Ofer Strichman, Michael Siegel:
Erratum ("The small model property: how small can it be?" Volume 178, Number 1 [2002], pages 279-293). Inf. Comput. 184(1): 227 (2003) - [c14]Sagar Chaki, Edmund M. Clarke, Alex Groce, Ofer Strichman:
Predicate Abstraction with Minimum Predicates. CHARME 2003: 19-34 - [c13]Daniel Kroening, Ofer Strichman:
Efficient Computation of Recurrence Diameters. VMCAI 2003: 298-309 - [c12]Ofer Strichman, Armin Biere:
Preface. BMC@CAV 2003: 541-542 - [e1]Ofer Strichman, Armin Biere:
First International Workshop on Bounded Model Checking, BMC@CAV 2003, Boulder, Colorado, USA, July 13, 2003. Electronic Notes in Theoretical Computer Science 89(4), Elsevier 2003 [contents] - 2002
- [j3]Amir Pnueli, Yoav Rodeh, Ofer Strichman, Michael Siegel:
The Small Model Property: How Small Can It Be? Inf. Comput. 178(1): 279-293 (2002) - [c11]Ofer Strichman, Sanjit A. Seshia, Randal E. Bryant:
Deciding Separation Formulas with SAT. CAV 2002: 209-222 - [c10]Edmund M. Clarke, Anubhav Gupta, James H. Kukula, Ofer Strichman:
SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques. CAV 2002: 265-279 - [c9]Ofer Strichman:
On Solving Presburger and Linear Arithmetic with SAT. FMCAD 2002: 160-170 - 2001
- [j2]Ofer Shtrichman, Rami Ben-Haim, Moshe Asher Pollatschek:
Using Simulation to Increase Efficiency in an Army Recruitment Office. Interfaces 31(4): 61-70 (2001) - [c8]Yoav Rodeh, Ofer Strichman:
Finite Instantiations in Equivalence Logic with Uninterpreted Functions. CAV 2001: 144-154 - [c7]Ofer Strichman:
Pruning Techniques for the SAT-Based Bounded Model Checking Problem. CHARME 2001: 58-70 - [c6]Amir Pnueli, Yoav Rodeh, Ofer Strichman:
Range Allocation for Equivalence Logic. FSTTCS 2001: 317-333 - 2000
- [c5]Ofer Strichman:
Tuning SAT Checkers for Bounded Model Checking. CAV 2000: 480-494
1990 – 1999
- 1999
- [c4]Amir Pnueli, Ofer Strichman, Michael Siegel:
Translation Validation: From SIGNAL to C. Correct System Design 1999: 231-255 - [c3]Amir Pnueli, Yoav Rodeh, Ofer Strichman, Michael Siegel:
Deciding Equality Formulas by Small Domains Instantiations. CAV 1999: 455-469 - 1998
- [j1]Amir Pnueli, Ofer Strichman, Michael Siegel:
The Code Validation Tool CVT: Automatic Verification of a Compilation Process. Int. J. Softw. Tools Technol. Transf. 2(2): 192-201 (1998) - [c2]Amir Pnueli, Ofer Strichman, Michael Siegel:
Translation Validation: From DC+ to C*. FM-Trends 1998: 137-150 - [c1]Amir Pnueli, Ofer Strichman, Michael Siegel:
Translation Validation for Synchronous Languages. ICALP 1998: 235-246
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-22 20:50 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:
