Остановите войну!
for scientists:
default search action
Calum MacRury
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i14]Will Ma, Calum MacRury, Jingwei Zhang:
Online Contention Resolution Schemes for Network Revenue Management and Combinatorial Auctions. CoRR abs/2403.05378 (2024) - 2023
- [j8]Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat:
Algorithms for p-Faulty Search on a Half-Line. Algorithmica 85(8): 2485-2514 (2023) - [j7]Calum MacRury, Tomás Masarík, Leilani Pai, Xavier Pérez-Giménez:
The Phase Transition of Discrepancy in Random Hypergraphs. SIAM J. Discret. Math. 37(3): 1818-1841 (2023) - [c6]Calum MacRury, Will Ma, Nathaniel Grammel:
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs. SODA 2023: 1995-2014 - [i13]Patrick Bennett, Calum MacRury:
Extending Wormald's Differential Equation Method to One-sided Bounds. CoRR abs/2302.12358 (2023) - [i12]Allan Borodin, Calum MacRury:
Online Bipartite Matching in the Probe-Commit Model. CoRR abs/2303.08908 (2023) - [i11]Calum MacRury, Will Ma:
Random-order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals. CoRR abs/2310.10101 (2023) - [i10]Alan M. Frieze, Pu Gao, Calum MacRury, Pawel Pralat, Gregory B. Sorkin:
Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2n Rounds. CoRR abs/2311.05533 (2023) - 2022
- [j6]Andrzej Dudek, Sean English, Alan M. Frieze, Calum MacRury, Pawel Pralat:
Localization game for random graphs. Discret. Appl. Math. 309: 202-214 (2022) - [j5]Pu Gao, Bogumil Kaminski, Calum MacRury, Pawel Pralat:
Hamilton cycles in the semi-random graph process. Eur. J. Comb. 99: 103423 (2022) - [j4]Pu Gao, Calum MacRury, Pawel Pralat:
Perfect Matchings in the Semirandom Graph Process. SIAM J. Discret. Math. 36(2): 1274-1290 (2022) - [c5]Pu Gao, Calum MacRury, Pawel Pralat:
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process. APPROX/RANDOM 2022: 29:1-29:22 - [c4]Allan Borodin, Calum MacRury, Akash Rakheja:
Prophet Matching in the Probe-Commit Model. APPROX/RANDOM 2022: 46:1-46:24 - [i9]Pu Gao, Calum MacRury, Pawel Pralat:
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process. CoRR abs/2205.02350 (2022) - [i8]Calum MacRury, Erlang Surya:
Sharp Thresholds in Adaptive Random Graph Processes. CoRR abs/2207.14469 (2022) - [i7]Calum MacRury, Will Ma, Nathaniel Grammel:
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs. CoRR abs/2209.07520 (2022) - 2021
- [j3]Sean English, Calum MacRury, Pawel Pralat:
Probabilistic zero forcing on random graphs. Eur. J. Comb. 91: 103207 (2021) - [c3]Allan Borodin, Calum MacRury, Akash Rakheja:
Secretary Matching Meets Probing with Commitment. APPROX-RANDOM 2021: 13:1-13:23 - [i6]Allan Borodin, Calum MacRury, Akash Rakheja:
Prophet Inequality Matching Meets Probing with Commitment. CoRR abs/2102.04325 (2021) - [i5]Calum MacRury, Tomás Masarík, Leilani Pai, Xavier Pérez-Giménez:
The Phase Transition of Discrepancy in Random Hypergraphs. CoRR abs/2102.07342 (2021) - [i4]Pu Gao, Calum MacRury, Pawel Pralat:
Perfect Matchings in the Semi-random Graph Process. CoRR abs/2105.13455 (2021) - 2020
- [c2]Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat:
Probabilistically Faulty Searching on a Half-Line - (Extended Abstract). LATIN 2020: 168-180 - [i3]Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat:
Probabilistically Faulty Searching on a Half-Line. CoRR abs/2002.07797 (2020) - [i2]Allan Borodin, Calum MacRury, Akash Rakheja:
Bipartite Stochastic Matching: Online, Random Order, and I.I.D. Models. CoRR abs/2004.14304 (2020) - [i1]Allan Borodin, Calum MacRury, Akash Rakheja:
Greedy Approaches to Online Stochastic Matching. CoRR abs/2008.09260 (2020)
2010 – 2019
- 2018
- [j2]Dmitry Jakobson, Calum MacRury, Sergey Norin, Lise Turner:
Distribution of Coefficients of Rank Polynomials for Random Sparse Graphs. Electron. J. Comb. 25(4): 4 (2018) - [j1]Anthony Bonato, Rita M. del Río-Chanona, Calum MacRury, Jake Nicolaidis, Xavier Pérez-Giménez, Pawel Pralat, Kirill Ternovsky:
The robot crawler graph process. Discret. Appl. Math. 247: 23-36 (2018) - 2015
- [c1]Anthony Bonato, Rita M. del Río-Chanona, Calum MacRury, Jake Nicolaidis, Xavier Pérez-Giménez, Pawel Pralat, Kirill Ternovsky:
The Robot Crawler Number of a Graph. WAW 2015: 132-147
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-04-21 17:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint