default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Nelson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]Stefan Grosser, Hamed Hatami, Peter Nelson
, Sergey Norin:
Typical structure of hereditary properties of binary matroids. J. Comb. Theory B 167: 283-302 (2024)- 2023
- [j33]Peter Nelson:
Claustrophobia, Repetition and Redundancy: The Economy and Aesthetics of User-Generated Content in Sandbox Computer Games. Game Stud. 23(2) (2023) - 2022
- [j32]Peter Nelson, Shayla Redlin, Jorn G. van der Pol:
Enumeration of extensions of the cycle matroid of a complete graph. Adv. Appl. Math. 138: 102343 (2022) - [j31]Marthe Bonamy, Tom Kelly, Peter Nelson, Luke Postle:
Bounding χ by a fraction of Δ for graphs without large cliques. J. Comb. Theory B 157: 263-282 (2022) - [j30]Peter Nelson, Kazuhiro Nomoto:
The Structure of $I_4$-Free and Triangle-Free Binary Matroids. SIAM J. Discret. Math. 36(3): 1711-1729 (2022) - [j29]Peter Nelson, Zach Walsh:
The Extremal Function for Excluding Geometry Minors over Prime Fields. SIAM J. Discret. Math. 36(3): 2100-2120 (2022) - 2021
- [j28]Peter Nelson, Sergey Norin:
The Smallest Matroids with no Large Independent Flat. Electron. J. Comb. 28(1): 1 (2021) - [j27]Peter Nelson, Kazuhiro Nomoto:
The structure of claw-free binary matroids. J. Comb. Theory B 150: 76-118 (2021) - 2020
- [j26]Hong Liu, Sammy Luo, Peter Nelson, Kazuhiro Nomoto:
Stability and exact Turán numbers for matroids. J. Comb. Theory B 143: 29-41 (2020) - [j25]Tony Huynh, Peter Nelson:
The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids. SIAM J. Discret. Math. 34(1): 163-176 (2020) - [j24]Peter Nelson, Sophia Park:
A Ramsey Theorem for Biased Graphs. SIAM J. Discret. Math. 34(4): 2270-2281 (2020)
2010 – 2019
- 2019
- [j23]Peter Nelson, Jorn G. van der Pol:
On the Number of Biased Graphs. SIAM J. Discret. Math. 33(1): 373-382 (2019) - 2018
- [j22]Adam Brown, Peter Nelson:
Matroids with no U2, n-minor and many hyperplanes. Adv. Appl. Math. 100: 143-147 (2018) - [j21]Peter Nelson, Jorn G. van der Pol:
Doubly Exponentially Many Ingleton Matroids. SIAM J. Discret. Math. 32(2): 1145-1153 (2018) - 2017
- [j20]Jim Geelen, Peter Nelson:
Odd circuits in dense binary matroids. Comb. 37(1): 41-47 (2017) - [j19]Jim Geelen, Peter Nelson:
The structure of matroids with a spanning clique or projective geometry. J. Comb. Theory B 127: 65-81 (2017) - [j18]Peter Nelson:
On the Probability that a Random Subgraph Contains a Circuit. J. Graph Theory 85(3): 644-650 (2017) - 2016
- [j17]Jim Geelen, Peter Nelson:
The critical number of dense triangle-free binary matroids. J. Comb. Theory B 116: 238-249 (2016) - [j16]Peter Nelson, Stefan H. M. van Zwam:
The Maximum-Likelihood Decoding Threshold for Cycle Codes of Graphs. IEEE Trans. Inf. Theory 62(10): 5316-5322 (2016) - [i2]Tony Huynh, Peter Nelson:
The matroid secretary problem for minor-closed classes and random matroids. CoRR abs/1603.06822 (2016) - 2015
- [j15]Jim Geelen, Peter Nelson:
An analogue of the Erdős-Stone theorem for finite geometries. Comb. 35(2): 209-214 (2015) - [j14]Jim Geelen, Peter Nelson:
The number of lines in a matroid with no U2, n-minor. Eur. J. Comb. 50: 115-122 (2015) - [j13]Jim Geelen, Peter Nelson:
A density Hales-Jewett theorem for matroids. J. Comb. Theory B 112: 70-77 (2015) - [j12]Jim Geelen, Peter Nelson:
Projective geometries in exponentially dense matroids. I. J. Comb. Theory B 113: 185-207 (2015) - [j11]Peter Nelson:
Projective geometries in exponentially dense matroids. II. J. Comb. Theory B 113: 208-219 (2015) - [j10]Jim Geelen, Peter Nelson:
Matroids denser than a clique. J. Comb. Theory B 114: 51-69 (2015) - [j9]Peter Nelson:
Matroids Denser than a Projective Geometry. SIAM J. Discret. Math. 29(2): 730-735 (2015) - [j8]Peter Nelson, Stefan H. M. van Zwam:
Matroids Representable Over Fields With a Common Subfield. SIAM J. Discret. Math. 29(2): 796-810 (2015) - [j7]Peter Nelson, Stefan H. M. van Zwam:
On the Existence of Asymptotically Good Linear Codes in Minor-Closed Classes. IEEE Trans. Inf. Theory 61(3): 1153-1158 (2015) - [c5]Peter Nelson, Chris Linegar, Paul Newman:
Building, Curating, and Querying Large-Scale Data Repositories for Field Robotics Applications. FSR 2015: 517-531 - [c4]Peter Nelson, Winston Churchill, Ingmar Posner, Paul Newman:
From dusk till dawn: Localisation at night using artificial light sources. ICRA 2015: 5245-5252 - [i1]Peter Nelson, Stefan H. M. van Zwam:
The maximum-likelihood decoding threshold for graphic codes. CoRR abs/1504.05225 (2015) - 2014
- [j6]Peter Nelson:
The number of rank-k flats in a matroid with no U2, n-minor. J. Comb. Theory B 107: 140-147 (2014) - [c3]Peter Nelson:
What Is Sound? ICMC 2014 - 2013
- [j5]Jim Geelen, Peter Nelson:
On minor-closed classes of matroids with exponential growth rate. Adv. Appl. Math. 50(1): 142-154 (2013) - [j4]Peter Nelson:
Growth rate functions of dense classes of representable matroids. J. Comb. Theory B 103(1): 75-92 (2013) - 2010
- [j3]Jim Geelen, Peter Nelson:
The number of points in a matroid with no n-point line as a minor. J. Comb. Theory B 100(6): 625-630 (2010)
2000 – 2009
- 2008
- [c2]Michael Brough, Bakhadyr Khoussainov, Peter Nelson:
Sequential Automatic Algebras. CiE 2008: 84-93 - 2007
- [j2]Ümit Y. Ogras, Radu Marculescu, Hyung Gyu Lee, Puru Choudhary, Diana Marculescu, Michael Kaufman, Peter Nelson:
Challenges and Promising Results in NoC Prototyping Using FPGAs. IEEE Micro 27(5): 86-95 (2007) - 2006
- [c1]Peter Nelson, Kenneth Dallmeyer, Lucasz Szybalski, Tom Palarz, Michael Wieher:
Spamalot: A Toolkit for Consuming Spammers' Resources. CEAS 2006
1980 – 1989
- 1983
- [j1]Peter Nelson, Larry Korba, Gordon Park, David Crabtree:
The MOD Keyboard. IEEE Micro 3(4): 7-17 (1983)
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 2024-12-22 20:02 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:
