Daniel J. Rosenkrantz

6.7k total citations · 1 hit paper
128 papers, 3.3k citations indexed

About

Daniel J. Rosenkrantz is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Daniel J. Rosenkrantz has authored 128 papers receiving a total of 3.3k indexed citations (citations by other indexed papers that have themselves been cited), including 57 papers in Computational Theory and Mathematics, 45 papers in Computer Networks and Communications and 44 papers in Artificial Intelligence. Recurrent topics in Daniel J. Rosenkrantz's work include semigroups and automata theory (26 papers), Distributed systems and fault tolerance (22 papers) and Algorithms and Data Compression (15 papers). Daniel J. Rosenkrantz is often cited by papers focused on semigroups and automata theory (26 papers), Distributed systems and fault tolerance (22 papers) and Algorithms and Data Compression (15 papers). Daniel J. Rosenkrantz collaborates with scholars based in United States, Israel and Germany. Daniel J. Rosenkrantz's co-authors include Richard E. Stearns, Philip Lewis, Harry B. Hunt, S. S. Ravi, Madhav Marathe, R. Ravi, Giri Kumar Tayi, Sujith Ravi, Venkatesh Babu Radhakrishnan and Sujith Ravi and has published in prestigious journals such as Proceedings of the National Academy of Sciences, European Journal of Operational Research and Operations Research.

In The Last Decade

Daniel J. Rosenkrantz

121 papers receiving 3.0k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

An Analysis of Several Heuristics for the Traveling Salesman Problem

1977 504 citations Daniel J. Rosenkrantz, Richard E. Stearns et al. profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Daniel J. Rosenkrantz United States	27	1.3k	1.2k	1.1k	519	320	128	3.3k
Baruch Schieber United States	33	1.2k 0.9×	2.0k 1.6×	786 0.7×	453 0.9×	278 0.9×	129	3.5k
Howard Karloff United States	29	1.2k 0.9×	1.3k 1.0×	957 0.9×	428 0.8×	89 0.3×	91	2.9k
George S. Lueker United States	18	1.4k 1.1×	863 0.7×	526 0.5×	531 1.0×	145 0.5×	41	2.6k
Richard E. Stearns United States	31	2.4k 1.8×	693 0.6×	1.8k 1.7×	386 0.7×	476 1.5×	94	4.1k
Alon Itai Israel	34	1.6k 1.2×	2.1k 1.7×	1.4k 1.4×	384 0.7×	114 0.4×	70	4.4k
J. W. Thatcher United States	16	2.2k 1.7×	851 0.7×	1.8k 1.7×	504 1.0×	300 0.9×	35	3.8k
Alberto Marchetti-Spaccamela Italy	24	693 0.5×	1.0k 0.8×	446 0.4×	347 0.7×	254 0.8×	112	2.3k
Yuval Rabani Israel	30	1.2k 0.9×	1.4k 1.1×	827 0.8×	250 0.5×	100 0.3×	94	2.9k
Allan Borodin Canada	33	2.0k 1.5×	2.9k 2.3×	1.4k 1.3×	484 0.9×	138 0.4×	105	5.2k
Harold N. Gabow United States	35	2.3k 1.8×	1.9k 1.5×	813 0.8×	512 1.0×	459 1.4×	118	4.7k

Countries citing papers authored by Daniel J. Rosenkrantz

Since Specialization

Citations

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

Fields of papers citing papers by Daniel J. Rosenkrantz

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Daniel J. Rosenkrantz

This figure shows the co-authorship network connecting the top 25 collaborators of Daniel J. Rosenkrantz. A scholar is included among the top collaborators of Daniel J. Rosenkrantz 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 Daniel J. Rosenkrantz. Daniel J. Rosenkrantz 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

Rosenkrantz, Daniel J., Anil Vullikanti, S. S. Ravi, et al.. (2022). Fundamental limitations on efficiently forecasting certain epidemic measures in network models. Proceedings of the National Academy of Sciences. 119(4). 9 indexed citations

