( en | de | ru )

 

Disambiguation of "Stearns, Richard Edwin"

Author of the publication

copydeleteadd this publication to your clipboard
Power Indices and Easier Hard Problems.

, and . Math. Syst. Theory, 23 (4): 209-225 (1990)

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 Günther

Edwin Baumgarten

Edwin Schiewer

 

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)Predecessor and Permutation Existence Problems for Sequential Dynamical Systems., , , , , and . DMCS, volume AB of DMTCS Proceedings, page 69-80. DMTCS, (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)On the State Assignment Problem for Sequential Machines II., and . IRE Trans. Electron. Comput., 10 (4): 593-603 (1961)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)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)Computational complexity of recursive sequences, and . SWCT, page 82-90. IEEE Computer Society, (1964)