default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNoah Kravitz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j17]Colin Defant, Noah Kravitz, Nathan Williams:
The Ungar Games. Comb. 44(3): 531-561 (2024)- [j16]Colin Defant, Noah Kravitz:
Foot-Sorting for Socks. Electron. J. Comb. 31(3) (2024) - [j15]Noah Kravitz, Noga Alon:
Cats in Cubes. Electron. J. Comb. 31(3) (2024) - [j14]Colin Defant, Noah Kravitz:
Loops and regions in Hitomezashi patterns. Discret. Math. 347(1): 113693 (2024) - [j13]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) - 2023
- [j12]Colin Defant, Noah Kravitz, Bridget Eileen Tenner:
Extensions of hitomezashi patterns. Discret. Math. 346(10): 113555 (2023) - [j11]Noga Alon, Colin Defant, Noah Kravitz:
Typical and extremal aspects of friends-and-strangers graphs. J. Comb. Theory B 158(Part): 3-42 (2023) - [j10]Colin Defant, Noah Kravitz:
Promotion Sorting. Order 40(1): 199-216 (2023) - 2022
- [j9]Noga Alon, Colin Defant, Noah Kravitz:
The runsort permuton. Adv. Appl. Math. 139: 102361 (2022) - 2021
- [j8]Colin Defant, Noah Kravitz:
Friends and strangers walking on graphs. Comb. Theory 1(0) (2021) - [j7]Noah Kravitz:
Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem. Comb. Theory 1(0) (2021) - [j6]Noah Kravitz, Ashwin Sah:
Linear Extension Numbers of n-Element Posets. Order 38(1): 49-66 (2021) - 2020
- [j5]Colin Defant, Noah Kravitz:
Stack-sorting for words. Australas. J Comb. 77: 51-68 (2020) - [j4]Colin Defant, Noah Kravitz, Ashwin Sah:
Supertrees. Electron. J. Comb. 27(2): 2 (2020) - 2019
- [j3]Noah Kravitz:
Harborth constants for certain classes of metacyclic groups. Discret. Math. 342(5): 1492-1509 (2019) - [j2]Noah Kravitz:
On the number of simultaneous core partitions with d-distinct parts. Discret. Math. 342(12) (2019) - 2018
- [j1]Noah Kravitz, Stefan Steinerberger:
Ulam Sequences and Ulam Sets. Integers 18: A80 (2018)
Informal and Other Publications
- 2022
- [i3]Noga Alon, Gabriela Bourla, Ben Graham, Xiaoyu He, Noah Kravitz:
Logarithmically larger deletion codes of all distances. CoRR abs/2209.11882 (2022) - 2020
- [i2]Noga Alon, Colin Defant, Noah Kravitz:
Typical and Extremal Aspects of Friends-and-Strangers Graphs. CoRR abs/2009.07840 (2020) - 2017
- [i1]Noah Kravitz, Stefan Steinerberger:
Ulam Sequences and Ulam Sets. CoRR abs/1705.01883 (2017)
Coauthor Index
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.
last updated on 2025-01-21 00:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
