Stein, Clifford 1965
Overview
Works:  33 works in 111 publications in 9 languages and 1,459 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor 
Classifications:  QA76.6, 005.1 
Publication Timeline
.
Most widely held works by
Clifford Stein
Introduction to algorithms by
Thomas H Cormen(
Book
)
26 editions published between 2001 and 2017 in 5 languages and held by 814 WorldCat member libraries worldwide
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively selfcontained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.  The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called "DivideandConquer"). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edgebased flow in the material on flow networks. Many new exercises and problems have been added for this edition
26 editions published between 2001 and 2017 in 5 languages and held by 814 WorldCat member libraries worldwide
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively selfcontained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.  The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called "DivideandConquer"). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edgebased flow in the material on flow networks. Many new exercises and problems have been added for this edition
Algorithm engineering and experiments : 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 45. 2002
: revised papers by
David M Mount(
Book
)
16 editions published in 2002 in English and held by 340 WorldCat member libraries worldwide
This book constitutes the thoroughly refereed postproceedings of the 4th International Workshop on Algorithm Engineering and Experiments, ALENEX 2002, held in San Francisico, CA, USA in January 2002. The 15 revised full papers presented were carefully reviewed and selected from 34 submissions. Among the topics addressed are hewistics for algorithms, combinatorial optimization, searching, graph computation, network optimization, scheduling, computational geometry, sorting, and clustering algorithms
16 editions published in 2002 in English and held by 340 WorldCat member libraries worldwide
This book constitutes the thoroughly refereed postproceedings of the 4th International Workshop on Algorithm Engineering and Experiments, ALENEX 2002, held in San Francisico, CA, USA in January 2002. The 15 revised full papers presented were carefully reviewed and selected from 34 submissions. Among the topics addressed are hewistics for algorithms, combinatorial optimization, searching, graph computation, network optimization, scheduling, computational geometry, sorting, and clustering algorithms
Discrete mathematics for computer scientists by
Clifford Stein(
Book
)
12 editions published between 2010 and 2011 in English and held by 128 WorldCat member libraries worldwide
12 editions published between 2010 and 2011 in English and held by 128 WorldCat member libraries worldwide
Discrete mathematics for computer science by
Kenneth P Bogart(
Book
)
8 editions published between 2005 and 2011 in English and held by 115 WorldCat member libraries worldwide
8 editions published between 2005 and 2011 in English and held by 115 WorldCat member libraries worldwide
Using cycles and scaling in parallel algorithms by
Clifford Stein(
Book
)
4 editions published in 1989 in English and held by 9 WorldCat member libraries worldwide
4 editions published in 1989 in English and held by 9 WorldCat member libraries worldwide
Introduzione agli algoritmi e strutture dati(
Book
)
1 edition published in 2010 in Italian and held by 7 WorldCat member libraries worldwide
1 edition published in 2010 in Italian and held by 7 WorldCat member libraries worldwide
Approximation algorithms for multicommodity flow and shop scheduling problems by
Clifford Stein(
Book
)
6 editions published in 1992 in English and held by 7 WorldCat member libraries worldwide
In this thesis, we give efficient approximation algorithms for two classical combinatorial optimization problems: multicommodity flow problems and shop scheduling problem. The algorithms we develop for these problems yield solutions that are not necessarily optimal, but come with a provable performance guarantee; that is, we can guarantee that the solution found is within a certain percentage of the optimal solution. This type of algorithm is known as an approximation algorithm. Our results show that by allowing a small error in the solution of a problem, it is often possible to gain a significant reduction in the running time of an algorithm for that problem. In Chapter 2, we study the multicommodity flow problem. The multicommodity flow problem involves simultaneously shipping several different commodities from their respective sources to their sinks in a single network so that the total amount of flow going through each edge is no more than its capacity. Associated with each commodity is a demand, which is the amount of that commodity that we wish to ship. Given a multicommodity flow problem, one often wants to know if there is a feasible flow, i.e., if it is possible to find a flow that satisfies the demands and obeys the capacity constraints. More generally, we might wish to know the maximum percentage z such that at least z percent of each demand can be shipped without violating the capacity constraints. The latter problem is known as the concurrent flow problem. multicommodity flow, scheduling, combinatorial optimization, network algorithms, approximation algorithms, randomized algorithms
6 editions published in 1992 in English and held by 7 WorldCat member libraries worldwide
In this thesis, we give efficient approximation algorithms for two classical combinatorial optimization problems: multicommodity flow problems and shop scheduling problem. The algorithms we develop for these problems yield solutions that are not necessarily optimal, but come with a provable performance guarantee; that is, we can guarantee that the solution found is within a certain percentage of the optimal solution. This type of algorithm is known as an approximation algorithm. Our results show that by allowing a small error in the solution of a problem, it is often possible to gain a significant reduction in the running time of an algorithm for that problem. In Chapter 2, we study the multicommodity flow problem. The multicommodity flow problem involves simultaneously shipping several different commodities from their respective sources to their sinks in a single network so that the total amount of flow going through each edge is no more than its capacity. Associated with each commodity is a demand, which is the amount of that commodity that we wish to ship. Given a multicommodity flow problem, one often wants to know if there is a feasible flow, i.e., if it is possible to find a flow that satisfies the demands and obeys the capacity constraints. More generally, we might wish to know the maximum percentage z such that at least z percent of each demand can be shipped without violating the capacity constraints. The latter problem is known as the concurrent flow problem. multicommodity flow, scheduling, combinatorial optimization, network algorithms, approximation algorithms, randomized algorithms
Wprowadzenie do algorytmów by
Thomas H Cormen(
Book
)
4 editions published between 2012 and 2018 in Polish and held by 4 WorldCat member libraries worldwide
4 editions published between 2012 and 2018 in Polish and held by 4 WorldCat member libraries worldwide
A parallel algorithm for eliminating cycles in undirected graphs by Philip Klein(
Book
)
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We give an efficient parallel algorithm for finding a maximal set of edgedisjoint cycles in an undirected graph. This algorithm can be generalized to handle a weighted version of the problem."
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We give an efficient parallel algorithm for finding a maximal set of edgedisjoint cycles in an undirected graph. This algorithm can be generalized to handle a weighted version of the problem."
Parallel algorithms for the assignment and minimumcost flow problems by
James B Orlin(
Book
)
3 editions published in 1992 in English and held by 3 WorldCat member libraries worldwide
Let G = (V, E) be a network for an assignment problem with 2n nodes and m edges, in which the largest edge cost is C. Recently the class of instances of bipartite matching problems has been shown to be in RNC provided that C is O(log(exp. k) n) for some fixed k. We show how to use scaling so as to develop an improved parallel algorithm and show that bipartite matching problems are in the class RNC provided that C = O(n (log(exp k) n)) for some fixed k. We then generalize these results to minimumcost flow problems. Let U be an upper bound on the capacities of the edges and on the largest demand. We show that the minimum cost flow problem is in the class RNC, provided that log(C + U) = O(log(exp k) n) for some fixed k. Thus the minimumcost flow problem is in the class RNC even when the magnitude of the costs and capacities are allowed to grow faster than any polynomial in n. The key to our approach is to reduce the number of processors needed from an amount that is proportional to the magnitude of the largest edge cost to an amount that is independent of the magnitude of the largest edge cost. The tradeoff is an increase in the running time that grows linearly in log(C + U)
3 editions published in 1992 in English and held by 3 WorldCat member libraries worldwide
Let G = (V, E) be a network for an assignment problem with 2n nodes and m edges, in which the largest edge cost is C. Recently the class of instances of bipartite matching problems has been shown to be in RNC provided that C is O(log(exp. k) n) for some fixed k. We show how to use scaling so as to develop an improved parallel algorithm and show that bipartite matching problems are in the class RNC provided that C = O(n (log(exp k) n)) for some fixed k. We then generalize these results to minimumcost flow problems. Let U be an upper bound on the capacities of the edges and on the largest demand. We show that the minimum cost flow problem is in the class RNC, provided that log(C + U) = O(log(exp k) n) for some fixed k. Thus the minimumcost flow problem is in the class RNC even when the magnitude of the costs and capacities are allowed to grow faster than any polynomial in n. The key to our approach is to reduce the number of processors needed from an amount that is proportional to the magnitude of the largest edge cost to an amount that is independent of the magnitude of the largest edge cost. The tradeoff is an increase in the running time that grows linearly in log(C + U)
Arugorizumu intorodakushon : sekai hyōjun emuaitī kyōkasho by
Thomas H Cormen(
Book
)
3 editions published between 2012 and 2013 in Japanese and held by 3 WorldCat member libraries worldwide
3 editions published between 2012 and 2013 in Japanese and held by 3 WorldCat member libraries worldwide
Kiso sōto dēta kōzō sūgaku(
Book
)
2 editions published in 2012 in Japanese and held by 2 WorldCat member libraries worldwide
2 editions published in 2012 in Japanese and held by 2 WorldCat member libraries worldwide
Approximating the minimumcost maximumflow is Pcomplete by
Clifford Stein(
Book
)
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
Suan fa dao lun by
Thomas H Cormen(
Book
)
1 edition published in 2006 in Chinese and held by 2 WorldCat member libraries worldwide
1 edition published in 2006 in Chinese and held by 2 WorldCat member libraries worldwide
Introduction to algorithms by
Thomas H Cormen(
Visual
)
1 edition published in 2001 in English and held by 2 WorldCat member libraries worldwide
This book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively selfcontained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. (Midwest)
1 edition published in 2001 in English and held by 2 WorldCat member libraries worldwide
This book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively selfcontained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. (Midwest)
Kodona sekkei to kaiseki shuho kodona deta kozo gurafu arugorizumu(
Book
)
2 editions published in 2012 in Japanese and held by 2 WorldCat member libraries worldwide
2 editions published in 2012 in Japanese and held by 2 WorldCat member libraries worldwide
Arugorizumu no sekkei to kaiseki shuho(
Book
)
1 edition published in 2007 in Japanese and held by 1 WorldCat member library worldwide
1 edition published in 2007 in Japanese and held by 1 WorldCat member library worldwide
Sugakuteki kiso to deta kozo(
Book
)
1 edition published in 2007 in Japanese and held by 1 WorldCat member library worldwide
1 edition published in 2007 in Japanese and held by 1 WorldCat member library worldwide
Fast approximation algorithms for multicommodity flow problems by
T Leighton(
)
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
In this paper, we describe the first polynomialtime combinatorial algorithms for approximately solving the multicommodity flow problem. Our algorithms are significantly faster than the best previously known algorithms, that were based on linear programming. For a kcommodity multicommodity flow problem, the running time of our randomized algorithm is (up to log factors) the same as the time needed to solve k singlecommodity flow problems, thus giving the surprising result that approximately computing a kcommodity maximumflow is not much harder than computing about k singlecommodity maximumflows iii isolation. Given any multicommodity flow problem as input, our algorithm is guaranteed to provide a feasible solution to a modified flow problem in which all capacities are increased by a (1 + e)factor, or to provide a proof that there is no feasible solution to the original problem. We also describe faster approximation algorithms for multicommodity flow problems with a special structure, such as those that arise in the sparsest cut problems and the uniform concurrent flow problems if k <or  m
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
In this paper, we describe the first polynomialtime combinatorial algorithms for approximately solving the multicommodity flow problem. Our algorithms are significantly faster than the best previously known algorithms, that were based on linear programming. For a kcommodity multicommodity flow problem, the running time of our randomized algorithm is (up to log factors) the same as the time needed to solve k singlecommodity flow problems, thus giving the surprising result that approximately computing a kcommodity maximumflow is not much harder than computing about k singlecommodity maximumflows iii isolation. Given any multicommodity flow problem as input, our algorithm is guaranteed to provide a feasible solution to a modified flow problem in which all capacities are increased by a (1 + e)factor, or to provide a proof that there is no feasible solution to the original problem. We also describe faster approximation algorithms for multicommodity flow problems with a special structure, such as those that arise in the sparsest cut problems and the uniform concurrent flow problems if k <or  m
Approximating disjointpath problems using greedy algorithms and packing integer programs by Stavros G Kolliopoulos(
Book
)
1 edition published in 1997 in English and held by 1 WorldCat member library worldwide
1 edition published in 1997 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Algorithms Approximation theory Combinatorial optimization Computational complexity Computer algorithms Computer graphics Computer programming Computer programmingAbility testing Computer science Computer scienceMathematics Computer software Data structures (Computer science) Decomposition (Mathematics) Electronic data processing Graph theory Graph theoryData processing Network analysis (Planning) Programming (Mathematics) Software engineering
Covers
Alternative Names
Clifford Stein Amerikaans informaticus
Clifford Stein informaticien américain
Штайн, Клиффорд
كليفورد شتاين عالِم حاسوب من الولايات المتحدة الأمريكية
کلیفورد استین دانشمند علوم کامپیوتر آمریکایی
克利福德·斯坦
Languages