Stearns, R. E.
Overview
Works:  32 works in 81 publications in 4 languages and 1,604 library holdings 

Roles:  Contributor, Author 
Classifications:  QA76.6, 001.6425 
Publication Timeline
.
Most widely held works by
R. E Stearns
Compiler design theory by
Philip M Lewis(
Book
)
23 editions published between 1967 and 1979 in 3 languages and held by 643 WorldCat member libraries worldwide
23 editions published between 1967 and 1979 in 3 languages and held by 643 WorldCat member libraries worldwide
Algebraic structure theory of sequential machines by
Juris Hartmanis(
Book
)
16 editions published between 1966 and 1975 in 3 languages and held by 527 WorldCat member libraries worldwide
16 editions published between 1966 and 1975 in 3 languages and held by 527 WorldCat member libraries worldwide
Repeated games with incomplete information by
Robert J Aumann(
Book
)
10 editions published in 1995 in English and held by 396 WorldCat member libraries worldwide
During the height of the Cold War, between 1965 and 1968, Robert Aumann, Michael Maschler, and Richard Stearns collaborated on research on the dynamics of arms control negotiations that has since become foundational to work on repeated games. These five seminal papers are collected here for the first time, with the addition of "postscripts" describing many of the developments since the papers were written. The basic model studied throughout the book is one in which players ignorant about the game being played must learn what they can from the actions of the others
10 editions published in 1995 in English and held by 396 WorldCat member libraries worldwide
During the height of the Cold War, between 1965 and 1968, Robert Aumann, Michael Maschler, and Richard Stearns collaborated on research on the dynamics of arms control negotiations that has since become foundational to work on repeated games. These five seminal papers are collected here for the first time, with the addition of "postscripts" describing many of the developments since the papers were written. The basic model studied throughout the book is one in which players ignorant about the game being played must learn what they can from the actions of the others
The Hughes Site : an aboriginal village site on the Potomac River in Montgomery County, Maryland by
R. E Stearns(
Book
)
1 edition published in 1940 in English and held by 6 WorldCat member libraries worldwide
1 edition published in 1940 in English and held by 6 WorldCat member libraries worldwide
Routing linear permutations through the omega network in two passes by John Keohane(
Book
)
1 edition published in 1988 in English and held by 2 WorldCat member libraries worldwide
Abstract: "The problem of routing permutations through an [Omega] network connecting a set of processors is studied in the framework of linear algebra. The class of linear permutations is defined, and it is shown that any linear permutation can be routed through the [Omega] network in two passes. Furthermore, the address of the intermediary processor for the routing can be found in O(n[superscript 4]), where n is the size of the address of a processor. The class of linear permutations contains the class of Bit Permute Complement permutations, and the address of the inermediary processor for routing Bit Permute Complement permutations can be found in O(n) time."
1 edition published in 1988 in English and held by 2 WorldCat member libraries worldwide
Abstract: "The problem of routing permutations through an [Omega] network connecting a set of processors is studied in the framework of linear algebra. The class of linear permutations is defined, and it is shown that any linear permutation can be routed through the [Omega] network in two passes. Furthermore, the address of the intermediary processor for the routing can be found in O(n[superscript 4]), where n is the size of the address of a processor. The class of linear permutations contains the class of Bit Permute Complement permutations, and the address of the inermediary processor for routing Bit Permute Complement permutations can be found in O(n) time."
On solving systems of linear equations and path problems for bounded treewidth graphs by Venkatesh Radhakrishnan(
Book
)
1 edition published in 1992 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1992 in English and held by 2 WorldCat member libraries worldwide
On the complexity of the satisfiability problem and the structure of NP by
R. E Stearns(
Book
)
1 edition published in 1986 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1986 in English and held by 2 WorldCat member libraries worldwide
An algebraic model for combinatorial problems by
R. E Stearns(
Book
)
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
Abstract: "A new algebraic model, called the 'generalized satisfiability problem' or 'GSP' model, is introduced for representing and solving combinatorial problems. The GSP model is an alternative to the common method in the literature of representing such problems as language recognition problems. In the GSP model, a problem instance is represented by a set of variables together with a set of terms, and the computational objective is to find a certain sum of products of terms over a commutative semiring. Each Boolean satisfiability problem, each nonserial optimization problem, many [0,1] linear programming problems, and many graph problems are directly representable as GSPs. Important properties of the GSP model include the following: 1. By varying the semiring, a number of complete problems in the complexity class NP, CoNP, D[superscript P], OPTP, MAX SNP, MAX [PI]₁, PSPACE, and #PSPACE are directly representable as GSPs. 2. In the GSP model, one can naturally discuss the structure of individual problem instances. The structure of a GSP is displayed in a 'structure tree.' The smaller the 'weighted depth' or 'channelwidth' of the structure tree for a GSP instance, the faster the instance can be solved by any one of several generic algorithms. 3. The GSP model extends easily so as to apply to heirarchicallyspecified problems and enables solutions to instances of such problems to be found directly from the specification rather than from the (often exponentially) larger specified object."
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
Abstract: "A new algebraic model, called the 'generalized satisfiability problem' or 'GSP' model, is introduced for representing and solving combinatorial problems. The GSP model is an alternative to the common method in the literature of representing such problems as language recognition problems. In the GSP model, a problem instance is represented by a set of variables together with a set of terms, and the computational objective is to find a certain sum of products of terms over a commutative semiring. Each Boolean satisfiability problem, each nonserial optimization problem, many [0,1] linear programming problems, and many graph problems are directly representable as GSPs. Important properties of the GSP model include the following: 1. By varying the semiring, a number of complete problems in the complexity class NP, CoNP, D[superscript P], OPTP, MAX SNP, MAX [PI]₁, PSPACE, and #PSPACE are directly representable as GSPs. 2. In the GSP model, one can naturally discuss the structure of individual problem instances. The structure of a GSP is displayed in a 'structure tree.' The smaller the 'weighted depth' or 'channelwidth' of the structure tree for a GSP instance, the faster the instance can be solved by any one of several generic algorithms. 3. The GSP model extends easily so as to apply to heirarchicallyspecified problems and enables solutions to instances of such problems to be found directly from the specification rather than from the (often exponentially) larger specified object."
On SAT and the relative complexities of NPhard problems by
R. E Stearns(
Book
)
1 edition published in 1987 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1987 in English and held by 2 WorldCat member libraries worldwide
Syntax directed transduction by
P. M Lewis(
Book
)
1 edition published in 1966 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1966 in English and held by 2 WorldCat member libraries worldwide
The complexity of equivalence for commutative rings by
H. B Hunt(
Book
)
1 edition published in 1987 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1987 in English and held by 2 WorldCat member libraries worldwide
The complexity of very simple Boolean formulas with applications by
H. B Hunt(
Book
)
1 edition published in 1987 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1987 in English and held by 2 WorldCat member libraries worldwide
Power indices, structure trees, and easier hard problems by
R. E Stearns(
Book
)
1 edition published in 1989 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1989 in English and held by 2 WorldCat member libraries worldwide
Efficient scan operators for bitserial processor arrays by
Charles M Fiduccia(
Book
)
1 edition published in 1988 in English and held by 1 WorldCat member library worldwide
1 edition published in 1988 in English and held by 1 WorldCat member library worldwide
Power indices and easier NPcomplete problems by
R. E Stearns(
Book
)
1 edition published in 1988 in English and held by 1 WorldCat member library worldwide
1 edition published in 1988 in English and held by 1 WorldCat member library worldwide
Description of a species of Actaeon from the quaternary bluffs at Spanish Bight, San Diego, California by
Robert E. C Stearns(
Book
)
1 edition published in 1899 in English and held by 1 WorldCat member library worldwide
1 edition published in 1899 in English and held by 1 WorldCat member library worldwide
Scientific Results of Explorations by the U.S. Fish Commissions Steamer Albatross  No. 17 Descriptions of New West American
Land, FreshWater, and Marine Shells, With Notes and Comments by
United States National Museum(
Book
)
1 edition published in 1890 in English and held by 1 WorldCat member library worldwide
1 edition published in 1890 in English and held by 1 WorldCat member library worldwide
SAT, nonserial dynamic programming, finite algebra, and the structure of NP by
H. B Hunt(
Book
)
1 edition published in 1988 in English and held by 1 WorldCat member library worldwide
1 edition published in 1988 in English and held by 1 WorldCat member library worldwide
Memorybounded gameplaying computing by
Stanford University(
Book
)
1 edition published in 1989 in English and held by 1 WorldCat member library worldwide
1 edition published in 1989 in English and held by 1 WorldCat member library worldwide
On the complexity of satisfiability problems for algebraic structures by
H. B Hunt(
Book
)
2 editions published in 1988 in English and held by 1 WorldCat member library worldwide
Abstract: "For several different algebraic structures S, we study the computational complexity of such problems as determining, for a system of equations on S, 1. if the system has a solution, 2. if the system has a unique solution, and 3. the number of solutions of the system. Three types of results are obtained. For rings S, we show that these problems are either NP or coNPhard, when S is unitary, and in addition, are SAThard(npolygon, n), where S is commutative and unitary. We also show that determining the number of solutions of a system of equations on S is #Pcomplete, when S is finite and unitary, and in addition, is #SATcomplete(npolygon, n), when S is finite, commutative, and unitary
2 editions published in 1988 in English and held by 1 WorldCat member library worldwide
Abstract: "For several different algebraic structures S, we study the computational complexity of such problems as determining, for a system of equations on S, 1. if the system has a solution, 2. if the system has a unique solution, and 3. the number of solutions of the system. Three types of results are obtained. For rings S, we show that these problems are either NP or coNPhard, when S is unitary, and in addition, are SAThard(npolygon, n), where S is commutative and unitary. We also show that determining the number of solutions of a system of equations on S is #Pcomplete, when S is finite and unitary, and in addition, is #SATcomplete(npolygon, n), when S is finite, commutative, and unitary
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Rosenkrantz, Daniel J. Author
 Lewis, Philip M. 1931 Author
 Hartmanis, Juris Author
 Maschler, Michael 19272008
 Aumann, Robert J. Author
 Hunt, H. B. Author
 United States National Museum
 Lewis, P. M. Author
 General Electric Company Research and Development Center
 Hunt III, H. B. Author
