Alexander Burstein

433 total citations
22 papers, 187 citations indexed

About

Alexander Burstein is a scholar working on Discrete Mathematics and Combinatorics, Artificial Intelligence and Computational Theory and Mathematics. According to data from OpenAlex, Alexander Burstein has authored 22 papers receiving a total of 187 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Discrete Mathematics and Combinatorics, 16 papers in Artificial Intelligence and 9 papers in Computational Theory and Mathematics. Recurrent topics in Alexander Burstein's work include Advanced Combinatorial Mathematics (20 papers), semigroups and automata theory (9 papers) and Algorithms and Data Compression (7 papers). Alexander Burstein is often cited by papers focused on Advanced Combinatorial Mathematics (20 papers), semigroups and automata theory (9 papers) and Algorithms and Data Compression (7 papers). Alexander Burstein collaborates with scholars based in United States, Chile and Israel. Alexander Burstein's co-authors include Toufik Mansour, Peter Hästö, Einar Steingrı́msson, Eva Jelínková, Sergey Kitaev, Vít Jelínek, Abdullahi Umar, Sergi Elizalde, M. L. Deadman and Carla D. Savage and has published in prestigious journals such as Discrete Mathematics, Journal of Combinatorial Theory Series A and SIAM Journal on Discrete Mathematics.

In The Last Decade

Alexander Burstein

19 papers receiving 170 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Alexander Burstein United States 7 170 95 86 70 28 22 187
Mathilde Bouvel France 8 97 0.6× 84 0.9× 59 0.7× 26 0.4× 21 0.8× 24 149
Vincent Vatter United States 11 248 1.5× 128 1.3× 196 2.3× 51 0.7× 74 2.6× 42 318
Rosena R. X. Du China 7 164 1.0× 44 0.5× 65 0.8× 73 1.0× 13 0.5× 15 218
Bridget Eileen Tenner United States 8 144 0.8× 31 0.3× 67 0.8× 69 1.0× 22 0.8× 33 167
Marni Mishna Canada 7 122 0.7× 37 0.4× 80 0.9× 29 0.4× 8 0.3× 24 170
Andrzej Kisielewicz Poland 10 79 0.5× 76 0.8× 184 2.1× 59 0.8× 42 1.5× 56 268
Kevin O’Bryant United States 6 70 0.4× 27 0.3× 54 0.6× 45 0.6× 43 1.5× 17 141
Jean-Luc Baril France 6 78 0.5× 60 0.6× 69 0.8× 24 0.3× 34 1.2× 34 126
Dan Saracino United States 9 109 0.6× 53 0.6× 87 1.0× 103 1.5× 19 0.7× 37 232
Gábor Hetyei United States 10 181 1.1× 30 0.3× 98 1.1× 83 1.2× 23 0.8× 39 234

Countries citing papers authored by Alexander Burstein

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Alexander Burstein

This figure shows the co-authorship network connecting the top 25 collaborators of Alexander Burstein. A scholar is included among the top collaborators of Alexander Burstein based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Alexander Burstein. Alexander Burstein is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Burstein, Alexander, et al.. (2025). On (Shape-)Wilf-Equivalence of Certain Sets of (Partially Ordered) Patterns. The Electronic Journal of Combinatorics. 32(1).
2.
Bóna, Miklós & Alexander Burstein. (2022). Permutations with Exactly One Copy of a Monotone Pattern of Length k, and a Generalization. Annals of Combinatorics. 26(2). 393–404.
3.
Burstein, Alexander, et al.. (2016). Egge triples and unbalanced Wilf-equivalence. Australas. J Comb.. 64. 232–251. 5 indexed citations
4.
Burstein, Alexander, et al.. (2012). The solution of a recursive sequence arising from a combinatorial problem in botanical epidemiology. The Journal of Difference Equations and Applications. 19(6). 981–993. 3 indexed citations
5.
Burstein, Alexander, Vít Jelínek, Eva Jelínková, & Einar Steingrı́msson. (2011). The Möbius function of separable and decomposable permutations. Journal of Combinatorial Theory Series A. 118(8). 2346–2364. 10 indexed citations
6.
Burstein, Alexander. (2010). On joint distribution of adjacencies, descents and some Mahonian statistics. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AN,...(Proceedings). 5 indexed citations
7.
Burstein, Alexander, Sergey Kitaev, & Toufik Mansour. (2010). COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS. 1 indexed citations
8.
Burstein, Alexander & Peter Hästö. (2009). Packing sets of patterns. European Journal of Combinatorics. 31(1). 241–253. 4 indexed citations
9.
Burstein, Alexander & Sergey Kitaev. (2008). Partially ordered patterns and their combinatorial interpretations. Strathprints: The University of Strathclyde institutional repository (University of Strathclyde). 19. 27–38. 1 indexed citations
10.
Burstein, Alexander, Sergi Elizalde, & Toufik Mansour. (2006). Restricted Dumont permutations, Dyck paths, and noncrossing partitions. Discrete Mathematics. 306(22). 2851–2869. 4 indexed citations
11.
Burstein, Alexander, et al.. (2005). A geometric form for the extended patience sorting algorithm. Advances in Applied Mathematics. 36(2). 106–117. 1 indexed citations
12.
Burstein, Alexander & Sergey Kitaev. (2005). Partially ordered generalized patterns and their combinatorial interpretation. Strathprints: The University of Strathclyde institutional repository (University of Strathclyde). 1 indexed citations
13.
Burstein, Alexander & Sergey Kitaev. (2005). On Unavoidable Sets of Word Patterns. SIAM Journal on Discrete Mathematics. 19(2). 371–381. 3 indexed citations
14.
Burstein, Alexander. (2005). Restricted Dumont Permutations. Annals of Combinatorics. 9(3). 269–280. 5 indexed citations
15.
Burstein, Alexander & Toufik Mansour. (2003). Counting occurrences of some subword patterns. Discrete Mathematics & Theoretical Computer Science. Vol. 6 no. 1. 19 indexed citations
16.
Burstein, Alexander & Toufik Mansour. (2003). Words Restricted by 3-Letter Generalized Multipermutation Patterns. Annals of Combinatorics. 7(1). 1–14. 17 indexed citations
17.
Burstein, Alexander, Peter Hästö, & Toufik Mansour. (2003). Packing Patterns into Words. The Electronic Journal of Combinatorics. 9(2). 8 indexed citations
18.
Burstein, Alexander, Sylvie Corteel, Alexander Postnikov, & Carla D. Savage. (2002). A lattice path approach to counting partitions with minimum rank t. Discrete Mathematics. 249(1-3). 31–39.
19.
Burstein, Alexander & Toufik Mansour. (2002). Words Restricted by Patterns with at Most 2 Distinct Letters. The Electronic Journal of Combinatorics. 9(2). 27 indexed citations
20.
Burstein, Alexander. (1998). Enumeration of words with forbidden patterns. Scholarly Commons (University of Pennsylvania). 42 indexed citations

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026