Alexander E. Holroyd

According to our database, Alexander E. Holroyd authored at least 19 papers between 2008 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Cyclic Products and Optimal Traps in Cyclic Birth and Death Chains.

Mark Holmes, Alexander E. Holroyd, Alejandro Ramírez

Electron. J. Comb., 2023

2021

Galton-Watson games.

Alexander E. Holroyd, James B. Martin

Random Struct. Algorithms, 2021

2019

Existential monadic second order logic on random rooted trees.

Alexander E. Holroyd, Avi Levy, Moumanti Podder, Joel Spencer

Discret. Math., 2019

Abelian Logic Gates.

Alexander E. Holroyd, Lionel Levine, Peter Winkler

Comb. Probab. Comput., 2019

2017

Perfect Snake-in-the-Box Codes for Rank Modulation.

Alexander E. Holroyd

IEEE Trans. Inf. Theory, 2017

Friendly Frogs, Stable Marriage, and the Magic of Invariance.

Maria Deijfen, Alexander E. Holroyd, James B. Martin

Am. Math. Mon., 2017

Node Overlap Removal by Growing a Tree.

Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander E. Holroyd

J. Graph Algorithms Appl., 2017

Stability of service under time-of-use pricing.

Shuchi Chawla, Nikhil R. Devanur, Alexander E. Holroyd, Anna R. Karlin, James B. Martin, Balasubramanian Sivan

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016

Representing Permutations with Few Moves.

Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev

SIAM J. Discret. Math., 2016

Edge routing with ordered bundles.

Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, Alexander E. Holroyd

Comput. Geom., 2016

2015

GraphMaps: Browsing Large Graphs as Interactive Maps.

Lev Nachmanson, Roman Prutkin, Bongshin Lee, Nathalie Henry Riche, Alexander E. Holroyd, Xiaoji Chen

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2013

Drawing Permutations with Few Corners.

Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012

Shorthand Universal Cycles for Permutations.

Alexander E. Holroyd, Frank Ruskey, Aaron Williams

Algorithmica, 2012

2011

Rotor Walks on General Trees.

Omer Angel, Alexander E. Holroyd

SIAM J. Discret. Math., 2011

2010

Random Subnetworks of Random Sorting Networks.

Omer Angel, Alexander E. Holroyd

Electron. J. Comb., 2010

Faster Generation of Shorthand Universal Cycles for Permutations.

Alexander E. Holroyd, Frank Ruskey, Aaron Williams

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009

A Nonmeasurable Set from Coin Flips.

Alexander E. Holroyd, Terry Soo

Am. Math. Mon., 2009

A percolating hard sphere model.

Codina Cotar, Alexander E. Holroyd, David Revelle

Random Struct. Algorithms, 2009

2008

Partition identities and the coin exchange problem.

Alexander E. Holroyd

J. Comb. Theory A, 2008