Rosenkrantz, Daniel J., Madhav Marathe, S. S. Ravi, & Richard E. Stearns. (2019). Symmetry Properties of Nested Canalyzing Functions. Discrete Mathematics & Theoretical Computer Science. vol. 21 no. 4(Discrete Algorithms). 2 indexed citations

Rosenkrantz, Daniel J., Madhav Marathe, S. S. Ravi, & Richard E. Stearns. (2018). Testing Phase Space Properties of Synchronous Dynamical Systems with Nested Canalyzing Local Functions. Adaptive Agents and Multi-Agents Systems. 1585–1594. 4 indexed citations

Adiga, Abhijin, Chris J. Kuhlman, Madhav Marathe, et al.. (2016). Inferring local transition functions of discrete dynamical systems from observations of system behavior. Theoretical Computer Science. 679. 126–144. 6 indexed citations

Rosenkrantz, Daniel J., Madhav Marathe, Harry B. Hunt, S. S. Ravi, & Richard E. Stearns. (2015). Analysis Problems for Graphical Dynamical Systems: A Unified Approach Through Graph Predicates. Adaptive Agents and Multi-Agents Systems. 1501–1509. 9 indexed citations

Tuli, Gaurav, Chris J. Kuhlman, Madhav Marathe, S. S. Ravi, & Daniel J. Rosenkrantz. (2012). Blocking complex contagions using community structure. 3 indexed citations

Kumar, V. S. Anil, Madhav Marathe, Samarth Swarup, et al.. (2011). Inhibiting the Diffusion of Contagions in Bi-Threshold Systems: Analytical and Experimental Results. National Conference on Artificial Intelligence. 5 indexed citations

Barrett, Chris, Harry B. Hunt, Madhav Marathe, et al.. (2007). Computational aspects of analyzing social network dynamics. International Joint Conference on Artificial Intelligence. 2268–2273. 7 indexed citations

Barrett, Chris, Harry B. Hunt, Madhav Marathe, et al.. (2007). Predecessor existence problems for finite discrete dynamical systems. Theoretical Computer Science. 386(1-2). 3–37. 37 indexed citations

10.

Rosenkrantz, Daniel J. & Richard E. Stearns. (2003). NP-complete problems. 32(6). 1252–1256. 10 indexed citations

11.

Breitbart, Yuri, Harry B. Hunt, & Daniel J. Rosenkrantz. (1995). On the size of binary decision diagrams representing Boolean functions. Theoretical Computer Science. 145(1-2). 45–69. 30 indexed citations

12.

Ravi, R., et al.. (1994). Spanning trees short or small. arXiv (Cornell University). 546–555. 32 indexed citations

13.

Ravi, S. S., Daniel J. Rosenkrantz, & Giri Kumar Tayi. (1991). Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract).. 11(22). 355–366. 5 indexed citations

14.

Rosenkrantz, Daniel J.. (1991). Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems. International Conference on Management of Data. 4 indexed citations

15.

Rosenkrantz, Daniel J. & Yehoshua Sagiv. (1990). Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems. 6 indexed citations

16.

Hunt, Harry B., et al.. (1989). Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection Networks.. Proceedings of the International Conference on Parallel Processing. 111–115. 1 indexed citations

17.

Hunt, Harry B. & Daniel J. Rosenkrantz. (1983). The complexity of monadic recursion schemes: Executability problems, nesting depth, and applications. Theoretical Computer Science. 27(1-2). 3–38. 4 indexed citations

18.

Rosenkrantz, Daniel J. & Harry B. Hunt. (1980). Processing conjunctive predicates and queries. Very Large Data Bases. 64–72. 81 indexed citations

19.

Rosenkrantz, Daniel J., et al.. (1976). Compiler Design Theory. Addison-Wesley Longman Publishing Co., Inc. eBooks. 69 indexed citations

20.

Lewis, Philip, Daniel J. Rosenkrantz, & Richard E. Stearns. (1974). Attributed translations. Journal of Computer and System Sciences. 9(3). 279–307. 84 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