Richard Edwin Stearns

Publication Activity (10 Years)

Years Active: 1961-2024
Publications (10 Years): 25

Top Venues

CoRR

AAAI

AAMAS

COMPLEX NETWORKS (1)

Publications

Zirou Qiu, Abhijin Adiga, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti
Learning the Topology and Behavior of Discrete Dynamical Systems. CoRR (2024)
Zirou Qiu, Abhijin Adiga, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti
Efficient PAC Learnability of Dynamical Systems Over Multilayer Networks. CoRR (2024)
Zirou Qiu, Abhijin Adiga, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti
Learning the Topology and Behavior of Discrete Dynamical Systems. AAAI (2024)
Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti
Networked Anti-coordination Games Meet Graphical Dynamical Systems: Equilibria and Convergence. AAAI (2023)
Zirou Qiu, Andrew Yuan, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti
Assigning Agents to Increase Network-Based Neighborhood Diversity. CoRR (2023)
Zirou Qiu, Andrew Yuan, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti
Assigning Agents to Increase Network-Based Neighborhood Diversity. AAMAS (2023)
Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti
Networked Anti-Coordination Games Meet Graphical Dynamical Systems: Equilibria and Convergence. CoRR (2023)
Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti
Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems. CoRR (2023)
Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti
Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems: Complexity, Special Case Algorithms and Heuristics. AAAI (2022)
Daniel J. Rosenkrantz, Anil Vullikanti, S. S. Ravi, Richard Edwin Stearns, Simon A. Levin, H. Vincent Poor, Madhav V. Marathe
Fundamental limitations on efficiently forecasting certain epidemic measures in network models. Proc. Natl. Acad. Sci. USA 119 (4) (2022)
Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
Using Active Queries to Infer Symmetric Node Functions of Graph Dynamical Systems. J. Mach. Learn. Res. 23 (2022)
Daniel J. Rosenkrantz, Abhijin Adiga, Madhav V. Marathe, Zirou Qiu, S. S. Ravi, Richard Edwin Stearns, Anil Vullikanti
Efficiently Learning the Topology and Behavior of a Networked Dynamical System Via Active Queries. ICML (2022)
Daniel J. Rosenkrantz, Madhav Marathe, S. S. Ravi, Richard Edwin Stearns
Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and Algorithms. AAAI (2021)
Joshua D. Priest, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
Evolution of Similar Configurations in Graph Dynamical Systems. COMPLEX NETWORKS (1) (2020)
Abhijin Adiga, Chris J. Kuhlman, Madhav Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti
Bounds and Complexity Results for Learning Coalition-Based Interaction Functions in Networked Social Systems. AAAI (2020)
Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns
Symmetry Properties of Nested Canalyzing Functions. Discret. Math. Theor. Comput. Sci. 21 (4) (2019)
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
Validating Agent-Based Models of Large Networked Systems. WSC (2019)
Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns
Symmetry Properties of Nested Canalyzing Functions. CoRR (2019)
Richard Edwin Stearns, Daniel J. Rosenkrantz, S. S. Ravi, Madhav V. Marathe
A characterization of nested canalyzing functions with maximum average sensitivity. Discret. Appl. Math. 251 (2018)
Abhijin Adiga, Vanessa Cedeno-Mieles, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
Inferring Probabilistic Contagion Models Over Networks Using Active Queries. CIKM (2018)
Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns
Testing Phase Space Properties of Synchronous Dynamical Systems with Nested Canalyzing Local Functions. AAMAS (2018)
Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
Computational Aspects of Fault Location and Resilience Problems for Interdependent Infrastructure Networks. COMPLEX NETWORKS (1) (2018)
Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
Using Active Queries to Learn Local Stochastic Behaviors in Social Networks. COMPLEX NETWORKS (2) (2018)
Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
Learning the Behavior of a Dynamical System Via a "20 Questions" Approach. AAAI (2018)
Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
Inferring local transition functions of discrete dynamical systems from observations of system behavior. Theor. Comput. Sci. 679 (2017)
Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems. CIAA (2015)
Daniel J. Rosenkrantz, Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi, Richard Edwin Stearns
Analysis Problems for Graphical Dynamical Systems: A Unified Approach Through Graph Predicates. AAMAS (2015)
Philip M. Lewis, Daniel J. Rosenkrantz, Richard Edwin Stearns
Attributed Translations. Fundamental Problems in Computing (2013)
Richard Edwin Stearns, Harry B. Hunt III
Sums-of-Products and Subproblem Independence. Fundamental Problems in Computing (2013)
Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis
System Level Concurrency Control for Distributed Database Systems. Fundamental Problems in Computing (2013)
Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis
An analysis of several heuristics for the traveling salesman problem. Fundamental Problems in Computing (2013)
Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis
Consistency and serializability in concurrent database systems. Fundamental Problems in Computing (2013)
Juris Hartmanis, Stephen Cook, William Kahan, Richard Edwin Stearns, Andrew C. Yao
The Turing Computational Model. ACM-TURING (2012)
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems. Theor. Comput. Sci. 412 (30) (2011)
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur
Errata for the paper "Predecessor existence problems for finite discrete dynamical systems" [TCS 386 (1-2) (2007) 3-37]. Theor. Comput. Sci. 395 (1) (2008)
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur
Predecessor existence problems for finite discrete dynamical systems. Theor. Comput. Sci. 386 (1-2) (2007)
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Mayur Thakur
Computational Aspects of Analyzing Social Network Dynamics. IJCAI (2007)
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
Complexity of reachability problems for finite discrete dynamical systems. J. Comput. Syst. Sci. 72 (8) (2006)
Richard Edwin Stearns, Harry B. Hunt III
Resource Bounds and Subproblem Independence. Theory Comput. Syst. 38 (6) (2005)
Thomas C. O'Connell, Richard Edwin Stearns
Mechanism design for software agents with complete information. Decis. Support Syst. 39 (2) (2005)
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
Reachability problems for sequential dynamical systems with threshold functions. Theor. Comput. Sci. 295 (2003)
Thomas C. O'Connell, Richard Edwin Stearns
On finite strategy sets for finitely repeated zero-sum games. Games Econ. Behav. 43 (1) (2003)
Richard Edwin Stearns
Deterministic versus nondeterministic time and lower bound problems. J. ACM 50 (1) (2003)
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
Predecessor and Permutation Existence Problems for Sequential Dynamical Systems. DMCS (2003)
Richard Edwin Stearns, Harry B. Hunt III
Exploiting structure in quantified formulas. J. Algorithms 43 (2) (2002)
Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization Problems. Inf. Comput. 173 (1) (2002)
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Predrag T. Tosic
Gardens of Eden and Fixed Points in Sequential Dynamical Systems. DM-CCG (2001)
Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
Analysis Problems for Sequential Dynamical Systems and Communicating State Machines. MFCS (2001)
Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns
Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems. Electron. Notes Discret. Math. 9 (2001)
Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns
Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures. ISSAC (2001)
Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. J. Algorithms 26 (2) (1998)
Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns
The Complexity of Planar Counting Problems. SIAM J. Comput. 27 (4) (1998)
Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems CoRR (1998)
Madhav V. Marathe, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns
Theory of Periodically Specified Problems: Complexity and Approximability. Computational Complexity Conference (1998)
Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems. SIAM J. Comput. 27 (5) (1998)
Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard Edwin Stearns
The Complexity of Planar Counting Problems CoRR (1998)
Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz, S. S. Ravi, Richard Edwin Stearns
I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract). PODC (1996)
Sandeep K. Shukla, Daniel J. Rosenkrantz, Harry B. Hunt III, Richard Edwin Stearns
The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approach. Satisfiability Problem: Theory and Applications (1996)
Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns
On the Complexity of Relational Problems for Finite State Processes (Extended Abstract). ICALP (1996)
Richard Edwin Stearns, Harry B. Hunt III
An Algebraic Model for Combinatorial Problems. SIAM J. Comput. 25 (2) (1996)
Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results. Satisfiability Problem: Theory and Applications (1996)
George Becker, Neil V. Murray, Richard Edwin Stearns
Refined Single-Threading for Parallel Functional Programming. LCR (1995)
Richard Edwin Stearns
Turing Award Lecture: It's Time to Reconsider Time. Commun. ACM 37 (11) (1994)
Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns
Generalized CNF Satisfiability Problems and Non-Efficient. Computational Complexity Conference (1994)
Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
Approximation Schemes Using L-Reductions. FSTTCS (1994)
Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns
A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. ESA (1994)
Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version). STOC (1994)
Venkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns
Efficient Algorithms for Solving Systems of Linear Equations and Path Problems. STACS (1992)
Harry B. Hunt III, Richard Edwin Stearns
The Complexity of Very Simple Boolean Formulas with Applications. SIAM J. Comput. 19 (1) (1990)
Richard Edwin Stearns, Harry B. Hunt III
Power Indices and Easier Hard Problems. Math. Syst. Theory 23 (4) (1990)
Harry B. Hunt III, Richard Edwin Stearns
The Complexity of Equivalence for Commutative Rings. J. Symb. Comput. 10 (5) (1990)
Harry B. Hunt III, Richard Edwin Stearns
On the Complexity of Satisfiability Problems for Algebraic Structures (Preliminary Report). AAECC (1988)
Richard Edwin Stearns
Juris Hartmanis: the beginnings of computational complexity. Computational Complexity Conference (1988)
Harry B. Hunt III, Richard Edwin Stearns
Nonlinear Algebra and Optimization on Rings are "Hard". SIAM J. Comput. 16 (5) (1987)
Harry B. Hunt III, Richard Edwin Stearns
Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report). STACS (1986)
Richard Edwin Stearns, Harry B. Hunt III
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata. SIAM J. Comput. 14 (3) (1985)
Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II
Consistency and Serializability in Concurrent Database Systems. SIAM J. Comput. 13 (3) (1984)
Richard Edwin Stearns, Harry B. Hunt III
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and Automata FOCS (1981)
Richard Edwin Stearns, Daniel J. Rosenkrantz
Distributed Database Concurrency Controls Using Before-Values. SIGMOD Conference (1981)
Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II
System Level Concurrency Control for Distributed Database Systems. ACM Trans. Database Syst. 3 (2) (1978)
Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II
An Analysis of Several Heuristics for the Traveling Salesman Problem. SIAM J. Comput. 6 (3) (1977)
Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II
A System Level Concurrency Control for Distributed Database Systems. Berkeley Workshop (1977)
Richard Edwin Stearns, Philip M. Lewis II, Daniel J. Rosenkrantz
Concurrency Control for Database Systems FOCS (1976)
Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II
Approximate Algorithms for the Traveling Salesperson Problem SWAT (1974)
Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns
Attributed Translations. J. Comput. Syst. Sci. 9 (3) (1974)
Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns
Attributed Translations STOC (1973)
Daniel J. Rosenkrantz, Richard Edwin Stearns
Properties of Deterministic Top-Down Grammars Inf. Control. 17 (3) (1970)
Daniel J. Rosenkrantz, Richard Edwin Stearns
Properties of Deterministic Top Down Grammars STOC (1969)
Richard Edwin Stearns, Daniel J. Rosenkrantz
Table Machine Simulation SWAT (1969)
Juris Hartmanis, Richard Edwin Stearns
Automata-based computational complexity. Inf. Sci. 1 (2) (1969)
Richard Edwin Stearns, Philip M. Lewis II
Property Grammars and Table Machines Inf. Control. 14 (6) (1969)
Richard Edwin Stearns, Philip M. Lewis II
Property Grammars and Table Machines SWAT (1968)
Philip M. Lewis II, Richard Edwin Stearns
Syntax-Directed Transduction. J. ACM 15 (3) (1968)
Richard Edwin Stearns
A Regularity Test for Pushdown Machines Inf. Control. 11 (3) (1967)
F. C. Hennie, Richard Edwin Stearns
Two-Tape Simulation of Multitape Turing Machines. J. ACM 13 (4) (1966)
Philip M. Lewis II, Richard Edwin Stearns
Syntax Directed Transduction SWAT (1966)
Richard Edwin Stearns, Juris Hartmanis, Philip M. Lewis II
Hierarchies of memory limited computations SWCT (1965)
Philip M. Lewis II, Richard Edwin Stearns, Juris Hartmanis
Memory bounds for recognition of context-free and context-sensitive languages SWCT (1965)
Juris Hartmanis, Richard Edwin Stearns
Pair Algebra and Its Application to Automata Theory Inf. Control. 7 (4) (1964)
Richard Edwin Stearns, Juris Hartmanis
On the application of pair algebra to automata theory SWCT (1964)

Richard Edwin Stearns.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Richard Edwin Stearns