default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlan L. Selman
Person information
- affiliation: University at Buffalo, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2017
[j57]Alan L. Selman, Arnold L. Rosenberg:
50 Years of TOCS. Theory Comput. Syst. 60(1): 1-2 (2017)- [c39]Christian Glaßer, Dung T. Nguyen, Alan L. Selman, Maximilian Witek:
Introduction to Autoreducibility and Mitoticity. Computability and Complexity 2017: 56-78 - 2016
- [j56]Andrew Hughes, Debasis Mandal, Aduri Pavan, Nathan Russell, Alan L. Selman:
A thirty Year old conjecture about promise problems. Comput. Complex. 25(4): 883-919 (2016) - [j55]Dung T. Nguyen, Alan L. Selman:
Structural Properties of Nonautoreducible Sets. ACM Trans. Comput. Theory 8(3): 11:1-11:24 (2016) - 2014
- [j54]Christian Glaßer, Andrew Hughes, Alan L. Selman, Nils Wisiol:
Disjoint NP-Pairs and Propositional Proof Systems. SIGACT News 45(4): 59-75 (2014) - [c38]Dung T. Nguyen, Alan L. Selman:
Non-autoreducible Sets for NEXP. STACS 2014: 590-601 - [p2]Steven Homer, Alan L. Selman:
Turing and the development of computational complexity. Turing's Legacy 2014: 299-328 - 2013
- [c37]Christian Glaßer, Dung T. Nguyen, Christian Reitwießner, Alan L. Selman, Maximilian Witek:
Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions. ICALP (1) 2013: 473-484 - [i18]Christian Glaßer, Dung T. Nguyen, Christian Reitwießner, Alan L. Selman, Maximilian Witek:
Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions. Electron. Colloquium Comput. Complex. TR13 (2013) - [i17]Dung T. Nguyen, Alan L. Selman:
Non-autoreducible Sets for NEXP. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c36]Andrew Hughes, Aduri Pavan, Nathan Russell, Alan L. Selman:
A Thirty Year Old Conjecture about Promise Problems. ICALP (1) 2012: 473-484 - 2011
- [b2]Steven Homer, Alan L. Selman:
Computability and Complexity Theory, Second Edition. Texts in Computer Science, Springer 2011, ISBN 978-1-4614-0681-5, pp. I-XVI, 1-298 - [j53]Jin-yi Cai, Alan L. Selman:
Foreword. J. Comput. Syst. Sci. 77(1): 1-2 (2011)
2000 – 2009
- 2009
- [j52]Christian Glaßer, Alan L. Selman, Liyu Zhang:
The Informational Content of Canonical Disjoint NP-Pairs. Int. J. Found. Comput. Sci. 20(3): 501-522 (2009) - [j51]Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang:
Non-mitotic sets. Theor. Comput. Sci. 410(21-23): 2011-2023 (2009) - 2008
- [j50]Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner:
The complexity of unions of disjoint sets. J. Comput. Syst. Sci. 74(7): 1173-1187 (2008) - [j49]Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Splitting NP-Complete Sets. SIAM J. Comput. 37(5): 1517-1535 (2008) - 2007
- [j48]Christian Glaßer, Mitsunori Ogihara
, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Autoreducibility, mitoticity, and immunity. J. Comput. Syst. Sci. 73(5): 735-754 (2007) - [j47]Christian Glaßer, Alan L. Selman, Liyu Zhang:
Canonical disjoint NP-pairs of propositional proof systems. Theor. Comput. Sci. 370(1-3): 60-73 (2007) - [j46]Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran:
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. Theor. Comput. Sci. 385(1-3): 167-178 (2007) - [c35]Christian Glaßer, Alan L. Selman, Liyu Zhang:
The Informational Content of Canonical Disjoint NP-Pairs. COCOON 2007: 307-317 - [c34]Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang:
Non-mitotic Sets. FSTTCS 2007: 146-157 - [c33]Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner:
The Complexity of Unions of Disjoint Sets. STACS 2007: 248-259 - [i16]Christian Glaßer, Alan L. Selman, Liyu Zhang:
The Informational Content of Canonical Disjoint NP-Pairs. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j45]Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta:
Properties of NP-Complete Sets. SIAM J. Comput. 36(2): 516-542 (2006) - [c32]Christian Glaßer, Alan L. Selman, Liyu Zhang:
Survey of Disjoint NP-pairs and Relations to Propositional Proof Systems. Essays in Memory of Shimon Even 2006: 241-253 - [c31]Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Redundancy in Complete Sets. STACS 2006: 444-454 - [c30]Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Mitosis in Computational Complexity. TAMC 2006: 61-67 - [e2]Oded Goldreich, Arnold L. Rosenberg, Alan L. Selman:
Theoretical Computer Science, Essays in Memory of Shimon Even. Lecture Notes in Computer Science 3895, Springer 2006, ISBN 3-540-32880-7 [contents] - [i15]Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner:
The Complexity of Unions of Disjoint Sets. Electron. Colloquium Comput. Complex. TR06 (2006) - [i14]Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang:
Non-Mitotic Sets. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j44]Christian Glaßer, Alan L. Selman, Samik Sengupta:
Reductions between disjoint NP-Pairs. Inf. Comput. 200(2): 247-267 (2005) - [c29]Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Autoreducibility, Mitoticity, and Immunity. MFCS 2005: 387-398 - [c28]Christian Glaßer, Alan L. Selman, Liyu Zhang:
Canonical Disjoint NP-Pairs of Propositional Proof Systems. MFCS 2005: 399-409 - [i13]Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Autoreducibility, Mitoticity, and Immunity. Electron. Colloquium Comput. Complex. TR05 (2005) - [i12]Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Redundancy in Complete Sets. Electron. Colloquium Comput. Complex. TR05 (2005) - [i11]Christian Glaßer, Alan L. Selman, Liyu Zhang:
Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j43]Aduri Pavan, Alan L. Selman:
Bi-immunity separates strong NP-completeness notions. Inf. Comput. 188(1): 116-126 (2004) - [j42]Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang:
Disjoint NP-Pairs. SIAM J. Comput. 33(6): 1369-1416 (2004) - [c27]Christian Glaßer, Alan L. Selman, Samik Sengupta:
Reductions between Disjoint NP-Pairs. CCC 2004: 42-53 - [c26]Alan L. Selman, Samik Sengupta:
Polylogarithmic-Round Interactive Proofs for coNP Collapse the Exponential Hierarchy. CCC 2004: 82-90 - [c25]Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta:
Properties of NP-Complete Sets. CCC 2004: 184-197 - [i10]Alan L. Selman, Samik Sengupta:
Polylogarithmic-round Interactive Proofs for coNP Collapses the Exponential Hierarchy. Electron. Colloquium Comput. Complex. TR04 (2004) - [i9]Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta:
Properties of NP-Complete Sets. Electron. Colloquium Comput. Complex. TR04 (2004) - [i8]Christian Glaßer, Alan L. Selman, Liyu Zhang:
Canonical Disjoint NP-Pairs of Propositional Proof Systems. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c24]Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang:
Disjoint NP-Pairs. CCC 2003: 313-332 - [i7]Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang:
Disjoint NP-Pairs. Electron. Colloquium Comput. Complex. TR03 (2003) - [i6]Christian Glaßer, Alan L. Selman, Samik Sengupta:
Reductions between Disjoint NP-Pairs. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [c23]Aduri Pavan, Alan L. Selman:
Bi-Immunity Separates Strong NP-Completeness Notions. STACS 2002: 408-418 - [i5]Aduri Pavan, Alan L. Selman:
Bi-Immunity Separates Strong NP-Completeness Notions. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [b1]Steven Homer, Alan L. Selman:
Computability and Complexity Theory. Texts in Computer Science, Springer 2001, ISBN 978-1-4419-2865-8, pp. i-xiii, 1-195 - [j41]John E. Savage, Alan L. Selman, Carl Smith:
The history and contribution of theoretical computer science. Adv. Comput. 55: 171-183 (2001) - [j40]Alan L. Selman:
Editorial Statement. Theory Comput. Syst. 34(1): 1 (2001) - [j39]Lance Fortnow, Aduri Pavan, Alan L. Selman:
Distributionally Hard Languages. Theory Comput. Syst. 34(3): 245-261 (2001) - [j38]Aduri Pavan, Alan L. Selman:
Separation of NP-Completeness Notions. SIAM J. Comput. 31(3): 906-918 (2001) - [c22]Aduri Pavan, Alan L. Selman:
Separation of NP-Completeness Notions. CCC 2001: 78-89 - [i4]Aduri Pavan, Alan L. Selman:
Separation of NP-completeness Notions. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j37]Aduri Pavan, Alan L. Selman:
Complete distributional problems, hard languages, and resource-bounded measure. Theor. Comput. Sci. 234(1-2): 273-286 (2000)
1990 – 1999
- 1999
- [j36]Ashish V. Naik, Alan L. Selman:
Adaptive Versus Nonadaptive Queries to NP and p-Selective Sets. Comput. Complex. 8(2): 169-187 (1999) - [j35]Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer:
Complements of Multivalued Functions. Chic. J. Theor. Comput. Sci. 1999 (1999) - [j34]Jin-yi Cai, Alan L. Selman:
Fine Separation of Average-Time Complexity Classes. SIAM J. Comput. 28(4): 1310-1325 (1999) - [c21]Lance Fortnow, Aduri Pavan, Alan L. Selman:
Distributionally-Hard Languages. COCOON 1999: 184-193 - 1998
- [j33]Lane A. Hemaspaandra, Alan L. Selman:
Writing and editing complexity theory: tales and tools. SIGACT News 29(4): 20-27 (1998) - [j32]Ashish V. Naik, John D. Rogers, James S. Royer, Alan L. Selman:
A Hierarchy Based on Output Multiplicity. Theor. Comput. Sci. 207(1): 131-157 (1998) - [i3]Lane A. Hemaspaandra, Alan L. Selman:
Writing and Editing Complexity Theory: Tales and Tools. CoRR cs.GL/9811005 (1998) - 1997
- [j31]Stephen A. Fenner, Steven Homer, Mitsunori Ogihara, Alan L. Selman:
Oracles that Compute Values. SIAM J. Comput. 26(4): 1043-1065 (1997) - [j30]Anne Condon, Faith E. Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys:
Strategic directions in research in theory of computing. SIGACT News 28(3): 75-93 (1997) - 1996
- [j29]Edith Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman:
P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility. J. Comput. Syst. Sci. 53(2): 194-209 (1996) - [j28]Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman:
Computing Solutions Uniquely Collapses the Polynomial Hierarchy. SIAM J. Comput. 25(4): 697-708 (1996) - [c20]Alan L. Selman:
Much Ado about Functions. CCC 1996: 198-212 - [c19]Ashish V. Naik, Alan L. Selman:
A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP. CCC 1996: 224-232 - [c18]Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer:
Complements of Multivalued Functions. CCC 1996: 260-269 - [c17]Jin-yi Cai, Alan L. Selman:
Fine Separation of Average Time Complexity Classes. STACS 1996: 331-343 - [i2]Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman:
Computing Solutions Uniquely Collapses the Polynomial Hierarchy. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j27]James C. French, Edward A. Fox, Kurt Maly, Alan L. Selman:
Wide Area Technical Report Service: Technical Reports Online. Commun. ACM 38(4): 45 (1995) - [j26]Lane A. Hemaspaandra, Albrecht Hoene, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman, Thomas Thierauf, Jie Wang:
Nondeterministically Selective Sets. Int. J. Found. Comput. Sci. 6(4): 403-416 (1995) - [i1]Jin-yi Cai, Alan L. Selman:
Average Time Complexity Classes. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j25]Alan L. Selman:
A Taxonomy of Complexity Classes of Functions. J. Comput. Syst. Sci. 48(2): 357-381 (1994) - [j24]James C. French, Edward A. Fox, Kurt Maly, Alan L. Selman:
Wide area technical report service - technical reports online. SIGACT News 25(3): 124-127 (1994) - [c16]Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, Alan L. Selman:
Computing Solutions Uniquely collapses the Polynomial Hierarchy. ISAAC 1994: 56-64 - 1993
- [j23]Luc Longpré, Alan L. Selman:
Hard Promise Problems and Nonuniform Complexity. Theor. Comput. Sci. 115(2): 277-290 (1993) - [c15]Ashish V. Naik, Mitsunori Ogiwara, Alan L. Selman:
P-Selective Sets, and Reducing Search to Decision vs. Self-Reducability. SCT 1993: 52-64 - [c14]Lane A. Hemachandra, Albrecht Hoene, Mitsunori Ogiwara, Alan L. Selman, Thomas Thierauf, Jie Wang:
Selectivity. ICCI 1993: 55-59 - [c13]Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman:
On Using Oracles That Compute Values. STACS 1993: 398-407 - [p1]Alan L. Selman:
Complexity Classes for Partial Functions. Current Trends in Theoretical Computer Science 1993: 504-522 - 1992
- [j22]Steven Homer, Alan L. Selman:
Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. J. Comput. Syst. Sci. 44(2): 287-301 (1992) - [j21]Alan L. Selman:
A Survey of One-Way Functions in Complexity Theory. Math. Syst. Theory 25(3): 203-221 (1992) - 1991
- [j20]Alan L. Selman:
Complexity Classes for Partial Functions. Bull. EATCS 45: 114-130 (1991) - 1990
- [c12]Alan L. Selman:
One-Way Functions in Complexity Theory. MFCS 1990: 88-104 - [c11]Luc Longpré, Alan L. Selman:
Hard Promise Problems and Nonuniform Complexity. STACS 1990: 216-226
1980 – 1989
- 1989
- [c10]Steven Homer, Alan L. Selman:
Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. SCT 1989: 3-14 - 1988
- [j19]Alan L. Selman:
Promise Problems Complete for Complexity Classes. Inf. Comput. 78(2): 87-97 (1988) - [j18]Joachim Grollmann, Alan L. Selman:
Complexity Measures for Public-Key Cryptosystems. SIAM J. Comput. 17(2): 309-335 (1988) - [j17]Alan L. Selman:
Natural Self-Reducible Sets. SIAM J. Comput. 17(5): 989-996 (1988) - 1987
- [c9]John G. Geske, Dung T. Huynh, Alan L. Selman:
A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees. STACS 1987: 125-135 - 1986
- [j16]Timothy J. Long, Alan L. Selman:
Relativizing complexity classes with sparse oracles. J. ACM 33(3): 618-627 (1986) - [e1]Alan L. Selman:
Structure in Complexity Theory, Proceedings of the Conference hold at the University of California, Berkeley, California, USA, June 2-5, 1986. Lecture Notes in Computer Science 223, Springer 1986, ISBN 3-540-16486-3 [contents] - 1985
- [j15]Shimon Even, Alan L. Selman, Yacov Yacobi:
Hard-Core Theorems for Complexity Classes. J. ACM 32(1): 205-217 (1985) - [j14]Ronald V. Book, Timothy J. Long, Alan L. Selman:
Qualitative Relativizations of Complexity Classes. J. Comput. Syst. Sci. 30(3): 395-413 (1985) - 1984
- [j13]Shimon Even, Alan L. Selman, Yacov Yacobi:
The Complexity of Promise Problems with Applications to Public-Key Cryptography. Inf. Control. 61(2): 159-173 (1984) - [j12]Ronald V. Book, Alan L. Selman:
Characterizations of Reduction Classes Modulo Oracle Conditions. Math. Syst. Theory 17(4): 263-277 (1984) - [j11]Ronald V. Book, Timothy J. Long, Alan L. Selman:
Quantitative Relativizations of Complexity Classes. SIAM J. Comput. 13(3): 461-487 (1984) - [c8]José L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman:
Sparse Oracles and Uniform Complexity Classes. FOCS 1984: 308-311 - [c7]Joachim Grollmann, Alan L. Selman:
Complexity Measures for Public-Key Cryptosystems (Preliminary Report). FOCS 1984: 495-503 - 1983
- [j10]Alan L. Selman, Xu Mei-Rui, Ronald V. Book:
Positive Relativizations of Complexity Classes. SIAM J. Comput. 12(3): 565-579 (1983) - [c6]Ronald V. Book, Timothy J. Long, Alan L. Selman:
Controlled relativizations of P and NP. Theoretical Computer Science 1983: 85-90 - 1982
- [j9]Alan L. Selman:
Analogues of Semicursive Sets and Effective Reducibilities to the Study of NP Complexity. Inf. Control. 52(1): 36-51 (1982) - [j8]Alan L. Selman:
Reductions on NP and P-Selective Sets. Theor. Comput. Sci. 19: 287-304 (1982) - [c5]Alan L. Selman, Yacov Yacobi:
The Complexity of Promise Problems. ICALP 1982: 502-509 - 1981
- [j7]Alan L. Selman:
Some Observations on NP, Real Numbers and P-Selective Sets. J. Comput. Syst. Sci. 23(3): 326-332 (1981)
1970 – 1979
- 1979
- [j6]Alan L. Selman:
P-selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP. Math. Syst. Theory 13: 55-65 (1979) - [j5]Theodore P. Baker, Alan L. Selman:
A Second Step Toward the Polynomial Hierarchy. Theor. Comput. Sci. 8: 177-187 (1979) - [c4]Alan L. Selman:
P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP. ICALP 1979: 546-555 - 1978
- [j4]Alan L. Selman:
Polynomial Time Enumeration Reducibility. SIAM J. Comput. 7(4): 440-457 (1978) - 1977
- [j3]Ronald V. Book, Celia Wrathall, Alan L. Selman, David P. Dobkin:
Inclusion Complete Tally Languages and the Hartmanis-Berman Conjecture. Math. Syst. Theory 11: 1-8 (1977) - 1976
- [c3]Theodore P. Baker, Alan L. Selman:
A Second Step toward the Polynomial Hierarchy. FOCS 1976: 71-75 - 1975
- [j2]Richard E. Ladner, Nancy A. Lynch, Alan L. Selman:
A Comparison of Polynomial Time Reducibilities. Theor. Comput. Sci. 1(2): 103-123 (1975) - 1974
- [j1]Neil D. Jones, Alan L. Selman:
Turing Machines and the Spectra of First-Order Formulas. J. Symb. Log. 39(1): 139-150 (1974) - [c2]Richard E. Ladner, Nancy A. Lynch, Alan L. Selman:
Comparisons of Polynomial-Time Reducibilities. STOC 1974: 110-121 - 1972
- [c1]Neil D. Jones, Alan L. Selman:
Turing Machines and the Spectra of First-Order Formulas with Equality. STOC 1972: 157-167
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 2025-01-21 00:14 CET 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:
