Alon, Noga
Overview
Works:  88 works in 254 publications in 2 languages and 2,530 library holdings 

Genres:  Conference papers and proceedings Textbooks 
Roles:  Author, Editor, Other, Creator 
Classifications:  QA164, 511.6 
Publication Timeline
.
Most widely held works by
Noga Alon
The probabilistic method by
Noga Alon(
Book
)
62 editions published between 1990 and 2016 in English and held by 1,107 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
62 editions published between 1990 and 2016 in English and held by 1,107 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
GAFA 2000 : Visions in mathematics : towards 2000 by
Israel seminar on Geometrical aspects of functional analysis(
Book
)
4 editions published in 2000 in English and held by 61 WorldCat member libraries worldwide
4 editions published in 2000 in English and held by 61 WorldCat member libraries worldwide
Star arboricity by
Noga Alon(
Book
)
5 editions published between 1988 and 1989 in German and English and held by 7 WorldCat member libraries worldwide
5 editions published between 1988 and 1989 in German and English and held by 7 WorldCat member libraries worldwide
Cutting disjoint discs by straight lines by
Noga Alon(
Book
)
4 editions published in 1987 in German and English and held by 7 WorldCat member libraries worldwide
4 editions published in 1987 in German and English and held by 7 WorldCat member libraries worldwide
A Graphtheoretic game & its application to the kserver problem by
Noga Alon(
Book
)
4 editions published between 1991 and 1992 in English and held by 7 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."
4 editions published between 1991 and 1992 in English and held by 7 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."
The algorithmic aspects of the regularity lemma : extended abstract by
Noga Alon(
Book
)
5 editions published in 1992 in English and German and held by 7 WorldCat member libraries worldwide
5 editions published in 1992 in English and German and held by 7 WorldCat member libraries worldwide
Homomorphisms of edgecoloured graphs and coxeter groups by
Noga Alon(
Book
)
2 editions published in 1996 in English and held by 6 WorldCat member libraries worldwide
2 editions published in 1996 in English and held by 6 WorldCat member libraries worldwide
The chromatic number of graph powers by
Noga Alon(
Book
)
3 editions published in 2000 in English and held by 5 WorldCat member libraries worldwide
3 editions published in 2000 in English and held by 5 WorldCat member libraries worldwide
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."
The maximum size of a convex polygon in a restricted set of points in the plane by
Noga Alon(
Book
)
3 editions published in 1987 in German and English and held by 5 WorldCat member libraries worldwide
3 editions published in 1987 in German and English and held by 5 WorldCat member libraries worldwide
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions by
Noga Alon(
Book
)
2 editions published in 1994 in English and held by 4 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]."
2 editions published in 1994 in English and held by 4 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]."
On disseminating information reliability without broadcasting by
Noga Alon(
Book
)
5 editions published in 1985 in English and Undetermined and held by 4 WorldCat member libraries worldwide
5 editions published in 1985 in English and Undetermined and held by 4 WorldCat member libraries worldwide
Single round simulation on radio networks by
Noga Alon(
Book
)
2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
In the uniform messagepassing model, in each round a processor must send an identical message to all its outgoing neighbors. Both messagepassing models can easily simulate the radio model with no overhead. In the other direction, we propose and study a primitive called the singleround simulation (SRS), enabling the simulation of a single round of an algorithm designed for the standard message models. We give lower bounds for the length of SRS schedules for both models, and supply constructions or existence proofs for schedules of matching (or almost matching) lengths."
2 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
In the uniform messagepassing model, in each round a processor must send an identical message to all its outgoing neighbors. Both messagepassing models can easily simulate the radio model with no overhead. In the other direction, we propose and study a primitive called the singleround simulation (SRS), enabling the simulation of a single round of an algorithm designed for the standard message models. We give lower bounds for the length of SRS schedules for both models, and supply constructions or existence proofs for schedules of matching (or almost matching) lengths."
Multicolored forests in bipartite decompositions of graphs by
Noga Alon(
Book
)
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We show that in any edgecoloring of the complete graph K[subscript n] on n vertices, such that each color class forms a complete bipartite graph, there is a spanning tree of K[subscript n] no two of whose edges have the same color. This strengthens a theorem of Graham and Pollak and verifies a conjecture of de Caen. More generally we show that in any edgecoloring of a graph G with p positive and q negative eigenvalues, such that each color class forms a complete bipartite graph, there is a forest of at least max(p, q) edges no two of which have the same color. In case G is bipartite there is always such a forest which is a matching."
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We show that in any edgecoloring of the complete graph K[subscript n] on n vertices, such that each color class forms a complete bipartite graph, there is a spanning tree of K[subscript n] no two of whose edges have the same color. This strengthens a theorem of Graham and Pollak and verifies a conjecture of de Caen. More generally we show that in any edgecoloring of a graph G with p positive and q negative eigenvalues, such that each color class forms a complete bipartite graph, there is a forest of at least max(p, q) edges no two of which have the same color. In case G is bipartite there is always such a forest which is a matching."
Simple constructions of almost kwise independent random variables by
Noga Alon(
Book
)
2 editions published in 1991 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1991 in English and held by 3 WorldCat member libraries worldwide
Visions in Mathematics Towards 2000 GAFA 2000 Special Volume, Part IIpp. 455983 by
Noga Alon(
)
1 edition published in 2010 in English and held by 0 WorldCat member libraries worldwide
Annotation
1 edition published in 2010 in English and held by 0 WorldCat member libraries worldwide
Annotation
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Spencer, Joel H.
 Erdős, Paul 19131996
 John Wiley & Sons Publisher
 Connes, A. Author Editor
 Milman, V. Editor
 Gromov, M.
 Bourgain, J.
 Bourgain, Jean Editor
 Thomas J. Watson IBM Research Center Research Division
 Pulleyblank, W. R.
Useful Links
Associated Subjects
Algebra, Boolean Approximation theory Combinatorial analysis Combinatorial optimization Combinatorial set theory Computer networks Decomposition (Mathematics) Electronic data processingDistributed processing Functional analysis Geometry Geometry, Hyperbolic Graph theory Hashing (Computer science) Integer programming Logic programming Mathematical analysis Probabilities Radio frequency
Alternative Names
Alon, N.
Alon, N. (Noga)
Alon, Noga M. 1956
ʾAlwn Nogah 1956?....
Noga Alon
Noga Alon israelischer Mathematiker und Informatiker
Noga Alon matematico israeliano
Noga Alon Mathematician
Noga Alon wiskundige uit Israël
Нога Алон
אלון, נגה
אלון נגה 1956?....
নোগা আলন
Languages
Covers