Stearns, R. E.
Overview
Works:  43 works in 93 publications in 4 languages and 1,652 library holdings 

Roles:  Author, Contributor 
Classifications:  QA76.6, 001.6425 
Publication Timeline
.
Most widely held works by
R. E Stearns
Compiler design theory
by
Philip M Lewis(
Book
)
20 editions published between 1967 and 1979 in 3 languages and held by 652 WorldCat member libraries worldwide
20 editions published between 1967 and 1979 in 3 languages and held by 652 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
)
8 editions published in 1995 in English and held by 376 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
8 editions published in 1995 in English and held by 376 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
Unfinished believing is only the beginning
by
R. E Stearns(
)
1 edition published in 2013 in English and held by 23 WorldCat member libraries worldwide
Just before he left, Jesus sent his followers into the world with a revolutionary mission: to change the world by proclaiming God's truth and demonstrating his incredible love. But the single task he gave us to accomplish remains unfinished. Rich Stearns takes us on a breathtaking journey to rediscover the critical mission of Christ in our world today and the richness of God's calling on our lives. Have you wondered why we are here, what our purpose is, and where we fit in the bigger story that God is writing? How should our faith affect our careers, our money, our families, and our lives? And why does it matter? We will find our deepest purpose only when we discover the unique role God created for us to play in his unfolding story
1 edition published in 2013 in English and held by 23 WorldCat member libraries worldwide
Just before he left, Jesus sent his followers into the world with a revolutionary mission: to change the world by proclaiming God's truth and demonstrating his incredible love. But the single task he gave us to accomplish remains unfinished. Rich Stearns takes us on a breathtaking journey to rediscover the critical mission of Christ in our world today and the richness of God's calling on our lives. Have you wondered why we are here, what our purpose is, and where we fit in the bigger story that God is writing? How should our faith affect our careers, our money, our families, and our lives? And why does it matter? We will find our deepest purpose only when we discover the unique role God created for us to play in his unfolding story
Some Indian village sites of Tidewater Maryland
by
R. E Stearns(
Book
)
1 edition published in 1943 in English and held by 14 WorldCat member libraries worldwide
1 edition published in 1943 in English and held by 14 WorldCat member libraries worldwide
The Hughes Site : an aboriginal village site on the Potomac River in Montgomery County, Maryland
by
R. E Stearns(
Book
)
3 editions published in 1940 in English and held by 14 WorldCat member libraries worldwide
3 editions published in 1940 in English and held by 14 WorldCat member libraries worldwide
Some Indian village sites of the Lower Patapsco River
by
R. E Stearns(
Book
)
1 edition published in 1949 in English and held by 9 WorldCat member libraries worldwide
1 edition published in 1949 in English and held by 9 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
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
Power indices, structure trees, and easier hard problems
by
R. E Stearns(
Book
)
2 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1989 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
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."
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
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
Routing linear permutations through the omega network in two passes
by John Keohane(
Book
)
2 editions 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."
2 editions 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."
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
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
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
United States National Museum(
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
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Lewis, Philip M. 1931 Author
 Rosenkrantz, Daniel J. Author
 Hartmanis, Juris Author
 Maschler, Michael 19272008
 Aumann, Robert J. Author
 Shepherd, Wayne Narrator
 Oasis Audio (Firm)
 Hunt, H. B. Author
 Natural History Society of Maryland
 United States National Museum
Useful Links
Associated Subjects
Algebra, Boolean Algorithms Antiquities Arms controlSimulation methods Combinatorial optimization Commutative rings Compilers (Computer programs) Completeness theorem Computer networks Computer programs Conduct of life DisarmamentSimulation methods Excavations (Archaeology) Game theory Indians of North America Indians of North AmericaAntiquities Linear programming Maryland MarylandMontgomery County MarylandPatapsco River NPcomplete problems Permutations Problem solving Selfactualization (Psychology)Religious aspectsChristianity Sequential machine theory Trees (Graph theory)