Richard E. Stearns

From MaRDI portal
Person:549708

Available identifiers

zbMath Open stearns.richard-eWikidataQ92822 ScholiaQ92822MaRDI QIDQ549708

List of research outcomes

PublicationDate of PublicationType
Efficient algorithms for solving systems of linear equations and path problems2022-08-18Paper
https://portal.mardi4nfdi.de/entity/Q51154652020-08-13Paper
A characterization of nested canalyzing functions with maximum average sensitivity2018-12-03Paper
Inferring local transition functions of discrete dynamical systems from observations of system behavior2017-06-19Paper
Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures2017-02-03Paper
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)2016-09-01Paper
Deterministic versus nondeterministic time and lower bound problems2015-12-07Paper
Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems2015-09-23Paper
Properties of deterministic top down grammars2014-03-14Paper
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems2011-07-18Paper
Sums-of-Products and Subproblem Independence2009-08-05Paper
https://portal.mardi4nfdi.de/entity/Q35971592009-02-09Paper
Errata for the paper ``Predecessor existence problems for finite discrete dynamical systems.2008-05-19Paper
Predecessor existence problems for finite discrete dynamical systems2007-10-25Paper
Complexity of reachability problems for finite discrete dynamical systems2006-12-07Paper
Resource bounds and subproblem independence2006-01-10Paper
https://portal.mardi4nfdi.de/entity/Q31589882005-02-01Paper
https://portal.mardi4nfdi.de/entity/Q48188582004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q44705172004-07-01Paper
On some special classes of sequential dynamical systems2004-03-11Paper
https://portal.mardi4nfdi.de/entity/Q44510172004-02-22Paper
Reachability problems for sequential dynamical systems with threshold functions.2003-08-17Paper
On finite strategy sets for finitely repeated zero-sum games.2003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q47854592003-03-10Paper
Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.2003-01-14Paper
Exploiting structure in quantified formulas2002-09-30Paper
https://portal.mardi4nfdi.de/entity/Q43311972002-06-10Paper
https://portal.mardi4nfdi.de/entity/Q27415272001-09-24Paper
https://portal.mardi4nfdi.de/entity/Q27439722001-09-18Paper
https://portal.mardi4nfdi.de/entity/Q45271942001-09-06Paper
https://portal.mardi4nfdi.de/entity/Q42585761999-09-13Paper
The Complexity of Planar Counting Problems1998-09-20Paper
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems1998-09-20Paper
https://portal.mardi4nfdi.de/entity/Q43757751998-07-13Paper
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs1998-04-26Paper
https://portal.mardi4nfdi.de/entity/Q43757601998-03-02Paper
An Algebraic Model for Combinatorial Problems1996-08-18Paper
The complexity of equivalence for commutative rings1990-01-01Paper
The Complexity of Very Simple Boolean Formulas with Applications1990-01-01Paper
Power indices and easier hard problems1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47293501989-01-01Paper
Nonlinear Algebra and Optimization on Rings are “Hard”1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37427141986-01-01Paper
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata1985-01-01Paper
Consistency and Serializability in Concurrent Database Systems1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39159931979-01-01Paper
An Analysis of Several Heuristics for the Traveling Salesman Problem1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41227301976-01-01Paper
Attributed translations1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40626691973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56394891971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51804131970-01-01Paper
Properties of deterministic top-down grammars1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56281111970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56368621970-01-01Paper
Property grammars and table machines1969-01-01Paper
Syntax-Directed Transduction1968-01-01Paper
Convergent Transfer Schemes for N-Person Games1968-01-01Paper
Sets of Numbers Defined by Finite Automata1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55362821967-01-01Paper
A regularity test for pushdown machines1967-01-01Paper
Two-Tape Simulation of Multitape Turing Machines1966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55354141966-01-01Paper
On the Computational Complexity of Algorithms1965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56018281965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53310391964-01-01Paper
Pair algebra and its application to automata theory1964-01-01Paper
On the Axioms for a Cooperative Game Without Side Payments1964-01-01Paper
Pair algebra and its application to automata theory1964-01-01Paper
Regularity preserving modifications of regular expressions1963-01-01Paper
A Study of Feedback and Errors in Sequential Machines1963-01-01Paper
Some dangers in state reduction of sequential machines1962-01-01Paper
The Voting Problem1959-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Richard E. Stearns