Synchronizing Sequences for Incompletely Specified Flow Tables. - Daniel J. Rosenkrantz (IEEE Trans. Electron. Comput., 1966)

Programmed Grammars: A New Device for Generating Formal Languages - Daniel J. Rosenkrantz (SWAT, 1967)

Matrix Equations and Normal Forms for Context-Free Grammars. - Daniel J. Rosenkrantz (J. ACM, 1967)

Table Machine Simulation - Richard Edwin Stearns; Daniel J. Rosenkrantz (SWAT, 1969)

Programmed Grammars and Classes of Formal Languages. - Daniel J. Rosenkrantz (J. ACM, 1969)

Deterministic Left Corner Parsing (Extended Abstract) - Daniel J. Rosenkrantz; Philip M. Lewis II (SWAT, 1970)

Properties of Deterministic Top-Down Grammars - Daniel J. Rosenkrantz; Richard Edwin Stearns (Inf. Control., 1970)

Approximate Algorithms for the Traveling Salesperson Problem - Daniel J. Rosenkrantz; Richard Edwin Stearns; Philip M. Lewis II (SWAT, 1974)

Attributed Translations. - Philip M. Lewis II; Daniel J. Rosenkrantz; Richard Edwin Stearns (J. Comput. Syst. Sci., 1974)

Concurrency Control for Database Systems - Richard Edwin Stearns; Philip M. Lewis II; Daniel J. Rosenkrantz (FOCS, 1976)

On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages. - Harry B. Hunt III; Daniel J. Rosenkrantz; Thomas G. Szymanski (J. Comput. Syst. Sci., 1976)

The Covering Problem for Linear Context-Free Grammars. - Harry B. Hunt III; Daniel J. Rosenkrantz; Thomas G. Szymanski (Theor. Comput. Sci., 1976)

On Equivalence and Containment Problems for Formal Languages. - Harry B. Hunt III; Daniel J. Rosenkrantz (J. ACM, 1977)

An Analysis of Several Heuristics for the Traveling Salesman Problem. - Daniel J. Rosenkrantz; Richard Edwin Stearns; Philip M. Lewis II (SIAM J. Comput., 1977)

Dynamic Database Dumping. - Daniel J. Rosenkrantz (SIGMOD Conference, 1978)

Computational Parallels Between the Regular and Context-Free Languages. - Harry B. Hunt III; Daniel J. Rosenkrantz (SIAM J. Comput., 1978)

Polynomial Algorithms for Deterministic Pushdown Automata. - Daniel J. Rosenkrantz; Harry B. Hunt III (SIAM J. Comput., 1978)

System Level Concurrency Control for Distributed Database Systems. - Daniel J. Rosenkrantz; Richard Edwin Stearns; Philip M. Lewis II (ACM Trans. Database Syst., 1978)

The Complexity of Testing Predicate Locks. - Harry B. Hunt III; Daniel J. Rosenkrantz (SIGMOD Conference, 1979)

The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract) - Harry B. Hunt III; Daniel J. Rosenkrantz (FOCS, 1980)

Efficient Algorithms for Structural Similarity of Grammars. - Harry B. Hunt III; Daniel J. Rosenkrantz (POPL, 1980)

Processing Conjunctive Predicates and Queries. - Daniel J. Rosenkrantz; Harry B. Hunt III (VLDB, 1980)

Distributed Database Concurrency Controls Using Before-Values. - Richard Edwin Stearns; Daniel J. Rosenkrantz (SIGMOD Conference, 1981)

The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications. - Harry B. Hunt III; Daniel J. Rosenkrantz (Theor. Comput. Sci., 1983)

Algebraic Structures with Hard Equivalence and Minimization Problems. - Peter A. Bloniarz; Harry B. Hunt III; Daniel J. Rosenkrantz (J. ACM, 1984)

