Peter Allen

According to our database1, Peter Allen authored at least 35 papers between 1984 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




Regularity inheritance in pseudorandom graphs.
Random Struct. Algorithms, 2020

Finding Tight Hamilton Cycles in Random Hypergraphs Faster.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Chromatic thresholds in sparse random graphs.
Random Struct. Algorithms, 2017

Chromatic thresholds in dense random graphs.
Random Struct. Algorithms, 2017

Tight cycles and regular slices in dense hypergraphs.
J. Comb. Theory, Ser. A, 2017

Packing degenerate graphs greedily.
Electron. Notes Discret. Math., 2017

Powers of Hamilton cycles in pseudorandom graphs.
Comb., 2017

Capture, learning, and classification of upper extremity movement primitives in healthy controls and stroke patients.
Proceedings of the International Conference on Rehabilitation Robotics, 2017

Tight Hamilton cycles in random hypergraphs.
Random Struct. Algorithms, 2015

Ramsey Numbers of Squares of Paths.
Electron. Notes Discret. Math., 2015

Triangle-Free Subgraphs of Random Graphs.
Electron. Notes Discret. Math., 2015

Local resilience of spanning subgraphs in sparse random graphs.
Electron. Notes Discret. Math., 2015

Regular slices for hypergraphs.
Electron. Notes Discret. Math., 2015

Tight Cycles in Hypergraphs.
Electron. Notes Discret. Math., 2015

Turán numbers of bipartite graphs plus an odd cycle.
J. Comb. Theory, Ser. B, 2014

An improved error term for minimum H-decompositions of graphs.
J. Comb. Theory, Ser. B, 2014

On the Number of Orientations of Random Graphs with No Directed Cycles of a Given Length.
Electron. J. Comb., 2014

An Extension of Turán's Theorem, Uniqueness and Stability.
Electron. J. Comb., 2014

Turánnical hypergraphs.
Random Struct. Algorithms, 2013

Decline in mortality with the Belize Integrated Patient-Centred Country Wide Health Information System (BHIS) with Embedded Program Management.
Int. J. Medical Informatics, 2013

An approximate blow-up lemma for sparse pseudorandom graphs.
Electron. Notes Discret. Math., 2013

Maximum Planar Subgraphs in Dense Graphs.
Electron. J. Comb., 2013

Ramsey-goodness - and otherwise.
Comb., 2013

SharePoint 2010 at Work - Tricks, Traps, and Bold Opinions: The Best of
O'Reilly, ISBN: 978-1-449-32100-0, 2012

Filling the gap between Turán's theorem and Pósa's conjecture.
J. Lond. Math. Soc., 2011

A density Corrádi-Hajnal theorem.
Electron. Notes Discret. Math., 2011

Dense H-Free Graphs are Almost (<i>χ(H)-1</i>)-Partite.
Electron. J. Comb., 2010

Forbidden induced bipartite graphs.
J. Graph Theory, 2009

Minimum degree conditions for large subgraphs.
Electron. Notes Discret. Math., 2009

Clique-Width and the Speed of Hereditary Properties.
Electron. J. Comb., 2009

Proceedings of the International Conference on Computer Graphics and Interactive Techniques, 2009

Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles.
Comb. Probab. Comput., 2008

Complex Systems and the Merger Process.
Technol. Anal. Strateg. Manag., 2002

Image-flow computation: An estimation-theoretic framework and a unified perspective.
CVGIP Image Underst., 1992

Surface descriptions from vision and touch.
Proceedings of the 1984 IEEE International Conference on Robotics and Automation, 1984