Anna Slobodová

593 total citations
19 papers, 169 citations indexed

About

Anna Slobodová is a scholar working on Computational Theory and Mathematics, Hardware and Architecture and Software. According to data from OpenAlex, Anna Slobodová has authored 19 papers receiving a total of 169 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Computational Theory and Mathematics, 6 papers in Hardware and Architecture and 6 papers in Software. Recurrent topics in Anna Slobodová's work include Formal Methods in Verification (11 papers), semigroups and automata theory (6 papers) and Cellular Automata and Applications (5 papers). Anna Slobodová is often cited by papers focused on Formal Methods in Verification (11 papers), semigroups and automata theory (6 papers) and Cellular Automata and Applications (5 papers). Anna Slobodová collaborates with scholars based in Germany, Slovakia and United States. Anna Slobodová's co-authors include Christoph Meinel, Warren A. Hunt, Christoph Meinel, Matt Kaufmann, J Strother Moore, Per Bjesse, Klaus W. Wagner, Katsushi Inoue, Juraj Hromkovič and Itsuo Takanami and has published in prestigious journals such as Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems and Theoretical Computer Science.

In The Last Decade

Anna Slobodová

18 papers receiving 156 citations

Peers

Anna Slobodová
Anna Slobodová
Citations per year, relative to Anna Slobodová Anna Slobodová (= 1×) peers Hratch Mangassarian

Countries citing papers authored by Anna Slobodová

Since Specialization
Citations

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

Fields of papers citing papers by Anna Slobodová

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Anna Slobodová

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

All Works

19 of 19 papers shown
1.
Hunt, Warren A. & Anna Slobodová. (2017). Proceedings 14th International Workshop on the ACL2 Theorem Prover and its Applications. Electronic Proceedings in Theoretical Computer Science. 249.
2.
Hunt, Warren A., Matt Kaufmann, J Strother Moore, & Anna Slobodová. (2017). Industrial hardware and software verification with ACL2. Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences. 375(2104). 20150399–20150399. 18 indexed citations
3.
Bjesse, Per & Anna Slobodová. (2011). Proceedings of the International Conference on Formal Methods in Computer-Aided Design. 5 indexed citations
4.
Slobodová, Anna, et al.. (2011). A flexible formal verification framework for industrial scale validation. 89–97. 18 indexed citations
5.
Slobodová, Anna. (2008). Formal Verification of Hardware Support for Advanced Encryption Standard. 1–4. 7 indexed citations
6.
Meinel, Christoph, et al.. (2002). Boolean manipulation with free BDD's. First experimental results. 62. 200–207. 3 indexed citations
7.
Meinel, Christoph, et al.. (1999). Application driven variable reordering and an example implementation in reachability analysis. 762. 327–330 vol.1. 2 indexed citations
8.
Cabodi, Gianpiero, et al.. (1998). Binary Decision Diagrams and the Multiple Variable Order Problem. PORTO Publications Open Repository TOrino (Politecnico di Torino). 5 indexed citations
9.
Meinel, Christoph & Anna Slobodová. (1997). Speeding up variable reordering of OBDDs. 338–343. 28 indexed citations
10.
Meinel, Christoph & Anna Slobodová. (1997). A Unifying Theoretical Background for Some Bdd-based Data Structures. Formal Methods in System Design. 11(3). 223–237. 3 indexed citations
11.
Meinel, Christoph, et al.. (1996). Some heuristics for generating tree-like FBDD types. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 15(1). 127–130. 15 indexed citations
12.
Meinel, Christoph, et al.. (1996). Global rebuilding of OBDD's avoiding memory requirement maxima. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 15(1). 131–134. 2 indexed citations
13.
Slobodová, Anna. (1995). ON THE POWER OF ONE-WAY GLOBALLY DETERMINISTIC SYNCHRONIZED ALTERNATING TURING MACHINES AND MULTIHEAD AUTOMATA. International Journal of Foundations of Computer Science. 6(4). 431–446. 3 indexed citations
14.
Meinel, Christoph, et al.. (1995). Efficient OBDD-based boolean manipulation in CAD beyond current limits. 408–413. 32 indexed citations
15.
Slobodová, Anna, et al.. (1994). Deterministic versus nondeterministic space in terms of synchronized alternating machines. Theoretical Computer Science. 132(1-2). 319–336. 10 indexed citations
16.
Hromkovič, Juraj, et al.. (1993). Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines.. 314–325. 1 indexed citations
17.
Hromkovič, Juraj, et al.. (1992). ON THE POWER OF ONE-WAY SYNCHRONIZED ALTERNATING MACHINES WITH SMALL SPACE. International Journal of Foundations of Computer Science. 3(1). 65–79. 11 indexed citations
18.
Slobodová, Anna. (1992). Some properties of space-bounded synchronized alternating Turing machines with universal states only. Theoretical Computer Science. 96(2). 411–419. 3 indexed citations
19.
Slobodová, Anna. (1990). One-way globally deterministic synchronized alternating finite automata recognize exactly deterministic context-sensitive languages. Information Processing Letters. 36(2). 69–72. 3 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