The Complexity of Monadic Recursion Schemes: Exponential Time Bounds. - Harry B. Hunt III; Daniel J. Rosenkrantz (J. Comput. Syst. Sci., 1984)

Consistency and Serializability in Concurrent Database Systems. - Daniel J. Rosenkrantz; Richard Edwin Stearns; Philip M. Lewis II (SIAM J. Comput., 1984)

Testing for Grammatical Coverings. - Daniel J. Rosenkrantz; Harry B. Hunt III (Theor. Comput. Sci., 1985)

Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze. - Harry B. Hunt III; Daniel J. Rosenkrantz (SIAM J. Comput., 1986)

On the Computational Complexity of Algebra on Lattices. - Harry B. Hunt III; Daniel J. Rosenkrantz; Peter A. Bloniarz (SIAM J. Comput., 1987)

Efficient Algorithms for Automatic Construction and Compactification of Parsing Grammars. - Daniel J. Rosenkrantz; Harry B. Hunt III (ACM Trans. Program. Lang. Syst., 1987)

Matrix Multiplication for Finite Algebraic Systems. - Daniel J. Rosenkrantz; Harry B. Hunt III (Inf. Process. Lett., 1988)

Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection Networks. - Philip J. Bernhard; Harry B. Hunt III; Daniel J. Rosenkrantz (ICPP (1), 1989)

The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits. - Sreejit Chakravarty; Harry B. Hunt III; S. S. Ravi; Daniel J. Rosenkrantz (IEEE Trans. Computers, 1989)

Design and analysis of test schemes for algorithm-based fault tolerance. - Dechang Gu; Daniel J. Rosenkrantz; S. S. Ravi (FTCS, 1990)

Minimizing Time-Space Cost for Database Version Control. - Lin Yu; Daniel J. Rosenkrantz (Acta Informatica, 1990)

Half-Hot State Assignments for Finite State Machines. - Daniel J. Rosenkrantz (IEEE Trans. Computers, 1990)

Construction and Analysis of Fault-Secure Multiprocessor Schedules. - Dechang Gu; Daniel J. Rosenkrantz; S. S. Ravi (FTCS, 1991)

Facility Dispersion Problems: Heuristics and Special Cases (Extended Abstract). - S. S. Ravi; Daniel J. Rosenkrantz; Giri Kumar Tayi (WADS, 1991)

A Linear-Time Scheme for Version Reconstruction (Extended Abstract). - Lin Yu; Daniel J. Rosenkrantz (WADS, 1991)

Sufficient-Completeness, Ground-Reducibility and their Complexity. - Deepak Kapur; Paliath Narendran; Daniel J. Rosenkrantz; Hantao Zhang 001 (Acta Informatica, 1991)

Compaction of Message Patterns into Succinct Representations for Multiprocessor Interconnection Networks. - Philip J. Bernhard; Harry B. Hunt III; Daniel J. Rosenkrantz (J. Parallel Distributed Comput., 1991)

An Efficient Method for Representing and Transmitting Message Patterns on Multiprocessor Interconnection Networks. - Philip J. Bernhard; Daniel J. Rosenkrantz (J. Parallel Distributed Comput., 1991)

Using the Dual Path Property of Omega Networks to Obtain Conflict-Free Message Routing. - Philip J. Bernhard; Daniel J. Rosenkrantz (IEEE Trans. Parallel Distributed Syst., 1991)

The Complexity of STructural Containment and Equivalence. - Daniel J. Rosenkrantz; Harry B. Hunt III (Theoretical Studies in Computer Science, 1992)

Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications. - Lin Yu; Daniel J. Rosenkrantz (SIAM J. Comput., 1992)

Compact Location Problems. - Venkatesh Radhakrishnan; Sven Oliver Krumke; Madhav V. Marathe; Daniel J. Rosenkrantz; S. S. Ravi (FSTTCS, 1993)

Exploiting Data Flow Information in Algorithm-Based Fault Tolerance. - Ragini Shamsunder; Daniel J. Rosenkrantz; S. S. Ravi (FTCS, 1993)

