Search results for "Noga Alon"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Noga Alon, Hao Huang, Benny Sudakov	Nonnegative k-sums, fractional covers, and probability of small deviations.	J. Comb. Theory, Ser. B	2012	DBLP DOI BibTeX RDF
1	Noga Alon, Peter Frankl, Hao Huang, Vojtech Rödl, Andrzej Rucinski, Benny Sudakov	Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels.	J. Comb. Theory, Ser. A	2012	DBLP DOI BibTeX RDF
1	Noga Alon, Amit Weinstein	Local correction of juntas.	Inf. Process. Lett.	2012	DBLP DOI BibTeX RDF
1	Noga Alon, Alexandr V. Kostochka	Dense uniform hypergraphs have high list chromatic number.	Discrete Mathematics	2012	DBLP DOI BibTeX RDF
1	Noga Alon	A Non-linear Lower Bound for Planar Epsilon-nets.	Discrete & Computational Geometry	2012	DBLP DOI BibTeX RDF
1	Noga Alon, Ronitt Rubinfeld, Shai Vardi, Ning Xie	Space-efficient local computation algorithms.	SODA	2012	DBLP BibTeX RDF
1	Noga Alon, Iftah Gamzu, Moshe Tennenholtz	Optimizing budget allocation among channels and influencers.	WWW	2012	DBLP DOI BibTeX RDF
1	Noga Alon, Ankur Moitra, Benny Sudakov	Nearly complete graphs decomposable into large induced matchings and their applications.	STOC	2012	DBLP DOI BibTeX RDF
1	Noga Alon, József Balogh, Béla Bollobás, Robert Morris	The structure of almost all graphs in a hereditary property.	J. Comb. Theory, Ser. B	2011	DBLP DOI BibTeX RDF
1	Noga Alon, Amir Shpilka, Chris Umans	On Sunflowers and Matrix Multiplication.	Electronic Colloquium on Computational Complexity (ECCC)	2011	DBLP BibTeX RDF
1	Noga Alon, Shachar Lovett	Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions.	Electronic Colloquium on Computational Complexity (ECCC)	2011	DBLP BibTeX RDF
1	Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo	Solving MAX-r-SAT Above a Tight Lower Bound.	Algorithmica	2011	DBLP DOI BibTeX RDF
1	Noga Alon, Abbas Mehrabian	On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game.	Electr. J. Comb.	2011	DBLP BibTeX RDF
1	Noga Alon, Simi Haber, Michael Krivelevich	The Number of f-Matchings in Almost Every Tree is a Zero Residue.	Electr. J. Comb.	2011	DBLP BibTeX RDF
1	Noga Alon, Alexandr V. Kostochka	Hypergraph list coloring and Euclidean Ramsey theory.	Random Struct. Algorithms	2011	DBLP DOI BibTeX RDF
1	Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle	Many Random Walks Are Faster Than One.	Combinatorics, Probability & Computing	2011	DBLP DOI BibTeX RDF
1	Noga Alon, Pawel Pralat	Modular Orientations of Random and Quasi-Random Regular Graphs.	Combinatorics, Probability & Computing	2011	DBLP DOI BibTeX RDF
1	Yehuda Afek, Noga Alon, Ziv Bar-Joseph	MIS on the fly	CoRR	2011	DBLP BibTeX RDF
1	Noga Alon, Amit Weinstein	Local Correction of Boolean Functions	CoRR	2011	DBLP BibTeX RDF
1	Noga Alon, Jacob Fox	Testing perfection is hard	CoRR	2011	DBLP BibTeX RDF
1	Noga Alon, Ankur Moitra, Benny Sudakov	Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications	CoRR	2011	DBLP BibTeX RDF
1	Noga Alon, Ronitt Rubinfeld, Shai Vardi, Ning Xie	Space-efficient Local Computation Algorithms	CoRR	2011	DBLP BibTeX RDF
1	Noga Alon, Dániel Marx	Sparse Balanced Partitions and the Complexity of Subgraph Problems.	SIAM J. Discrete Math.	2011	DBLP DOI BibTeX RDF
1	Noga Alon, H. Tracy Hall, Christian Knauer, Rom Pinchasi, Raphael Yuster	On graphs and algebraic graphs that do not contain cycles of length 4.	Journal of Graph Theory	2011	DBLP DOI BibTeX RDF
1	Noga Alon	List coloring and Euclidean Ramsey Theory.	CCCG	2011	DBLP BibTeX RDF
1	Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn	Beeping a Maximal Independent Set.	DISC	2011	DBLP DOI BibTeX RDF
1	Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz	Economical Graph Discovery.	ICS	2011	DBLP BibTeX RDF
1	Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil	Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems.	SSS	2011	DBLP DOI BibTeX RDF
1	Noga Alon, Felix A. Fischer, Ariel D. Procaccia, Moshe Tennenholtz	Sum of us: strategyproof selection from the selectors.	TARK	2011	DBLP DOI BibTeX RDF
1	Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz	A note on competitive diffusion through social networks.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz	Walking in circles.	Discrete Mathematics	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Ehsan Chiniforooshan, Vasek Chvátal, François Genest	Another Abstraction of the Erdös-Szekeres Happy End Theorem.	Electr. J. Comb.	2010	DBLP BibTeX RDF
1	Noga Alon, Dan Hefetz, Michael Krivelevich	Playing to Retain the Advantage.	Combinatorics, Probability & Computing	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Béla Bollobás	Introduction.	Combinatorics, Probability & Computing	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Paul H. Edelman	The inverse Banzhaf problem.	Social Choice and Welfare	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Shai Gutner	Balanced families of perfect hash functions and their applications.	ACM Transactions on Algorithms	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz	Strategyproof Approximation of the Minimax on Networks.	Math. Oper. Res.	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Gradinariu, Sébastien Tixeuil	Practically Stabilizing Atomic Memory	CoRR	2010	DBLP BibTeX RDF
1	Noga Alon, Ohad N. Feldheim	The Brunn--Minkowski Inequality and Nontrivial Cycles in the Discrete Torus.	SIAM J. Discrete Math.	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport	Approximate Maximum Parsimony and Ancestral Maximum Likelihood.	IEEE/ACM Trans. Comput. Biology Bioinform.	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Sonny Ben-Shimon, Michael Krivelevich	A note on regular Ramsey graphs.	Journal of Graph Theory	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht	Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions.	SIAM J. Comput.	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Simon Litsyn, Alexander Shpunt	Typical peak sidelobe level of binary sequences.	IEEE Transactions on Information Theory	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo	Solving MAX-r-SAT Above a Tight Lower Bound.	SODA	2010	DBLP BibTeX RDF
1	Noga Alon	On Constant Time Approximation of Parameters of Bounded Degree Graphs.	Property Testing	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Gradinariu, Sébastien Tixeuil	Brief Announcement: Sharing Memory in a Self-stabilizing Manner.	DISC	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Erik D. Demaine, MohammadTaghi Hajiaghayi, Tom Leighton	Basic network creation games.	SPAA	2010	DBLP DOI BibTeX RDF	routing, nash equilibrium, network design, price of anarchy
1	Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz	Bayesian ignorance.	PODC	2010	DBLP DOI BibTeX RDF	local vs. global view, network cost sharing, bayesian games
1	Noga Alon, Eric Blais	Testing Boolean Function Isomorphism.	APPROX-RANDOM	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz	Adversarial Leakage in Games.	ICS	2010	DBLP BibTeX RDF
1	Noga Alon	Voting Paradoxes.	COLT	2010	DBLP BibTeX RDF
1	Noga Alon	A Non-linear Lower Bound for Planar Epsilon-Nets.	FOCS	2010	DBLP DOI BibTeX RDF
1	Noga Alon, Raphael Yuster	Solving Linear Systems through Nested Dissection.	FOCS	2010	DBLP DOI BibTeX RDF
1	Dan Hefetz, Noga Alon, Michael Krivelevich	Playing to retain the advantage.	Electronic Notes in Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Shai Gutner	Balanced Hashing, Color Coding and Approximate Counting.	Electronic Colloquium on Computational Complexity (ECCC)	2009	DBLP BibTeX RDF
1	Noga Alon, Uri Stav	Hardness of edge-modification problems.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Shai Gutner	Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.	Algorithmica	2009	DBLP DOI BibTeX RDF	H-minor-free graphs, Degenerated graphs, Dominating set problem, Finding an induced cycle, Fixed-parameter tractable algorithms
1	Noga Alon, Alexandr V. Kostochka	Induced subgraphs with distinct sizes.	Random Struct. Algorithms	2009	DBLP DOI BibTeX RDF
1	Noga Alon	Economical Elimination of Cycles in the Torus.	Combinatorics, Probability & Computing	2009	DBLP DOI BibTeX RDF
1	Noga Alon	Perturbed Identity Matrices Have High Rank: Proof and Applications.	Combinatorics, Probability & Computing	2009	DBLP DOI BibTeX RDF
1	Noga Alon, József Balogh, Alexandr V. Kostochka, Wojciech Samotij	Sizes of Induced Subgraphs of Ramsey Graphs.	Combinatorics, Probability & Computing	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Béla Bollobás	Introduction.	Combinatorics, Probability & Computing	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Yossi Azar, Shai Gutner	Admission control to minimize rejections and online set cover with repetitions.	ACM Transactions on Algorithms	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Eyal Lubetzky	Uniformly cross intersecting families.	Combinatorica	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi, Bettina Speckmann, Philipp Zumstein	Polychromatic Colorings of Plane Graphs.	Discrete & Computational Geometry	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Felix A. Fischer, Ariel D. Procaccia, Moshe Tennenholtz	Sum of Us: Strategyproof Selection from the Selectors	CoRR	2009	DBLP BibTeX RDF
1	Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz	Strategyproof Approximation Mechanisms for Location on Networks	CoRR	2009	DBLP BibTeX RDF
1	Noga Alon, Asaf Shapira, Uri Stav	Can a Graph Have Distinct Regular Partitions?	SIAM J. Discrete Math.	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh	Spanning Directed Trees with Many Leaves.	SIAM J. Discrete Math.	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir	Tell Me Who I Am: An Interactive Recommendation System.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Recommendation systems, Collaborative filtering, Electronic commerce, Randomized algorithms, Probes, Billboard
1	Noga Alon, Uri Stav	Stability-type results for hereditary properties.	Journal of Graph Theory	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor	The Online Set Cover Problem.	SIAM J. Comput.	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira	A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity.	SIAM J. Comput.	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Rani Hod	Optimal Monotone Encodings.	IEEE Transactions on Information Theory	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Uriel Feige	On the power of two, three and four probes.	SODA	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Daniel Lokshtanov, Saket Saurabh	Fast FAST.	ICALP	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Shai Gutner	Balanced Hashing, Color Coding and Approximate Counting.	IWPEC	2009	DBLP DOI BibTeX RDF	Approximate counting of subgraphs, derandomization, expanders, perfect hashing, color-coding, k-wise independence
1	Noga Alon, Rina Panigrahy, Sergey Yekhanin	Deterministic Approximation Algorithms for the Nearest Codeword Problem.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich	Choice-Memory Tradeoff in Allocations.	FOCS	2009	DBLP DOI BibTeX RDF	Space / performance tradeoffs, Lower bounds on memory, Balanced allocations, Online perfect matching, Balls and bins paradigm
1	Noga Alon, Uri Stav	The maximum edit distance from hereditary graph properties.	J. Comb. Theory, Ser. B	2008	DBLP DOI BibTeX RDF
1	Noga Alon, Eli Berger	The Grothendieck constant of random and pseudo-random graphs.	Discrete Optimization	2008	DBLP DOI BibTeX RDF
1	Noga Alon, Rina Panigrahy, Sergey Yekhanin	Deterministic Approximation Algorithms for the Nearest Codeword Problem.	Electronic Colloquium on Computational Complexity (ECCC)	2008	DBLP BibTeX RDF
1	Noga Alon, Shai Gutner	Kernels for the Dominating Set Problem on Graphs with an Excluded Minor.	Electronic Colloquium on Computational Complexity (ECCC)	2008	DBLP BibTeX RDF
1	Noga Alon	Problems and results in extremal combinatorics - II.	Discrete Mathematics	2008	DBLP DOI BibTeX RDF
1	Noga Alon, Adi Pinchasi, Rom Pinchasi	An isoperimetric inequality in the universal cover of the punctured plane.	Discrete Mathematics	2008	DBLP DOI BibTeX RDF
1	Noga Alon, Jaroslaw Grytczuk	Breaking the rhythm on graphs.	Discrete Mathematics	2008	DBLP DOI BibTeX RDF
1	Noga Alon, Shmuel Friedland	The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence.	Electr. J. Comb.	2008	DBLP BibTeX RDF
1	Noga Alon, Uri Stav	What is the furthest graph from a hereditary property?	Random Struct. Algorithms	2008	DBLP DOI BibTeX RDF
1	Noga Alon, Oded Schwartz, Asaf Shapira	An Elementary Construction of Constant-Degree Expanders.	Combinatorics, Probability & Computing	2008	DBLP DOI BibTeX RDF
1	Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin Farach-Colton, Mohammad Taghi Hajiaghayi, Anastasios Sidiropoulos	Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	ordinal embedding, Metrics, distortion, relaxation
1	Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky	Weak &epsis;-nets and interval chains.	J. ACM	2008	DBLP DOI BibTeX RDF	Interval chain, inverse Ackermann function, moment curve, weak epsilon-net
1	Noga Alon, Asaf Shapira	A separation theorem in property testing.	Combinatorica	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05D99, 05C35, 68R05
1	Noga Alon, Shai Gutner	Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs	CoRR	2008	DBLP BibTeX RDF
1	Noga Alon, Sonny Ben-Shimon, Michael Krivelevich	A note on regular Ramsey graphs	CoRR	2008	DBLP BibTeX RDF
1	Noga Alon, Yossi Azar, Shai Gutner	Admission Control to Minimize Rejections and Online Set Cover with Repetitions	CoRR	2008	DBLP BibTeX RDF
1	Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh	Spanning directed trees with many leaves	CoRR	2008	DBLP BibTeX RDF
1	Noga Alon, Shai Gutner	Balanced Families of Perfect Hash Functions and Their Applications	CoRR	2008	DBLP BibTeX RDF
1	Noga Alon, Avinatan Hassidim, Eyal Lubetzky, Uri Stav, Amit Weinstein	Broadcasting with side information	CoRR	2008	DBLP BibTeX RDF
1	Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron	Testing Triangle-Freeness in General Graphs.	SIAM J. Discrete Math.	2008	DBLP DOI BibTeX RDF
1	Noga Alon, Pawel Pralat, Nicholas C. Wormald	Cleaning Regular Graphs with Brushes.	SIAM J. Discrete Math.	2008	DBLP DOI BibTeX RDF

Publications of "Noga Alon" ( http://dblp.L3S.de/Authors/Noga_Alon )