( en | de | ru )

 

Disambiguation of "Stearns, Richard Edwin"

Author of the publication

copydeleteadd this publication to your clipboard
Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results.

, , , and . Satisfiability Problem: Theory and Applications, volume 35 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 225-259. DIMACS/AMS, (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Joseph Edwin

Barbara Stearns-Bläsing

Edwin Schulz

Edwin Kemper

Edwin Koch

 

Other publications of authors with the same name

I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract)., , , , and . PODC, page 122. ACM, (1996)Inferring Probabilistic Contagion Models Over Networks Using Active Queries., , , , , , and . CIKM, page 377-386. ACM, (2018)Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report)., and . STACS, volume 210 of Lecture Notes in Computer Science, page 277-290. Springer, (1986)Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems., , , , , and . CIAA, volume 9223 of Lecture Notes in Computer Science, page 21-34. Springer, (2015)Reachability problems for sequential dynamical systems with threshold functions., , , , , and . Theor. Comput. Sci., (2003)On the State Assignment Problem for Sequential Machines II., and . IRE Trans. Electron. Comput., 10 (4): 593-603 (1961)A System Level Concurrency Control for Distributed Database Systems., , and . Berkeley Workshop, page 132-145. Technical Information Department, Lawrence Berkeley Laboratory, University of California, Berkeley CA, (1977)On finite strategy sets for finitely repeated zero-sum games., and . Games Econ. Behav., 43 (1): 107-136 (2003)Validating Agent-Based Models of Large Networked Systems., , , , , , , , , and 1 other author(s). WSC, page 2807-2818. IEEE, (2019)Power Indices and Easier Hard Problems., and . Math. Syst. Theory, 23 (4): 209-225 (1990)