Many birds with one stone: multi-objective approximation algorithms. - R. Ravi 001; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Harry B. Hunt III (STOC, 1993)

Determining Performance Measures of Algorithm-Based Fault Tolerant Systems. - Dechang Gu; Daniel J. Rosenkrantz; S. S. Ravi (J. Parallel Distributed Comput., 1993)

The Complexity of Processing Hierarchical Specifications. - Daniel J. Rosenkrantz; Harry B. Hunt III (SIAM J. Comput., 1993)

Improved Bounds for Algorithm-Based Fault Tolerance. - Daniel J. Rosenkrantz; S. S. Ravi (IEEE Trans. Computers, 1993)

Ancestor Controlled Submodule Inclusion in Design Databases. - Lin Yu; Daniel J. Rosenkrantz (IEEE Trans. Knowl. Data Eng., 1993)

A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. - Harry B. Hunt III; Madhav V. Marathe; Venkatesh Radhakrishnan; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (ESA, 1994)

Approximation Schemes Using L-Reductions. - Harry B. Hunt III; Madhav V. Marathe; Venkatesh Radhakrishnan; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (FSTTCS, 1994)

Interactive control restructuring. - Jeanette Bruno; Daniel J. Rosenkrantz (SETA, 1994)

Geometry based heuristics for unit disk graphs. - Madhav V. Marathe; Heinz Breu; Harry B. Hunt III; S. S. Ravi; Daniel J. Rosenkrantz (CoRR, 1994)

Heuristic and Special Case Algorithms for Dispersion Problems. - S. S. Ravi; Daniel J. Rosenkrantz; Giri Kumar Tayi (Oper. Res., 1994)

Construction of Check Sets for Algorithm-Based Fault Tolerance. - Dechang Gu; Daniel J. Rosenkrantz; S. S. Ravi (IEEE Trans. Computers, 1994)

A Linear-Time Scheme for Version Reconstruction. - Lin Yu; Daniel J. Rosenkrantz (ACM Trans. Program. Lang. Syst., 1994)

Partitioning Message Patterns for Bundled Omega Networks. - Philip J. Bernhard; Daniel J. Rosenkrantz (IEEE Trans. Parallel Distributed Syst., 1994)

Efficient algorithms for analyzing and synthesizing fault-tolerant datapaths. - Ragini Narasimhan; Daniel J. Rosenkrantz; S. S. Ravi (DFT, 1995)

Active Client Primary-Backup Protocols (Abstract). - Parvathi Chundi; Ragini Narasimhan; Daniel J. Rosenkrantz; S. S. Ravi (PODC, 1995)

Simple heuristics for unit disk graphs. - Madhav V. Marathe; Heinz Breu; Harry B. Hunt III; S. S. Ravi; Daniel J. Rosenkrantz (Networks, 1995)

On the Size of Binary Decision Diagrams Representing Boolean Functions. - Yuri Breitbart; Harry B. Hunt III; Daniel J. Rosenkrantz (Theor. Comput. Sci., 1995)

HORNSAT, Model Checking, Verification and games (Extended Abstract). - Sandeep K. Shukla; Harry B. Hunt III; Daniel J. Rosenkrantz (CAV, 1996)

The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approach. - Sandeep K. Shukla; Daniel J. Rosenkrantz; Harry B. Hunt III; Richard Edwin Stearns (Satisfiability Problem: Theory and Applications, 1996)

A simulation and validation tool for self-stabilizing protocols. - Sandeep K. Shukla; Daniel J. Rosenkrantz; S. S. Ravi (The Spin Verification System, 1996)

On the Complexity of Relational Problems for Finite State Processes (Extended Abstract). - Sandeep K. Shukla; Harry B. Hunt III; Daniel J. Rosenkrantz; Richard Edwin Stearns (ICALP, 1996)

