default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancine Blanchet-Sadri
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j78]Francine Blanchet-Sadri, Kun Chen, Kenneth Hawes:
Dyck Words, Lattice Paths, and Abelian Borders. Int. J. Found. Comput. Sci. 33(3&4): 203-226 (2022)
2010 – 2019
- 2018
- [j77]Francine Blanchet-Sadri, S. Osborne:
Computing longest common extensions in partial words. Discret. Appl. Math. 246: 119-139 (2018) - [j76]Francine Blanchet-Sadri, Michelle Cordier
, Rachel Kirsch:
Border correlations, lattices, and the subgraph component polynomial. Eur. J. Comb. 68: 204-222 (2018) - [j75]Francine Blanchet-Sadri, Justin Lazarow, Jordan Nikkel, J. D. Quigley, Xufan Zhang:
Computing primitively-rooted squares and runs in partial words. Eur. J. Comb. 68: 223-241 (2018) - 2017
- [j74]Francine Blanchet-Sadri, Kira Goldner, Aidan Shackleton:
Minimal partial languages and automata. RAIRO Theor. Informatics Appl. 51(2): 99-119 (2017) - [j73]Kevin Black, Francine Blanchet-Sadri, Ian Coley, Brent Woodhouse, Andrew Zemke:
Pattern Avoidance in Partial Words Dense with Holes. J. Autom. Lang. Comb. 22(4): 209-241 (2017) - [j72]Francine Blanchet-Sadri, Michelle Bodnar, Benjamin De Winkle:
New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings. Theory Comput. Syst. 60(3): 473-497 (2017) - [j71]Francine Blanchet-Sadri, Sinziana Munteanu:
Computing generalized de Bruijn sequences. Theor. Comput. Sci. 704: 42-61 (2017) - [c41]Joey Becker, Francine Blanchet-Sadri, Laure Flapan, Stephen Watkins:
Unavoidable Sets of Partial Words of Uniform Length. AFL 2017: 26-40 - [c40]Francine Blanchet-Sadri, Kun Chen, Kenneth Hawes:
Dyck Words, Lattice Paths, and Abelian Borders. AFL 2017: 56-70 - [c39]Francine Blanchet-Sadri, S. Osborne:
Constructing Words with High Distinct Square Densities. AFL 2017: 71-85 - 2016
- [j70]Francine Blanchet-Sadri, Andrew Lohr:
Computing Depths of Patterns. RAIRO Theor. Informatics Appl. 50(2): 117-133 (2016) - [j69]Francine Blanchet-Sadri, Aleksandar Chakarov, Bob Chen, Lucas Manuelli, Sinziana Munteanu, Jarett Schwartz, Slater Stich:
Recurrent Partial Words and Representable Sets. J. Autom. Lang. Comb. 21(3): 149-181 (2016) - [j68]Emily Allen, Francine Blanchet-Sadri, Michelle Bodnar, Brian Bowers, Joe Hidakatsu, John Lensmire:
Combinatorics on partial word borders. Theor. Comput. Sci. 609: 469-493 (2016) - [j67]Francine Blanchet-Sadri, Daniel Seita, David Wise:
Computing abelian complexity of binary uniform morphic words. Theor. Comput. Sci. 640: 41-51 (2016) - 2015
- [j66]Francine Blanchet-Sadri, Michelle Bodnar, Jordan Nikkel, J. D. Quigley, Xufan Zhang:
Squares and primitivity in partial words. Discret. Appl. Math. 185: 26-37 (2015) - [j65]Eric Balkanski, Francine Blanchet-Sadri, Matthew Kilgore, Benjamin J. Wyatt:
On the state complexity of partial word DFAs. Theor. Comput. Sci. 578: 2-12 (2015) - [j64]Francine Blanchet-Sadri, Andrew Lohr:
Computing minimum length representations of sets of words of uniform length. Theor. Comput. Sci. 596: 41-54 (2015) - [c38]Francine Blanchet-Sadri, Abraham Rashin:
Squareable Words. DLT 2015: 132-142 - [c37]Francine Blanchet-Sadri, Rachel Harred, Justin Lazarow:
Longest Common Extensions in Partial Words. IWOCA 2015: 52-64 - 2014
- [j63]Francine Blanchet-Sadri, Nathan Fox, Narad Rampersad:
On the asymptotic abelian complexity of morphic words. Adv. Appl. Math. 61: 46-84 (2014) - [j62]Francine Blanchet-Sadri, James D. Currie, Narad Rampersad, Nathan Fox:
Abelian Complexity of Fixed Point of Morphism 0 ↦ 012, 1 ↦ 02, 2 ↦ 1. Integers 14: A11 (2014) - [j61]Francine Blanchet-Sadri, Benjamin De Winkle, Sean Simmons:
Abelian pattern avoidance in partial words. RAIRO Theor. Informatics Appl. 48(3): 315-339 (2014) - [j60]Francine Blanchet-Sadri, Bob Chen, Sinziana Munteanu:
Recurrence in infinite partial words. Theor. Comput. Sci. 524: 41-47 (2014) - [j59]Francine Blanchet-Sadri, Yang Jiao, John M. Machacek, J. D. Quigley, Xufan Zhang:
Squares in partial words. Theor. Comput. Sci. 530: 42-57 (2014) - [c36]Francine Blanchet-Sadri, Michelle Cordier, Rachel Kirsch:
Border Correlations, Lattices, and the Subgraph Component Polynomial. IWOCA 2014: 62-73 - [c35]Francine Blanchet-Sadri, Andrew Lohr:
Computing Minimum Length Representations of Sets of Words of Uniform Length. IWOCA 2014: 74-85 - [c34]Francine Blanchet-Sadri, Jordan Nikkel, J. D. Quigley, Xufan Zhang:
Computing Primitively-Rooted Squares and Runs in Partial Words. IWOCA 2014: 86-97 - [c33]Francine Blanchet-Sadri, Andrew Lohr, Sean Simmons, Brent Woodhouse:
Computing Depths of Patterns. LATA 2014: 173-185 - [c32]Francine Blanchet-Sadri, Michelle Bodnar, Benjamin De Winkle:
New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings. STACS 2014: 162-173 - [c31]Francine Blanchet-Sadri, Kira Goldner, Aidan Shackleton:
Minimal Partial Languages and Automata. CIAA 2014: 110-123 - 2013
- [j58]Francine Blanchet-Sadri, Sean Simmons:
Counting minimal semi-Sturmian words. Discret. Appl. Math. 161(18): 2851-2861 (2013) - [j57]Francine Blanchet-Sadri, Bob Chen, Sinziana Munteanu:
A note on constructing infinite binary words with polynomial subword complexity. RAIRO Theor. Informatics Appl. 47(2): 195-199 (2013) - [j56]Francine Blanchet-Sadri, Sean Simmons, Amelia Tebbe, Amy Veprauskas:
Abelian periods, partial words, and an extension of a theorem of Fine and Wilf. RAIRO Theor. Informatics Appl. 47(3): 215-234 (2013) - [j55]Francine Blanchet-Sadri, Andrew Lohr, Shane Scott:
Computing the partial word avoidability indices of binary patterns. J. Discrete Algorithms 23: 113-118 (2013) - [j54]Francine Blanchet-Sadri, Andrew Lohr, Shane Scott:
Computing the partial word avoidability indices of ternary patterns. J. Discrete Algorithms 23: 119-142 (2013) - [j53]Francine Blanchet-Sadri, Sean Simmons:
Deciding representability of sets of words of equal length. Theor. Comput. Sci. 475: 34-46 (2013) - [j52]Francine Blanchet-Sadri, Nathan Fox:
Abelian-primitive partial words. Theor. Comput. Sci. 485: 16-37 (2013) - [j51]Francine Blanchet-Sadri, Brent Woodhouse:
Strict bounds for pattern avoidance. Theor. Comput. Sci. 506: 17-28 (2013) - [c30]Francine Blanchet-Sadri, Nathan Fox:
On the Asymptotic Abelian Complexity of Morphic Words. Developments in Language Theory 2013: 94-105 - [c29]Francine Blanchet-Sadri, Brent Woodhouse:
Strict Bounds for Pattern Avoidance. Developments in Language Theory 2013: 106-117 - [c28]Francine Blanchet-Sadri, Sinziana Munteanu:
Deciding Representability of Sets of Words of Equal Length in Polynomial Time. IWOCA 2013: 28-40 - [c27]Francine Blanchet-Sadri, Michelle Bodnar, Nathan Fox, Joe Hidakatsu:
A Graph Polynomial Approach to Primitivity. LATA 2013: 153-164 - [c26]Francine Blanchet-Sadri, Justin Lazarow:
Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem. LATA 2013: 165-176 - [c25]Eric Balkanski, Francine Blanchet-Sadri, Matthew Kilgore, Benjamin J. Wyatt:
Partial Word DFAs. CIAA 2013: 36-47 - 2012
- [j50]Francine Blanchet-Sadri, Sean Simmons, Dimin Xu:
Abelian repetitions in partial words. Adv. Appl. Math. 48(1): 194-214 (2012) - [j49]Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein:
Erratum to: Avoidable binary patterns in partial words. Acta Informatica 49(1): 53-54 (2012) - [j48]Francine Blanchet-Sadri:
Algorithmic Combinatorics on Partial Words. Int. J. Found. Comput. Sci. 23(6): 1189-1206 (2012) - [j47]Francine Blanchet-Sadri, Jane I. Kim, Robert Mercas, William Severa, Sean Simmons, Dimin Xu:
Avoiding abelian squares in partial words. J. Comb. Theory A 119(1): 257-270 (2012) - [j46]Francine Blanchet-Sadri, Bob Chen, Aleksandar Chakarov:
Number of holes in unavoidable sets of partial words I. J. Discrete Algorithms 14: 55-64 (2012) - [j45]Francine Blanchet-Sadri, Steven Ji, Elizabeth Reiland:
Number of holes in unavoidable sets of partial words II. J. Discrete Algorithms 14: 65-73 (2012) - [j44]Francine Blanchet-Sadri, Travis Mandel, Gautam Sisodia:
Periods in partial words: An algorithm. J. Discrete Algorithms 16: 113-128 (2012) - [j43]Francine Blanchet-Sadri, Robert Mercas:
The three-squares lemma for partial words with one hole. Theor. Comput. Sci. 428: 1-9 (2012) - [j42]Francine Blanchet-Sadri, Aleksandar Chakarov, Lucas Manuelli, Jarett Schwartz, Slater Stich:
Constructing partial words with subword complexities not achievable by full words. Theor. Comput. Sci. 432: 21-27 (2012) - [j41]Francine Blanchet-Sadri, Robert Mercas, Abraham Rashin, Elara Willett:
Periodicity algorithms and a conjecture on overlaps in partial words. Theor. Comput. Sci. 443: 35-45 (2012) - [c24]Francine Blanchet-Sadri, Sean Simmons:
Deciding Representability of Sets of Words of Equal Length. DCFS 2012: 103-116 - [c23]Francine Blanchet-Sadri, Yang Jiao, John M. Machacek:
Squares in Binary Partial Words. Developments in Language Theory 2012: 404-415 - [c22]Francine Blanchet-Sadri, Andrew Lohr, Shane Scott:
Computing the Partial Word Avoidability Indices of Ternary Patterns. IWOCA 2012: 206-218 - [c21]Francine Blanchet-Sadri, Sean Simmons:
Abelian Pattern Avoidance in Partial Words. MFCS 2012: 210-221 - 2011
- [j40]Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein:
Avoidable binary patterns in partial words. Acta Informatica 48(1): 25-41 (2011) - [j39]Emily Allen, Francine Blanchet-Sadri, Cameron Byrum, Mihai Cucuringu, Robert Mercas:
Counting Bordered Partial Words by Critical Positions. Electron. J. Comb. 18(1) (2011) - [j38]Francine Blanchet-Sadri, John Lensmire:
On minimal Sturmian partial words. Discret. Appl. Math. 159(8): 733-745 (2011) - [j37]Francine Blanchet-Sadri, Ilkyoo Choi, Robert Mercas:
Avoiding large squares in partial words. Theor. Comput. Sci. 412(29): 3752-3758 (2011) - [c20]Francine Blanchet-Sadri:
Open Problems on Avoidable Patterns in Partial Words. AFL 2011: 12-24 - [c19]Francine Blanchet-Sadri, Sarah Nelson, Amelia Tebbe:
On Operations Preserving Primitivity of Partial Words with One Hole. AFL 2011: 93-107 - [c18]Francine Blanchet-Sadri, Sean Simmons:
Avoiding Abelian Powers in Partial Words. Developments in Language Theory 2011: 70-81 - [c17]Francine Blanchet-Sadri, Travis Mandel, Gautam Sisodia:
Periods in Partial Words: An Algorithm. IWOCA 2011: 57-70 - [c16]Francine Blanchet-Sadri, Kevin Black, Andrew Zemke:
Unary Pattern Avoidance in Partial Words Dense with Holes. LATA 2011: 155-166 - [c15]Francine Blanchet-Sadri, John Lensmire:
On Minimal Sturmian Partial Words. STACS 2011: 225-236 - [c14]Francine Blanchet-Sadri, Aleksandar Chakarov, Lucas Manuelli, Jarett Schwartz, Slater Stich:
Recurrent Partial Words. WORDS 2011: 71-82 - 2010
- [j36]Francine Blanchet-Sadri, Taktin Oey, Timothy D. Rankin:
Fine and Wilf's Theorem for Partial Words with Arbitrarily Many Weak Periods. Int. J. Found. Comput. Sci. 21(5): 705-722 (2010) - [j35]Francine Blanchet-Sadri, Mihai Cucuringu:
Counting Primitive Partial Words. J. Autom. Lang. Comb. 15(3/4): 199-227 (2010) - [j34]Francine Blanchet-Sadri, Justin Fowler, Joshua D. Gafni, Kevin H. Wilson:
Combinatorics on partial word correlations. J. Comb. Theory A 117(6): 607-624 (2010) - [j33]Francine Blanchet-Sadri, E. Clader, O. Simpson:
Border Correlations of Partial Words. Theory Comput. Syst. 47(1): 179-195 (2010) - [j32]Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad:
On the complexity of deciding avoidability of sets of partial words. Theor. Comput. Sci. 411(49): 4263-4271 (2010) - [c13]Francine Blanchet-Sadri, Bob Chen, Aleksandar Chakarov:
Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three. IWOCA 2010: 43-55 - [c12]Francine Blanchet-Sadri, Jane I. Kim, Robert Mercas, William Severa, Sean Simmons:
Abelian Square-Free Partial Words. LATA 2010: 94-105 - [c11]Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein:
Avoidable Binary Patterns in Partial Words. LATA 2010: 106-117 - [c10]Francine Blanchet-Sadri, Jarett Schwartz, Slater Stich, Benjamin J. Wyatt:
Binary De Bruijn Partial Words with One Hole. TAMC 2010: 128-138 - [p2]Francine Blanchet-Sadri, Brandon Blakeley, Josh Gunter, Sean Simmons, Eric Weissenstein:
Classifying All Avoidable Sets of Partial Words of Size Two. Scientific Applications of Language Methods 2010: 59-101
2000 – 2009
- 2009
- [j31]Francine Blanchet-Sadri, Robert Mercas, Geoffrey Scott:
Counting Distinct Squares in Partial Words. Acta Cybern. 19(2): 465-477 (2009) - [j30]Francine Blanchet-Sadri, C. D. Davis, Joel Dodge, Robert Mercas, Margaret Moorefield:
Unbordered partial words. Discret. Appl. Math. 157(5): 890-900 (2009) - [j29]Francine Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis:
Equations on partial words. RAIRO Theor. Informatics Appl. 43(1): 23-39 (2009) - [j28]Francine Blanchet-Sadri, Robert Mercas:
A note on the number of squares in a partial word with one hole. RAIRO Theor. Informatics Appl. 43(4): 767-774 (2009) - [j27]Francine Blanchet-Sadri, N. C. Brownstein, Andy Kalcic, Justin Palumbo, Tracy Weyand:
Unavoidable Sets of Partial Words. Theory Comput. Syst. 45(2): 381-406 (2009) - [j26]Francine Blanchet-Sadri, Robert Mercas, Geoffrey Scott:
A generalization of Thue freeness for partial words. Theor. Comput. Sci. 410(8-10): 793-800 (2009) - [j25]Francine Blanchet-Sadri, Raphaël M. Jungers, Justin Palumbo:
Testing avoidability on sets of partial words is hard. Theor. Comput. Sci. 410(8-10): 968-972 (2009) - [c9]Brandon Blakeley, Francine Blanchet-Sadri, Josh Gunter, Narad Rampersad:
On the Complexity of Deciding Avoidability of Sets of Partial Words. Developments in Language Theory 2009: 113-124 - [c8]Francine Blanchet-Sadri, Emily Allen, Cameron Byrum, Robert Mercas:
How Many Holes Can an Unbordered Partial Word Contain?. LATA 2009: 176-187 - [c7]Francine Blanchet-Sadri, Robert Mercas, Abraham Rashin, Elara Willett:
An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms. LATA 2009: 188-199 - 2008
- [b1]Francine Blanchet-Sadri:
Algorithmic Combinatorics on Partial Words. Discrete mathematics and its applications, CRC Press 2008, ISBN 978-1-4200-6092-8, pp. 1-385 - [j24]Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodia:
Graph connectivity, partial words, and a theorem of Fine and Wilf. Inf. Comput. 206(5): 676-693 (2008) - [j23]Francine Blanchet-Sadri, Kevin Corcoran, Jenell Nyberg:
Periodicity properties on partial words. Inf. Comput. 206(9-10): 1057-1064 (2008) - [j22]Francine Blanchet-Sadri, L. Bromberg, K. Zipple:
Remarks on Two Nonstandard Versions of Periodicity in Words. Int. J. Found. Comput. Sci. 19(6): 1439-1448 (2008) - [c6]Francine Blanchet-Sadri, Robert Mercas, Geoffrey Scott:
Counting Distinct Squares in Partial Words. AFL 2008: 122-133 - [c5]Francine Blanchet-Sadri, Taktin Oey, Timothy D. Rankin:
Computing Weak Periods of Partial Words. AFL 2008: 134-145 - [p1]Francine Blanchet-Sadri:
Open Problems on Partial Words. New Developments in Formal Languages and Applications 2008: 11-58 - 2007
- [j21]Francine Blanchet-Sadri, Arundhati R. Anavekar:
Testing primitivity on partial words. Discret. Appl. Math. 155(3): 279-287 (2007) - [j20]Francine Blanchet-Sadri, Nathan D. Wetzler:
Partial words and the critical factorization theorem revisited. Theor. Comput. Sci. 385(1-3): 179-192 (2007) - [c4]Francine Blanchet-Sadri, N. C. Brownstein, Justin Palumbo:
Two Element Unavoidable Sets of Partial Words. Developments in Language Theory 2007: 96-107 - [c3]Francine Blanchet-Sadri, Kevin Corcoran, Jenell Nyberg:
Fine and Wilf's Periodicity Result on Partial Words and Consequences. LATA 2007: 115-126 - [c2]Francine Blanchet-Sadri, Joshua D. Gafni, Kevin H. Wilson:
Correlations of Partial Words. STACS 2007: 97-108 - 2006
- [c1]Francine Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis:
Equations on Partial Words. MFCS 2006: 167-178 - 2005
- [j19]Francine Blanchet-Sadri:
Primitive partial words. Discret. Appl. Math. 148(3): 195-213 (2005) - [j18]Lili Zhang, Francine Blanchet-Sadri:
Algorithms for approximate k-covering of strings. Int. J. Found. Comput. Sci. 16(6): 1231-1251 (2005) - [j17]Francine Blanchet-Sadri, S. Duncan:
Partial words and the critical factorization theorem. J. Comb. Theory A 109(2): 221-245 (2005) - 2004
- [j16]Francine Blanchet-Sadri, Ajay Chriscoe:
Local periods and binary partial words: an algorithm. Theor. Comput. Sci. 314(1-2): 189-216 (2004) - [j15]Francine Blanchet-Sadri:
Codes, orderings, and partial words. Theor. Comput. Sci. 329(1-3): 177-202 (2004) - 2002
- [j14]Francine Blanchet-Sadri, Robert A. Hegstrom:
Partial words and a theorem of Fine and Wilf revisited. Theor. Comput. Sci. 270(1-2): 401-419 (2002) - [j13]Francine Blanchet-Sadri, D. K. Luhmann:
Conjugacy on partial words. Theor. Comput. Sci. 289(1): 297-312 (2002) - 2001
- [j12]Francine Blanchet-Sadri:
On unique, multiset, set decipherability of three-word codes. IEEE Trans. Inf. Theory 47(5): 1745-1757 (2001)
1990 – 1999
- 1998
- [j11]Francine Blanchet-Sadri:
Trees, Congruences and Varieties of Finite Semigroups. Discret. Appl. Math. 86(2-3): 157-179 (1998) - 1997
- [j10]Francine Blanchet-Sadri:
On the Semidirect Product of the Pseudovariety of Semilattices by a Locally Finite Pseudovariety of Groups. RAIRO Theor. Informatics Appl. 31(3): 237-250 (1997) - 1996
- [j9]Francine Blanchet-Sadri:
Inclusion Relations Between Some Congruences Related to the Dot-depth Hierarchy. Discret. Appl. Math. 68(1-2): 33-71 (1996) - [j8]Francine Blanchet-Sadri:
On Semidirect and Two-Sided Semidirect Products of Finite J-Trivial Monoids. RAIRO Theor. Informatics Appl. 30(5): 457-482 (1996) - 1995
- [j7]Francine Blanchet-Sadri:
Equations on the Semidirect Product of a Finite Semilattice by a J-Trivial Monoid of Height k. RAIRO Theor. Informatics Appl. 29(3): 157-170 (1995) - [j6]Francine Blanchet-Sadri:
Some Logical Characterizations of the Dot-Depth Hierarchy and Applications. J. Comput. Syst. Sci. 51(2): 324-337 (1995) - 1994
- [j5]Francine Blanchet-Sadri:
On a complete set of generators for dot-depth two. Discret. Appl. Math. 50(1): 1-25 (1994) - [j4]Francine Blanchet-Sadri:
Equations and Monoid Varieties of Dot-Depth One and Two. Theor. Comput. Sci. 123(2): 239-258 (1994) - 1992
- [j3]Francine Blanchet-Sadri:
Games, Equations and Dot-Depth Two Monoids. Discret. Appl. Math. 39(2): 99-111 (1992) - [j2]Francine Blanchet-Sadri:
The Dot-Depth of a Generating Class of Aperiodic Monoids is Computable. Int. J. Found. Comput. Sci. 3(4): 419-442 (1992) - 1990
- [j1]Francine Blanchet-Sadri:
On dot-depth two. RAIRO Theor. Informatics Appl. 24: 521-529 (1990)
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-10-07 21:20 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:
