Richard Edwin Stearns - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 98 from 98

2024

Learning the Topology and Behavior of Discrete Dynamical SystemsZirou Qiu, Abhijin Adiga, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti. AAAI 2024: 14722-14730 [doi]

2023

2022

Using Active Queries to Infer Symmetric Node Functions of Graph Dynamical SystemsAbhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. jmlr, 23, 2022. [doi]

Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems: Complexity, Special Case Algorithms and HeuristicsZirou Qiu, Chen Chen, Madhav Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti. AAAI 2022: 9422-9430 [doi]

Efficiently Learning the Topology and Behavior of a Networked Dynamical System Via Active QueriesDaniel J. Rosenkrantz, Abhijin Adiga, Madhav Marathe, Zirou Qiu, S. S. Ravi, Richard Edwin Stearns, Anil Vullikanti. icml 2022: 18796-18808 [doi]

Fundamental limitations on efficiently forecasting certain epidemic measures in network modelsDaniel J. Rosenkrantz, Anil Vullikanti, S. S. Ravi, Richard Edwin Stearns, Simon A. Levin, H. Vincent Poor, Madhav V. Marathe. pnas, 119(4), 2022. [doi]

2021

Synchronous Dynamical Systems on Directed Acyclic Graphs: Complexity and AlgorithmsDaniel J. Rosenkrantz, Madhav Marathe, S. S. Ravi, Richard Edwin Stearns. AAAI 2021: 11334-11342 [doi]

2020

Bounds and Complexity Results for Learning Coalition-Based Interaction Functions in Networked Social SystemsAbhijin Adiga, Chris J. Kuhlman, Madhav Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Anil Vullikanti. AAAI 2020: 3138-3145 [doi]

Evolution of Similar Configurations in Graph Dynamical SystemsJoshua D. Priest, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. complexnetworks 2021: 544-555 [doi]

2019

2018

Inferring Probabilistic Contagion Models Over Networks Using Active QueriesAbhijin Adiga, Vanessa Cedeno-Mieles, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. CIKM 2018: 377-386 [doi]

Learning the Behavior of a Dynamical System Via a "20 Questions" ApproachAbhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. AAAI 2018: 4630-4637 [doi]

Using Active Queries to Learn Local Stochastic Behaviors in Social NetworksAbhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. complexnetworks 2019: 246-257 [doi]

Computational Aspects of Fault Location and Resilience Problems for Interdependent Infrastructure NetworksMadhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. complexnetworks 2019: 879-890 [doi]

Testing Phase Space Properties of Synchronous Dynamical Systems with Nested Canalyzing Local FunctionsDaniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns. atal 2018: 1585-1594 [doi]

A characterization of nested canalyzing functions with maximum average sensitivityRichard Edwin Stearns, Daniel J. Rosenkrantz, S. S. Ravi, Madhav V. Marathe. DAM, 251:5-14, 2018. [doi]

2017

Inferring local transition functions of discrete dynamical systems from observations of system behaviorAbhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. TCS, 679:126-144, 2017. [doi]

2015

Complexity of Inferring Local Transition Functions of Discrete Dynamical SystemsAbhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. wia 2015: 21-34 [doi]

Analysis Problems for Graphical Dynamical Systems: A Unified Approach Through Graph PredicatesDaniel J. Rosenkrantz, Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi, Richard Edwin Stearns. atal 2015: 1501-1509 [doi]

2013

2012

The Turing Computational ModelJuris Hartmanis, Stephen Cook, William Kahan, Richard Edwin Stearns, Andrew C. Yao. acm 2012: [doi]

2011

Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systemsChristopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. TCS, 412(30):3932-3946, 2011. [doi]

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. TCS, 395(1):132-133, 2008. [doi]

2007

2006

Complexity of reachability problems for finite discrete dynamical systemsChristopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. jcss, 72(8):1317-1345, 2006. [doi]

Towards a Predictive Computational Complexity TheoryHarry B. Hunt III, Madhav V. Marathe, Daniel J. Rosenkrantz, Richard Edwin Stearns. In Allon G. Percus, Gabriel Istrate, Cristopher Moore, editors, Computational Complexity and Statistical Physics. Studies in the sciences of complexity, pages 285, Oxford University Press, 2006.

2005

Mechanism design for software agents with complete informationThomas C. O Connell, Richard Edwin Stearns. dss, 39(2):197-217, 2005. [doi]

Resource Bounds and Subproblem IndependenceRichard Edwin Stearns, Harry B. Hunt III. mst, 38(6):731-761, 2005. [doi]

2003

2002

Parallel Approximation Schemes for a Class of Planar and Near Planar Combinatorial Optimization ProblemsHarry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. iandc, 173(1):40-63, 2002. [doi]

Exploiting structure in quantified formulasRichard Edwin Stearns, Harry B. Hunt III. jal, 43(2):220-263, 2002. [doi]

2001

Gardens of Eden and Fixed Points in Sequential Dynamical SystemsChristopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns, Predrag T. Tosic. dmccg 2001: 95-110 [doi]

Analysis Problems for Sequential Dynamical Systems and Communicating State MachinesChristopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. mfcs 2001: 159-172 [doi]

Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structuresHarry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns. issac 2001: 183-191 [doi]

Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction ProblemsHarry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns. endm, 9:217-230, 2001. [doi]

1998

1996

Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness resultsMadhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan. dimacs 1997: 225-260

The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approachSandeep K. Shukla, Daniel J. Rosenkrantz, Harry B. Hunt III, Richard Edwin Stearns. dimacs 1997: 603-642

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: 466-477

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: 122

An Algebraic Model for Combinatorial ProblemsRichard Edwin Stearns, Harry B. Hunt III. SICOMP, 25(2):448-476, 1996.