Deferred Updates and Data Placement in Distributed Databases. - Parvathi Chundi; Daniel J. Rosenkrantz; S. S. Ravi (ICDE, 1996)

I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract). - Sandeep K. Shukla; Harry B. Hunt III; Daniel J. Rosenkrantz; S. S. Ravi; Richard Edwin Stearns (PODC, 1996)

Spanning Trees - Short or Small. - R. Ravi 001; Ravi Sundaram; Madhav V. Marathe; Daniel J. Rosenkrantz; S. S. Ravi (SIAM J. Discret. Math., 1996)

Multi-site distributed database transactions utilizing deferred update. - Parvathi Chundi; Daniel J. Rosenkrantz; S. S. Ravi (SAC, 1997)

Compact Location Problems. - Sven Oliver Krumke; Madhav V. Marathe; Hartmut Noltemeier; Venkatesh Radhakrishnan; S. S. Ravi; Daniel J. Rosenkrantz (Theor. Comput. Sci., 1997)

Theory of Periodically Specified Problems: Complexity and Approximability. - Madhav V. Marathe; Harry B. Hunt III; Daniel J. Rosenkrantz; Richard Edwin Stearns (CCC, 1998)

NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. - Harry B. Hunt III; Madhav V. Marathe; Venkatesh Radhakrishnan; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (J. Algorithms, 1998)

Bicriteria Network Design Problems. - Madhav V. Marathe; R. Ravi 001; Ravi Sundaram; S. S. Ravi; Daniel J. Rosenkrantz; Harry B. Hunt III (J. Algorithms, 1998)

Using Data Flow Information to Obtain Efficient Check Sets for Algorithm-Based Fault Tolerance. - Ragini Narasimhan; Daniel J. Rosenkrantz; S. S. Ravi (Int. J. Parallel Program., 1999)

Path problems in networks with vector-valued edge weights. - Giri Kumar Tayi; Daniel J. Rosenkrantz; S. S. Ravi (Networks, 1999)

On Materializations of Array-Valued Temporaries. - Daniel J. Rosenkrantz; Lenore M. R. Mullin; Harry B. Hunt III (LCPC, 2000)

Algorithms for Path-Based Placement of Inspection Stations on Networks. - Daniel J. Rosenkrantz; Giri Kumar Tayi; S. S. Ravi (INFORMS J. Comput., 2000)

Facility Dispersion Problems Under Capacity and Cost Constraints. - Daniel J. Rosenkrantz; Giri Kumar Tayi; S. S. Ravi (J. Comb. Optim., 2000)

Alarm placement in systems with fault propagation. - K. B. Lakshmanan; Daniel J. Rosenkrantz; S. S. Ravi (Theor. Comput. Sci., 2000)

Gardens of Eden and Fixed Points in Sequential Dynamical Systems. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns; Predrag T. Tosic (DM-CCG, 2001)

Analysis Problems for Sequential Dynamical Systems and Communicating State Machines. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (MFCS, 2001)

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. - R. Ravi 001; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Harry B. Hunt III (Algorithmica, 2001)

Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times. - Daniel J. Rosenkrantz; Lin Yu; S. S. Ravi (Algorithmica, 2001)

Reminiscences on Influential Papers. - Kenneth A. Ross; Jiawei Han 001; Nick Koudas; Rajeev Rastogi; Daniel J. Rosenkrantz; Peter Scheuermann; Dan Suciu (SIGMOD Rec., 2001)

Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems. - Harry B. Hunt III; Madhav V. Marathe; Venkatesh Radhakrishnan; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (Inf. Comput., 2002)

Predecessor and Permutation Existence Problems for Sequential Dynamical Systems. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (DMCS, 2003)

JACM 1986-1990. - Daniel J. Rosenkrantz (J. ACM, 2003)

Reachability problems for sequential dynamical systems with threshold functions. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (Theor. Comput. Sci., 2003)

