Roy Armoni

580 total citations
10 papers, 142 citations indexed

About

Roy Armoni is a scholar working on Computational Theory and Mathematics, Software and Hardware and Architecture. According to data from OpenAlex, Roy Armoni has authored 10 papers receiving a total of 142 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Computational Theory and Mathematics, 5 papers in Software and 2 papers in Hardware and Architecture. Recurrent topics in Roy Armoni's work include Formal Methods in Verification (7 papers), Software Testing and Debugging Techniques (5 papers) and Complexity and Algorithms in Graphs (3 papers). Roy Armoni is often cited by papers focused on Formal Methods in Verification (7 papers), Software Testing and Debugging Techniques (5 papers) and Complexity and Algorithms in Graphs (3 papers). Roy Armoni collaborates with scholars based in Israel, United States and India. Roy Armoni's co-authors include Shiyu Zhou, Amnon Ta‐Shma, Avi Wigderson, Moshe Y. Vardi, Yaron Wolfsthal, Ranan Fraer, V. Iyengar, Barry K. Rosen, Ashok K. Chandra and Daniel Geist and has published in prestigious journals such as Journal of the ACM, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems and IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

In The Last Decade

Roy Armoni

9 papers receiving 125 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Roy Armoni Israel 7 91 62 43 38 33 10 142
Matthieu Moy France 6 72 0.8× 111 1.8× 21 0.5× 24 0.6× 31 0.9× 18 142
HoonSang Jin United States 7 112 1.2× 51 0.8× 91 2.1× 51 1.3× 29 0.9× 17 173
Ramin Hojati United States 5 137 1.5× 85 1.4× 52 1.2× 51 1.3× 55 1.7× 13 166
Emmanuelle Encrenaz France 6 54 0.6× 70 1.1× 27 0.6× 74 1.9× 15 0.5× 13 133
Robert Brummayer Austria 5 80 0.9× 14 0.2× 78 1.8× 70 1.8× 10 0.3× 7 140
Laure Gonnord France 7 63 0.7× 43 0.7× 35 0.8× 57 1.5× 6 0.2× 22 93
Marcus Größer Germany 6 121 1.3× 14 0.2× 51 1.2× 78 2.1× 8 0.2× 11 150
Aina Niemetz Austria 5 54 0.6× 18 0.3× 49 1.1× 58 1.5× 12 0.4× 14 110
Dang Van Hung Spain 6 70 0.8× 28 0.5× 24 0.6× 52 1.4× 14 0.4× 31 110
Anna Slobodová Germany 8 149 1.6× 60 1.0× 50 1.2× 65 1.7× 36 1.1× 19 169

Countries citing papers authored by Roy Armoni

Since Specialization
Citations

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

Fields of papers citing papers by Roy Armoni

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Roy Armoni

This figure shows the co-authorship network connecting the top 25 collaborators of Roy Armoni. A scholar is included among the top collaborators of Roy Armoni 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 Roy Armoni. Roy Armoni is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

10 of 10 papers shown
1.
Armoni, Roy, Limor Fix, Ranan Fraer, et al.. (2007). Deeper Bound in BMC by Combining Constant Propagation and Abstraction. 304–309. 1 indexed citations
2.
Basu, Parthiba, Susobhan Das, Ansuman Banerjee, et al.. (2006). Design-Intent Coverage—A New Paradigm for Formal Property Verification. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 25(10). 1922–1934. 8 indexed citations
3.
Armoni, Roy, et al.. (2005). Efficient LTL compilation for SAT-based model checking. International Conference on Computer Aided Design. 877–884. 9 indexed citations
4.
Armoni, Roy, et al.. (2005). SAT-based Induction for Temporal Safety Properties. Electronic Notes in Theoretical Computer Science. 119(2). 3–16. 17 indexed citations
5.
Basu, Parthiba, Ansuman Banerjee, Pallab Dasgupta, et al.. (2005). Formal verification coverage: computing the coverage gap between temporal specifications. 198–203. 4 indexed citations
6.
Armoni, Roy, Michael Saks, Avi Wigderson, & Shiyu Zhou. (2002). Discrepancy sets and pseudorandom generators for combinatorial rectangles. 412–421. 13 indexed citations
7.
Armoni, Roy, et al.. (2002). Aborts vs Resets in Linear Temporal Logic. 4 indexed citations
8.
Armoni, Roy, et al.. (2000). An O (log( n ) 4/3 ) space algorithm for ( s, t ) connectivity in undirected graphs. Journal of the ACM. 47(2). 294–311. 13 indexed citations
9.
Armoni, Roy, Amnon Ta‐Shma, Avi Wigderson, & Shiyu Zhou. (1997). SLL4/3. 230–239. 16 indexed citations
10.
Chandra, Ashok K., V. Iyengar, Barry K. Rosen, et al.. (1995). AVPGEN-A test generator for architecture verification. IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 3(2). 188–200. 57 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