B. A. Trakhtenbrot
- Computational Theory and Mathematics top 2%
- Artificial Intelligence top 5%
- Computer Networks and Communications
- Software top 10%
- Hardware and Architecture
- Topics
- Formal Methods in Verification (9 papers)Logic, programming, and type systems (7 papers)semigroups and automata theory (6 papers)
- Partner nations
- IsraelPolandUnited Kingdom
In The Last Decade
B. A. Trakhtenbrot
16 papers receiving 307 citations
Peers
Comparison fields: 5 of 55
- Computational Theory and Mathematics 266
- Artificial Intelligence 239
- Computer Networks and Communications 55
- Software 29
- Hardware and Architecture 27
Countries citing papers authored by B. A. Trakhtenbrot
This map shows the geographic impact of B. A. Trakhtenbrot'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 B. A. Trakhtenbrot with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites B. A. Trakhtenbrot more than expected).
Fields of papers citing papers by B. A. Trakhtenbrot
This network shows the impact of papers produced by B. A. Trakhtenbrot. 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 B. A. Trakhtenbrot. The network helps show where B. A. Trakhtenbrot may publish in the future.
Co-authorship network of co-authors of B. A. Trakhtenbrot
This figure shows the co-authorship network connecting the top 25 collaborators of B. A. Trakhtenbrot. A scholar is included among the top collaborators of B. A. Trakhtenbrot 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 B. A. Trakhtenbrot. B. A. Trakhtenbrot is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Understanding Basic Automata Theory in the Continuous Time Setting | 4 |
| 2 | Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness | 2 |
| 3 | 0 | |
| 4 | 4 | |
| 5 | 1 | |
| 6 | 1 | |
| 7 | 1 | |
| 8 | Nets of processes and data flow | 5 |
| 9 | 54 | |
| 10 | 99 | |
| 11 | 18 | |
| 12 | The Semantics of Local Storage, or What Makes the Free-List Free? | 16 |
| 13 | Finite automata; behavior and synthesis | 123 |
| 14 | 5 | |
| 15 | 21 | |
| 16 | Algorithms and automatic computing machines | 25 |
| 17 | Finite Automata and the Logic of Single-Place Predicates | 3 |
About B. A. Trakhtenbrot
B. A. Trakhtenbrot is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Hardware and Architecture, having authored 17 papers that have together received 382 indexed citations. Recurring topics across this work include Formal Methods in Verification (9 papers), Logic, programming, and type systems (7 papers) and semigroups and automata theory (6 papers). The work is most often cited by research in Computational Theory and Mathematics (266 citations), Software (29 citations) and Artificial Intelligence (239 citations). B. A. Trakhtenbrot has collaborated with scholars based in Israel, Poland and United Kingdom. Frequent co-authors include Alexander Rabinovich, Albert R. Meyer, Joseph Y. Halpern, Martin Davis and Antoni Mazurkiewicz. Their work appears in journals such as Mathematics of Computation, Theoretical Computer Science and Fundamenta Informaticae.
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.