On lossy time decompositions of time stamped documents. - Parvathi Chundi; Daniel J. Rosenkrantz (CIKM, 2004)

Constructing Time Decompositions for Analyzing Time-Stamped Documents. - Parvathi Chundi; Daniel J. Rosenkrantz (SDM, 2004)

Local base station assignment with time intervals in mobile computing environments. - Giri Kumar Tayi; Daniel J. Rosenkrantz; S. S. Ravi (Eur. J. Oper. Res., 2004)

Efficient Algorithms for Constructing Time Decompositions of Time Stamped Documents. - Parvathi Chundi; Rui Zhang 004; Daniel J. Rosenkrantz (DEXA, 2005)

Structure-Based Resilience Metrics for Service-Oriented Networks. - Daniel J. Rosenkrantz; Sanjay Goel; S. S. Ravi; Jagdish Gangolly (EDCC, 2005)

In memory of Seymour Ginsburg 1928 - 2004. - Serge Abiteboul; Richard Hull 001; Victor Vianu; Sheila A. Greibach; Michael A. Harrison; Ellis Horowitz; Daniel J. Rosenkrantz; Jeffrey D. Ullman; Moshe Y. Vardi (SIGMOD Rec., 2005)

Towards a Predictive Computational Complexity Theory. - Harry B. Hunt III; Madhav V. Marathe; Daniel J. Rosenkrantz; Richard Edwin Stearns (Computational Complexity and Statistical Physics, 2006)

Information Preserving Time Decompositions of Time Stamped Documents*. - Parvathi Chundi; Daniel J. Rosenkrantz (Data Min. Knowl. Discov., 2006)

Complexity of reachability problems for finite discrete dynamical systems. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (J. Comput. Syst. Sci., 2006)

Obtaining online approximation algorithms for facility dispersion from offline algorithms. - Daniel J. Rosenkrantz; Giri Kumar Tayi; S. S. Ravi (Networks, 2006)

On minimizing materializations of array-valued temporaries. - Daniel J. Rosenkrantz; Lenore M. R. Mullin; Harry B. Hunt III (ACM Trans. Program. Lang. Syst., 2006)

Discovering Dynamic Developer Relationships from Software Version Histories by Time Series Segmentation. - Harvey P. Siy; Parvathi Chundi; Daniel J. Rosenkrantz; Mahadevan Subramaniam (ICSM, 2007)

Computational Aspects of Analyzing Social Network Dynamics. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns; Mayur Thakur (IJCAI, 2007)

Predecessor existence problems for finite discrete dynamical systems. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns; Mayur Thakur (Theor. Comput. Sci., 2007)

Approximation Algorithms for Facility Dispersion. - Daniel J. Rosenkrantz; S. S. Ravi; Giri Kumar Tayi (Handbook of Approximation Algorithms and Metaheuristics, 2007)

A Transformation–Based Approach for the Design of Parallel/Distributed Scientific Software: the FFT - Harry B. Hunt III; Lenore R. Mullin; Daniel J. Rosenkrantz; James E. Raynolds (CoRR, 2008)

Efficient algorithms for segmentation of item-set time series. - Parvathi Chundi; Daniel J. Rosenkrantz (Data Min. Knowl. Discov., 2008)

A segmentation-based approach for temporal analysis of software version repositories. - Harvey P. Siy; Parvathi Chundi; Daniel J. Rosenkrantz; Mahadevan Subramaniam (J. Softw. Maintenance Res. Pract., 2008)

Errata for the paper "Predecessor existence problems for finite discrete dynamical systems" [TCS 386 (1-2) (2007) 3-37]. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns; Mayur Thakur (Theor. Comput. Sci., 2008)

Resilience Metrics for Service-Oriented Networks: A Service Allocation Approach. - Daniel J. Rosenkrantz; Sanjay Goel; S. S. Ravi; Jagdish Gangolly (IEEE Trans. Serv. Comput., 2009)

