Bard Bloom

1.5k total citations
27 papers, 713 citations indexed

About

Bard Bloom is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Software. According to data from OpenAlex, Bard Bloom has authored 27 papers receiving a total of 713 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Artificial Intelligence, 16 papers in Computational Theory and Mathematics and 6 papers in Software. Recurrent topics in Bard Bloom's work include Logic, programming, and type systems (15 papers), Formal Methods in Verification (15 papers) and Logic, Reasoning, and Knowledge (9 papers). Bard Bloom is often cited by papers focused on Logic, programming, and type systems (15 papers), Formal Methods in Verification (15 papers) and Logic, Reasoning, and Knowledge (9 papers). Bard Bloom collaborates with scholars based in United States, Netherlands and United Kingdom. Bard Bloom's co-authors include Albert R. Meyer, Sorin Istrail, Frits Vaandrager, Luca Aceto, Robert Paige, Wan Fokkink, Rob J. van Glabbeek, John K. Field, Rok Strniša and Gregor Richards and has published in prestigious journals such as IEEE Transactions on Software Engineering, Journal of the ACM and Theoretical Computer Science.

In The Last Decade

Bard Bloom

27 papers receiving 630 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Bard Bloom United States 12 615 512 123 83 83 27 713
Colin Stirling United Kingdom 17 649 1.1× 718 1.4× 179 1.5× 69 0.8× 98 1.2× 29 898
Andrzej Tarlecki Poland 17 829 1.3× 624 1.2× 182 1.5× 121 1.5× 44 0.5× 57 947
Dennis Dams Netherlands 11 342 0.6× 486 0.9× 275 2.2× 37 0.4× 60 0.7× 31 559
R. D. Tennent Canada 12 656 1.1× 367 0.7× 80 0.7× 92 1.1× 105 1.3× 37 745
Lenore D. Zuck United States 16 389 0.6× 366 0.7× 169 1.4× 94 1.1× 121 1.5× 53 641
Ahmed Bouajjani France 16 407 0.7× 610 1.2× 299 2.4× 60 0.7× 176 2.1× 65 811
Grant Malcolm United Kingdom 13 472 0.8× 366 0.7× 101 0.8× 89 1.1× 49 0.6× 29 595
Philippe Schnoebelen France 7 233 0.4× 267 0.5× 108 0.9× 40 0.5× 45 0.5× 20 385
Gennaro Parlato Italy 12 213 0.3× 260 0.5× 127 1.0× 58 0.7× 82 1.0× 39 397
Douglas J. Howe United States 8 673 1.1× 486 0.9× 74 0.6× 64 0.8× 65 0.8× 14 727

Countries citing papers authored by Bard Bloom

Since Specialization
Citations

This map shows the geographic impact of Bard Bloom'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 Bard Bloom with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bard Bloom more than expected).

Fields of papers citing papers by Bard Bloom

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Bard Bloom. 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 Bard Bloom. The network helps show where Bard Bloom may publish in the future.

Co-authorship network of co-authors of Bard Bloom

This figure shows the co-authorship network connecting the top 25 collaborators of Bard Bloom. A scholar is included among the top collaborators of Bard Bloom 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 Bard Bloom. Bard Bloom 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.
Tardieu, Olivier, David Grove, Bard Bloom, et al.. (2012). IBM Research Report X10 for Productivity and Performance at Scale A Submission to the 2012 HPC Class II Challange. 2 indexed citations
2.
Bloom, Bard & Martin Hirzel. (2012). Robust scripting via patterns. ACM SIGPLAN Notices. 48(2). 29–40. 1 indexed citations
3.
Bloom, Bard & Martin Hirzel. (2012). Robust scripting via patterns. 29–40. 9 indexed citations
4.
Bloom, Bard, John K. Field, Nathaniel Nystrom, et al.. (2009). Thorn. ACM SIGPLAN Notices. 44(10). 117–136. 39 indexed citations
5.
Bloom, Bard, et al.. (2008). Ferret: Programming language support for multiple dynamic classification. Computer Languages Systems & Structures. 35(3). 306–321. 3 indexed citations
6.
Bloom, Bard, et al.. (2006). Architectural thinking and modeling with the Architects' Workbench. IBM Systems Journal. 45(3). 481–500. 20 indexed citations
7.
Bloom, Bard. (2005). Lopsided Little Languages: Experience with XQuery.. 1 indexed citations
8.
Bloom, Bard, Wan Fokkink, & Rob J. van Glabbeek. (2004). Precongruence formats for decorated trace semantics. ACM Transactions on Computational Logic. 5(1). 26–78. 35 indexed citations
9.
Aceto, Luca, Bard Bloom, & Frits Vaandrager. (2003). Turning SOS rules into equations. 113–124. 2 indexed citations
10.
Bloom, Bard, Wan Fokkink, & Rob van Glabbeek. (2002). Precongruence formats for decorated trace preorders. Data Archiving and Networked Services (DANS). 107–118. 6 indexed citations
11.
Bloom, Bard, et al.. (1997). Using a Protean language to enhance expressiveness in specification. IEEE Transactions on Software Engineering. 23(4). 224–234. 3 indexed citations
12.
Bloom, Bard, et al.. (1996). Metatheory of the $\pi$-Calculus. eCommons (Cornell University). 2 indexed citations
13.
Bloom, Bard & Robert Paige. (1995). Transformational design and implementation of a new efficient solution to the ready simulation problem. Science of Computer Programming. 24(3). 189–220. 44 indexed citations
14.
15.
Bloom, Bard. (1994). When is partial trace equivalence adequate?. Formal Aspects of Computing. 6(3). 317–338. 8 indexed citations
16.
Aceto, Luca, Bard Bloom, & Frits Vaandrager. (1994). Turning SOS Rules into Equations. Information and Computation. 111(1). 1–52. 67 indexed citations
17.
Bloom, Bard & Albert R. Meyer. (1992). Experimenting with process equivalence. Theoretical Computer Science. 101(2). 223–237. 9 indexed citations
18.
Bloom, Bard. (1990). Can LCF be topped? Flat lattice models of typed λ-calculus. Information and Computation. 87(1-2). 264–301. 16 indexed citations
19.
Bloom, Bard. (1989). Ready simulation, bisimulation, and the semantics of CCS-like languages. 37 indexed citations
20.
Bloom, Bard, Sorin Istrail, & Albert R. Meyer. (1987). Bisimulation can't be traced. Preliminary report. OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information). 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

Breakdown of academic impact, for papers by Colin Stirling Breakdown of academic impact, for papers by Andrzej Tarlecki Breakdown of academic impact, for papers by Dennis Dams Breakdown of academic impact, for papers by R. D. Tennent Breakdown of academic impact, for papers by Lenore D. Zuck Breakdown of academic impact, for papers by Ahmed Bouajjani Breakdown of academic impact, for papers by Grant Malcolm Breakdown of academic impact, for papers by Philippe Schnoebelen Breakdown of academic impact, for papers by Gennaro Parlato Breakdown of academic impact, for papers by Douglas J. Howe
Rankless by CCL
2026