Alexander E. Holroyd

Publication Activity (10 Years)

Years Active: 2008-2023
Publications (10 Years): 17

Top Topics

Interactive Retrieval

Stable Marriage

Distributional Assumptions

Top Venues

Comb. Probab. Comput.

IEEE Trans. Inf. Theory

Publications

Mark Holmes, Alexander E. Holroyd, Alejandro Ramírez
Cyclic Products and Optimal Traps in Cyclic Birth and Death Chains. Electron. J. Comb. 30 (2) (2023)
Alexander E. Holroyd, James B. Martin
Galton-Watson games. Random Struct. Algorithms 59 (4) (2021)
Alexander E. Holroyd, Avi Levy, Moumanti Podder, Joel Spencer
Existential monadic second order logic on random rooted trees. Discret. Math. 342 (1) (2019)
Alexander E. Holroyd, Lionel Levine, Peter Winkler
Abelian Logic Gates. Comb. Probab. Comput. 28 (3) (2019)
Maria Deijfen, Alexander E. Holroyd, James B. Martin
Friendly Frogs, Stable Marriage, and the Magic of Invariance. Am. Math. Mon. 124 (5) (2017)
Shuchi Chawla, Nikhil R. Devanur, Alexander E. Holroyd, Anna R. Karlin, James B. Martin, Balasubramanian Sivan
Stability of service under time-of-use pricing. STOC (2017)
Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander E. Holroyd
Node Overlap Removal by Growing a Tree. J. Graph Algorithms Appl. 21 (5) (2017)
Shuchi Chawla, Nikhil R. Devanur, Alexander E. Holroyd, Anna R. Karlin, James B. Martin, Balasubramanian Sivan
Stability of Service under Time-of-Use Pricing. CoRR (2017)
Alexander E. Holroyd
Perfect Snake-in-the-Box Codes for Rank Modulation. IEEE Trans. Inf. Theory 63 (1) (2017)
Alexander E. Holroyd
Perfect snake-in-the-box codes for rank modulation. CoRR (2016)
Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander E. Holroyd
Node Overlap Removal by Growing a Tree. CoRR (2016)
Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, Alexander E. Holroyd
Edge routing with ordered bundles. Comput. Geom. 52 (2016)
Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander E. Holroyd
Node Overlap Removal by Growing a Tree. Graph Drawing (2016)
Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev
Representing Permutations with Few Moves. SIAM J. Discret. Math. 30 (4) (2016)
Alexander E. Holroyd, Lionel Levine, Peter Winkler
Abelian logic gates. CoRR (2015)
Lev Nachmanson, Roman Prutkin, Bongshin Lee, Nathalie Henry Riche, Alexander E. Holroyd, Xiaoji Chen
GraphMaps: Browsing Large Graphs as Interactive Maps. Graph Drawing (2015)
Lev Nachmanson, Roman Prutkin, Bongshin Lee, Nathalie Henry Riche, Alexander E. Holroyd, Xiaoji Chen
GraphMaps: Browsing Large Graphs as Interactive Maps. CoRR (2015)
Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev
Drawing Permutations with Few Corners. CoRR (2013)
Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev
Drawing Permutations with Few Corners. Graph Drawing (2013)
Alexander E. Holroyd, Frank Ruskey, Aaron Williams
Shorthand Universal Cycles for Permutations. Algorithmica 64 (2) (2012)
Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev
Edge Routing with Ordered Bundles CoRR (2012)
Omer Angel, Alexander E. Holroyd
Rotor Walks on General Trees. SIAM J. Discret. Math. 25 (1) (2011)
Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, Alexander E. Holroyd
Edge Routing with Ordered Bundles. Graph Drawing (2011)
Alexander E. Holroyd, Frank Ruskey, Aaron Williams
Faster Generation of Shorthand Universal Cycles for Permutations. COCOON (2010)
Omer Angel, Alexander E. Holroyd
Random Subnetworks of Random Sorting Networks. Electron. J. Comb. 17 (1) (2010)
Alexander E. Holroyd, Terry Soo
A Nonmeasurable Set from Coin Flips. Am. Math. Mon. 116 (10) (2009)
Codina Cotar, Alexander E. Holroyd, David Revelle
A percolating hard sphere model. Random Struct. Algorithms 34 (2) (2009)
Alexander E. Holroyd
Partition identities and the coin exchange problem. J. Comb. Theory, Ser. A 115 (6) (2008)