Joan Boyar

2.5k total citations
74 papers, 835 citations indexed

About

Joan Boyar is a scholar working on Computer Networks and Communications, Artificial Intelligence and Computational Theory and Mathematics. According to data from OpenAlex, Joan Boyar has authored 74 papers receiving a total of 835 indexed citations (citations by other indexed papers that have themselves been cited), including 44 papers in Computer Networks and Communications, 32 papers in Artificial Intelligence and 26 papers in Computational Theory and Mathematics. Recurrent topics in Joan Boyar's work include Optimization and Search Problems (43 papers), Complexity and Algorithms in Graphs (23 papers) and Cryptography and Data Security (15 papers). Joan Boyar is often cited by papers focused on Optimization and Search Problems (43 papers), Complexity and Algorithms in Graphs (23 papers) and Cryptography and Data Security (15 papers). Joan Boyar collaborates with scholars based in Denmark, United States and Canada. Joan Boyar's co-authors include Kim S. Larsen, René Peralta, Lene M. Favrholdt, Mark W. Krentel, Morten Nielsen, Stuart A. Kurtz, Leah Epstein, Ivan Damgård, Howard Karloff and Shahin Kamali and has published in prestigious journals such as The Journal of Pediatrics, ACM Computing Surveys and Journal of the ACM.

In The Last Decade

Joan Boyar

71 papers receiving 753 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Joan Boyar Denmark 16 442 388 230 166 139 74 835
Jeffery Westbrook United States 17 223 0.5× 479 1.2× 356 1.5× 84 0.5× 71 0.5× 34 766
Bala Kalyanasundaram United States 15 278 0.6× 544 1.4× 359 1.6× 136 0.8× 25 0.2× 37 861
Chu-Min Li France 17 318 0.7× 276 0.7× 313 1.4× 152 0.9× 61 0.4× 58 629
Kurt Rohloff United States 19 521 1.2× 353 0.9× 314 1.4× 49 0.3× 118 0.8× 56 887
J. Bitner United States 7 266 0.6× 243 0.6× 218 0.9× 55 0.3× 52 0.4× 18 585
Éric Fabre France 15 191 0.4× 358 0.9× 551 2.4× 163 1.0× 57 0.4× 55 882
Shalev Ben-David Canada 10 198 0.4× 403 1.0× 188 0.8× 74 0.4× 28 0.2× 29 610
Lakhdar Saïs France 13 347 0.8× 392 1.0× 250 1.1× 61 0.4× 24 0.2× 58 647
P.P. Chakrabarti India 9 279 0.6× 181 0.5× 95 0.4× 54 0.3× 91 0.7× 50 505
Jussi Rintanen Australia 19 845 1.9× 271 0.7× 343 1.5× 33 0.2× 58 0.4× 57 1.1k

Countries citing papers authored by Joan Boyar

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Joan Boyar

This figure shows the co-authorship network connecting the top 25 collaborators of Joan Boyar. A scholar is included among the top collaborators of Joan Boyar 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 Joan Boyar. Joan Boyar 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.
Boyar, Joan, Faith Ellen, & Kim S. Larsen. (2025). Brief Announcement: Distributed Graph Algorithms with Predictions. University of Southern Denmark Research Portal (University of Southern Denmark). 322–325.
2.
Boyar, Joan, Shahin Kamali, Kim S. Larsen, & Alejandro López-Ortíz. (2016). On the list update problem with advice. Information and Computation. 253. 411–423. 4 indexed citations
3.
Boyar, Joan, et al.. (2014). Relative interval analysis of paging algorithms on access graphs. Theoretical Computer Science. 568. 28–48. 2 indexed citations
4.
Boyar, Joan, et al.. (2014). Cancellation-free circuits in unbounded and bounded depth. Theoretical Computer Science. 590. 17–26. 4 indexed citations
5.
Boyar, Joan, et al.. (2013). A comparison of performance measures via online search. Theoretical Computer Science. 532. 2–13. 8 indexed citations
6.
Boyar, Joan, György Dósa, & Leah Epstein. (2012). On the absolute approximation ratio for First Fit and related results. Discrete Applied Mathematics. 160(13-14). 1914–1923. 13 indexed citations
7.
Boyar, Joan, Leah Epstein, & Asaf Levin. (2010). Tight results for Next Fit and Worst Fit with resource augmentation. Theoretical Computer Science. 411(26-28). 2572–2580. 7 indexed citations
8.
Borodin, Allan, et al.. (2009). Priority algorithms for graph optimization problems. Theoretical Computer Science. 411(1). 239–258. 10 indexed citations
9.
Boyar, Joan & René Peralta. (2008). Tight bounds for the multiplicative complexity of symmetric functions. Theoretical Computer Science. 396(1-3). 223–246. 14 indexed citations
10.
Boyar, Joan, Lene M. Favrholdt, & Kim S. Larsen. (2007). The relative worst-order ratio applied to paging. Journal of Computer and System Sciences. 73(5). 818–843. 25 indexed citations
11.
Boyar, Joan, et al.. (2006). The maximum resource bin packing problem. Theoretical Computer Science. 362(1-3). 127–139. 12 indexed citations
12.
Boyar, Joan & René Peralta. (2005). The Exact Multiplicative Complexity of the Hamming Weight Function. Electronic colloquium on computational complexity. 7 indexed citations
13.
Boyar, Joan, Lene M. Favrholdt, & Kim S. Larsen. (2005). The relative worst order ratio applied to paging. Symposium on Discrete Algorithms. 718–727. 5 indexed citations
14.
Boyar, Joan, Lene M. Favrholdt, Kim S. Larsen, & Morten Nielsen. (2001). The competitive ratio for on-line dual bin packing with restricted input sequences. University of Southern Denmark Research Portal (University of Southern Denmark). 8(4). 463–472. 7 indexed citations
15.
Bach, Eric, Joan Boyar, Leah Epstein, et al.. (2000). Tight bounds on the competitive ratio on accomodating sequences for the seat reservation problem. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–16. 1 indexed citations
16.
Boyar, Joan, et al.. (2000). On the multiplicative complexity of Boolean functions over the basis (∧,⊕,1). Theoretical Computer Science. 235(1). 43–57. 44 indexed citations
17.
Boyar, Joan, Rolf Fagerberg, & Kim S. Larsen. (1997). Amortization Results for Chromatic Search Trees, with an Application to Priority Queues. Journal of Computer and System Sciences. 55(3). 504–521. 14 indexed citations
18.
Boyar, Joan & René Peralta. (1996). Short Discrete Proofs.. 131–142. 1 indexed citations
19.
Boyar, Joan & Kim S. Larsen. (1994). Efficient rebalancing of chromatic search trees. Journal of Computer and System Sciences. 49(3). 667–682. 20 indexed citations
20.
Boyar, Joan, et al.. (1992). An arithmetic model of computation equivalent to threshold circuits. Theoretical Computer Science. 93(2). 303–319. 11 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

Breakdown of academic impact, for papers by Jeffery Westbrook Breakdown of academic impact, for papers by Bala Kalyanasundaram Breakdown of academic impact, for papers by Chu-Min Li Breakdown of academic impact, for papers by Kurt Rohloff Breakdown of academic impact, for papers by J. Bitner Breakdown of academic impact, for papers by Éric Fabre Breakdown of academic impact, for papers by Shalev Ben-David Breakdown of academic impact, for papers by Lakhdar Saïs Breakdown of academic impact, for papers by P.P. Chakrabarti Breakdown of academic impact, for papers by Jussi Rintanen
Rankless by CCL
2026