default search action
Alexander E. Holroyd
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j15]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) - 2021
- [j14]Alexander E. Holroyd, James B. Martin:
Galton-Watson games. Random Struct. Algorithms 59(4): 495-521 (2021)
2010 – 2019
- 2019
- [j13]Alexander E. Holroyd, Lionel Levine
, Peter Winkler:
Abelian Logic Gates. Comb. Probab. Comput. 28(3): 388-422 (2019) - [j12]Alexander E. Holroyd, Avi Levy, Moumanti Podder, Joel Spencer:
Existential monadic second order logic on random rooted trees. Discret. Math. 342(1): 152-167 (2019) - 2017
- [j11]Lev Nachmanson, Arlind Nocaj, Sergey Bereg
Node Overlap Removal by Growing a Tree. J. Graph Algorithms Appl. 21(5): 857-872 (2017) - [j10]Maria Deijfen, Alexander E. Holroyd, James B. Martin:
Friendly Frogs, Stable Marriage, and the Magic of Invariance. Am. Math. Mon. 124(5): 387-402 (2017) - [j9]Alexander E. Holroyd
Perfect Snake-in-the-Box Codes for Rank Modulation. IEEE Trans. Inf. Theory 63(1): 104-110 (2017) - [c6]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: 184-197 - [i7]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 abs/1704.02364 (2017) - 2016
- [j8]Sergey Pupyrev, Lev Nachmanson, Sergey Bereg
Edge routing with ordered bundles. Comput. Geom. 52: 18-33 (2016) - [j7]Sergey Bereg
Representing Permutations with Few Moves. SIAM J. Discret. Math. 30(4): 1950-1977 (2016) - [c5]Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang
Node Overlap Removal by Growing a Tree. GD 2016: 33-43 - [i6]Alexander E. Holroyd:
Perfect snake-in-the-box codes for rank modulation. CoRR abs/1602.08073 (2016) - [i5]Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander E. Holroyd:
Node Overlap Removal by Growing a Tree. CoRR abs/1608.02653 (2016) - 2015
- [c4]Lev Nachmanson, Roman Prutkin, Bongshin Lee, Nathalie Henry Riche, Alexander E. Holroyd, Xiaoji Chen:
GraphMaps: Browsing Large Graphs as Interactive Maps. GD 2015: 3-15 - [i4]Lev Nachmanson, Roman Prutkin, Bongshin Lee, Nathalie Henry Riche, Alexander E. Holroyd, Xiaoji Chen:
GraphMaps: Browsing Large Graphs as Interactive Maps. CoRR abs/1506.06745 (2015) - [i3]Alexander E. Holroyd, Lionel Levine, Peter Winkler:
Abelian logic gates. CoRR abs/1511.00422 (2015) - 2013
- [c3]Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Drawing Permutations with Few Corners. GD 2013: 484-495 - [i2]Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Drawing Permutations with Few Corners. CoRR abs/1306.4048 (2013) - 2012
- [j6]Alexander E. Holroyd, Frank Ruskey
Shorthand Universal Cycles for Permutations. Algorithmica 64(2): 215-245 (2012) - [i1]Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Edge Routing with Ordered Bundles. CoRR abs/1209.4227 (2012) - 2011
- [j5]Omer Angel
Rotor Walks on General Trees. SIAM J. Discret. Math. 25(1): 423-446 (2011) - [c2]Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, Alexander E. Holroyd:
Edge Routing with Ordered Bundles. GD 2011: 136-147 - 2010
- [j4]Omer Angel, Alexander E. Holroyd:
Random Subnetworks of Random Sorting Networks. Electron. J. Comb. 17(1) (2010) - [c1]Alexander E. Holroyd, Frank Ruskey
Faster Generation of Shorthand Universal Cycles for Permutations. COCOON 2010: 298-307
2000 – 2009
- 2009
- [j3]Codina Cotar, Alexander E. Holroyd, David Revelle:
A percolating hard sphere model. Random Struct. Algorithms 34(2): 285-299 (2009) - [j2]Alexander E. Holroyd, Terry Soo:
A Nonmeasurable Set from Coin Flips. Am. Math. Mon. 116(10): 926-928 (2009) - 2008
- [j1]Alexander E. Holroyd:
Partition identities and the coin exchange problem. J. Comb. Theory A 115(6): 1096-1101 (2008)
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-08-05 20:22 CEST 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: