Alexander Burstein
Impact in
-
- Advanced Combinatorial Mathematics
- Algebra and Number Theory top 10%
- Advanced Mathematical Identities
Papers in
-
- Advanced Combinatorial Mathematics 20
-
- Algorithms and Data Compression 8
- Bayesian Methods and Mixture Models 5
- Coding theory and cryptography 5
- Co-authors
- Toufik Mansour (6 shared papers)Peter Hästö (2 shared papers)Vít Jelínek (1 shared paper)Eva Jelínková (1 shared paper)Einar Steingrı́msson (1 shared paper)Sergey Kitaev (5 shared papers)Herbert S. Wilf (1 shared paper)M. L. Deadman (1 shared paper)
- Journals
- The Electronic Journal of Combinatorics (4 papers)Annals of Combinatorics (4 papers)Discrete Mathematics & Theoretical Computer Science (2 papers)Discrete Mathematics (2 papers)Advances in Applied Mathematics (1 paper)
- Partner nations
- United StatesChileIsrael
In The Last Decade
Alexander Burstein
20 papers receiving 172 citations
Peers
Comparison fields: 5 of 23
- Discrete Mathematics and Combinatorics 170
- Algebra and Number Theory 72
- Computational Theory and Mathematics 85
- Artificial Intelligence 96
- Statistics and Probability 14
Countries citing papers authored by Alexander Burstein
This map shows the geographic impact of Alexander Burstein's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Alexander Burstein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alexander Burstein more than expected).
Fields of papers citing papers by Alexander Burstein
This network shows the impact of papers produced by Alexander Burstein. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Alexander Burstein. The network helps show where Alexander Burstein may publish in the future.
Co-authors
The 15 scholars most cited alongside Alexander Burstein, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 23 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Enumeration of words with forbidden patterns | 1998 | 41 |
| 2 | 2002 | 26 | |
| 3 | 2007 | 26 | |
| 4 | 2003 | 19 | |
| 5 | 2003 | 17 | |
| 6 | 2011 | 10 | |
| 7 | 2003 | 8 | |
| 8 | 2011 | 5 | |
| 9 | Egge triples and unbalanced Wilf-equivalence | 2016 | 5 |
| 10 | 2010 | 5 | |
| 11 | 2005 | 5 | |
| 12 | 2006 | 4 | |
| 13 | 2009 | 4 | |
| 14 | 1997 | 3 | |
| 15 | 2012 | 3 | |
| 16 | 2005 | 3 | |
| 17 | 2005 | 1 | |
| 18 | Partially ordered generalized patterns and their combinatorial interpretation | 2005 | 1 |
| 19 | Partially ordered patterns and their combinatorial interpretations | 2008 | 1 |
| 20 | COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS | 2010 | 1 |
About Alexander Burstein
Alexander Burstein is a scholar working on Discrete Mathematics and Combinatorics, Artificial Intelligence, Computational Theory and Mathematics, Algebra and Number Theory and Electrical and Electronic Engineering, having authored 23 papers that have together received 188 indexed citations. Recurring topics across this work include Advanced Combinatorial Mathematics (20 papers), semigroups and automata theory (10 papers), Algorithms and Data Compression (8 papers), Advanced Mathematical Identities (6 papers), Bayesian Methods and Mixture Models (5 papers), Coding theory and cryptography (5 papers), graph theory and CDMA systems (4 papers) and Color Science and Applications (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (170 citations), Algebra and Number Theory (72 citations), Computational Theory and Mathematics (85 citations), Artificial Intelligence (96 citations) and Statistics and Probability (14 citations). Alexander Burstein has collaborated with scholars based in United States, Chile and Israel. Frequent co-authors include Toufik Mansour, Peter Hästö, Vít Jelínek, Eva Jelínková, Einar Steingrı́msson, Sergey Kitaev, Herbert S. Wilf, M. L. Deadman, Abdullahi Umar and Sergi Elizalde. Their work appears in journals such as The Electronic Journal of Combinatorics, Annals of Combinatorics, Discrete Mathematics & Theoretical Computer Science, Discrete Mathematics and Advances in Applied Mathematics.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.