1995

Refined Single-Threading for Parallel Functional ProgrammingGeorge Becker, Neil V. Murray, Richard Edwin Stearns. lcr 1996: 321-324 [doi]

1994

Approximation Schemes Using L-ReductionsHarry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. fsttcs 1994: 342-353

A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric GraphsHarry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. esa 1994: 424-435

Generalized CNF Satisfiability Problems and Non-EfficientHarry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns. cocoon 1994: 356-366

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: 468-477 [doi]

Turing Award Lecture: It s Time to Reconsider TimeRichard Edwin Stearns. CACM, 37(11):95-99, 1994.

1992

Efficient Algorithms for Solving Systems of Linear Equations and Path ProblemsVenkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns. STACS 1992: 109-119

1990

The Complexity of Very Simple Boolean Formulas with ApplicationsHarry B. Hunt III, Richard Edwin Stearns. SICOMP, 19(1):44-70, 1990.

The Complexity of Equivalence for Commutative RingsHarry B. Hunt III, Richard Edwin Stearns. JSC, 10(5):411-436, 1990.

Power Indices and Easier Hard ProblemsRichard Edwin Stearns, Harry B. Hunt III. mst, 23(4):209-225, 1990.

1988

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

Juris Hartmanis: the beginnings of computational complexityRichard Edwin Stearns. coco 1988: 128-134 [doi]

1987

Nonlinear Algebra and Optimization on Rings are Hard Harry B. Hunt III, Richard Edwin Stearns. SICOMP, 16(5):910-929, 1987.

1986

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: 277-290

1985

On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite AutomataRichard Edwin Stearns, Harry B. Hunt III. SICOMP, 14(3):598-611, 1985.

1984

Consistency and Serializability in Concurrent Database SystemsDaniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II. SICOMP, 13(3):508-530, 1984.

1981

Distributed Database Concurrency Controls Using Before-ValuesRichard Edwin Stearns, Daniel J. Rosenkrantz. SIGMOD 1981: 74-83 [doi]

On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Grammars, and AutomataRichard Edwin Stearns, Harry B. Hunt III. focs 1981: 74-81

1978

System Level Concurrency Control for Distributed Database SystemsDaniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II. TODS, 3(2):178-198, 1978. [doi]

1977

A System Level Concurrency Control for Distributed Database SystemsDaniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II. berkeley 1977: 132-145

An Analysis of Several Heuristics for the Traveling Salesman ProblemDaniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II. SICOMP, 6(3):563-581, 1977.

1976

Concurrency Control for Database SystemsRichard Edwin Stearns, Philip M. Lewis II, Daniel J. Rosenkrantz. focs 1976: 19-32

1974

Attributed TranslationsPhilip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns. jcss, 9(3):279-307, 1974.

Approximate Algorithms for the Traveling Salesperson ProblemDaniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II. focs 1974: 33-42

1973

Attributed TranslationsPhilip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns. stoc 1973: 160-171

1970

Properties of Deterministic Top-Down GrammarsDaniel J. Rosenkrantz, Richard Edwin Stearns. iandc, 17(3):226-256, October 1970.

1969

Automata-based computational complexityJuris Hartmanis, Richard Edwin Stearns. isci, 1(2):173-184, 1969. [doi]

Properties of Deterministic Top Down GrammarsDaniel J. Rosenkrantz, Richard Edwin Stearns. stoc 1969: 165-180

Table Machine SimulationRichard Edwin Stearns, Daniel J. Rosenkrantz. focs 1969: 118-128

Property Grammars and Table MachinesRichard Edwin Stearns, Philip M. Lewis II. iandc, 14(6):524-549, June 1969.

1968

Syntax-Directed TransductionPhilip M. Lewis II, Richard Edwin Stearns. JACM, 15(3):465-488, 1968. [doi]

Property Grammars and Table MachinesRichard Edwin Stearns, Philip M. Lewis II. focs 1968: 106-119

1967

A Regularity Test for Pushdown MachinesRichard Edwin Stearns. iandc, 11(3):323-340, September 1967.

1966

Two-Tape Simulation of Multitape Turing MachinesF. C. Hennie, Richard Edwin Stearns. JACM, 13(4):533-546, 1966. [doi]

Syntax Directed TransductionPhilip M. Lewis II, Richard Edwin Stearns. focs 1966: 21-35

1965

Memory bounds for recognition of context-free and context-sensitive languagesPhilip M. Lewis II, Richard Edwin Stearns, Juris Hartmanis. focs 1965: 191-202

Hierarchies of memory limited computationsRichard Edwin Stearns, Juris Hartmanis, Philip M. Lewis II. focs 1965: 179-190

1964

Computational complexity of recursive sequencesJuris Hartmanis, Richard Edwin Stearns. focs 1964: 82-90

Pair Algebra and Its Application to Automata TheoryJuris Hartmanis, Richard Edwin Stearns. iandc, 7(4):485-507, December 1964.

On the application of pair algebra to automata theoryRichard Edwin Stearns, Juris Hartmanis. focs 1964: 192-196

1963

A Study of Feedback and Errors in Sequential MachinesJuris Hartmanis, Richard Edwin Stearns. TC, 12(3):223-232, 1963. [doi]

Regularity Preserving Modifications of Regular ExpressionsRichard Edwin Stearns, Juris Hartmanis. iandc, 6(1):55-69, March 1963.

1962

Some Dangers in State Reduction of Sequential MachinesJuris Hartmanis, Richard Edwin Stearns. iandc, 5(3):252-260, September 1962.

1961

On the State Assignment Problem for Sequential Machines IIRichard Edwin Stearns, Juris Hartmanis. TC, 10(4):593-603, 1961. [doi]

Sign in or sign up to see more results.

runs on WebDSL