Allan Borodin

Allan Borodin

University of Toronto

H-index: 47

North America-Canada

About Allan Borodin

Allan Borodin, With an exceptional h-index of 47 and a recent h-index of 20 (since 2020), a distinguished researcher at University of Toronto, specializes in the field of theoretical computer science, algorithm design.

His recent articles reflect a diverse array of research interests and contributions to the field:

University of Toronto, Toronto, Canada {bor, ckar}@ cs. toronto. edu

Any-order online interval selection

A time-space tradeoff for sorting on a general sequential model of computation

Online Bipartite Matching in the Probe-Commit Model

Prophet matching in the probe-commit model

Distortion in Voting with Top-t Preferences.

Little House (Seat) on the Prairie: Compactness, Gerrymandering, and Population Distribution.

Secretary matching meets probing with commitment

Allan Borodin Information

University

Position

Professor of Computer Science

Citations(all)

13548

Citations(since 2020)

2175

Cited By

12142

hIndex(all)

47

hIndex(since 2020)

20

i10Index(all)

91

i10Index(since 2020)

35

Email

University Profile Page

University of Toronto

Google Scholar

View Google Scholar Profile

Allan Borodin Skills & Research Interests

theoretical computer science

algorithm design

Top articles of Allan Borodin

Title

Journal

Author(s)

Publication Date

University of Toronto, Toronto, Canada {bor, ckar}@ cs. toronto. edu

Approximation and Online Algorithms: 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7–8, 2023, Proceedings

Allan Borodin

Christodoulos Karavasilis

2023/12/21

Any-order online interval selection

arXiv preprint arXiv:2303.06127

Allan Borodin

Christodoulos Karavasilis

2023/3/10

A time-space tradeoff for sorting on a general sequential model of computation

Allan Borodin

Stephen Cook

2023/5/23

Online Bipartite Matching in the Probe-Commit Model

arXiv preprint arXiv:2303.08908

Allan Borodin

Calum MacRury

2023/3/15

Prophet matching in the probe-commit model

Allan Borodin

Calum MacRury

Akash Rakheja

2022

Distortion in Voting with Top-t Preferences.

Allan Borodin

Daniel Halpern

Mohamad Latifian

Nisarg Shah

2022

Little House (Seat) on the Prairie: Compactness, Gerrymandering, and Population Distribution.

Allan Borodin

Omer Lev

Nisarg Shah

Tyrone Strangway

2022/1/1

Secretary matching meets probing with commitment

Allan Borodin

Calum MacRury

Akash Rakheja

2021

Prophet matching meets probing with commitment

arXiv preprint arXiv:2102.04325

Allan Borodin

Calum MacRury

Akash Rakheja

2021/2/8

Prophet inequality matching meets probing with commitment

arXiv preprint arXiv:2102.04325

Allan Borodin

Calum MacRury

Akash Rakheja

2021/2

Greedy approaches to online stochastic matching

arXiv preprint arXiv:2008.09260

Allan Borodin

Calum MacRury

Akash Rakheja

2020/8/21

Advice complexity of priority algorithms

Theory of Computing Systems

Allan Borodin

Joan Boyar

Kim S Larsen

Denis Pankratov

2020/5

Bipartite stochastic matching: Online, random order, and iid models

arXiv preprint arXiv:2004.14304

Allan Borodin

Calum MacRury

Akash Rakheja

2020/4/29

An experimental study of algorithms for online bipartite matching

Journal of Experimental Algorithmics (JEA)

Allan Borodin

Christodoulos Karavasilis

Denis Pankratov

2020/3/13

See List of Professors in Allan Borodin University(University of Toronto)