Segmentation of Time Series Data. - Parvathi Chundi; Daniel J. Rosenkrantz (Encyclopedia of Data Warehousing and Mining, 2009)

Finding Critical Nodes for Inhibiting Diffusion of Complex Contagions in Social Networks. - Chris J. Kuhlman; V. S. Anil Kumar 001; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz (ECML/PKDD (2), 2010)

Inhibiting the Diffusion of Contagions in Bi-Threshold Systems: Analytical and Experimental Results. - Christopher James Kuhlman; V. S. Anil Kumar 001; Madhav V. Marathe; Samarth Swarup; Gaurav Tuli; S. S. Ravi; Daniel J. Rosenkrantz (AAAI Fall Symposium: Complex Adaptive Systems, 2011)

Effects of Opposition on the Diffusion of Complex Contagions in Social Networks: An Empirical Study. - Chris J. Kuhlman; V. S. Anil Kumar 001; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz (SBP, 2011)

A general-purpose graph dynamical system modeling framework. - Chris J. Kuhlman; V. S. Anil Kumar 001; Madhav V. Marathe; Henning S. Mortveit; Samarth Swarup; Gaurav Tuli; S. S. Ravi; Daniel J. Rosenkrantz (WSC, 2011)

Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems. - Christopher L. Barrett; Harry B. Hunt III; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (Theor. Comput. Sci., 2011)

Bayesian Inference in Treewidth-Bounded Graphical Models Without Indegree Constraints. - Daniel J. Rosenkrantz; Madhav V. Marathe; Ravi Sundaram; Anil Vullikanti (UAI, 2014)

Analysis Problems for Graphical Dynamical Systems: A Unified Approach Through Graph Predicates. - Daniel J. Rosenkrantz; Madhav V. Marathe; Harry B. Hunt III; S. S. Ravi; Richard Edwin Stearns (AAMAS, 2015)

Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems. - Abhijin Adiga; Chris J. Kuhlman; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (CIAA, 2015)

Inhibiting diffusion of complex contagions in social networks: theoretical and experimental results. - Chris J. Kuhlman; V. S. Anil Kumar 001; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz (Data Min. Knowl. Discov., 2015)

Inferring local transition functions of discrete dynamical systems from observations of system behavior. - Abhijin Adiga; Chris J. Kuhlman; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (Theor. Comput. Sci., 2017)

Approximation Algorithms for Facility Dispersion. - S. S. Ravi; Daniel J. Rosenkrantz; Giri Kumar Tayi (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

Learning the Behavior of a Dynamical System Via a "20 Questions" Approach. - Abhijin Adiga; Chris J. Kuhlman; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (AAAI, 2018)

Testing Phase Space Properties of Synchronous Dynamical Systems with Nested Canalyzing Local Functions. - Daniel J. Rosenkrantz; Madhav V. Marathe; S. S. Ravi; Richard Edwin Stearns (AAMAS, 2018)

Inferring Probabilistic Contagion Models Over Networks Using Active Queries. - Abhijin Adiga; Vanessa Cedeno-Mieles; Chris J. Kuhlman; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (CIKM, 2018)

Using Active Queries to Learn Local Stochastic Behaviors in Social Networks. - Abhijin Adiga; Chris J. Kuhlman; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (COMPLEX NETWORKS (2), 2018)

Computational Aspects of Fault Location and Resilience Problems for Interdependent Infrastructure Networks. - Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (COMPLEX NETWORKS (1), 2018)

A characterization of nested canalyzing functions with maximum average sensitivity. - Richard Edwin Stearns; Daniel J. Rosenkrantz; S. S. Ravi; Madhav V. Marathe (Discret. Appl. Math., 2018)

Validating Agent-Based Models of Large Networked Systems. - Abhijin Adiga; Samarth Swarup; Anil Vullikanti; Christopher L. Barrett; Stephen G. Eubank; Chris J. Kuhlman; Madhav V. Marathe; Henning S. Mortveit; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (WSC, 2019)

Symmetry Properties of Nested Canalyzing Functions. - Daniel J. Rosenkrantz; Madhav V. Marathe; S. S. Ravi; Richard Edwin Stearns (Discret. Math. Theor. Comput. Sci., 2019)

Bounds and Complexity Results for Learning Coalition-Based Interaction Functions in Networked Social Systems. - Abhijin Adiga; Chris J. Kuhlman; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns; Anil Vullikanti (AAAI, 2020)

Blocking the Propagation of Two Simultaneous Contagions over Networks. - Henry L. Carscadden; Chris J. Kuhlman; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz (COMPLEX NETWORKS (1), 2020)

Evolution of Similar Configurations in Graph Dynamical Systems. - Joshua D. Priest; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (COMPLEX NETWORKS (1), 2020)

Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems: Complexity, Special Case Algorithms and Heuristics. - Zirou Qiu; Chen Chen 022; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns; Anil Vullikanti (AAAI, 2022)

Efficiently Learning the Topology and Behavior of a Networked Dynamical System Via Active Queries. - Daniel J. Rosenkrantz; Abhijin Adiga; Madhav V. Marathe; Zirou Qiu; S. S. Ravi; Richard Edwin Stearns; Anil Vullikanti (ICML, 2022)

Using Active Queries to Infer Symmetric Node Functions of Graph Dynamical Systems. - Abhijin Adiga; Chris J. Kuhlman; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns (J. Mach. Learn. Res., 2022)

Techniques for blocking the propagation of two simultaneous contagions over networks using a graph dynamical systems framework. - Henry L. Carscadden; Chris J. Kuhlman; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz (Netw. Sci., 2022)

Fundamental limitations on efficiently forecasting certain epidemic measures in network models. - Daniel J. Rosenkrantz; Anil Vullikanti; S. S. Ravi; Richard Edwin Stearns; Simon A. Levin; H. Vincent Poor; Madhav V. Marathe (Proc. Natl. Acad. Sci. USA, 2022)

Networked Anti-coordination Games Meet Graphical Dynamical Systems: Equilibria and Convergence. - Zirou Qiu; Chen Chen 022; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns; Anil Vullikanti (AAAI, 2023)

Resource Sharing through Multi-Round Matchings. - Yohai Trabelsi; Abhijin Adiga; Sarit Kraus; S. S. Ravi; Daniel J. Rosenkrantz (AAAI, 2023)

Assigning Agents to Increase Network-Based Neighborhood Diversity. - Zirou Qiu; Andrew Yuan; Chen Chen 022; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns; Anil Vullikanti (AAMAS, 2023)

Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems. - Zirou Qiu; Chen Chen 022; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns; Anil Vullikanti (CoRR, 2023)

Learning the Topology and Behavior of Discrete Dynamical Systems. - Zirou Qiu; Abhijin Adiga; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns; Anil Vullikanti (AAAI, 2024)

Efficient PAC Learnability of Dynamical Systems Over Multilayer Networks. - Zirou Qiu; Abhijin Adiga; Madhav V. Marathe; S. S. Ravi; Daniel J. Rosenkrantz; Richard Edwin Stearns; Anil Kumar S. Vullikanti (ICML, 2024)

Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms. - Daniel J. Rosenkrantz; Madhav V. Marathe; S. S. Ravi; Richard Edwin Stearns (ACM Trans. Comput. Theory, 2024)

On Some Fundamental Problems for Multi-Agent Systems Over Multilayer Networks. - Daniel J. Rosenkrantz; Madhav V. Marathe; Zirou Qiu; S. S. Ravi; Richard Edwin Stearns (AAMAS, 2025)

Theoretical foundations for parent divorcing transformations in Bayesian networks. - Daniel J. Rosenkrantz; Madhav V. Marathe; Zirou Qiu; S. S. Ravi (Theor. Comput. Sci., 2025)