Alon, Noga
Overview
Works:  61 works in 131 publications in 3 languages and 2,098 library holdings 

Genres:  Conference proceedings Textbooks 
Roles:  Author, Editor, Other 
Classifications:  QA164, 511.6 
Publication Timeline
.
Most widely held works by
Noga Alon
The probabilistic method
by
Noga Alon(
Book
)
45 editions published between 1990 and 2008 in English and held by 1,276 WorldCat member libraries worldwide
The probabalistic method, allows us to prove the existence of combinatorial structure with certain properties by constructing an appropriate probability space and showing that a chosen element has the desired properties with positive probability
45 editions published between 1990 and 2008 in English and held by 1,276 WorldCat member libraries worldwide
The probabalistic method, allows us to prove the existence of combinatorial structure with certain properties by constructing an appropriate probability space and showing that a chosen element has the desired properties with positive probability
Visions in mathematics GAFA 2000 special volume
by Israel Seminar on Geometrical Aspects of Functional Analysis(
)
5 editions published in 2010 in English and held by 311 WorldCat member libraries worldwide
"Visions in Mathematics  Towards 2000" was one of the most remarkable mathematical meetings in recent years. It was held in Tel Aviv from August 25th to September 3rd, 1999, and united some of the leading mathematicians worldwide. The goals of the conference were to discuss the importance, the methods, the past and the future of mathematics as we enter the 21st century and to consider the connection between mathematics and related areas. The aims of the conference are reflected in the present set of survey articles, documenting the state of art and future prospects in many branches of mathematics of current interest. This is the first part of a twovolume set that will serve any research mathematician or advanced student as an overview and guideline through the multifaceted body of mathematical research in the present and near future
5 editions published in 2010 in English and held by 311 WorldCat member libraries worldwide
"Visions in Mathematics  Towards 2000" was one of the most remarkable mathematical meetings in recent years. It was held in Tel Aviv from August 25th to September 3rd, 1999, and united some of the leading mathematicians worldwide. The goals of the conference were to discuss the importance, the methods, the past and the future of mathematics as we enter the 21st century and to consider the connection between mathematics and related areas. The aims of the conference are reflected in the present set of survey articles, documenting the state of art and future prospects in many branches of mathematics of current interest. This is the first part of a twovolume set that will serve any research mathematician or advanced student as an overview and guideline through the multifaceted body of mathematical research in the present and near future
Visions in mathematics
(
)
2 editions published in 2010 in English and held by 271 WorldCat member libraries worldwide
2 editions published in 2010 in English and held by 271 WorldCat member libraries worldwide
GAFA 2000 : Visions in mathematics : towards 2000
by Visions in Mathematics  Towards 2000(
Book
)
2 editions published in 2000 in English and held by 56 WorldCat member libraries worldwide
2 editions published in 2000 in English and held by 56 WorldCat member libraries worldwide
Visions in mathematics GAFA 2000 special volume
(
)
3 editions published in 2010 in English and held by 30 WorldCat member libraries worldwide
"Visions in Mathematics  Towards 2000" was one of the most remarkable mathematical meetings in recent years. It was held in Tel Aviv from August 25th to September 3rd, 1999, and united some of the leading mathematicians worldwide. The goals of the conference were to discuss the importance, the methods, the past and the future of mathematics as we enter the 21st century and to consider the connection between mathematics and related areas. The aims of the conference are reflected in the present set of survey articles, documenting the state of art and future prospects in many branches of mathematics of current interest. This is the second part of a twovolume set that will serve any research mathematician or advanced student as an overview and guideline through the multifaceted body of mathematical research in the present and near future
3 editions published in 2010 in English and held by 30 WorldCat member libraries worldwide
"Visions in Mathematics  Towards 2000" was one of the most remarkable mathematical meetings in recent years. It was held in Tel Aviv from August 25th to September 3rd, 1999, and united some of the leading mathematicians worldwide. The goals of the conference were to discuss the importance, the methods, the past and the future of mathematics as we enter the 21st century and to consider the connection between mathematics and related areas. The aims of the conference are reflected in the present set of survey articles, documenting the state of art and future prospects in many branches of mathematics of current interest. This is the second part of a twovolume set that will serve any research mathematician or advanced student as an overview and guideline through the multifaceted body of mathematical research in the present and near future
Visions in Mathematics
by
Noga Alon(
)
2 editions published in 2010 in English and held by 19 WorldCat member libraries worldwide
Visions in Mathematics  Towards 2000' was one of the most remarkable mathematical meetings in recent years. It was held in Tel Aviv from August 25th to September 3rd, 1999, and united some of the leading mathematicians worldwide. The goals of the conference were to discuss the importance, the methods, the past and the future of mathematics as we enter the 21st century and to consider the connection between mathematics and related areas. The aims of the conference are reflected in the present set of survey articles, documenting the state of art and future prospects in many branches of mathemat
2 editions published in 2010 in English and held by 19 WorldCat member libraries worldwide
Visions in Mathematics  Towards 2000' was one of the most remarkable mathematical meetings in recent years. It was held in Tel Aviv from August 25th to September 3rd, 1999, and united some of the leading mathematicians worldwide. The goals of the conference were to discuss the importance, the methods, the past and the future of mathematics as we enter the 21st century and to consider the connection between mathematics and related areas. The aims of the conference are reflected in the present set of survey articles, documenting the state of art and future prospects in many branches of mathemat
Visions in mathematics
(
Book
)
2 editions published in 2010 in English and held by 18 WorldCat member libraries worldwide
2 editions published in 2010 in English and held by 18 WorldCat member libraries worldwide
Visions in mathematics. GAFA 2000 special volume
by
Noga Alon(
)
1 edition published in 2010 in English and held by 8 WorldCat member libraries worldwide
1 edition published in 2010 in English and held by 8 WorldCat member libraries worldwide
Visions in mathematics GAFA 2000 special volume
by
Noga Alon(
Book
)
4 editions published between 2000 and 2010 in English and held by 7 WorldCat member libraries worldwide
4 editions published between 2000 and 2010 in English and held by 7 WorldCat member libraries worldwide
Visions in mathematics : towards 2000
(
Book
)
1 edition published in 2000 in English and held by 7 WorldCat member libraries worldwide
1 edition published in 2000 in English and held by 7 WorldCat member libraries worldwide
A Graphtheoretic game & its application to the kserver problem
by N Alon(
Book
)
2 editions published between 1991 and 1992 in English and held by 6 WorldCat member libraries worldwide
This result has potential application to the design of communication networks. It also improves substantially known estimates concerning the existence of a sparse basis for the cycle space of a graph."
2 editions published between 1991 and 1992 in English and held by 6 WorldCat member libraries worldwide
This result has potential application to the design of communication networks. It also improves substantially known estimates concerning the existence of a sparse basis for the cycle space of a graph."
Improved parallel approximation of a class of integer programming problems
by
Noga Alon(
Book
)
1 edition published in 1995 in English and held by 5 WorldCat member libraries worldwide
Abstract: "We present a method to derandomize RNC algorithms, converting them to NC algorithms. Using it, we show how to approximate a class of NPhard integer programming problems in NC, to within factors better than the currentbest NC algorithms (of Berger & Rompel and Motwani, Naor & Naor); in some cases, the approximation factors are as good as the bestknown sequential algorithms, due to Raghaven. This class includes problems such as global wirerouting in VLSI gate arrays and a generalization of telephone network planning in SONET rings. Also for a subfamily of the 'packing' integer programs, we provide the first NC approximation algorithms; this includes problems such as maximum matchings in hypergraphs, and generalizations. The key to the utility of our method is that it involves sums of superpolynomially many terms, which can however be computed in NC; this superpolynomiality is the bottleneck for some earlier approaches, due to Berger & Rompel and Motwani, Naor & Naor."
1 edition published in 1995 in English and held by 5 WorldCat member libraries worldwide
Abstract: "We present a method to derandomize RNC algorithms, converting them to NC algorithms. Using it, we show how to approximate a class of NPhard integer programming problems in NC, to within factors better than the currentbest NC algorithms (of Berger & Rompel and Motwani, Naor & Naor); in some cases, the approximation factors are as good as the bestknown sequential algorithms, due to Raghaven. This class includes problems such as global wirerouting in VLSI gate arrays and a generalization of telephone network planning in SONET rings. Also for a subfamily of the 'packing' integer programs, we provide the first NC approximation algorithms; this includes problems such as maximum matchings in hypergraphs, and generalizations. The key to the utility of our method is that it involves sums of superpolynomially many terms, which can however be computed in NC; this superpolynomiality is the bottleneck for some earlier approaches, due to Berger & Rompel and Motwani, Naor & Naor."
Homomorphisms of edgecoloured graphs and coxeter groups
by
Noga Alon(
Book
)
1 edition published in 1996 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1996 in English and held by 5 WorldCat member libraries worldwide
GAFA 2000. visions in mathematics : towards 2000
by
Israel seminar on Geometrical aspects of functional analysis(
Book
)
1 edition published in 2000 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 2000 in English and held by 4 WorldCat member libraries worldwide
Visions in mathematics  towards 2000
(
Book
)
1 edition published in 2000 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 2000 in English and held by 4 WorldCat member libraries worldwide
Visions in mathematics : towards 2000
(
Book
)
1 edition published in 2000 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 2000 in English and held by 4 WorldCat member libraries worldwide
The chromatic number of graph powers
by
Noga Alon(
Book
)
3 editions published in 2000 in English and held by 3 WorldCat member libraries worldwide
3 editions published in 2000 in English and held by 3 WorldCat member libraries worldwide
<>
(
Book
)
2 editions published in 1983 in Hebrew and held by 3 WorldCat member libraries worldwide
2 editions published in 1983 in Hebrew and held by 3 WorldCat member libraries worldwide
Star arboricity
by
Noga Alon(
Book
)
2 editions published in 1988 in German and held by 3 WorldCat member libraries worldwide
2 editions published in 1988 in German and held by 3 WorldCat member libraries worldwide
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
by
Noga Alon(
Book
)
1 edition published in 1994 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Small sample spaces with almost independent random variables are applied to design efficient sequential deterministic algorithms for two problems. The first algorithm, motivated by the attempt to design efficient algorithms for the All Pairs Shortest Path problem using fast matrix multiplication, solves the problem of computing witnesses for the Boolean product of two matrices. That is, if A and B are two n by n matrices, and C = AB is their Boolean product, the algorithm finds for every entry C[subscript ij] = 1 a witness: an index k so that A[subscript ik] = B[subscript kj] = 1. Its running time exceeds that of computing the product of two n by n matrices with small integer entries by a polylogarithmic factor. The second algorithm is a nearly linear time deterministic procedure for constructing a perfect hash function for a given nsubset of [1,., m]."
1 edition published in 1994 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Small sample spaces with almost independent random variables are applied to design efficient sequential deterministic algorithms for two problems. The first algorithm, motivated by the attempt to design efficient algorithms for the All Pairs Shortest Path problem using fast matrix multiplication, solves the problem of computing witnesses for the Boolean product of two matrices. That is, if A and B are two n by n matrices, and C = AB is their Boolean product, the algorithm finds for every entry C[subscript ij] = 1 a witness: an index k so that A[subscript ik] = B[subscript kj] = 1. Its running time exceeds that of computing the product of two n by n matrices with small integer entries by a polylogarithmic factor. The second algorithm is a nearly linear time deterministic procedure for constructing a perfect hash function for a given nsubset of [1,., m]."
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links