On the State Assignment Problem for Sequential Machines II. - Richard Edwin Stearns; Juris Hartmanis (IRE Trans. Electron. Comput., 1961)

Some Dangers in State Reduction of Sequential Machines - Juris Hartmanis; Richard Edwin Stearns (Inf. Control., 1962)

A Study of Feedback and Errors in Sequential Machines. - Juris Hartmanis; Richard Edwin Stearns (IEEE Trans. Electron. Comput., 1963)

Regularity Preserving Modifications of Regular Expressions - Richard Edwin Stearns; Juris Hartmanis (Inf. Control., 1963)

Computational complexity of recursive sequences - Juris Hartmanis; Richard Edwin Stearns (SWCT, 1964)

On the application of pair algebra to automata theory - Richard Edwin Stearns; Juris Hartmanis (SWCT, 1964)

Pair Algebra and Its Application to Automata Theory - Juris Hartmanis; Richard Edwin Stearns (Inf. Control., 1964)

Memory bounds for recognition of context-free and context-sensitive languages - Philip M. Lewis II; Richard Edwin Stearns; Juris Hartmanis (SWCT, 1965)

Hierarchies of memory limited computations - Richard Edwin Stearns; Juris Hartmanis; Philip M. Lewis II (SWCT, 1965)

Two-Tape Simulation of Multitape Turing Machines. - F. C. Hennie; Richard Edwin Stearns (J. ACM, 1966)

A Regularity Test for Pushdown Machines - Richard Edwin Stearns (Inf. Control., 1967)

Syntax-Directed Transduction. - Philip M. Lewis II; Richard Edwin Stearns (J. ACM, 1968)

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

Automata-based computational complexity. - Juris Hartmanis; Richard Edwin Stearns (Inf. Sci., 1969)

Property Grammars and Table Machines - Richard Edwin Stearns; Philip M. Lewis II (Inf. Control., 1969)

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)

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

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

On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and Automata - Richard Edwin Stearns; Harry B. Hunt III (FOCS, 1981)

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

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

On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata. - Richard Edwin Stearns; Harry B. Hunt III (SIAM J. Comput., 1985)

Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report). - Harry B. Hunt III; Richard Edwin Stearns (STACS, 1986)

Nonlinear Algebra and Optimization on Rings are "Hard". - Harry B. Hunt III; Richard Edwin Stearns (SIAM J. Comput., 1987)

On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report). - Harry B. Hunt III; Richard Edwin Stearns (AAECC, 1988)

Juris Hartmanis: the beginnings of computational complexity. - Richard Edwin Stearns (SCT, 1988)

The Complexity of Equivalence for Commutative Rings. - Harry B. Hunt III; Richard Edwin Stearns (J. Symb. Comput., 1990)

Power Indices and Easier Hard Problems. - Richard Edwin Stearns; Harry B. Hunt III (Math. Syst. Theory, 1990)

The Complexity of Very Simple Boolean Formulas with Applications. - Harry B. Hunt III; Richard Edwin Stearns (SIAM J. Comput., 1990)

Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. - Venkatesh Radhakrishnan; Harry B. Hunt III; Richard Edwin Stearns (STACS, 1992)

Generalized CNF Satisfiability Problems and Non-Efficient. - Harry B. Hunt III; Madhav V. Marathe; Richard Edwin Stearns (SCT, 1994)

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)

Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). - Madhav V. Marathe; Harry B. Hunt III; Richard Edwin Stearns; Venkatesh Radhakrishnan (STOC, 1994)

Turing Award Lecture: It's Time to Reconsider Time. - Richard Edwin Stearns (Commun. ACM, 1994)

Refined Single-Threading for Parallel Functional Programming. - George Becker; Neil V. Murray; Richard Edwin Stearns (LCR, 1995)

Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results. - Madhav V. Marathe; Harry B. Hunt III; Richard Edwin Stearns; Venkatesh Radhakrishnan (Satisfiability Problem: Theory and Applications, 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)

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)

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)

An Algebraic Model for Combinatorial Problems. - Richard Edwin Stearns; Harry B. Hunt III (SIAM J. Comput., 1996)

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)

The Complexity of Planar Counting Problems. - Harry B. Hunt III; Madhav V. Marathe; Venkatesh Radhakrishnan; Richard Edwin Stearns (SIAM J. Comput., 1998)

Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. - Madhav V. Marathe; Harry B. Hunt III; Richard Edwin Stearns; Venkatesh Radhakrishnan (SIAM J. Comput., 1998)

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)

Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures. - Harry B. Hunt III; Madhav V. Marathe; Richard Edwin Stearns (ISSAC, 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)

Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems. - Harry B. Hunt III; Madhav V. Marathe; Richard Edwin Stearns (Electron. Notes Discret. Math., 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)

Exploiting structure in quantified formulas. - Richard Edwin Stearns; Harry B. Hunt III (J. Algorithms, 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)

On finite strategy sets for finitely repeated zero-sum games. - Thomas C. O'Connell; Richard Edwin Stearns (Games Econ. Behav., 2003)

Deterministic versus nondeterministic time and lower bound problems. - Richard Edwin Stearns (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)

Mechanism design for software agents with complete information. - Thomas C. O'Connell; Richard Edwin Stearns (Decis. Support Syst., 2005)

Resource Bounds and Subproblem Independence. - Richard Edwin Stearns; Harry B. Hunt III (Theory Comput. Syst., 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)

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)

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)

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)

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)

The Turing Computational Model. - Juris Hartmanis; Stephen Cook; William Kahan; Richard Edwin Stearns; Andrew C. Yao (ACM-TURING, 2012)

Sums-of-Products and Subproblem Independence. - Richard Edwin Stearns; Harry B. Hunt III (Fundamental Problems in Computing, 2013)

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)

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)

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)

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)

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)

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)

Pumping Lemmas Can be "Harmful". - Jingnan Xie; Harry B. Hunt III; Richard Edwin Stearns (Theory Comput. Syst., 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)

On the computational and descriptional complexity of multi-pattern languages. - Jingnan Xie; Harry B. Hunt III; Richard Edwin Stearns (Theor. Comput. Sci., 2025)