default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEldar Fischer
Person information
SPARQL queries 
🛈 Please note that only 65% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c49]Tomer Adar, Eldar Fischer:
Refining the Adaptivity Notion in the Huge Object Model. APPROX/RANDOM 2024: 45:1-45:16- [c48]Tomer Adar, Eldar Fischer, Amit Levi:
Support Testing in the Huge Object Model. APPROX/RANDOM 2024: 46:1-46:16 - [c47]Tomer Adar, Eldar Fischer, Amit Levi:
Improved Bounds for High-Dimensional Equivalence and Product Testing Using Subcube Queries. APPROX/RANDOM 2024: 48:1-48:21 - [c46]Eldar Fischer, Johann A. Makowsky:
Extensions and Limits of the Specker-Blatter Theorem. CSL 2024: 26:1-26:20 - [i39]Eldar Fischer:
A basic lower bound for property testing. CoRR abs/2403.04999 (2024) - [i38]Tomer Adar, Eldar Fischer, Amit Levi:
Improved Bounds for High-Dimensional Equivalence and Product Testing using Subcube Queries. CoRR abs/2408.02347 (2024) - 2023
- [c45]Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen
:
Testing of Index-Invariant Properties in the Huge Object Model. COLT 2023: 3065-3136 - [i37]Tomer Adar, Eldar Fischer:
Refining the Adaptivity Notion in the Huge Object Model. CoRR abs/2306.16129 (2023) - [i36]Tomer Adar, Eldar Fischer, Amit Levi:
Support Testing in the Huge Object Model. CoRR abs/2308.15988 (2023) - 2022
- [c44]Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing. APPROX/RANDOM 2022: 27:1-27:23 - [i35]Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Testing of Index-Invariant Properties in the Huge Object Model. CoRR abs/2207.12514 (2022) - [i34]Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Testing of Index-Invariant Properties in the Huge Object Model. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c43]Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Yuichi Yoshida:
Ordered Graph Limits and Their Applications. ITCS 2021: 42:1-42:20 - [i33]Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Exploring the Gap between Tolerant and Non-tolerant Distribution Testing. CoRR abs/2110.09972 (2021) - 2020
- [c42]Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum:
Hard Properties with (Very) Short PCPPs and Their Applications. ITCS 2020: 9:1-9:27
2010 – 2019
- 2019
- [j33]Eldar Fischer, Oded Lachish, Yadu Vasudev:
Improving and Extending the Testing of Distributions for Shape-Restricted Properties. Algorithmica 81(9): 3765-3802 (2019) - [j32]Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev:
Fast distributed algorithms for testing graph properties. Distributed Comput. 32(1): 41-57 (2019) - [i32]Nikola K. Blanchard, Eldar Fischer, Oded Lachish, Felix Reidl:
Longest paths in 2-edge-connected cubic graphs. CoRR abs/1903.02508 (2019) - [i31]Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum:
Hard properties with (very) short PCPPs and their applications. CoRR abs/1909.03255 (2019) - 2018
- [c41]Omri Ben-Eliezer, Eldar Fischer:
Earthmover Resilience and Testing in Ordered Structures. CCC 2018: 18:1-18:35 - [c40]Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya:
Improved bounds for testing Dyck languages. SODA 2018: 1529-1544 - [i30]Omri Ben-Eliezer, Eldar Fischer:
Earthmover Resilience and Testing in Ordered Structures. CoRR abs/1801.09798 (2018) - [i29]Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Yuichi Yoshida:
Limits of Ordered Graphs and Images. CoRR abs/1811.02023 (2018) - [i28]Omri Ben-Eliezer, Eldar Fischer:
Earthmover Resilience and Testing in Ordered Structures. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c39]Noga Alon, Omri Ben-Eliezer, Eldar Fischer:
Testing Hereditary Properties of Ordered Graphs and Matrices. FOCS 2017: 848-858 - [c38]Eldar Fischer, Oded Lachish, Yadu Vasudev:
Improving and Extending the Testing of Distributions for Shape-Restricted Properties. STACS 2017: 31:1-31:14 - [i27]Noga Alon, Omri Ben-Eliezer, Eldar Fischer:
Testing hereditary properties of ordered graphs and matrices. CoRR abs/1704.02367 (2017) - [i26]Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya:
Improved bounds for testing Dyck languages. CoRR abs/1707.06606 (2017) - [i25]Noga Alon, Omri Ben-Eliezer, Eldar Fischer:
Testing hereditary properties of ordered graphs and matrices. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j31]Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
On the Power of Conditional Samples in Distribution Testing. SIAM J. Comput. 45(4): 1261-1296 (2016) - [j30]Eldar Fischer, Yonatan Goldhirsh, Oded Lachish:
Testing Read-Once Formula Satisfaction. ACM Trans. Comput. Theory 8(2): 5:1-5:26 (2016) - [c37]Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev:
Fast Distributed Algorithms for Testing Graph Properties. DISC 2016: 43-56 - [i24]Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev:
Fast Distributed Algorithms for Testing Graph Properties. CoRR abs/1602.03718 (2016) - [i23]Eldar Fischer, Oded Lachish, Yadu Vasudev:
Improving and extending the testing of distributions for shape-restricted properties. CoRR abs/1609.06736 (2016) - 2015
- [c36]Eldar Fischer, Oded Lachish, Yadu Vasudev:
Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability. FOCS 2015: 1163-1182 - [i22]Eldar Fischer, Oded Lachish, Yadu Vasudev:
Trading query complexity for sample-based testing and multi-testing scalability. CoRR abs/1504.00695 (2015) - [i21]Eldar Fischer, Oded Lachish, Yadu Vasudev:
Trading query complexity for sample-based testing and multi-testing scalability}. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j29]Sourav Chakraborty, Eldar Fischer, Arie Matsliah:
Query Complexity Lower Bounds for Reconstruction of Codes. Theory Comput. 10: 515-533 (2014) - [c35]Eldar Fischer, Yonatan Goldhirsh, Oded Lachish:
Partial tests, universal tests and decomposability. ITCS 2014: 483-500 - 2013
- [c34]Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
On the power of conditional samples in distribution testing. ITCS 2013: 561-580 - [c33]Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett:
Testing Low Complexity Affine-Invariant Properties. SODA 2013: 1337-1355 - [c32]Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett:
Every locally characterized affine-invariant property is testable. STOC 2013: 429-436 - [i20]Eldar Fischer, Yonatan Goldhirsh, Oded Lachish:
Some properties are not even partially testable. CoRR abs/1306.1360 (2013) - [i19]Eldar Fischer, Yonatan Goldhirsh, Oded Lachish:
Some properties are not even partially testable. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j28]Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman, Orly Yahalom:
On the query complexity of testing orientations for being Eulerian. ACM Trans. Algorithms 8(2): 15:1-15:41 (2012) - [c31]Sourav Chakraborty, Eldar Fischer, David García-Soriano, Arie Matsliah:
Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching. CCC 2012: 148-158 - [c30]Eldar Fischer, Yonatan Goldhirsh, Oded Lachish:
Testing Formula Satisfaction. SWAT 2012: 376-387 - [i18]Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett:
Testing Low Complexity Affine-Invariant Properties. CoRR abs/1201.0330 (2012) - [i17]Eldar Fischer, Yonatan Goldhirsh, Oded Lachish:
Testing Formula Satisfaction. CoRR abs/1204.3413 (2012) - [i16]Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
On the Power of Conditional Samples in Distribution Testing. CoRR abs/1210.8338 (2012) - [i15]Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett:
Every locally characterized affine-invariant property is testable. CoRR abs/1212.3849 (2012) - [i14]Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett:
Every locally characterized affine-invariant property is testable. Electron. Colloquium Comput. Complex. TR12 (2012) - [i13]Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett:
Testing Low Complexity Affine-Invariant Properties. Electron. Colloquium Comput. Complex. TR12 (2012) - [i12]Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
On the Power of Conditional Samples in Distribution Testing. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j27]Eldar Fischer, Orly Yahalom:
Testing Convexity Properties of Tree Colorings. Algorithmica 60(4): 766-805 (2011) - [j26]Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra:
PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability. Comput. Complex. 20(3): 413-504 (2011) - [j25]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster:
Hardness and algorithms for rainbow connection. J. Comb. Optim. 21(3): 330-347 (2011) - [c29]Eldar Fischer, Eyal Rozenberg:
Inflatable Graph Properties and Natural Property Tests. APPROX-RANDOM 2011: 542-554 - [c28]Sagi Ben-Moshe, Yaron Kanza, Eldar Fischer, Arie Matsliah, Mani Fischer, Carl Staelin:
Detecting and exploiting near-sortedness for efficient relational query evaluation. ICDT 2011: 256-267 - [c27]Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfeld, Paul Valiant:
Testing monotonicity of distributions over general partial orders. ICS 2011: 239-252 - [c26]Sourav Chakraborty, Eldar Fischer, Arie Matsliah:
Query Complexity Lower Bounds for Reconstruction of Codes. ICS 2011: 264-274 - 2010
- [j24]Eldar Fischer, Frédéric Magniez, Michel de Rougemont:
Approximate Satisfiability and Equivalence. SIAM J. Comput. 39(6): 2251-2281 (2010) - [j23]Eldar Fischer, Arie Matsliah, Asaf Shapira:
Approximate Hypergraph Partitioning and Applications. SIAM J. Comput. 39(7): 3155-3185 (2010) - [c25]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf:
New Results on Quantum Property Testing. FSTTCS 2010: 145-156 - [c24]Sourav Chakraborty, Eldar Fischer, Oded Lachish, Raphael Yuster:
Two-phase Algorithms for the Parametric Shortest Path Problem. STACS 2010: 167-178 - [i11]Eldar Fischer, Oded Lachish, Raphael Yuster:
Two-phase algorithms for the parametric shortest path problem. CoRR abs/1001.3749 (2010) - [i10]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf:
New Results on Quantum Property Testing. CoRR abs/1005.0523 (2010) - [i9]Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfeld, Paul Valiant:
Testing monotonicity of distributions over general partial orders. Electron. Colloquium Comput. Complex. TR10 (2010) - [i8]Sourav Chakraborty, Eldar Fischer, Arie Matsliah:
Query Complexity Lower Bounds for Reconstruction of Codes. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j22]Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira:
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity. SIAM J. Comput. 39(1): 143-167 (2009) - [c23]Eldar Fischer, Tomer Kotek, Johann A. Makowsky:
Application of logic to combinatorial sequences and their recurrence relations. AMS-ASL Joint Special Session 2009: 1-42 - [c22]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster:
Hardness and Algorithms for Rainbow Connectivity. STACS 2009: 243-254 - [i7]Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster:
Hardness and Algorithms for Rainbow Connectivity. CoRR abs/0902.1255 (2009) - 2008
- [j21]Eldar Fischer, Johann A. Makowsky, Elena V. Ravve:
Counting truth assignments of formulas of bounded tree-width or clique-width. Discret. Appl. Math. 156(4): 511-529 (2008) - [j20]Eldar Fischer, Arie Matsliah:
Testing Graph Isomorphism. SIAM J. Comput. 38(1): 207-225 (2008) - [c21]Eldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, Orly Yahalom:
On the Query Complexity of Testing Orientations for Being Eulerian. APPROX-RANDOM 2008: 402-415 - [c20]Eldar Fischer, Johann A. Makowsky:
Linear Recurrence Relations for Graph Polynomials. Pillars of Computer Science 2008: 266-279 - 2007
- [j19]Eldar Fischer, Ilan Newman:
Testing of matrix-poset properties. Comb. 27(3): 293-327 (2007) - [j18]Eldar Fischer, Ilan Newman:
Testing versus Estimation of Graph Properties. SIAM J. Comput. 37(2): 482-501 (2007) - [j17]Noga Alon, Eldar Fischer, Ilan Newman:
Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs. SIAM J. Comput. 37(3): 959-976 (2007) - [c19]Sourav Chakraborty, Eldar Fischer, Oded Lachish, Arie Matsliah, Ilan Newman:
Testing st -Connectivity. APPROX-RANDOM 2007: 380-394 - [c18]Eldar Fischer, Eyal Rozenberg:
Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects. APPROX-RANDOM 2007: 464-478 - [c17]Eldar Fischer, Arie Matsliah, Asaf Shapira:
Approximate Hypergraph Partitioning and Applications. FOCS 2007: 579-589 - [c16]Eldar Fischer, Orly Yahalom:
Testing Convexity Properties of Tree Colorings. STACS 2007: 109-120 - 2006
- [j16]Eldar Fischer, Lance Fortnow:
Tolerant Versus Intolerant Testing for Boolean Properties. Theory Comput. 2(9): 173-183 (2006) - [c15]Eldar Fischer, Frédéric Magniez, Michel de Rougemont:
Approximate Satisfiability and Equivalence. LICS 2006: 421-430 - [c14]Eldar Fischer, Arie Matsliah:
Testing graph isomorphism. SODA 2006: 299-308 - [c13]Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira:
A combinatorial characterization of the testable graph properties: it's all about regularity. STOC 2006: 251-260 - [i6]Eldar Fischer, Orly Yahalom:
Testing Convexity Properties of Tree Colorings. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j15]Eldar Fischer:
Testing graphs for colorability properties. Random Struct. Algorithms 26(3): 289-309 (2005) - [j14]Eldar Fischer:
The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance. SIAM J. Comput. 34(5): 1147-1158 (2005) - [c12]Eldar Fischer, Lance Fortnow:
Tolerant Versus Intolerant Testing for Boolean Properties. CCC 2005: 135-140 - [c11]Eldar Fischer, Ilan Newman:
Testing versus estimation of graph properties. STOC 2005: 138-146 - 2004
- [j13]Eldar Fischer:
On the strength of comparisons in property testing. Inf. Comput. 189(1): 107-116 (2004) - [j12]Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky:
Testing juntas. J. Comput. Syst. Sci. 68(4): 753-787 (2004) - [j11]Eldar Fischer, Johann A. Makowsky:
On spectra of sentences of monadic second order logic with counting. J. Symb. Log. 69(3): 617-640 (2004) - [j10]Eldar Fischer, Ilan Newman, Jirí Sgall:
Functions that have read-twice constant width branching programs are not necessarily testable. Random Struct. Algorithms 24(2): 175-193 (2004) - [c10]Eldar Fischer:
The difficulty of testing for isomorphism against a graph that is given in advance. STOC 2004: 391-397 - [i5]Eldar Fischer, Frédéric Magniez, Michel de Rougemont:
Property and Equivalence Testing on Strings. Electron. Colloquium Comput. Complex. TR04 (2004) - [i4]Eldar Fischer, Lance Fortnow:
Tolerant Versus Intolerant Testing for Boolean Properties. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j9]Eldar Fischer:
The Specker-Blatter theorem does not hold for quaternary relations. J. Comb. Theory A 103(1): 121-136 (2003) - [c9]Eldar Fischer, Johann A. Makowsky:
The Specker-Blatter Theorem Revisited. COCOON 2003: 90-101 - 2002
- [c8]Eldar Fischer, Ilan Newman:
Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable. CCC 2002: 73-79 - [c7]Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky:
Testing Juntas. FOCS 2002: 103-112 - [c6]Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky:
Monotonicity testing over general poset domains. STOC 2002: 474-483 - 2001
- [j8]Eldar Fischer:
The Art of Uninformed Decisions. Bull. EATCS 75: 97 (2001) - [j7]Noga Alon, Eldar Fischer, Mario Szegedy:
Parent-Identifying Codes. J. Comb. Theory A 95(2): 349-359 (2001) - [c5]Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, Patrick White:
Testing Random Variables for Independence and Identity. FOCS 2001: 442-451 - [c4]Eldar Fischer:
Testing graphs for colorable properties. SODA 2001: 873-882 - [c3]Eldar Fischer, Ilan Newman:
Testing of matrix properties. STOC 2001: 286-295 - [i3]Eldar Fischer:
On the strength of comparisons in property testing. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j6]Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy:
Efficient Testing of Large Graphs. Comb. 20(4): 451-476 (2000) - [i2]Eldar Fischer:
Testing graphs for colorability properties. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j5]Noga Alon, Eldar Fischer:
Refining the Graph Density Condition for the Existence of Almost K-factors. Ars Comb. 52 (1999) - [j4]Eldar Fischer:
Induced Complete h-partite Graphs in Dense Clique-less Graphs. Electron. J. Comb. 6 (1999) - [j3]Eldar Fischer:
Cycle factors in dense graphs. Discret. Math. 197-198: 309-323 (1999) - [j2]Eldar Fischer:
Variants of the Hajnal-Szemerédi Theorem. J. Graph Theory 31(4): 275-282 (1999) - [c2]Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy:
Efficient Testing of Large Graphs. FOCS 1999: 656-666 - [c1]Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra:
PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. STOC 1999: 29-40 - 1998
- [i1]Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra:
PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. Electron. Colloquium Comput. Complex. TR98 (1998) - 1996
- [j1]Noga Alon, Eldar Fischer:
2-factors in dense graphs. Discret. Math. 152(1-3): 13-23 (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-18 01:09 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:
