Benjamin Sach

643 total citations
13 papers, 168 citations indexed

About

Benjamin Sach is a scholar working on Artificial Intelligence, Molecular Biology and Computational Theory and Mathematics. According to data from OpenAlex, Benjamin Sach has authored 13 papers receiving a total of 168 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Artificial Intelligence, 8 papers in Molecular Biology and 5 papers in Computational Theory and Mathematics. Recurrent topics in Benjamin Sach's work include Algorithms and Data Compression (12 papers), DNA and Biological Computing (8 papers) and semigroups and automata theory (4 papers). Benjamin Sach is often cited by papers focused on Algorithms and Data Compression (12 papers), DNA and Biological Computing (8 papers) and semigroups and automata theory (4 papers). Benjamin Sach collaborates with scholars based in United Kingdom, Israel and Denmark. Benjamin Sach's co-authors include Raphaël Clifford, Markus Jalsenius, Inge Li Gørtz, Philip Bille, Ashley Montanaro, Matt McVicar, Ely Porat, Johannes Fischer, Tsvi Kopelowitz and Jefrey Lijffijt and has published in prestigious journals such as Pattern Recognition Letters, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Benjamin Sach

12 papers receiving 164 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Benjamin Sach United Kingdom 7 89 52 37 34 26 13 168
Inge Li Gørtz Denmark 7 120 1.3× 62 1.2× 47 1.3× 16 0.5× 14 0.5× 42 158
Ola Petersson Sweden 8 110 1.2× 48 0.9× 29 0.8× 52 1.5× 14 0.5× 20 157
Luís M. S.​Russo Portugal 9 187 2.1× 112 2.2× 86 2.3× 21 0.6× 25 1.0× 28 277
Markus Jalsenius United Kingdom 6 57 0.6× 77 1.5× 10 0.3× 27 0.8× 19 0.7× 12 165
Peter van Emde Boas Netherlands 9 120 1.3× 128 2.5× 12 0.3× 78 2.3× 24 0.9× 25 229
Radu Nicolescu New Zealand 8 47 0.5× 50 1.0× 92 2.5× 28 0.8× 21 0.8× 34 174
Gregory V. Bard United States 5 142 1.6× 43 0.8× 18 0.5× 28 0.8× 51 2.0× 9 210
Jyh-Jong Tsay Taiwan 8 82 0.9× 20 0.4× 29 0.8× 67 2.0× 105 4.0× 37 267
Song Bian China 4 119 1.3× 19 0.4× 29 0.8× 34 1.0× 75 2.9× 4 209
Markus Triska Austria 6 130 1.5× 28 0.5× 16 0.4× 55 1.6× 24 0.9× 8 211

Countries citing papers authored by Benjamin Sach

Since Specialization
Citations

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

Fields of papers citing papers by Benjamin Sach

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Benjamin Sach

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

All Works

13 of 13 papers shown
1.
Bille, Philip, et al.. (2017). Fingerprints in compressed strings. Journal of Computer and System Sciences. 86. 171–180. 5 indexed citations
2.
Bille, Philip, et al.. (2016). Sparse Text Indexing in Small Space. ACM Transactions on Algorithms. 12(3). 1–19. 6 indexed citations
3.
McVicar, Matt, et al.. (2016). SuMoTED: An intuitive edit distance between rooted unordered uniquely-labelled trees. Pattern Recognition Letters. 79. 52–59. 6 indexed citations
4.
Clifford, Raphaël, Markus Jalsenius, & Benjamin Sach. (2015). ACM-SIAM Symposium on Discrete Algorithms. Symposium on Discrete Algorithms. 84 indexed citations
5.
Clifford, Raphaël, Markus Jalsenius, & Benjamin Sach. (2015). Cell-probe bounds for online edit distance and other pattern matching problems. arXiv (Cornell University). 552–561. 3 indexed citations
6.
Bille, Philip, et al.. (2013). Time–space trade-offs for longest common extensions. Journal of Discrete Algorithms. 25. 42–50. 12 indexed citations
7.
Clifford, Peter, Raphaël Clifford, Markus Jalsenius, et al.. (2013). Pattern Matching under Polynomial Transformation. SIAM Journal on Computing. 42(2). 611–633. 3 indexed citations
8.
Jalsenius, Markus, et al.. (2013). Parameterized Matching in the Streaming Model. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 6 indexed citations
9.
Clifford, Raphaël, Markus Jalsenius, Ely Porat, & Benjamin Sach. (2012). Space lower bounds for online pattern matching. Theoretical Computer Science. 483. 68–74. 3 indexed citations
10.
Clifford, Raphaël, Markus Jalsenius, Ashley Montanaro, & Benjamin Sach. (2011). The Complexity of Flood Filling Games. Theory of Computing Systems. 50(1). 72–92. 8 indexed citations
11.
Clifford, Raphaël & Benjamin Sach. (2010). Pattern matching in pseudo real-time. Journal of Discrete Algorithms. 9(1). 67–81.
12.
Clifford, Raphaël & Benjamin Sach. (2010). Permuted function matching. Information Processing Letters. 110(22). 1012–1015. 1 indexed citations
13.
Clifford, Raphaël & Benjamin Sach. (2009). Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching (CPM). 31 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