![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Noga Alon
aka: Alon Nilli
Princeton University, USA
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 723 matches
- 2024
- Noga Alon:
Graph-codes. Eur. J. Comb. 116: 103880 (2024) - Noga Alon
, Peter Frankl:
Turán graphs with bounded matching number. J. Comb. Theory B 165: 223-229 (2024) - Noga Alon, Dor Elboim
, János Pach, Gábor Tardos:
Random Necklaces Require Fewer Cuts. SIAM J. Discret. Math. 38(2): 1381-1408 (2024) - Noga Alon, Emil Powierski, Michael Savery
, Alex D. Scott, Elizabeth Wilmer:
Invertibility of Digraphs and Tournaments. SIAM J. Discret. Math. 38(1): 327-347 (2024) - Noga Alon
, Gabriela Bourla
, Ben Graham, Xiaoyu He, Noah Kravitz:
Logarithmically Larger Deletion Codes of All Distances. IEEE Trans. Inf. Theory 70(1): 125-130 (2024) - Noga Alon, Shay Moran, Hilla Schefler, Amir Yehudayoff:
A Unified Characterization of Private Learnability via Graph Theory. COLT 2024: 94-129 - Noga Alon, Or Zamir:
Sumsets in the Hypercube. CoRR abs/2403.16589 (2024) - Noga Alon, Baruch Schieber:
Optimal Preprocessing for Answering On-Line Product Queries. CoRR abs/2406.06321 (2024) - 2023
- Noga Alon, Fan Wei:
Irregular subgraphs. Comb. Probab. Comput. 32(2): 269-283 (2023) - Noga Alon, Michael Krivelevich
, Wojciech Samotij:
Largest subgraph from a hereditary property in a random graph. Discret. Math. 346(9): 113480 (2023) - Noga Alon, Jaroslaw Grytczuk, Andrzej P. Kisielewicz, Krzysztof Przeslawski:
New bounds on the maximum number of neighborly boxes in Rd. Eur. J. Comb. 114: 103797 (2023) - Noga Alon, Colin Defant, Noah Kravitz:
Typical and extremal aspects of friends-and-strangers graphs. J. Comb. Theory B 158(Part): 3-42 (2023) - Noga Alon, Michael Krivelevich
, Benny Sudakov:
Complete minors and average degree: A short proof. J. Graph Theory 103(3): 599-602 (2023) - Noga Alon, Ehud Friedgut, Gil Kalai, Guy Kindler
:
The Success Probability in Levine's Hat Problem, and Independent Sets in Graphs. SIAM J. Discret. Math. 37(4): 2717-2729 (2023) - Noga Alon, Anna Gujgiczer, János Körner, Aleksa Milojevic, Gábor Simonyi:
Structured Codes of Graphs. SIAM J. Discret. Math. 37(1): 379-403 (2023) - Noga Alon, Alon Gonen, Elad Hazan, Shay Moran:
Boosting Simple Learners. TheoretiCS 2 (2023) - Hannaneh Akrami
, Noga Alon
, Bhaskar Ray Chaudhury
, Jugal Garg
, Kurt Mehlhorn
, Ruta Mehta
:
EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number. EC 2023: 61 - Noga Alon, Olivier Bousquet, Kasper Green Larsen, Shay Moran, Shlomo Moran:
Diagonalization Games. CoRR abs/2301.01924 (2023) - Noga Alon, Shay Moran, Hilla Schefler, Amir Yehudayoff:
A Unified Characterization of Private Learnability via Graph Theory. CoRR abs/2304.03996 (2023) - Noga Alon, Anurag Bishnoi, Shagnik Das, Alessandro Neri:
Strong blocking sets and minimal codes from expander graphs. CoRR abs/2305.15297 (2023) - Noga Alon, Allan Grønlund, Søren Fuglede Jørgensen, Kasper Green Larsen:
Sublinear Time Shortest Path in Expander Graphs. CoRR abs/2307.06113 (2023) - Noga Alon:
On bipartite coverings of graphs and multigraphs. CoRR abs/2307.16784 (2023) - Noga Alon, Dmitrii Avdiukhin, Dor Elboim, Orr Fischer, Grigory Yaroslavtsev:
Optimal Sample Complexity of Contrastive Learning. CoRR abs/2312.00379 (2023) - Noga Alon, Olivier Bousquet, Kasper Green Larsen, Shay Moran, Shlomo Moran:
Diagonalization Games. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- Noga Alon, Colin Defant, Noah Kravitz:
The runsort permuton. Adv. Appl. Math. 139: 102361 (2022) - Noga Alon, Clara Shikhelman
:
Additive Approximation of Generalized Turán Questions. Algorithmica 84(2): 464-481 (2022) - Noga Alon, Asaf Nachmias, Matan Shalev:
The diameter of the uniform spanning tree of dense graphs. Comb. Probab. Comput. 31(6): 1010-1030 (2022) - Noga Alon, Bruno Jartoux
, Chaya Keller, Shakhar Smorodinsky
, Yelena Yuditsky:
The ε-t-Net Problem. Discret. Comput. Geom. 68(2): 618-644 (2022) - Noga Alon, Jeremy Chizewer
:
On the hat guessing number of graphs. Discret. Math. 345(4): 112785 (2022) - Noga Alon, Mark Bun, Roi Livni, Maryanthe Malliaris, Shay Moran
:
Private and Online Learnability Are Equivalent. J. ACM 69(4): 28:1-28:34 (2022)
skipping 693 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-27 15:35 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint