( en | de | ru )

 

Disambiguation of "Borodin, Allan"

Author of the publication

copydeleteadd this publication to your clipboard
An Experimental Study of Algorithms for Online Bipartite Matching.

, , and . CoRR, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andrii Borodin

Andriy Borodin

Moray Allan

Jennifer Allanson

Marianne Allanic

 

Other publications of authors with the same name

Criteria for Cluster-Based Personalized Search., and . Internet Math., 6 (3): 399-435 (2009)A Time-Space Tradeoff for Sorting on Non-Oblivious Machines., , , , and . J. Comput. Syst. Sci., 22 (3): 351-364 (1981)Lower Bounds on the Length of Universal Traversal Sequences., , and . J. Comput. Syst. Sci., 45 (2): 180-203 (1992)Further Reflections on a Theory for Basic Algorithms.. AAIM, volume 4041 of Lecture Notes in Computer Science, page 1-9. Springer, (2006)Elimination Graphs., and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 774-785. Springer, (2009)Time Space Tradeoffs (Getting Closer to the Barrier?).. ISAAC, volume 762 of Lecture Notes in Computer Science, page 209-220. Springer, (1993)Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization., and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 528-539. Springer, (2014)Big City vs. the Great Outdoors: Voter Distribution and How It Affects Gerrymandering., , , and . IJCAI, page 98-104. ijcai.org, (2018)Bounds for Width Two Branching Programs., , , and . SIAM J. Comput., 15 (2): 549-560 (1986)Complexity Classes of Recursive Functions and the Existence of Complexity Gaps. STOC, page 67-78. ACM, (1969)