M. W. Bunder
Impact in
-
- Advanced Algebra and Logic
- semigroups and automata theory
Papers in
-
- Advanced Algebra and Logic 35
- semigroups and automata theory 15
- Computability, Logic, AI Algorithms 7
-
- Logic, Reasoning, and Knowledge 38
- Logic, programming, and type systems 26
- Algorithms and Data Compression 7
- Co-authors
- Joseph Tonien (6 shared papers)Willy Susilo (2 shared papers)Abderrahmane Nitaj (2 shared papers)Henk Barendregt (3 shared papers)R. Meyer (2 shared papers)J. Roger Hindley (2 shared papers)Robert K. Meyer (1 shared paper)Jonathan P. Seldin (2 shared papers)
- Journals
- Journal of Symbolic Logic (12 papers)Notre Dame Journal of Formal Logic (11 papers)Theoretical Computer Science (6 papers)Archive for Mathematical Logic (5 papers)European Journal of Combinatorics (3 papers)
- Partner nations
- AustraliaUnited StatesCanada
In The Last Decade
M. W. Bunder
61 papers receiving 350 citations
Peers
Comparison fields: 5 of 88
- Computational Theory and Mathematics 203
- Theoretical Computer Science 9
- Artificial Intelligence 223
- Discrete Mathematics and Combinatorics 21
- Algebra and Number Theory 18
Countries citing papers authored by M. W. Bunder
This map shows the geographic impact of M. W. Bunder'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 M. W. Bunder with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites M. W. Bunder more than expected).
Fields of papers citing papers by M. W. Bunder
This network shows the impact of papers produced by M. W. Bunder. 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 M. W. Bunder. The network helps show where M. W. Bunder may publish in the future.
Co-authors
The 11 scholars most cited alongside M. W. Bunder, 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 76 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1976 | 147 | |
| 2 | 2017 | 23 | |
| 3 | 1974 | 18 | |
| 4 | 1973 | 17 | |
| 5 | 2010 | 13 | |
| 6 | 1993 | 11 | |
| 7 | 2009 | 9 | |
| 8 | 1992 | 9 | |
| 9 | 2018 | 9 | |
| 10 | Linkages between the Gauss map and the Stern- Brocot tree | 2006 | 9 |
| 11 | 1991 | 8 | |
| 12 | 1994 | 8 | |
| 13 | 1977 | 7 | |
| 14 | 2010 | 7 | |
| 15 | 1998 | 6 | |
| 16 | 1978 | 6 | |
| 17 | 1974 | 6 | |
| 18 | 1983 | 6 | |
| 19 | A new attack on the RSA cryptosystem based on continued fractions | 2017 | 6 |
| 20 | 1990 | 5 |
About M. W. Bunder
M. W. Bunder is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Geometry and Topology, Statistical and Nonlinear Physics and Mathematical Physics, having authored 76 papers that have together received 443 indexed citations. Recurring topics across this work include Logic, Reasoning, and Knowledge (38 papers), Advanced Algebra and Logic (35 papers), Logic, programming, and type systems (26 papers), semigroups and automata theory (15 papers), Advanced Mathematical Theories and Applications (8 papers), Algorithms and Data Compression (7 papers), Computability, Logic, AI Algorithms (7 papers) and Mathematics and Applications (7 papers). The work is most often cited by research in Computational Theory and Mathematics (203 citations), Theoretical Computer Science (9 citations), Artificial Intelligence (223 citations), Discrete Mathematics and Combinatorics (21 citations) and Algebra and Number Theory (18 citations). M. W. Bunder has collaborated with scholars based in Australia, United States and Canada. Frequent co-authors include Joseph Tonien, Willy Susilo, Abderrahmane Nitaj, Henk Barendregt, R. Meyer, J. Roger Hindley, Robert K. Meyer, Jonathan P. Seldin, Glen Wheeler and David Griffiths. Their work appears in journals such as Journal of Symbolic Logic, Notre Dame Journal of Formal Logic, Theoretical Computer Science, Archive for Mathematical Logic and European Journal of Combinatorics.
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.