WorldCat Identities

Stearns, Richard E.

Overview
Works: 24 works in 34 publications in 3 languages and 456 library holdings
Roles: Collaborator
Classifications: jx1974, 327.174015193
Publication Timeline
Key
Publications about  Richard E Stearns Publications about Richard E Stearns
Publications by  Richard E Stearns Publications by Richard E Stearns
Most widely held works by Richard E Stearns
by ( Book )
3 editions published in in English and held by 357 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.
by ( Book )
7 editions published between and 1978 in English and Undetermined and held by 26 libraries worldwide
by ( Book )
1 edition published in in English and held by 15 libraries worldwide
by ( Book )
3 editions published in in English and held by 13 libraries worldwide
by ( Book )
1 edition published in in English and held by 9 libraries worldwide
by ( Book )
1 edition published in in Russian and held by 3 libraries worldwide
by ( Book )
1 edition published in in English and held by 2 libraries worldwide
by ( Book )
1 edition published in in English and held by 2 libraries worldwide
by ( Book )
1 edition published in in English and held by 2 libraries worldwide
Abstract: "We show how various ideas in [SH2] can be used to solve graph and hypergraph coloring problems, including computing chromatic polynomials, for a number of sets [gamma] of graphs and hypergraphs studied in the literature. Often, our algorithms for these problems use much less than 2[superscript cn] time, for any c> 0. This is true, even for sets [gamma], for which these coloring problems are NP- or #P-hard. Our results both extend and unify ideas for solving easier instances of hard graph problems using efficient separator theorems as in [LT2], [GHT], [RaH], etc., and tree-decompositions in [RS], [ALS], [Bodl], [BLW], etc."
by ( Book )
1 edition published in in English and held by 2 libraries worldwide
Abstract: "Efficient algorithms are presented for solving systems of linear equations defined on and for solving path problems [11] for treewidth k graphs [20] and for [alpha]-near-planar graphs [22]. These algorithms include the following: 1. O(nk²) and O(n[superscript (3/2)]) time algorithms for solving a system of linear equations and for solving the single source shortest path problem, 2. O(n²k) and O(n²log n) time algorithms for computing A[superscript( -1)] where A is an n x n matrix over a field or for computing A[superscript *] where A is an n x n matrix over a closed semiring, and.
by ( Book )
1 edition published in in English and held by 1 library worldwide
by ( Book )
1 edition published in in English and held by 1 library worldwide
by ( Book )
1 edition published in in English and held by 1 library worldwide
by ( Book )
1 edition published in in English and held by 1 library worldwide
by ( Book )
1 edition published in in English and held by 1 library worldwide
by ( Book )
1 edition published in in English and held by 1 library worldwide
by ( Book )
1 edition published in in English and held by 1 library worldwide
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.78 (from 0.62 for Some India ... to 0.83 for Generalize ...)
Alternative Names
Stearns, R. E.
Stearns, Richard Edwin.
Stirnz, R.
Languages
Covers