Useful Links
Associated Subjects
Algebra, Boolean Algorithms Antiquities Arms controlSimulation methods Combinatorial optimization Commutative rings Compilers (Computer programs) Completeness theorem Computational complexity Computer networks Computer programs DisarmamentSimulation methods Excavations (Archaeology) Game theory Indians of North AmericaAntiquities Information theory Linear programming Maryland MarylandMontgomery County NPcomplete problems Paleontology Parallel processing (Electronic computers) Permutations Problem solving Quaternary Geologic Period Sequential machine theory Shells Trees (Graph theory)
Alternative Names
Richard E. Stearns Amerikaans informaticus
Richard E. Stearns amerikansk ingeniør og informatikar
Richard E. Stearns amerikansk ingeniør og informatiker
Richard E. Stearns amerikansk ingenjör och datavetare
Richard E. Stearns USamerikanischer Informatiker
Richard Stearns
Richard Stearns informaticien américain
Stearns, R. E.
Stearns, Richard 1936
Stearns, Richard E.
Stearns, Richard E. 1936
Stearns, Richard Edwin.
Stearns, Richard Edwin 1936
Stirnz, R.
Річард Стернз
Стернс, Ричард Эдвин
ريتشارد ستيرنز
ریچارد استیرنز دانشمند علوم کامپیوتر و مهندس آمریکایی
রিচার্ড এডউইন স্টার্নস
リチャード・スターンズ
理查德·斯特恩斯
Languages
Covers