World's Best Scientists 2026 revealed!
Daniel J. Rosenkrantz

Daniel J. Rosenkrantz

D-Index & Metrics

Computer Science

D-Index
42
Citations
9104
World Ranking
8271
National Ranking
3546

Research.com Recognitions

  • 1995 - ACM Fellow For pioneering contributions to formal languages, compiler design, algorithm analysis, databases, parallel and fault-tolerant computing and for exemplary ACM service including Editorship of JACM.

Overview

Daniel J. Rosenkrantz is affiliated with the University of Virginia in the United States. Their research spans several interdisciplinary areas with a focus on computational theory, decision sciences, and physics. They have contributed to topics that intersect social dynamics, game theory, and complex network analysis.

The main fields of study for Rosenkrantz include Physics and Astronomy as well as Decision Sciences. More specifically, their subfields span Statistical and Nonlinear Physics, Management Science and Operations Research, Economics and Econometrics, Sociology and Political Science, and Artificial Intelligence.

Key topics in Rosenkrantz's work cover:

  • Opinion Dynamics and Social Influence
  • Complex Network Analysis Techniques
  • Game Theory and Applications
  • Auction Theory and Applications
  • Evolutionary Game Theory and Cooperation
  • Game Theory and Voting Systems
  • Economic theories and models

Rosenkrantz has multiple frequent co-authors, including:

  • Madhav Marathe
  • Richard E. Stearns
  • S. S. Ravi
  • Zirou Qiu
  • Anil Vullikanti

Rosenkrantz's publication record spans several reputable venues. The most frequent publication venues include:

  • arXiv (Cornell University)
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Proceedings of the National Academy of Sciences
  • Abacus
  • ACM Transactions on Computation Theory

Recent papers authored or co-authored by Rosenkrantz are:

  • "Fundamental limitations on efficiently forecasting certain epidemic measures in network models" (2022), Proceedings of the National Academy of Sciences
  • "Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms" (2024), ACM Transactions on Computation Theory
  • "Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms" (2021), Proceedings of the AAAI Conference on Artificial Intelligence

Additionally, Rosenkrantz is recognized as an ACM Fellow since 1995 for contributions across multiple areas including formal languages, compiler design, algorithm analysis, databases, parallel and fault-tolerant computing, and for service including editorship of the Journal of the ACM.

Best Publications

  • An analysis of several heuristics for the traveling salesman problem

    Daniel J. Rosenkrantz;Richard Edwin Stearns;Philip M. Lewis

  • Simple heuristics for unit disk graphs

    Madhav V. Marathe;H. Breu;Harry B. Hunt;S. S. Ravi

  • System level concurrency control for distributed database systems

    Daniel J. Rosenkrantz;Richard E. Stearns;Philip M. Lewis

  • NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs

    Harry B Hunt;Madhav V Marathe;Venkatesh Radhakrishnan;S.S Ravi

  • Properties of deterministic top-down grammars

    Daniel J. Rosenkrantz;Richard Edwin Stearns

  • HEURISTIC AND SPECIAL CASE ALGORITHMS FOR DISPERSION PROBLEMS

    S. S. Ravi;Daniel J. Rosenkrantz;Giri Kumar Tayi

  • Programmed Grammars and Classes of Formal Languages

    Daniel J. Rosenkrantz

  • Spanning Trees---Short or Small

    R. Ravi;R. Sundaram;M. V. Marathe;D. J. Rosenkrantz

  • Bicriteria Network Design Problems

    Madhav V Marathe;R Ravi;Ravi Sundaram;S.S Ravi

  • Compiler Design Theory

    nd Philip M. Lewis;Daniel J. Rosenkrantz;Richard E. Stearns

  • Approximate algorithms for the traveling salesperson problem

    D. J. Rosenkrantz;R. E. Stearns;P. M. Lewis

  • Many birds with one stone: multi-objective approximation algorithms

    R. Ravi;M. V. Marathe;S. S. Ravi;D. J. Rosenkrantz

  • Deterministic left corner parsing

    D. J. Rosenkrantz;P. M. Lewis

  • Attributed translations

    P. M. Lewis;D. J. Rosenkrantz;R. E. Stearns

  • Processing conjunctive predicates and queries

    Daniel J. Rosenkrantz;Harry B. Hunt

  • On the equivalence, containment, and covering problems for the regular and context-free languages

    Harry B. Hunt;Daniel J. Rosenkrantz;Thomas G. Szymanski

  • Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

    R. Ravi;Madhav V. Marathe;S. S. Ravi;Daniel J. Rosenkrantz

  • Concurrency control for database systems

    R. E. Stearns;P. M. Lewis;D. J. Rosenkrantz

  • Distributed database concurrency controls using before-values

    Richard E. Stearns;Daniel J. Rosenkrantz

  • Deferred updates and data placement in distributed databases

    P. Chundi;D.J. Rosenkrantz;S.S. Ravi

  • Spanning trees short or small

    R. Ravi;R. Sundaram;Madhav V. Marathe;S. S. Ravi

  • A System Level Concurrency Control for Distributed Database Systems.

    Daniel J. Rosenkrantz;Richard Edwin Stearns;Philip M. Lewis

Frequent Co-Authors

S. S. Ravi
S. S. Ravi University of Virginia
Richard Edwin Stearns
Richard Edwin Stearns University at Albany, State University of New York
Madhav V. Marathe
Madhav V. Marathe University of Virginia
R. Ravi
R. Ravi Carnegie Mellon University
Christopher L. Barrett
Christopher L. Barrett University of Virginia
Ravi Sundaram
Ravi Sundaram Northeastern University
Deepak Kapur
Deepak Kapur University of New Mexico
Yehoshua Sagiv
Yehoshua Sagiv Hebrew University of Jerusalem

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

As technology and industry needs evolve, students are seeking degrees that offer both flexibility and strong career outcomes. Many are considering the fastest online degree programs to enter the workforce quickly while acquiring in-demand skills.

The field of artificial intelligence is rapidly growing, making ai degrees online an attractive choice for those looking to specialize in cutting-edge technologies. These programs often offer flexibility for working professionals and can open doors to careers in data science, machine learning, and more.

If you're planning for long-term success, exploring the best degrees for the future can provide insight into which fields are predicted to have strong job growth and earning potential. Computer Science consistently ranks as a top option.

For those seeking further qualifications without a major time investment, there are easy masters degrees online that can expand your skills and boost your resume. These programs can be ideal for professionals looking to advance or switch careers with minimal disruption.

Best Scientists Citing Daniel J. Rosenkrantz

Trending Scientists

Recently Published Articles