Joan Boyar
Impact in
-
- Optimization and Search Problems
-
- Optimization and Packing Problems
- Scheduling and Optimization Algorithms
Papers in
-
- Optimization and Search Problems 43
-
- Cryptography and Data Security 15
- Cryptographic Implementations and Security 9
- Co-authors
- Kim S. Larsen (35 shared papers)René Peralta (15 shared papers)Lene M. Favrholdt (21 shared papers)Stuart A. Kurtz (2 shared papers)Mark W. Krentel (2 shared papers)Morten Nielsen (5 shared papers)Ivan Damgård (3 shared papers)Leah Epstein (7 shared papers)
- Journals
- Theoretical Computer Science (10 papers)Algorithmica (8 papers)Journal of Cryptology (6 papers)Theory of Computing Systems (3 papers)Journal of Computer and System Sciences (3 papers)
- Partner nations
- DenmarkUnited StatesCanada
In The Last Decade
Joan Boyar
71 papers receiving 760 citations
Peers
Comparison fields: 5 of 49
- Computer Networks and Communications 392
- Industrial and Manufacturing Engineering 168
- Computational Theory and Mathematics 232
- Artificial Intelligence 445
- Management Science and Operations Research 112
Countries citing papers authored by Joan Boyar
This map shows the geographic impact of Joan Boyar'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 Joan Boyar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joan Boyar more than expected).
Fields of papers citing papers by Joan Boyar
This network shows the impact of papers produced by Joan Boyar. 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 Joan Boyar. The network helps show where Joan Boyar may publish in the future.
Co-authors
The 25 scholars most cited alongside Joan Boyar, 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 74 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2012 | 84 | |
| 2 | 1989 | 63 | |
| 3 | 2000 | 44 | |
| 4 | 1990 | 36 | |
| 5 | 2007 | 32 | |
| 6 | 2001 | 32 | |
| 7 | 1989 | 31 | |
| 8 | 1999 | 28 | |
| 9 | A new combinational logic minimization technique with applications to cryptology | 2010 | 28 |
| 10 | 2014 | 27 | |
| 11 | 2016 | 26 | |
| 12 | 2017 | 25 | |
| 13 | 2007 | 25 | |
| 14 | 1994 | 21 | |
| 15 | 1990 | 18 | |
| 16 | 1987 | 17 | |
| 17 | 1997 | 15 | |
| 18 | 1991 | 15 | |
| 19 | 2008 | 14 | |
| 20 | 2018 | 13 |
About Joan Boyar
Joan Boyar is a scholar working on Computer Networks and Communications, Artificial Intelligence, Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Management Science and Operations Research, having authored 74 papers that have together received 841 indexed citations. Recurring topics across this work include Optimization and Search Problems (43 papers), Complexity and Algorithms in Graphs (23 papers), Cryptography and Data Security (15 papers), Optimization and Packing Problems (13 papers), Auction Theory and Applications (12 papers), Scheduling and Optimization Algorithms (9 papers), Cryptographic Implementations and Security (9 papers) and Advanced Bandit Algorithms Research (8 papers). The work is most often cited by research in Computer Networks and Communications (392 citations), Industrial and Manufacturing Engineering (168 citations), Computational Theory and Mathematics (232 citations), Artificial Intelligence (445 citations) and Management Science and Operations Research (112 citations). Joan Boyar has collaborated with scholars based in Denmark, United States and Canada. Frequent co-authors include Kim S. Larsen, René Peralta, Lene M. Favrholdt, Stuart A. Kurtz, Mark W. Krentel, Morten Nielsen, Ivan Damgård, Leah Epstein, Howard Karloff and Shahin Kamali. Their work appears in journals such as Theoretical Computer Science, Algorithmica, Journal of Cryptology, Theory of Computing Systems and Journal of Computer and System Sciences.
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.