default search action
Aviezri S. Fraenkel
Person information
- affiliation: Weizmann Institute of Science, Israel
- award (2005): Euler Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
- [j102]Aviezri S. Fraenkel, Urban Larsson:
Games on Arbitrarily Large Rats and Playability. Integers 19: G4 (2019) - 2018
- [j101]Lior Goldberg, Aviezri S. Fraenkel:
Patterns in the generalized Fibonacci word, applied to games. Discret. Math. 341(6): 1675-1687 (2018) - [j100]Aviezri S. Fraenkel, Urban Larsson, Carlos Pereira dos Santos, Bernhard von Stengel:
Special issue on combinatorial game theory. Int. J. Game Theory 47(2): 375-377 (2018) - [j99]Lior Goldberg, Aviezri S. Fraenkel:
Rulesets for Beatty games. Int. J. Game Theory 47(2): 577-594 (2018) - 2017
- [j98]Haiyan Li, Sanyang Liu, Aviezri S. Fraenkel, Wen An Liu:
Variants of (d, t)-Wythoff's game. Discret. Appl. Math. 227: 1-12 (2017) - 2016
- [j97]George E. Andrews, Aviezri S. Fraenkel, James A. Sellers
:
m-ary partitions with no gaps: A characterization modulo m. Discret. Math. 339(1): 283-287 (2016) - 2015
- [j96]Aviezri S. Fraenkel, Nhan Bao Ho:
When are Translations of P-positions of Wythoff's Game P-positions? Integers 15A: A4 (2015) - [j95]George E. Andrews, Aviezri S. Fraenkel, James A. Sellers
Characterizing the Number of m-ary Partitions Modulo m. Am. Math. Mon. 122(9): 880-885 (2015) - 2014
- [j94]Alex Fink, Aviezri S. Fraenkel, Carlos Pereira dos Santos
LIM is not slim. Int. J. Game Theory 43(2): 269-281 (2014) - [j93]Aviezri S. Fraenkel, Jamie Simpson:
Corrigendum to "The exact number of squares in Fibonacci words" [Theoret. Comput. Sci. 218(1) (1999) 95-106]. Theor. Comput. Sci. 547: 122 (2014) - [c22]Aviezri S. Fraenkel:
Integrating and Rejuvenating Old and New Gems. Language, Culture, Computation (1) 2014: 37-49 - 2013
- [j92]Aviezri S. Fraenkel:
Reflection. J. Int. Comput. Games Assoc. 36(1): 49 (2013) - 2012
- [j91]Aviezri S. Fraenkel:
The vile, dopey, evil and odious game players. Discret. Math. 312(1): 42-46 (2012) - [j90]Aviezri S. Fraenkel, Yuval Tanny:
A Class of Wythoff-Like Games. Integers 12B: A7 (2012) - 2011
- [j89]Aviezri S. Fraenkel:
Aperiodic Subtraction Games. Electron. J. Comb. 18(2) (2011) - [j88]Saúl A. Blanco, Aviezri S. Fraenkel:
Tromping Games: Tiling With Trominoes. Integers 11A: Article6 (2011) - [j87]Urban Larsson, Peter Hegarty, Aviezri S. Fraenkel:
Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture. Theor. Comput. Sci. 412(8-10): 729-735 (2011) - 2010
- [j86]Éric Duchêne, Aviezri S. Fraenkel, Richard J. Nowakowski
Extensions and restrictions of Wythoff's game preserving its p positions. J. Comb. Theory A 117(5): 545-567 (2010) - [j85]Aviezri S. Fraenkel:
Complementary Iterated Floor Words and the Flora Game. SIAM J. Discret. Math. 24(2): 570-588 (2010) - [j84]Aviezri S. Fraenkel:
From Enmity to Amity. Am. Math. Mon. 117(7): 646-648 (2010)
2000 – 2009
- 2009
- [j83]Éric Duchêne, Aviezri S. Fraenkel, Sylvain Gravier, Richard J. Nowakowski:
Another bridge between Nim and Wythoff. Australas. J Comb. 44: 43-56 (2009) - [j82]Jason P. Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo
A Decision Problem for Ultimately Periodic Sets in Nonstandard Numeration Systems. Int. J. Algebra Comput. 19(6): 809-839 (2009) - [p1]Philip J. Davis, Aviezri S. Fraenkel:
Remembering Philip Rabinowitz. The Birth of Numerical Analysis 2009: 179-186 - [i2]Jason P. Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo:
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems. CoRR abs/0907.0620 (2009) - 2008
- [j81]Aviezri S. Fraenkel:
Games played by Boole and Galois. Discret. Appl. Math. 156(4): 420-427 (2008) - [j80]Shiri Artstein-Avidan, Aviezri S. Fraenkel, Vera T. Sós:
A two-parameter family of an extension of Beatty sequences. Discret. Math. 308(20): 4578-4588 (2008) - [j79]Aviezri S. Fraenkel:
Problem 11365. Am. Math. Mon. 115(5): 462 (2008) - [j78]Aviezri S. Fraenkel:
Sequences Built from the Golden Ratio: 11238. Am. Math. Mon. 115(7): 667-668 (2008) - 2006
- [j77]Aviezri S. Fraenkel:
Nim is Easy, Chess is Hard - But Why?? J. Int. Comput. Games Assoc. 29(4): 203-206 (2006) - [j76]Aviezri S. Fraenkel:
Problem 11238. Am. Math. Mon. 113(7): 655 (2006) - 2005
- [j75]Aviezri S. Fraenkel, Jamie Simpson:
An extension of the periodicity lemma to longer periods. Discret. Appl. Math. 146(2): 146-155 (2005) - [j74]Aviezri S. Fraenkel:
Euclid and Wythoff games. Discret. Math. 304(1-3): 65-68 (2005) - 2004
- [j73]Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt:
Traveling salesmen in the presence of competition. Theor. Comput. Sci. 313(3): 377-392 (2004) - [j72]Aviezri S. Fraenkel:
Complexity, appeal and challenges of combinatorial games. Theor. Comput. Sci. 313(3): 393-415 (2004) - [j71]Erik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, Richard J. Nowakowski
Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory. Theor. Comput. Sci. 313(3): 539-543 (2004) - 2003
- [c21]Aviezri S. Fraenkel:
New Games Related to Old and New Sequences. ACG 2003: 367-382 - 2002
- [j70]Aviezri S. Fraenkel:
Arrays, numeration systems and Frankenstein games. Theor. Comput. Sci. 282(2): 271-284 (2002) - [c20]Aviezri S. Fraenkel, Ofer Rahat:
Complexity of Error-Correcting Codes Derived from Combinatorial Games. Computers and Games 2002: 201-212 - [i1]Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt:
Traveling Salesmen in the Presence of Competition. CoRR cs.CC/0212001 (2002) - 2001
- [j69]Aviezri S. Fraenkel, Tamar Seeman, Jamie Simpson:
The Subword Complexity of a Two-Parameter Family of Sequences. Electron. J. Comb. 8(2) (2001) - [j68]Aviezri S. Fraenkel, Dmitri Zusman:
A new heap game. Theor. Comput. Sci. 252(1-2): 5-12 (2001) - [j67]Aviezri S. Fraenkel, Ofer Rahat:
Infinite cyclic impartial games. Theor. Comput. Sci. 252(1-2): 13-22 (2001) - [c19]Aviezri S. Fraenkel, Jamie Simpson:
An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture). CPM 2001: 98-105 - 2000
- [j66]Aviezri S. Fraenkel:
On the recurrence fm+1=bmfm-fm-1 and applications. Discret. Math. 224(1-3): 273-279 (2000) - [j65]Aviezri S. Fraenkel:
Recent results and questions in combinatorial game complexities. Theor. Comput. Sci. 249(2): 265-288 (2000) - [c18]Aviezri S. Fraenkel:
Virus Versus Mankind. Computers and Games 2000: 204-213
1990 – 1999
- 1999
- [j64]Aviezri S. Fraenkel, Shmuel T. Klein:
Information Retrieval from Annotated Texts. J. Am. Soc. Inf. Sci. 50(10): 845-854 (1999) - [j63]Aviezri S. Fraenkel, Jamie Simpson:
The Exact Number of Squares in Fibonacci Words. Theor. Comput. Sci. 218(1): 95-106 (1999) - 1998
- [j62]Aviezri S. Fraenkel, Jamie Simpson:
How Many Squares Can a String Contain? J. Comb. Theory A 82(1): 112-120 (1998) - [j61]Uri Blass, Aviezri S. Fraenkel, Romina Guelman:
How Far Can Nim in Disguise Be Stretched? J. Comb. Theory A 84(2): 145-156 (1998) - [j60]Aviezri S. Fraenkel, Michal Ozery:
Adjoining to Wythoff's Game its P-Positions as Moves. Theor. Comput. Sci. 205(1-2): 283-296 (1998) - [c17]Aviezri S. Fraenkel, Dmitri Zusman:
A New Heap Game. Computers and Games 1998: 205-211 - [c16]Aviezri S. Fraenkel, Ofer Rahat:
Infinite Cyclic Impartial Games. Computers and Games 1998: 212-221 - 1997
- [j59]Aviezri S. Fraenkel:
Combinatorial game theory foundations applied to digraph kernels. Electron. J. Comb. 4(2) (1997) - [c15]Aviezri S. Fraenkel, Jamie Simpson, Mike Paterson:
On Weak Circular Squares in Binary Words. CPM 1997: 76-82 - [c14]Aviezri S. Fraenkel:
Protein folding, spin glass and computational complexity. DNA Based Computers 1997: 101-121 - 1996
- [j58]Aviezri S. Fraenkel, Shmuel T. Klein
Robust Universal Complete Codes for Transmission and Compression. Discret. Appl. Math. 64(1): 31-55 (1996) - 1995
- [j57]Aviezri S. Fraenkel, Jamie Simpson:
How Many Squares Must a Binary Sequence Contain? Electron. J. Comb. 2 (1995) - [j56]Aviezri S. Fraenkel, Martin Loebl
Complexity of circuit intersection in graphs. Discret. Math. 141(1-3): 135-151 (1995) - [j55]James P. Jones, Aviezri S. Fraenkel:
Complexities of Winning Strategies in Diophantine Games. J. Complex. 11(4): 435-455 (1995) - [j54]Aviezri S. Fraenkel, Alan Jaffray, Anton Kotzig, Gert Sabidussi:
Modular Nim. Theor. Comput. Sci. 143(2): 319-333 (1995) - 1994
- [j53]Aviezri S. Fraenkel, Shmuel T. Klein
Complexity Aspects of Guessing Prefix Codes. Algorithmica 12(4/5): 409-419 (1994) - [j52]Aviezri S. Fraenkel:
Even Kernels. Electron. J. Comb. 1 (1994) - [j51]Aviezri S. Fraenkel, Clark Kimberling:
Generalized Wythoff arrays, shuffles and interspersions. Discret. Math. 126(1-3): 137-149 (1994) - [j50]Aviezri S. Fraenkel, H. Porta, Kenneth B. Stolarsky:
The almost PV behavior of some far from PV algebraic integers. Discret. Math. 135(1-3): 93-101 (1994) - [j49]Aviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena:
Efficient Management of Dynamic Tables. Inf. Process. Lett. 50(1): 25-30 (1994) - 1993
- [j48]Aviezri S. Fraenkel, Shmuel T. Klein
Bounding the Depth of Search Trees. Comput. J. 36(7): 668-678 (1993) - [j47]Roger B. Eggleton, Aviezri S. Fraenkel, R. Jaime Simpson:
Beatty sequences and Langford sequences. Discret. Math. 111(1-3): 165-178 (1993) - [j46]Aviezri S. Fraenkel, Shai Simonson:
Geography. Theor. Comput. Sci. 110(1): 197-214 (1993) - [j45]Aviezri S. Fraenkel, Edward R. Scheinerman, Daniel Ullman:
Undirected Edge Geography. Theor. Comput. Sci. 112(2): 371-381 (1993) - 1991
- [j44]Aviezri S. Fraenkel, Edward R. Scheinerman:
A deletion game on hypergraphs. Discret. Appl. Math. 30(2-3): 155-162 (1991) - [j43]Aviezri S. Fraenkel, Mordechai Lorberbom:
Nimhoff games. J. Comb. Theory A 58(1): 1-25 (1991) - 1990
- [j42]Aviezri S. Fraenkel, Shmuel T. Klein
Bidirectional Huffman Coding. Comput. J. 33(4): 296-307 (1990) - [j41]Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel:
Irreducible disjoint covering systems (with an application to boolean algebra). Discret. Appl. Math. 29(2-3): 143-164 (1990) - [j40]Uri Blass, Aviezri S. Fraenkel:
The Sprague-Grundy Function for Wythoff's Game. Theor. Comput. Sci. 75(3): 311-333 (1990)
1980 – 1989
- 1989
- [j39]Aviezri S. Fraenkel, Mordechai Lorberbom:
Epidemiography with various growth functions. Discret. Appl. Math. 25(1-2): 53-71 (1989) - [j38]N. Duvdevani, Aviezri S. Fraenkel:
Properties of K-Welter's game. Discret. Math. 76(3): 197-221 (1989) - [j37]Aviezri S. Fraenkel:
The Use and Usefulness of Numeration Systems. Inf. Comput. 81(1): 46-61 (1989) - 1988
- [j36]Z. Agur, Aviezri S. Fraenkel, Shmuel T. Klein
The number of fixed points of the majority rule. Discret. Math. 70(3): 295-302 (1988) - [j35]Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel:
Covers of Product Sets and the Korec-Znám Result. Eur. J. Comb. 9(2): 131-138 (1988) - [j34]Aviezri S. Fraenkel, Martin Loebl
Epidemiography II. Games with a dozing yet winning player. J. Comb. Theory A 49(1): 129-144 (1988) - [c13]Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein
Compression of Concordances in Full-Text Retrieval Systems. SIGIR 1988: 597-612 - 1987
- [j33]Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel:
Lattice parallelotopes and disjoint covering systems. Discret. Math. 65(1): 23-46 (1987) - [j32]Joseph Kahane, Aviezri S. Fraenkel:
k-welter - a generalization of Welter's game. J. Comb. Theory A 46(1): 1-20 (1987) - [j31]Aviezri S. Fraenkel, Elisheva Goldschmidt:
PSPACE-hardness of some combinatorial games. J. Comb. Theory A 46(1): 21-38 (1987) - [j30]Alberto Apostolico, Aviezri S. Fraenkel:
Robust transmission of unbounded strings using Fibonacci representations. IEEE Trans. Inf. Theory 33(2): 238-245 (1987) - [c12]Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein
Improved Techniques for Processing Queries in Full-Text Systems. SIGIR 1987: 306-315 - 1986
- [j29]Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel:
A non-analytic proof of the Newman - Znám result for disjoint covering systems. Comb. 6(3): 235-343 (1986) - [j28]Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel:
Disjoint covering systems of rational beatty sequences. J. Comb. Theory A 42(1): 150-153 (1986) - [j27]Aviezri S. Fraenkel, Yaacov Yesha:
The generalized Sprague-Grundy function and its invariance under certain mappings. J. Comb. Theory A 43(2): 165-177 (1986) - [c11]Yaacov Choueka, Aviezri S. Fraenkel, Shmuel T. Klein
Improved Hierarchical Bit-Vector Compression in Document Retrieval Systems. SIGIR 1986: 88-96 - 1984
- [j26]Moshe Mor, Aviezri S. Fraenkel:
Cayley permutations. Discret. Math. 48(1): 101-112 (1984) - [j25]M. Boshernitzan, Aviezri S. Fraenkel:
A Linear Algorithm for Nonhomogeneous Spectra of Numbers. J. Algorithms 5(2): 187-198 (1984) - [j24]Aviezri S. Fraenkel:
Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. Theor. Comput. Sci. 29: 49-73 (1984) - 1983
- [j23]Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl:
Is Text Compression by Prefixes and Suffixes Practical? Acta Informatica 20: 371-389 (1983) - [j22]Aviezri S. Fraenkel, Moshe Mor:
Combinatorial Compression and Partitioning of Large Dictionaries. Comput. J. 26(4): 336-343 (1983) - [j21]Aviezri S. Fraenkel:
Problem 38. Discret. Math. 44(3): 331-333 (1983) - [j20]Aviezri S. Fraenkel:
Problem 39 : Posed by Aviezri S. Fraenkel and Anton Kotzig. Discret. Math. 44(3): 333 (1983) - [j19]Aviezri S. Fraenkel:
Problem 40. Discret. Math. 44(3): 333-334 (1983) - [j18]Aviezri S. Fraenkel:
Problem 47 : Posed by Aviezri S. Fraenkel. Discret. Math. 46(2): 215-216 (1983) - [c10]Aviezri S. Fraenkel:
Systems of numeration. IEEE Symposium on Computer Arithmetic 1983: 37-42 - [c9]Aviezri S. Fraenkel:
Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches. ICALP 1983: 203-225 - [c8]Aviezri S. Fraenkel, Moshe Mor:
Combinational Compression and Partitioning of Large Dictionaries: Theory and Experiments. SIGIR 1983: 205-219 - 1982
- [j17]Moshe Mor, Aviezri S. Fraenkel:
A Hash Code Method for Detecting and Correcting Spelling Errors. Commun. ACM 25(12): 935-938 (1982) - [j16]Moshe Mor, Aviezri S. Fraenkel:
Permutation Generation on Vector Processors. Comput. J. 25(4): 423-428 (1982) - [c7]Moshe Mor, Aviezri S. Fraenkel:
Retrieval in an Environment for Faulty Texts or Faulty Queries. JCDKB 1982: 405-425 - [c6]Aviezri S. Fraenkel, Moshe Mor, Yehoshua Perl:
Is Text Compression by Prefizes and Suffixes Practical? SIGIR 1982: 289-311 - 1981
- [j15]Aviezri S. Fraenkel:
Planar kernel and grundy with d≤3, dout≤2, din≤2 are NP-complete. Discret. Appl. Math. 3(4): 257-262 (1981) - [j14]M. Boshernitzan, Aviezri S. Fraenkel:
Nonhomogeneous spectra of numbers. Discret. Math. 34(3): 325-327 (1981) - [j13]Aviezri S. Fraenkel, David Lichtenstein:
Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n. J. Comb. Theory A 31(2): 199-214 (1981) - [c5]Aviezri S. Fraenkel, David Lichtenstein:
Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N. ICALP 1981: 278-293 - [c4]Aviezri S. Fraenkel:
Document Classification, Indexing and Abstracting May be Inherently Difficult Problems. SIGIR 1981: 77-82 - 1980
- [j12]Aviezri S. Fraenkel, Yaacov Yesha:
Complexity of Solving Algebraic Equations. Inf. Process. Lett. 10(4/5): 178-179 (1980)
1970 – 1979
- 1979
- [j11]Aviezri S. Fraenkel, Yaacov Yesha:
Complexity of problems in games, graphs and algebraic equations. Discret. Appl. Math. 1(1-2): 15-30 (1979) - [j10]Aviezri S. Fraenkel:
Paired Sequential Lists in a memory Interval. Inf. Process. Lett. 8(1): 9-10 (1979) - 1978
- [j9]R. Attar, Yaacov Choueka, Nachum Dershowitz, Aviezri S. Fraenkel:
KEDMA - Linguistic Tools for Retrieval Systems. J. ACM 25(1): 52-66 (1978) - [c3]Aviezri S. Fraenkel, M. R. Garey, David S. Johnson, T. Schaefer, Yaacov Yesha:
The Complexity of Checkers on an N * N Board - Preliminary Report. FOCS 1978: 55-64 - 1977
- [j8]R. Attar, Aviezri S. Fraenkel:
Local Feedback in Full-Text Retrieval Systems. J. ACM 24(3): 397-417 (1977) - 1975
- [j7]Aviezri S. Fraenkel:
Further characterizations and properties of exactly covering congruences. Discret. Math. 12(1): 93-100 (1975) - 1973
- [j6]Aviezri S. Fraenkel:
A characterization of exactly covering congruences. Discret. Math. 4(4): 359-366 (1973) - [j5]Aviezri S. Fraenkel:
Complementing and Exactly Covering Sequences. J. Comb. Theory A 14(1): 8-20 (1973) - [j4]Aviezri S. Fraenkel, I. Borosh:
A Generalization of Wythoff's Game. J. Comb. Theory A 15(2): 175-191 (1973) - 1972
- [j3]Aviezri S. Fraenkel, Jonathan Levitt, Michael Shimshoni:
Characterization of the set of values f(n) = [na], n = 1, 2, ... Discret. Math. 2(4): 335-345 (1972) - 1971
- [c2]Yaacov Choueka, M. Cohen, J. Dueck, Aviezri S. Fraenkel, M. Slae:
Full Text Document Retrieval: Hebrew Legal Texts. SIGIR 1971: 61-79
1960 – 1969
- 1968
- [j2]Aviezri S. Fraenkel:
Legal Information Retrieval. Adv. Comput. 9: 113-178 (1968) - 1964
- [c1]Aviezri S. Fraenkel:
On the size of modular numbers. ACM National Conference 1964: 51 - 1961
- [j1]Aviezri S. Fraenkel:
The Use of Index Calculus and Mersenne Primes for the Design of a High-Speed Digital Multiplier. J. ACM 8(1): 87-96 (1961)
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-06-10 21:24 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: