Theis Rauhe

1.6k total citations
26 papers, 424 citations indexed

About

Theis Rauhe is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Theis Rauhe has authored 26 papers receiving a total of 424 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Artificial Intelligence, 16 papers in Computational Theory and Mathematics and 9 papers in Computer Networks and Communications. Recurrent topics in Theis Rauhe's work include Algorithms and Data Compression (15 papers), Complexity and Algorithms in Graphs (8 papers) and semigroups and automata theory (6 papers). Theis Rauhe is often cited by papers focused on Algorithms and Data Compression (15 papers), Complexity and Algorithms in Graphs (8 papers) and semigroups and automata theory (6 papers). Theis Rauhe collaborates with scholars based in Denmark, Sweden and Israel. Theis Rauhe's co-authors include Stephen Alstrup, Gerth Stølting Brodal, Thore Husfeldt, Haim Kaplan, Jakob Pagter, Cyril Gavoille, Philip Bille, Nils Klarlund, Tova Milo and Serge Abiteboul and has published in prestigious journals such as SIAM Journal on Computing, SIAM Journal on Discrete Mathematics and Theory of Computing Systems.

In The Last Decade

Theis Rauhe

24 papers receiving 390 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Theis Rauhe Denmark	12	245	218	140	92	62	26	424
Peter Emde Boas Netherlands	2	179 0.7×	117 0.5×	125 0.9×	62 0.7×	61 1.0×	2	325
Amir Abboud United States	12	206 0.8×	342 1.6×	196 1.4×	46 0.5×	42 0.7×	36	482
Karl Abrahamson Canada	10	327 1.3×	294 1.3×	192 1.4×	23 0.3×	120 1.9×	23	553
Omer Berkman United States	9	253 1.0×	194 0.9×	119 0.8×	34 0.4×	79 1.3×	17	396
Kristian de Lichtenberg Denmark	5	95 0.4×	171 0.8×	133 0.9×	49 0.5×	15 0.2×	6	306
Glenn K. Manacher United States	9	122 0.5×	165 0.8×	83 0.6×	31 0.3×	59 1.0×	22	324
Mark R. Brown United States	7	157 0.6×	83 0.4×	103 0.7×	43 0.5×	34 0.5×	9	244
Benjamin Rossman United States	10	215 0.9×	250 1.1×	115 0.8×	55 0.6×	24 0.4×	34	427
Elad Verbin Israel	12	130 0.5×	165 0.8×	127 0.9×	32 0.3×	22 0.4×	25	309
Oded Margalit Israel	10	109 0.4×	218 1.0×	184 1.3×	41 0.4×	16 0.3×	20	372

Countries citing papers authored by Theis Rauhe

Since Specialization

Citations

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

Fields of papers citing papers by Theis Rauhe

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Theis Rauhe

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Alstrup, Stephen, Mikkel Thorup, Inge Li Gørtz, Theis Rauhe, & Uri Zwick. (2014). Union-Find with Constant Time Deletions. ACM Transactions on Algorithms. 11(1). 1–28. 7 indexed citations

Abiteboul, Serge, Stephen Alstrup, Haim Kaplan, Tova Milo, & Theis Rauhe. (2006). Compact Labeling Scheme for Ancestor Queries. SIAM Journal on Computing. 35(6). 1295–1309. 26 indexed citations

Alstrup, Stephen, Thore Husfeldt, Theis Rauhe, & Mikkel Thorup. (2005). Black box for constant-time insertion in priority queues (note). ACM Transactions on Algorithms. 1(1). 102–106. 5 indexed citations

Alstrup, Stephen, Cyril Gavoille, Haim Kaplan, & Theis Rauhe. (2004). Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment. Theory of Computing Systems. 37(3). 441–456. 37 indexed citations

Alstrup, Stephen, Philip Bille, & Theis Rauhe. (2003). Labeling schemes for small distances in trees. Symposium on Discrete Algorithms. 689–698. 14 indexed citations

Husfeldt, Thore & Theis Rauhe. (2003). New Lower Bound Techniques for Dynamic Partial Sums and Related Problems. SIAM Journal on Computing. 32(3). 736–753. 8 indexed citations

Alstrup, Stephen & Theis Rauhe. (2003). Small induced-universal graphs and compact implicit graph representations. 53–62. 22 indexed citations

Alstrup, Stephen & Theis Rauhe. (2002). Improved labeling scheme for ancestor queries. Symposium on Discrete Algorithms. 947–953. 40 indexed citations

Alstrup, Stephen, Gerth Stølting Brodal, & Theis Rauhe. (2002). New data structures for orthogonal range searching. 198–207. 65 indexed citations

10.

Alstrup, Stephen, Cyril Gavoille, Haim Kaplan, & Theis Rauhe. (2002). Nearest common ancestors. 1 indexed citations

11.

Alstrup, Stephen, Thore Husfeldt, & Theis Rauhe. (2002). Marked ancestor problems. 534–543. 47 indexed citations

12.

Alstrup, Stephen, Thore Husfeldt, & Theis Rauhe. (2001). A cell probe lower bound for dynamic nearest-neighbor searching. Symposium on Discrete Algorithms. 779–780. 2 indexed citations

13.

Alstrup, Stephen, Gerth Stølting Brodal, & Theis Rauhe. (2001). Optimal static range reporting in one dimension. 476–482. 28 indexed citations

14.

Alstrup, Stephen, Gerth Stølting Brodal, & Theis Rauhe. (2000). Pattern matching in dynamic texts. Symposium on Discrete Algorithms. 819–828. 15 indexed citations

15.

Alstrup, Stephen, Amir M. Ben-Amram, & Theis Rauhe. (1999). Worst-case and amortised optimality in union-find (extended abstract). 499–506. 10 indexed citations

16.

Husfeldt, Thore & Theis Rauhe. (1997). Hardness Results for Dynamic Problems by Extensions of Fredman and Saks’ Chronogram Method. BRICS Report Series. 4(32). 4 indexed citations

17.

Husfeldt, Thore, et al.. (1996). Lower bounds for dynamic transitive closure, planar point location, and parantheses matching. Nordic journal of computing. 3(4). 323–336. 4 indexed citations

18.

Husfeldt, Thore, et al.. (1996). Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching. BRICS Report Series. 3(9). 1 indexed citations

19.

Frandsen, Gudmund Skovbjerg, et al.. (1995). Dynamic Algorithms for the Dyck Languages. BRICS Report Series. 2(1). 10 indexed citations

20.

Henriksen, Jesper G., et al.. (1995). MONA: Monadic Second-Order Logic in Practice. BRICS Report Series. 2(21). 24 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