#3,450

Most Influential Person

Israeli mathematician

According to Wikipedia, Noga Alon is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.

- The Probabilistic Method (1992) (6272)
- The space complexity of approximating the frequency moments (1996) (1962)
- Eigenvalues and expanders (1986) (1105)
- A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem (1985) (754)
- The Probabilistic Method: Alon/Probabilistic Method (2004) (619)
- lambda1, Isoperimetric inequalities for graphs, and superconcentrators (1985) (569)
- il , , lsoperimetric Inequalities for Graphs , and Superconcentrators (1985) (551)
- Finding and counting given length cycles (1997) (512)
- Colorings and orientations of graphs (1992) (496)
- Scale-sensitive dimensions, uniform convergence, and learnability (1993) (455)
- Color-coding (1995) (453)
- Simple construction of almost k-wise independent random variables (1990) (424)
- The Probabilistic Method: Alon/Probabilistic (2008) (418)
- Finding a large hidden clique in a random graph (1998) (404)
- Explicit construction of linear sized tolerant networks (1988) (367)
- Efficient Testing of Large Graphs (2000) (355)
- The monotone circuit complexity of boolean functions (1987) (351)
- A Lower Bound for Radio Broadcast (1991) (343)
- The algorithmic aspects of the regularity lemma (1992) (331)
- Approximating the cut-norm via Grothendieck's inequality (2004) (319)
- Tracking join and self-join sizes in limited storage (1999) (298)
- Algorithmic construction of sets for k-restrictions (2006) (297)
- A Graph-Theoretic Game and Its Application to the k-Server Problem (1995) (289)
- The Probabilistic Method, Second Edition (2000) (278)
- Construction Of Asymptotically Good Low-rate Error-correcting Codes Through Pseudo-random Graphs (1991) (270)
- Random Cayley Graphs and Expanders (1994) (255)
- Problems and results in extremal combinatorics--I (2003) (251)
- Acyclic Coloring of Graphs (1991) (231)
- A combinatorial characterization of the testable graph properties: it's all about regularity (2006) (229)
- On the second eigenvalue of a graph (1991) (229)
- Ranking Tournaments (2006) (226)
- The online set cover problem (2003) (220)
- A characterization of the (natural) graph properties testable with one-sided error (2005) (218)
- Restricted colorings of graphs (1993) (215)
- A separator theorem for graphs with an excluded minor and its applications (1990) (214)
- On the Exponent of the All Pairs Shortest Path Problem (1991) (212)
- A separator theorem for nonplanar graphs (1990) (208)
- A parallel algorithmic version of the local lemma (1991) (208)
- The Moore Bound for Irregular Graphs (2002) (203)
- Norm-Graphs: Variations and Applications (1999) (199)
- Biomolecular network motif counting and discovery by color coding (2008) (194)
- Approximation schemes for scheduling on parallel machines (1998) (189)
- Testing subgraphs in large graphs (2001) (181)
- Many T copies in H-free graphs (2014) (177)
- Piercing convex sets and the hadwiger-debrunner (p (1992) (177)
- Broadcasting with Side Information (2008) (177)
- Many random walks are faster than one (2007) (168)
- An Application of Graph Theory to Additive Number Theory (1985) (168)
- Acyclic edge colorings of graphs (2001) (168)
- H-Factors in Dense Graphs (1996) (163)
- Non-backtracking random walks mix faster (2006) (161)
- On the concentration of eigenvalues of random symmetric matrices (2000) (161)
- The Shannon Capacity of a Union (1998) (160)
- Regular languages are testable with a constant number of queries (1999) (157)
- Nonrepetitive colorings of graphs (2002) (155)
- Transversal numbers of uniform hypergraphs (1990) (153)
- The Polynomial Method and Restricted Sums of Congruence Classes (1996) (153)
- Point Selections and Weak ε-Nets for Convex Hulls (1992) (152)
- A linear time erasure-resilient code with nearly optimal recovery (1996) (149)
- A Biological Solution to a Fundamental Distributed Computing Problem (2011) (148)
- Approximating the independence number via theϑ-function (1998) (148)
- Testing subgraphs in directed graphs (2003) (145)
- Source coding and graph entropies (1996) (144)
- Solving MAX-r-SAT Above a Tight Lower Bound (2009) (144)
- Dense graphs are antimagic (2003) (137)
- Every monotone graph property is testable (2005) (133)
- Percolation on finite graphs and isoperimetric inequalities (2002) (132)
- A general approach to online network optimization problems (2004) (131)
- Coloring Graphs with Sparse Neighborhoods (1999) (131)
- Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory (1986) (129)
- Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices (2004) (126)
- The linear arboricity of graphs (1988) (125)
- Testing Reed-Muller codes (2005) (124)
- Explicit Ramsey graphs and orthonormal labelings (1994) (122)
- Testing k-wise and almost k-wise independence (2007) (121)
- Independent sets in regular graphs and sum-free subsets of finite groups (1991) (120)
- Unextendible Product Bases (2001) (119)
- Online Learning with Feedback Graphs: Beyond Bandits (2015) (118)
- Derandomized graph products (1995) (115)
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions (2003) (114)
- Quadratic forms on graphs (2005) (113)
- Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels (2011) (113)
- XML with data values: typechecking revisited (2001) (113)
- Testing Low-Degree Polynomials over GF(2( (2003) (111)
- Resolution enhancement in MRI. (2006) (110)
- Ramsey-type Theorems with Forbidden Subgraphs (2001) (110)
- The number of small semispaces of a finite set of points in the plane (1986) (110)
- Regular subgraphs of almost regular graphs (1984) (109)
- Approximation schemes for scheduling (1997) (109)
- Geometrical realization of set systems and probabilistic communication complexity (1985) (109)
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems (1991) (109)
- Adding Distinct Congruence Classes Modulo a Prime (1995) (107)
- The star arboricity of graphs (1988) (107)
- Tools from higher algebra (1996) (106)
- Strategyproof Approximation of the Minimax on Networks (2010) (104)
- Beeping a maximal independent set (2011) (104)
- Random sampling and approximation of MAX-CSPs (2003) (103)
- Explicit construction of exponential sized families of k-independent sets (1986) (103)
- Efficient simulation of finite automata by neural nets (1991) (103)
- Crossing patterns of semi-algebraic sets (2005) (102)
- Homomorphisms of Edge-Colored Graphs and Coxeter Groups (1998) (102)
- Transversal numbers for hypergraphs arising in geometry (2002) (102)
- A note on competitive diffusion through social networks (2010) (102)
- Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs (2007) (102)
- Testing of clustering (2000) (101)
- Planar Separators (1994) (100)
- Degrees and choice numbers (2000) (100)
- Sum of us: strategyproof selection from the selectors (2009) (99)
- On-line steiner trees in the Euclidean plane (1992) (99)
- The Probabilistic Method, Third Edition (2008) (98)
- Nearly perfect matchings in regular simple hypergraphs (1997) (97)
- Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback (2014) (95)
- Space-efficient local computation algorithms (2011) (93)
- Routing permutations on graphs via matchings (1993) (93)
- Linear time erasure codes with nearly optimal recovery (1995) (92)
- Combinatorics, Probability and Computing (2006) (92)
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (1994) (92)
- A lattice point problem and additive number theory (1995) (91)
- Partitioning into graphs with only small components (2003) (91)
- Wiley‐Interscience Series in Discrete Mathematics and Optimization (2004) (90)
- Graph Products, Fourier Analysis and Spectral Techniques (2004) (89)
- The concentration of the chromatic number of random graphs (1997) (88)
- A characterization of easily testable induced subgraphs (2004) (88)
- The Borsuk-Ulam theorem and bisection of necklaces (1986) (87)
- Perturbed Identity Matrices Have High Rank: Proof and Applications (2009) (87)
- Testing k-colorability (2002) (86)
- Learning a hidden matching (2002) (85)
- Balancing sets of vectors (1988) (85)
- Zero-sum sets of prescribed size (1993) (83)
- Graphs with integral spectrum (2009) (83)
- Learning a Hidden Subgraph (2004) (82)
- Repeated communication and Ramsey graphs (1994) (81)
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (1994) (81)
- Maximum cuts and judicious partitions in graphs without short cycles (2003) (81)
- Witnesses for Boolean matrix multiplication and for shortest paths (1992) (80)
- Covering the Cube by Affine Hyperplanes (1993) (80)
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints (2003) (79)
- Bipartite Subgraphs and the Smallest Eigenvalue (2000) (78)
- Inapproximabilty of Densest κ-Subgraph from Average Case Hardness (2011) (78)
- On a conjecture of erdöus, simonovits, and sós concerning anti-Ramsey theorems (1983) (78)
- Basic network creation games (2010) (78)
- Constructive Bounds for a Ramsey-Type Problem (1997) (77)
- The number of polytopes, configurations and real matroids (1986) (77)
- Semi-direct product in groups and zig-zag product in graphs: connections and applications (2001) (76)
- The Number of Edge Colorings with no Monochromatic Cliques (2004) (76)
- An Extremal Problem for Sets with Applications to Graph Theory (1985) (76)
- Algorithms with large domination ratio (2004) (75)
- Bipartite subgraphs (1996) (75)
- The structure of almost all graphs in a hereditary property (2009) (75)
- Optimizing budget allocation among channels and influencers (2012) (75)
- Properly colored Hamilton cycles in edge-colored complete graphs (1997) (74)
- On the density of sets of vectors (1983) (74)
- Covering Multigraphs by Simple Circuits (1985) (73)
- Choice Numbers of Graphs: a Probabilistic Approach (1992) (73)
- From Bandits to Experts: A Tale of Domination and Independence (2013) (73)
- On sunflowers and matrix multiplication (2012) (72)
- Many Random Walks Are Faster Than One† (2011) (72)
- Meanders and Their Applications in Lower Bounds Arguments (1988) (70)
- Private PAC learning implies finite Littlestone dimension (2018) (69)
- Covering graphs by the minimum number of equivalence relations (1986) (69)
- A nowhere-zero point in linear mappings (1989) (68)
- The chromatic number of kneser hypergraphs (1986) (68)
- Testing triangle-freeness in general graphs (2006) (68)
- Almost k-wise independence versus k-wise independence (2003) (68)
- Measures of pseudorandomness for finite sequences: typical values (2007) (68)
- A Non-linear Lower Bound for Planar Epsilon-nets (2010) (67)
- Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs (1997) (66)
- Random sampling and approximation of MAX-CSP problems (2002) (65)
- Better Expanders and Superconcentrators (1987) (65)
- On Disseminating Information Reliably without Broadcasting (1987) (64)
- Scalable Secure Storage When Half the System Is Faulty (2000) (64)
- Can visibility graphs Be represented compactly? (1993) (64)
- Improved approximation for directed cut problems (2007) (63)
- The Chromatic Number of Graph Powers (2002) (63)
- Coin-flipping games immune against linear-sized coalitions (1990) (62)
- Spectral Techniques in Graph Algorithms (1998) (60)
- Sharp Bounds For Some Multicolor Ramsey Numbers (2005) (60)
- Nearly complete graphs decomposable into large induced matchings and their applications (2011) (60)
- A simple algorithm for edge-coloring bipartite multigraphs (2003) (60)
- The approximate rank of a matrix and its algorithmic applications: approximate rank (2013) (59)
- A lower bound on the expected length of one-to-one codes (1994) (57)
- A Spectral Technique for Coloring Random 3-Colorable Graphs (1997) (57)
- Additive approximation for edge-deletion problems (2005) (57)
- List Coloring of Random and Pseudo-Random Graphs (1999) (57)
- The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence (2008) (54)
- Independent sets in tensor graph powers (2006) (53)
- Dominating sets in k-majority tournaments (2006) (53)
- Estimating arbitrary subset sums with few probes (2005) (53)
- Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension (1987) (53)
- Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case (1995) (53)
- Conflict-free colorings of shallow discs (2006) (53)
- On the Number of Permutations Avoiding a Given Pattern (2000) (53)
- AlmostH-factors in dense graphs (1992) (53)
- Algorithmic Aspects of Acyclic Edge Colorings (2001) (52)
- An elementary construction of constant-degree expanders (2007) (52)
- Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions (2007) (52)
- Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition (1994) (52)
- A note on the decomposition of graphs into isomorphic matchings (1983) (51)
- Additive latin transversals (2000) (51)
- Eigenvalues, Expanders and Superconcentrators (Extended Abstract) (1984) (51)
- Embedding nearly-spanning bounded degree trees (2007) (50)
- Nonnegative k-sums, fractional covers, and probability of small deviations (2011) (50)
- Balanced families of perfect hash functions and their applications (2007) (50)
- Generating Pseudo-Random Permutations and Maximum Flow Algorithms (1990) (49)
- Disjoint Directed Cycles (1996) (48)
- Large induced degenerate subgraphs (1987) (48)
- Bounding the piercing number (1995) (48)
- Typechecking XML views of relational databases (2001) (47)
- Turán ’ s theorem in the hypercube (2006) (47)
- An optimal procedure for gap closing in whole genome shotgun sequencing (2001) (47)
- Linear hash functions (1999) (47)
- Disjoint Simplices and Geometric Hypergraphs (1989) (46)
- Universality and tolerance (2000) (46)
- Spanning Directed Trees with Many Leaves (2008) (45)
- On the complexity of radio communication (1989) (44)
- Bipartite subgraphs of integer weighted graphs (1998) (44)
- Choosability and fractional chromatic numbers (1997) (44)
- The Shannon capacity of a graph and the independence numbers of its powers (2006) (44)
- Meanders, Ramsey theory and lower bounds for branching programs (1986) (44)
- An algorithm for the detection and construction of Monge sequences (1989) (44)
- Degrees of freedom versus dimension for containment orders (1988) (44)
- The Probablistic Method (2000) (44)
- Tough Ramsey Graphs Without Short Cycles (1995) (44)
- A Simple Proof of the Upper Bound Theorem (1985) (44)
- Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling (1992) (43)
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs (2007) (43)
- Large induced forests in sparse graphs (2001) (43)
- Lower bounds for approximations by low degree polynomials over Z/sub m/ (2001) (42)
- LINEAR EXTENSIONS OF A RANDOM PARTIAL ORDER (1994) (42)
- A counterexample to the rank-coloring conjecture (1989) (42)
- Parent-Identifying Codes (2001) (42)
- On three zero-sum Ramsey-type problems (1993) (42)
- The inverse Banzhaf problem (2010) (42)
- Parallel linear programming in fixed dimension almost surely in constant time (1994) (42)
- Combinatorial reconstruction problems (1989) (42)
- Long non-crossing configurations in the plane (1993) (41)
- Tur[a-acute]n's Theorem in the Hypercube (2007) (41)
- Additive bases of vector spaces over prime fields (1991) (41)
- Large sets in finite fields are sumsets (2007) (41)
- Deterministic Approximation Algorithms for the Nearest Codeword Problem (2009) (41)
- The String Chromatic Number of a Graph (1992) (41)
- On a Ramsey-type problem (2000) (40)
- 2-factors in Dense Graphs (1996) (40)
- Independence numbers of locally sparse graphs and a Ramsey type problem (1996) (40)
- Every 8-uniform 8-regular hypergraph is 2-colorable (1988) (40)
- Optimal Compression of Approximate Inner Products and Dimension Reduction (2016) (40)
- Single Round Simulation on Radio Networks (1992) (40)
- Subdivided graphs have linear ramsey numbers (1994) (40)
- On An Extremal Hypergraph Problem Of Brown, Erdős And Sós (2006) (39)
- Linear Arboricity and Linear k-Arboricity of Regular Graphs (2001) (39)
- Piercing d -Intervals (1998) (38)
- New Bounds on Parent-Identifying Codes: The Case of Multiple Parents (2004) (38)
- On the power of two, three and four probes (2009) (38)
- Generalized hashing and parent-identifying codes (2003) (38)
- Threshold Functions for H-factors (1993) (38)
- Decreasing the diameter of bounded degree graphs (2000) (37)
- On the maximum number of Hamiltonian paths in tournaments (2001) (37)
- Embedding ofl∞k in finite dimensional Banach spaces (1983) (37)
- Strategyproof Approximation Mechanisms for Location on Networks (2009) (37)
- Star arboricity (1992) (37)
- Disjoint edges in geometric graphs (1989) (36)
- Cleaning Regular Graphs with Brushes (2008) (36)
- Sparse universal graphs for bounded‐degree graphs (2007) (36)
- Testing satisfiability (2002) (35)
- On sums of subsets of a set of integers (1988) (35)
- On the number of subgraphs of prescribed type of graphs with a given number of edges (1981) (35)
- Counting sum-free sets in abelian groups (2012) (35)
- On a Hypergraph Matching Problem (2005) (34)
- The Number of Spanning Trees in Regular Graphs (1990) (33)
- An Asymptotic Isoperimetric Inequality (1998) (33)
- Nearly tight bounds for testing function isomorphism (2011) (33)
- Parameterized Algorithms for Directed Maximum Leaf Problems (2007) (33)
- Optimal universal graphs with deterministic embedding (2008) (33)
- Welfare Maximization with Limited Interaction (2015) (33)
- Fault tolerant graphs, perfect hash functions and disjoint paths (1992) (33)
- The maximum edit distance from hereditary graph properties (2008) (33)
- Neighborly Families of Boxes and Bipartite Coverings (2013) (33)
- A Note on Network Reliability (1995) (33)
- Separable Partitions (1999) (32)
- Sign rank versus VC dimension (2015) (32)
- Maximum directed cuts in acyclic digraphs (2007) (32)
- Tell Me Who I Am: An Interactive Recommendation System (2006) (32)
- Matching nuts and bolts (1994) (32)
- Weak ε-nets and interval chains (2008) (32)
- Linear Circuits over GF(2) (1990) (32)
- Polychromatic Colorings of Plane Graphs (2008) (31)
- Subset Sums (1987) (31)
- Smaller Explicit Superconcentrators (2003) (31)
- On the Capacity of Digraphs (1998) (31)
- Sparse universal graphs (2002) (30)
- Asymptotically optimal induced universal graphs (2017) (30)
- Finding and Counting Given Length Cycles (Extended Abstract) (1994) (30)
- Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics (2005) (30)
- Guessing secrets efficiently via list decoding (2002) (30)
- Reliable communication over highly connected noisy networks (2016) (30)
- What is the furthest graph from a hereditary property? (2008) (30)
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles (2016) (30)
- epsilon-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials (1995) (30)
- Measures of Pseudorandomness for Finite Sequences: Minimal Values (2006) (30)
- Problems and results in Extremal Combinatorics , Part (2002) (30)
- On an anti-Ramsey type result (2002) (29)
- Hardness of fully dense problems (2007) (29)
- Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary (1995) (29)
- Cutting disjoint disks by straight lines (1989) (29)
- Near-optimum Universal Graphs for Graphs with Bounded Degrees (2001) (29)
- Adversarial laws of large numbers and optimal regret in online classification (2021) (29)
- Easily Testable Graph Properties (2015) (29)
- Balanced Hashing, Color Coding and Approximate Counting (2009) (29)
- Graphs with a small number of distinct induced subgraphs (1989) (29)
- A Note on Graph Colorings and Graph Polynomials (1997) (28)
- Every 4-regular graph plus an edge contains a 3-regular subgraph (1984) (28)
- A separation theorem in property testing (2008) (28)
- Testing Boolean Function Isomorphism (2010) (28)
- Discrete Mathematics: Methods and Challenges (2002) (28)
- Hypergraphs with high chromatic number (1985) (28)
- Expanders, sorting in rounds and superconcentrators of limited depth (1985) (28)
- Efficient Global Learning of Entailment Graphs (2015) (27)
- A Tribute to Paul Erdős: Sum-free subsets (1990) (27)
- Kernels for the Dominating Set Problem on Graphs with an Excluded Minor (2008) (27)
- A spectral technique for coloring random 3-colorable graphs (preliminary version) (1994) (27)
- Explicit unique-neighbor expanders (2002) (27)
- ECONOMICAL TORIC SPINES VIA CHEEGER'S INEQUALITY (2008) (27)
- Spanning subgraphs of random graphs (1992) (27)
- Constructive lower bounds for off-diagonal Ramsey numbers (2001) (26)
- Approximate Hypergraph Coloring (1996) (26)
- Superconcentrators of Depths 2 and 3; Odd Levels Help (Rarely) (1994) (26)
- A Ramsey‐type result for the hypercube (2006) (26)
- On Two Segmentation Problems (1999) (26)
- The Number Of Orientations Having No Fixed Tournament (2006) (26)
- Equilateral Sets in lpn (2003) (26)
- Almost k-Wise vs. k-Wise Independent Permutations, and Uniformity for General Group Actions (2012) (25)
- Cycles of length 0 modulo k in directed graphs (1989) (25)
- On acyclic colorings of graphs on surfaces (1996) (25)
- Perfect Matchings in ε-regular Graphs (1998) (25)
- On the Complexity of Arrangements of Circles in the Plane (2001) (25)
- Sorting, Approximate Sorting, and Searching in Rounds (1988) (25)
- Separating Pairs of Points by Standard Boxes (1985) (25)
- Game domination number (2002) (25)
- testing of large graphs (2000) (24)
- On-Line and Off-Line Approximation Algorithms for Vector Covering Problems (1996) (24)
- The average complexity of deterministic and randomized parallel comparison sorting algorithms (1987) (24)
- Splitting digraphs (2006) (24)
- Two notions of unit distance graphs (2013) (24)
- Addendum to "Simple Construction of Almost k-wise Independent Random Variables" (1993) (23)
- Finding Disjoint Paths in Expanders Deterministically and Online (2007) (23)
- Better Algorithms and Bounds for Directed Maximum Leaf Problems (2007) (23)
- Covering a hypergraph of subgraphs (2002) (23)
- On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game (2011) (23)
- Voting paradoxes and digraphs realizations (2002) (23)
- Universal sequences for complete graphs (1990) (23)
- Walking in circles (2010) (23)
- Linear equations, arithmetic progressions and hypergraph property testing (2005) (23)
- UNIVERSALITY AND TOLERANCE (Extended Abstract) (2000) (22)
- Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory (1986) (22)
- Practically stabilizing SWMR atomic memory in message-passing systems (2015) (22)
- The maximum number of Hamiltonian paths in tournaments (1990) (22)
- Limits of Private Learning with Access to Public Data (2019) (22)
- Sequential voting with externalities: herding in social networks (2012) (22)
- Explicit Expanders of Every Degree and Size (2020) (22)
- Equilateral sets in l np (2002) (22)
- Chasing a Fast Robber on Planar Graphs and Random Graphs (2015) (22)
- Induced subgraphs of prescribed size (2003) (21)
- Acyclic colouring of graphs (2006) (21)
- Open Problems in Data Streams, Property Testing, and Related Topics (2011) (21)
- MaxCut in ${\bm H)$-Free Graphs (2005) (21)
- Coloring, sparseness and girth (2014) (21)
- The geometry of coin-weighing problems (1996) (21)
- k-Wise Independent Random Graphs (2008) (21)
- A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture (1996) (20)
- Tight complexity bounds for parallel comparison sorting (1986) (20)
- Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths (1999) (20)
- Multicolored forests in bipartite decompositions of graphs (1991) (20)
- Additive Patterns in Multiplicative Subgroups (2014) (20)
- A note on regular Ramsey graphs (2008) (20)
- Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodym property (2008) (20)
- Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time (1990) (20)
- A refinement of the Cameron–Erdős conjecture (2012) (20)
- Locally Thin Set Families (2000) (20)
- Piercing convex sets (1992) (20)
- Problems and results in extremal combinatorics - II (2008) (20)
- On The Number of Subgraphs of Prescribed Type of Planar Graphs With A Given Number of Vertices (1984) (20)
- Hypergraph list coloring and Euclidean Ramsey theory (2011) (19)
- OPTIMAL PREPROCESSING FOR S ANSWERING ON-LINE PRODUCT QUERIE (1987) (19)
- Constructing worst case instances for semidefinite programming based approximation algorithms (2001) (19)
- Non-constructive proofs in Combinatorics (2002) (19)
- Edge-disjoint cycles in regular directed graphs (1996) (19)
- The choice number of random bipartite graphs (1998) (19)
- Biased Coins and Randomized Algorithms (1989) (19)
- On the number of certain subgraphs contained in graphs with a given number of edges (1986) (19)
- Broadcast Throughput in Radio Networks: Routing vs. Network Coding (2012) (19)
- Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs (1994) (19)
- Solving Linear Systems through Nested Dissection (2010) (19)
- H-Free Graphs of Large Minimum Degree (2006) (18)
- The maximum size of a convex polygon in a restricted set of points in the plane (1989) (18)
- Subgraphs of large connectivity and chromatic number in graphs of large chromatic number (1987) (18)
- How Robust Is the Wisdom of the Crowds? (2015) (18)
- Packings with large minimum kissing numbers (1997) (18)
- Graph Powers (2002) (18)
- The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms (1988) (17)
- The longest cycle of a graph with a large minimal degree (1986) (17)
- High Degree Graphs Contain Large-Star Factors (2008) (17)
- Poisson approximation for non-backtracking random walks (2007) (17)
- Packing and covering dense graphs (1998) (17)
- Sign rank, VC dimension and spectral gaps (2014) (17)
- Sub-Ramsey numbers for arithmetic progressions (1989) (17)
- Palette Sparsification Beyond (Δ+1) Vertex Coloring (2020) (17)
- Hierarchical Clustering: a 0.585 Revenue Approximation (2020) (17)
- List-Decodable Zero-Rate Codes (2017) (17)
- Non-averaging Subsets and Non-vanishing Transversals (1999) (17)
- Approximate Maximum Parsimony and Ancestral Maximum Likelihood (2010) (17)
- Sparse universal graphs for bounded-degree graphs (2007) (17)
- Asynchronous threshold networks (1985) (17)
- Economical Graph Discovery (2014) (17)
- Breaking the rhythm on graphs (2008) (17)
- What is the furthest graph from a hereditary property (2008) (17)
- Set systems with no union of cardinality 0 modulom (1991) (16)
- Algebraic, Extremal and Metric Combinatorics, 1986: Some Recent Combinatorial Applications of Borsuk-Type Theorems (1988) (16)
- The chromatic number of random Cayley graphs (2013) (16)
- Choice-Memory Tradeoff in Allocations (2009) (16)
- Homomorphisms in Graph Property Testing (2006) (16)
- Testing Hereditary Properties of Ordered Graphs and Matrices (2017) (16)
- On partitions of discrete boxes (2002) (16)
- Hardness of edge-modification problems (2009) (16)
- Tight bounds for shared memory systems accessed by Byzantine processes (2002) (16)
- Homomorphisms in Graph Property Testing - A Survey (2005) (16)
- Admission control to minimize rejections and online set cover with repetitions (2005) (15)
- Large Sets of Nearly Orthogonal Vectors (1999) (15)
- Probabilistic methods in coloring and decomposition problems (1994) (15)
- Covering with Latin Transversals (1995) (15)
- Ascending waves (1989) (15)
- Uniform dilations (1992) (15)
- Duplication Distance to the Root for Binary Sequences (2016) (15)
- On Constant Time Approximation of Parameters of Bounded Degree Graphs (2010) (15)
- Induced subgraphs with distinct sizes (2009) (15)
- Coloring 2-colorable hypergraphs with a sublinear number of colors (1996) (15)
- Refining the Graph Density Condition for the Existence of Almost K-factors (1999) (15)
- The maximum number of disjoint pairs in a family of subsets (1985) (15)
- The Hat Guessing Number of Graphs (2018) (14)
- Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems (2011) (14)
- Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles (2019) (14)
- On the Edge-Expansion of Graphs (1997) (14)
- Optimal Monotone Encodings (2008) (14)
- Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213] (2007) (14)
- Probabilistic Methods in Extremal Finite Set Theory (2002) (14)
- On k-saturated graphs with restrictions on the degrees (1996) (14)
- T-choosability in Graphs (1998) (14)
- Closure Properties for Private Classification and Online Prediction (2020) (14)
- A graph-theoretic approach to multitasking (2016) (14)
- Sums and products along sparse graphs (2009) (14)
- Decomposition of the completer-graph into completer-partiter-graphs (1986) (13)
- Visions in mathematics : GAFA 2000 special volume (2010) (13)
- A Theory of PAC Learnability of Partial Concept Classes (2021) (13)
- Optimal induced universal graphs for bounded-degree graphs (2016) (13)
- The Acyclic Orientation Game on Random Graphs (1995) (13)
- Typical Peak Sidelobe Level of Binary Sequences (2008) (13)
- Matrix sparsification and nested dissection over arbitrary fields (2013) (13)
- Bundling Attacks in Judgment Aggregation (2013) (13)
- Covering a square by small perimeter rectangles (1986) (13)
- Sizes of Induced Subgraphs of Ramsey Graphs (2009) (13)
- Parallel comparison algorithms for approximation problems (1988) (13)
- On the Degree, Size, and Chromatic Index of a Uniform Hypergraph (1997) (12)
- The Algorithmic Aspects of the Regularity Lemma (Extended Abstract) (1992) (12)
- Can a Graph Have Distinct Regular Partitions? (2007) (12)
- Edge-statistics on large graphs (2018) (12)
- Differential pricing with inequity aversion in social networks (2013) (12)
- The Grothendieck constant of random and pseudo-random graphs (2008) (12)
- Separation Dimension of Bounded Degree Graphs (2014) (12)
- Correction: Basic Network Creation Games (2014) (12)
- Algorithmic construction of sets for (2006) (12)
- Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover (2007) (11)
- Problems and results in Extremal Combinatorics – III (2016) (11)
- Subgraphs with a large cochromatic number (1997) (11)
- Efficient arithmetic regularity and removal lemmas for induced bipartite patterns (2018) (11)
- Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues (2017) (11)
- The 123 Theorem and Its Extensions (1995) (11)
- Bayesian ignorance (2010) (11)
- Increasing the chromatic number of a random graph (2010) (11)
- The number of sumsets in a finite field (2010) (11)
- Tracing Many Users With Almost No Rate Penalty (2007) (11)
- Adversarial Leakage in Games (2013) (11)
- Improved parallel approximation of a class of integer programming problems (1997) (11)
- Eigenvalues of K1,k ‐Free Graphs and the Connectivity of Their Independence Complexes (2016) (11)
- String Quartets in Binary (2000) (11)
- Linear Hashing (1997) (10)
- Multi-Node Graphs: A Framework for Multiplexed Biological Assays (2006) (10)
- Bisection of trees and sequences (1993) (10)
- Is linear hashing good? (1997) (10)
- Fair representation by independent sets (2016) (10)
- Many cliques in $H$-free subgraphs of random graphs (2016) (10)
- The smallestn-uniform hypergraph with positive discrepancy (1987) (10)
- The Number of f-Matchings in Almost Every Tree is a Zero Residue (2010) (10)
- Typical and Extremal Aspects of Friends-and-Strangers Graphs (2020) (10)
- Large Nearly Regular Induced Subgraphs (2007) (10)
- Testing of bipartite graph properties ∗ (2005) (10)
- The CW-Inequalities for Vectors in l1 (1990) (9)
- More on the Bipartite Decomposition of Random Graphs (2014) (9)
- Discrepancy Games (2005) (9)
- Splitting necklaces and measurable colorings of the real line (2008) (9)
- Probabilistic proofs of existence of rare events (1989) (9)
- Equireplicate Balanced Binary Codes for Oligo Arrays (2001) (9)
- Ramsey graphs cannot be defined by real polynomials (1990) (9)
- Tracing a single user (2006) (9)
- Scale-sensitive Dimensions, Uniform Convergence, (1993) (9)
- Bipartite subgraphs (Final Version; appeared in Combinatorica 16 (1996), 301-311.) (1996) (9)
- Refelection sequences (1989) (9)
- High-girth near-Ramanujan graphs with localized eigenvectors (2019) (9)
- Multicolored matchings in hypergraphs (2010) (9)
- Transmitting in the n-Dimensional Cube (1992) (9)
- Bipartite decomposition of random graphs (2014) (8)
- Recent Trends In Combinatorics: Combinatorial Nullstellensatz (2001) (8)
- On the Maximum Quartet Distance between Phylogenetic Trees (2015) (8)
- Partitioning a rectangle into small perimeter rectangles (1992) (8)
- Partitioning multi-dimensional sets in a small number of "uniform" parts (2005) (8)
- Divisible subdivisions (2020) (8)
- How to Put Through Your Agenda in Collective Binary Decisions (2013) (8)
- Uniformly cross intersecting families (2006) (8)
- Coins with Arbitrary Weights (1997) (8)
- Finding an Approximate Maximum (1989) (8)
- Sums, products, and ratios along the edges of a graph (2018) (8)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (2007) (8)
- On the discrepancy of combinatorial rectangles (2002) (8)
- A Ramsey‐type problem and the Turán numbers * (2002) (8)
- On Active and Passive Testing (2013) (8)
- Matching Nuts and Bolts Faster (1995) (8)
- Short odd cycles in 4-chromatic graphs (1999) (8)
- Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon (2006) (7)
- Extremal and Probabilistic Combinatorics (2006) (7)
- Additive Approximation of Generalized Turán Questions (2018) (7)
- The de Bruijn–Erdős theorem for hypergraphs (2010) (7)
- Maximizing the Number of Nonnegative Subsets (2013) (7)
- On the kernel of intersecting families (1987) (7)
- Monochromatic directed walks in arc-colored directed graphs (1987) (7)
- Clique coloring of dense random graphs (2016) (7)
- Triangle-free graphs with large chromatic numbers (2000) (7)
- Corruption Detection on Networks (2015) (7)
- Geometric and Functional Analysis Uniform Dilations (2005) (7)
- Every H -decomposition of K n has a Nearly Resolvable Alternative. (2000) (7)
- Intersecting Systems (1997) (7)
- On the Compatibility of Quartet Trees (2014) (7)
- Restricted Integer Partition Functions (2012) (7)
- The Turán number of sparse spanning graphs (2013) (7)
- The Cover Number of a Matrix and its Algorithmic Applications (2014) (7)
- Families in Which Disjoint Sets Have Large Union (1989) (7)
- Regular ArticleAcyclic Matchings (1996) (6)
- Linear Boolean Classification, Coding and the Critical Problem (2014) (6)
- Stability‐type results for hereditary properties (2009) (6)
- A note on general sliding window processes (2014) (6)
- Vertex transversals that dominate (1996) (6)
- Sparse Balanced Partitions and the Complexity of Subgraph Problems (2011) (6)
- Extremal Problems Concerning Transformations of the Set of Edges of the Complete Graph (1986) (6)
- Dense uniform hypergraphs have high list chromatic number (2012) (6)
- A Ramsey-type result for the hypercube (2006) (6)
- Asymmetric List Sizes in Bipartite Graphs (2020) (6)
- A note on euclidean Ramsey theory and a construction of Bourgain (1991) (6)
- Paul Erdős and Probabilistic Reasoning (2013) (6)
- Uniformly Discrete Forests with Poor Visibility (2017) (6)
- Dominance Solvability in Random Games (2021) (6)
- H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups (2017) (6)
- Modular Orientations of Random and Quasi-Random Regular Graphs (2011) (6)
- Problems and results in Extremal Combinatorics -- IV (2020) (6)
- On Rigid Matrices and U-Polynomials (2013) (6)
- Short Certificates for Tournaments (1997) (6)
- Inverse problems for minimal complements and maximal supplements (2020) (6)
- List Ramsey numbers (2019) (6)
- Boosting simple learners (2020) (6)
- Discrete Kakeya-type problems and small bases (2007) (5)
- Out‐colourings of digraphs (2017) (5)
- A Note on Degenerate and Spectrally Degenerate Graphs (2013) (5)
- The runsort permuton (2021) (5)
- On the Complexity of Radio Communication (Extended Abstract) (1989) (5)
- Disjoint Systems (1995) (5)
- On k -saturated graphs with restrictions on the degrees (1996) (5)
- On the intersection of edges of a geometric graph by straight lines (1986) (5)
- Playing to Retain the Advantage (2009) (5)
- Testing Equality in Communication Graphs (2016) (5)
- Efficient Removal Lemmas for Matrices (2016) (5)
- Codes And Xor Graph Products (2007) (5)
- Privileged users in zero-error transmission over a noisy channel (2006) (5)
- Long cycles in critical graphs (2000) (5)
- Poker, Chance and Skill (2007) (5)
- Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap (1997) (5)
- Small Sample Spaces Cannot Fool Low Degree Polynomials (2008) (5)
- C O ] 1 2 M ar 2 02 0 Unitary signings and induced subgraphs of Cayley graphs of Z n 2 (2020) (5)
- Minimizing the Number of Carries in Addition (2012) (5)
- Separation dimension and sparsity (2018) (5)
- Improved Parallel Approximation of a Class of Integer Programming Programming Problems (1996) (5)
- Triangles in H-free graphs (2014) (5)
- Unitary Signings and Induced Subgraphs of Cayley Graphs of Z2 (2020) (5)
- Progressions in Sequences of Nearly Consecutive Integers (1998) (5)
- Efficient Splitting of Measures and Necklaces (2020) (5)
- Combinatorial Reasoning in Information Theory (2009) (5)
- Algebraic and Probabilistic Methods in Discrete Mathematics (2000) (5)
- Random time transformation analysis of Covid19 2020 (2020) (5)
- Legitimate colorings of projective planes (1989) (4)
- A Turanlike Neighborhood Condition and Cliques in Graphs (1989) (4)
- Dynamics of Evolving Social Groups (2016) (4)
- Comparison-sorting and selecting in totally monotone matrices (1992) (4)
- Lovász, Vectors, Graphs and Codes (2019) (4)
- An Application of Set Theory to Coding Theory (1989) (4)
- Efficient Splitting of Necklaces (2021) (4)
- On graphs with subgraphs having large independence numbers (2007) (4)
- On the product dimension of clique factors (2019) (4)
- The Value of Ignorance about the Number of Players (2013) (4)
- Ramsey graphs contain many distinct induced subgraphs (1991) (4)
- Approximating sparse binary matrices in the cut-norm (2015) (4)
- Another Abstraction of the Erdös-Szekeres Happy End Theorem (2010) (4)
- Not All Graphs are Segment T-graphs (1990) (4)
- Admission control to minimize rejections and online set cover with repetitions (2009) (4)
- Brief Announcement: Sharing Memory in a Self-stabilizing Manner (2010) (4)
- Drawing outerplanar graphs using three edge lengths (2012) (4)
- Optimal compression of approximate Euclidean distances (2016) (4)
- Local correction of juntas (2011) (4)
- Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs (1999) (4)
- Generalized sum graphs (1992) (4)
- Mixing properties of colorings of the $\mathbb{Z}^d$ lattice (2019) (4)
- EveryH-decomposition ofKnhas a Nearly Resolvable Alternative (2000) (4)
- Sure monochromatic subset sums (1996) (4)
- A note on subdigraphs of digraphs with large outdegrees (1984) (4)
- Isoperimetry, stability, and irredundance in direct products (2019) (4)
- Universality, Tolerance, Chaos and Order (2010) (3)
- Removal Lemmas for Matrices (2016) (3)
- Multitasking Capacity: Hardness Results and Improved Constructions (2018) (3)
- Comparable pairs in families of sets (2014) (3)
- A propagation process on Cayley graphs (2008) (3)
- Packing of partial designs (1994) (3)
- Factor d-domatic colorings of graphs (2003) (3)
- TR-2003-010 Asymptotically tight bounds for some multicolored Ramsey numbers (2002) (3)
- The minrank of random graphs over arbitrary fields (2018) (3)
- Edge Colouring with Delays (2007) (3)
- The Basic Method (2004) (3)
- Perfect Hashing and Probability (1994) (3)
- Size and Degree Anti-Ramsey Numbers (2015) (3)
- On Neciporuk's Theorem for Branching Programs (1989) (3)
- Random Sampling and Max-SNP problems (2002) (3)
- Economical Covers with Geometric Applications (2003) (3)
- The Asymmetric Matrix Partition Problem (2013) (3)
- Counting contours on trees (2016) (3)
- Mixing properties of colourings of the ℤd lattice (2020) (3)
- Regular graphs whose subgraphs tend to be acyclic (2006) (3)
- The complexity of the outer face in arrangements of random segments (2008) (3)
- Economical coverings of sets of lattice points (1991) (3)
- The diameter of the uniform spanning tree of dense graphs (2020) (3)
- Unitary signings and induced subgraphs of Cayley graphs of $\mathbb{Z}_2^{n}$ (2020) (3)
- Many $T$ copies in $H$-free subgraphs of random graphs (2016) (3)
- Generalized hashing and applications to digital fingerprinting (2002) (3)
- The Second Moment (2004) (3)
- Redesigning the Israeli Medical Internship Match (2018) (2)
- Testing perfection is hard (2011) (2)
- Stability-type results for hereditary properties (2009) (2)
- Revenue and Reserve Prices in a Probabilistic Single Item Auction (2015) (2)
- Identifying the Deviator (2022) (2)
- Paul Erdős and the Probabilistic Method (2013) (2)
- Chasing robbers on random geometric graphs - An alternative approach (2014) (2)
- ε-discrepancy sets and their applications for interpolation of sparse polynomials (2002) (2)
- A Non-linear Lower Bound for Planar Epsilon-nets (2011) (2)
- Learning a Hidden Matching Combinatorial Identification of Hidden Matchings with Applications to (2002) (2)
- Sign rank versus Vapnik-Chervonenkis dimension (2017) (2)
- On (ε,k)-min-wise independent permutations (2007) (2)
- Local Correction with Constant Error Rate (2012) (2)
- Private and Online Learnability Are Equivalent (2022) (2)
- Dynamics of Evolving Social Groups (2019) (2)
- Equilateral Sets in ... (2002) (2)
- Random necklaces require fewer cuts (2021) (2)
- Distributed Corruption Detection in Networks (2015) (2)
- Traces of hypergraphs (2018) (2)
- An isoperimetric inequality in the universal cover of the punctured plane (2008) (2)
- Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa-Szemerédi Graphs and Hypergraphs (2020) (2)
- On the duplication distance of binary strings (2016) (2)
- Palette Sparsification Beyond $(\Delta+1)$ Vertex Coloring (2020) (2)
- On A Problem of Erdos and Turn and Some Related Results (1995) (2)
- Appendix A: Bounding of Large Deviations (2004) (2)
- Complete minors and average degree -- a short proof (2022) (2)
- The probalistic method (2000) (2)
- Ramsey-nice families of graphs (2017) (2)
- A Ramsey-type problem and the Turán numbers (2002) (1)
- On a Problem in Shuffling (2000) (1)
- Linearity of Expectation (2004) (1)
- Local rainbow colorings (2011) (1)
- Finding simple paths and cycles in graphs ∗ ( Extended Abstract ) (2002) (1)
- Induced Universal Hypergraphs (2019) (1)
- Testing Low-Degree Polynomials over (2004) (1)
- Spanning subgraphs of Random Graphs ( A research problem ) (1992) (1)
- Fair Partitions (2021) (1)
- On sums of monotone random integer variables (2021) (1)
- inear Time Erasure- esilient ith Nearly Optimal Recovery (1996) (1)
- Derandomization Via Small Sample Spaces (Abstract) (1996) (1)
- Reliable communication over highly connected noisy networks (2017) (1)
- The Local Lemma (2004) (1)
- The Price of Bounded Preemption (2018) (1)
- Sum of Us: Truthful Self-Selection (2009) (1)
- On a Problem of E Rd} Os and Turr an and Some Related Results (1995) (1)
- Practically Stabilizing Atomic Memory (2010) (1)
- Permutations Resilient to Deletions (2018) (1)
- Recursive bounds for perfect hashing (2001) (1)
- The Brunn--Minkowski Inequality and Nontrivial Cycles in the Discrete Torus (2010) (1)
- Economical Elimination of Cycles in the Torus (2009) (1)
- Random Cayley Graphs and Expanders (Abstract) (1992) (1)
- On Short Edges in Straight-Edge Triangulations. (1995) (1)
- High girth augmented trees are huge (2016) (1)
- The average size of an independent set in graphs with a given chromatic number (1988) (1)
- Near-sunflowers and focal families (2020) (1)
- Regressions and monotone chains II: The poset of integer intervals (1987) (1)
- Eigenvalues, geometric expanders and sorting in rounds (1985) (1)
- Structured Codes of Graphs (2022) (1)
- On sums and products along the edges, II (2020) (1)
- Rank of Matrices with Entries from a Multiplicative Group (2021) (1)
- Short Certiicates for Tournaments (1997) (1)
- The Geometry of Coin-Weighing Problems (Extended Abstract) (1996) (1)
- A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract) (1991) (1)
- Even edge colorings of a graph (1985) (1)
- Counting Dope Matrices (2022) (1)
- Short certiflcates for tournaments (1997) (1)
- D S ] 2 J ul 2 02 0 Palette Sparsification Beyond ( ∆ + 1 ) Vertex Coloring ∗ (2020) (1)
- IDENTIFICATION OF LEADING RESEARCH CONTRIBUTORS WITH NOVEL PERFORMANCE METRICS USING ACADEMIC SOCIAL NETWORK (2017) (1)
- The $\epsilon$-$t$-Net Problem (2020) (1)
- The de Bruijn-Erdý os theorem for hypergraphs (2012) (1)
- Edge Coloring with Delays (2004) (1)
- Hitting all maximum independent sets (2021) (1)
- Approximation of Uniform and Product Distributions , k-Restrictions , Group Testing (2012) (0)
- Spanning trees with few non-leaves (2022) (0)
- Constructions of Depth-2 Majority Circuits for Comparison and Addition using Linear Block Codes (1993) (0)
- The Price of Bounded Preemption (2021) (0)
- Invertibility of digraphs and tournaments (2022) (0)
- Visions in mathematics : towards 2000 : GAFA special volume (2000) (0)
- Erratum to “Resolution enhancement in MRI” [Magn Reson Imaging 24 (2006) 133–154] (2011) (0)
- Cats in cubes (2022) (0)
- Local Correction with Constant Error Rate (2013) (0)
- CPC volume 4 issue 2 Cover and Front matter (1995) (0)
- On Some Isoperimetric Inequality In The Universal Covering Space Of The Punctured Plane (2009) (0)
- J ul 2 01 0 Practically Stabilizing Atomic Memory ( Extended Abstract ) (2010) (0)
- 移動型敵対者に対する「検証可能秘密共有」(VSS)の効率的動的再共有 (1995) (0)
- Visions in Mathematics Towards 2000: GAFA 2000 Special Volume, Part Ipp. 1-453 (2010) (0)
- CPC volume 5 issue 2 Cover and Front matter (1996) (0)
- A Coding Theory Bound and Zero-Sum Square Matrices (2003) (0)
- Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits (2020) (0)
- A Lower Bound on the Expected Length of 1-1 Codes (2002) (0)
- On graphs with subgraphs of large independence numbers (2007) (0)
- MIS on the fly (2011) (0)
- 4 Concluding Remarks Acknowledgements (1994) (0)
- High degree graphs contain large-star factors Dedicated to (2010) (0)
- On a random model of forgetting (2022) (0)
- Arithmetic Progressions in Sumsets of Sparse Sets (2021) (0)
- CPC volume 3 issue 1 Cover and Front matter (1994) (0)
- Small (weighted) families of k-wise independent permutations (2011) (0)
- Guessing Se rets EÆ iently via List De oding ( (2007) (0)
- The eigenvalues of random symmetric matrices are highly concentrated DRAFT (2002) (0)
- Erratum: Finding and counting given length cycles (2015) (0)
- Realizing tournaments by orderings (2002) (0)
- A Characterization of Easily Testable Induced Subgraphs Extended Abstract (2004) (0)
- Ramsey Graphs Cannot Be Defined by Real Pol y n o m i a Is (1990) (0)
- CPC volume 4 issue 1 Cover and Front matter (1995) (0)
- EXPLICIT UNIQUE-NEIGHBOR EXPANDERS Extended Abstract (2002) (0)
- Probabilistic Combinatorics: Recent Progress and New Frontiers (2005) (0)
- Adversarial Leakage in Games | SIAM Journal on Discrete Mathematics | Vol. 27, No. 1 | Society for Industrial and Applied Mathematics (2013) (0)
- Fe b 20 15 Online Learning with Feedback Graphs : Beyond (2018) (0)
- 1 Derandomizing the Replacment Paths Algorithm of Roditty and Zwick [ 37 (2019) (0)
- Addendum: Discussions at the Dead Sea (2000) (0)
- Logarithmically larger deletion codes of all distances (2022) (0)
- C O ] 2 1 N ov 2 01 8 Additive Approximation of Generalized Turán Questions (2018) (0)
- Space-Efficient Local Computation Algorithms Citation (2011) (0)
- The M a x i m u m Size of a Convex Polygon in a Restricted Set of Points in the Plane * (0)
- Sums of subsequences modulo prime powers (1988) (0)
- The rate of Index Coding (2007) (0)
- Am : An Interactive Recommendation System (0)
- TRANSMISSION TO PRIORITIZING RECEIVERS (2017) (0)
- The ε-t-Net Problem (2020) (0)
- Disjoint Systems (Extended Abstract) (1993) (0)
- Explicit Expanders of Every Degree and Size (2021) (0)
- Feasible Schedules for Rotating Transmissions (2006) (0)
- Induced subgraphs with distinct size or order (2007) (0)
- Additive Approximation for Edge-Deletion Problems (Abstract) (2006) (0)
- EQUILATERAL SETS IN l (2003) (0)
- OF A SET OF INTEGERS (1988) (0)
- Turán graphs with bounded matching number (2022) (0)
- Cap Set Bounds and Matrix Multiplication (2013) (0)
- On Rigid Matrices and Subspace Polynomials (2012) (0)
- Hitting a prime in 2.43 dice rolls (on average) (2022) (0)
- CPC volume 3 issue 3 Cover and Front matter (1994) (0)
- How to Put Through Change in Collective Binary Decisions (2013) (0)
- Partitioning all k-subsets into r-wise intersecting families (2021) (0)
- A probabilistic variant of Sperner 's theorem and of maximal r-cover free families (2018) (0)
- The Poisson Paradigm (2004) (0)
- Bipartite Subgraphs (final Version; to Appear in Combinatorica) (1996) (0)
- Basic Network Creation Games Citation (2010) (0)
- Subgraphs of Large Connectivity and Chromatic of Chromatic Number in Large Number (1987) (0)
- Inst I tute f o r Ma t he M a t Ics and I ts a ppl Ic a t IonsUNI v ERSIT y of M INNE S o T A (2012) (0)
- Problem Collection of the DIMANET Mátraháza Workshop, 22–28 October 1995 (1999) (0)
- A 16 RESTRICTED INTEGER PARTITION FUNCTIONS (2014) (0)
- 1 . 1 Littlestone dimension vs . approximate private learning (2019) (0)
- Large cliques and independent sets all over the place (2020) (0)
- Foundations of Network Creation Games (2009) (0)
- 5. Conclusion and Open Problems Step 4.3 for Each Internal Node Build Tablem , 1 for Array M in M , Level of the Tree Number of Children per Node (0)
- Randomness and Pseudo-Randomness in Discrete Mathematics (2002) (0)
- On Graphs, Arithmetic Progressions and Communication (2012) (0)
- eomet Disjoint Edges in Geometric Graphs (0)
- CPC volume 4 issue 4 Cover and Front matter (1995) (0)
- Revenue and Reserve Prices in a Probabilistic Single Item Auction (2015) (0)
- CPC volume 1 issue 2 Cover and Front matter (1992) (0)
- The Birthday Paradox for Non-Backtracking Random Walks (2009) (0)
- Gregory gutin and graph optimization problems (2018) (0)
- Adding distinct residue classes modulo a prime (DRAFT) (2002) (0)
- Transversal Numbers for Hypergraphs Arising inGeometryNoga (2001) (0)
- IV.19 Extremal and Probabilistic Combinatorics (2010) (0)
- Competitive distributed scheduling (draft: do not circulate) (2002) (0)
- # A 16 INTEGERS 13 ( 2013 ) RESTRICTED INTEGER PARTITION FUNCTIONS (0)
- Render(m(v)) /* Generate Rendering Sequence for Mesh M on Vertex Set V * (2011) (0)
- Appendix for “ Dominance Solvability in Random Games ” by (2021) (0)
- Regular Honest Graphs, Isoperimetric Number, and Bisecting Weighted Graphs (2002) (0)
- Limitations on regularity lemmas for clustering graphs (2021) (0)
- Degrees, sizes and chromatic indices of uniform hypergraphs (2002) (0)
- Modular orientations of random regular graphs (2010) (0)
- 12 : 2 Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles 1 (2019) (0)
- The success probability in Levine's hat problem, and independent sets in graphs (2022) (0)
- Beeping an MIS (2011) (0)
- On graphs and algebraic graphs that do not contain cycles of length 4 (2011) (0)
- On (ε,k)‐min‐wise independent permutations (2007) (0)
- Local Correction of Boolean Functions (2011) (0)
- CPC volume 1 issue 3 Cover and Front matter (1992) (0)
- Threshold-gates, coin-weighing and indecomposable hypergraphs (DRAFT) (2002) (0)
- Packing Ferrers Shapes (1998) (0)
- Combinatorics Probability and Computing: Introduction (2009) (0)
- Introduction (2009) (0)
- Sums and progressions (DRAFT) (2002) (0)
- CPC volume 2 issue 4 Cover and Front matter (1993) (0)
- C O ] 1 3 O ct 2 01 1 Testing perfection is hard (2021) (0)
- Additive Patterns in Multiplicative Subgroups (2014) (0)
- Tight Estimates for Eigenvalues of Regular Graphs (2004) (0)
- On the Density of Sin's of V]i~ctors* (1982) (0)
- C O ] 1 0 N ov 2 00 7 Discrete Kakeya-type problems and small bases (2008) (0)
- D C ] 1 0 Ju n 20 11 MIS on the fly ( Extended Abstract ) (2011) (0)
- Beeping a maximal independent set (2012) (0)
- Largest subgraph from a hereditary property in a random graph (2022) (0)
- List coloring and Euclidean Ramsey Theory (2011) (0)
- Linear Time Erasure Codes With Nearly Optimal (Extended Abstract) (1995) (0)
- Martingales and Tight Concentration (2004) (0)
- Size and Degree Anti-Ramsey Numbers (2015) (0)
- CPC volume 2 issue 3 Cover and Front matter (1993) (0)
- Drawing outerplanar graphs (2013) (0)
- A ug 2 00 6 Graph powers , Delsarte , Hoffman , Ramsey and Shannon (2008) (0)
- The Erdös–Rényi Phase Transition (2010) (0)
- Implicit representation of sparse hereditary families (2022) (0)
- Local and global colorability of graphs (2014) (0)
- Introduction (2010) (0)
- Asymptotically optimal induced universal graphs (2017) (0)
- Long non-crossing configurations in the plane ( Draft ) (2002) (0)
- Broadcast Transmission to Prioritizing Receivers (2017) (0)
- CPC volume 2 issue 1 Cover and Front matter (1993) (0)
- Universality and Tolerance at the Turn of the Millennium (Extended Abstract) (1985) (0)
- Counting contours on trees (2016) (0)
- THE HEBREW UNIVERSITY OF JERUSALEM (2004) (0)
- Guessing secrets efficiently via list decoding (extended abstract) (2002) (0)
- On Rigid Matrices and U-Polynomials (2015) (0)
- NOTE A NOWHERE-ZERO POINT IN LINEAR MAPPINGS (1989) (0)
- CPC volume 2 issue 2 Cover and Front matter (1993) (0)
- PROBLEM SECTION Splitting digraphs (2006) (0)
- Graph Property Testing (2010) (0)
- List coloring and Euclidean Ramsey Theory (Abstract) (2011) (0)
- C O ] 2 4 M ay 2 01 9 On the product dimension of clique factors (2019) (0)
- STAR ARBOI ~ ICITY 379 3 Graphs with Large Star Arboricity (1992) (0)
- On sunflowers and matrix multiplication (2013) (0)
- On Generalized Regularity (2019) (0)
- CPC volume 4 issue 3 Cover and Front matter (1995) (0)
- Stabilizing Sharing Memory Robustly in Message Passing ( Extended Abstract ) (2010) (0)
- Priority Transmission (2016) (0)
- Homomorphisms in Graph Property Testing - A Survey Dedicated to Jaroslav Ne set ril on the occasion of his 60 th birthday (2005) (0)
- Irregular subgraphs (2021) (0)
- Codes, Games and Entropy (2004) (0)
- MAX CUT and the smallest eigenvalue ( Extended abstract ) (2002) (0)
- D S ] 8 F eb 2 00 7 Parameterized Algorithms for Directed Maximum Leaf Problems ( Extended Abstract ) (2007) (0)
- Combinatorics, Geometry and Probability: Threshold Functions for H -factors (1997) (0)

This paper list is powered by the following services:

Noga Alon is affiliated with the following schools:

This website uses cookies to enhance the user experience. Read the Privacy Policy for more.

Subscribe To Newsletter?Yes!