| 2023 | WAOA | Any-Order Online Interval Selection. | Allan Borodin, Christodoulos Karavasilis |
| 2022 | IJCAI | Distortion in Voting with Top-t Preferences. | Allan Borodin, Daniel Halpern, Mohamad Latifian, Nisarg Shah |
| 2019 | AAAI | Primarily about Primaries. | Allan Borodin, Omer Lev, Nisarg Shah, Tyrone Strangway |
| 2018 | IJCAI | Big City vs. the Great Outdoors: Voter Distribution and How It Affects Gerrymandering. | Allan Borodin, Omer Lev, Nisarg Shah, Tyrone Strangway |
| 2018 | SODA | A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version. | Allan Borodin, Denis Pankratov, Amirali Salehi-Abari |
| 2018 | WAOA | Advice Complexity of Priority Algorithms. | Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov |
| 2017 | WAOA | On Conceptually Simple Algorithms for Variants of Online Bipartite Matching. | Allan Borodin, Denis Pankratov, Amirali Salehi-Abari |
| 2014 | ISAAC | Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization. | Norman Huang, Allan Borodin |
| 2013 | WWW | Strategyproof mechanisms for competitive influence in networks. | Allan Borodin, Mark Braverman, Brendan Lucier, Joel Oren |
| 2012 | PODS | Max-Sum diversification, monotone submodular functions and dynamic updates. | Allan Borodin, Hyun Chul Lee, Yuli Ye |
| 2010 | ICALP | On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions. | Allan Borodin, Brendan Lucier |
| 2010 | SODA | Price of Anarchy for Greedy Auctions. | Brendan Lucier, Allan Borodin |
| 2010 | SAT | On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem. | Denis Pankratov, Allan Borodin |
| 2009 | Algosensors | Invited Talk II The Power and Limitations of Simple Algorithms: A Partial Case Study of Greedy Mechanisim Design for Combinatorial Actions. | Allan Borodin |
| 2009 | ICALP | Elimination Graphs. | Yuli Ye, Allan Borodin |
| 2009 | WAW | Cluster Based Personalized Search. | Hyun Chul Lee, Allan Borodin |
| 2007 | COCOON | Priority Algorithms for the Subset-Sum Problem. | Yuli Ye, Allan Borodin |
| 2006 | AAIM | Further Reflections on a Theory for Basic Algorithms. | Allan Borodin |
| 2005 | ICALP | How Well Can Primal-Dual and Local-Ratio Algorithms Perform?. | Allan Borodin, David Cashman, Avner Magen |
| 2005 | WADS | Towards a Theory of Algorithms. | Allan Borodin |
| 2004 | WAOA | Priority Algorithms for Graph Optimization Problems. | Allan Borodin, Joan Boyar, Kim S. Larsen |
| 2003 | COCOON | Perturbation of the Hyper-Linked Environment. | Hyun Chul Lee, Allan Borodin |
| 2002 | SODA | (Incremental) priority algorithms. | Allan Borodin, Morten N. Nielsen, Charles Rackoff |
| 2001 | WWW | Finding authorities and hubs from link structures on the World Wide Web. | Allan Borodin, Gareth O. Roberts, Jeffrey S. Rosenthal, Panayiotis Tsaparas |
| 2001 | SODA | Stability preserving transformations: packet routing networks with edge capacities and speeds. | Allan Borodin, Rafail Ostrovsky, Yuval Rabani |
| 2000 | LATIN | On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract). | Allan Borodin, Ran El-Yaniv, Vincent Gogan |
| 1999 | STOC | Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems. | Allan Borodin, Rafail Ostrovsky, Yuval Rabani |
| 1999 | STOC | Subquadratic Approximation Algorithms for Clustering Problems in High Dimensional Spaces. | Allan Borodin, Rafail Ostrovsky, Yuval Rabani |
| 1996 | STOC | Adversarial Queueing Theory. | Allan Borodin, Jon M. Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson |
| 1993 | ISAAC | Time Space Tradeoffs (Getting Closer to the Barrier?). | Allan Borodin |
| 1993 | STOC | How much can hardware help routing? | Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal |
| 1993 | WADS | Towards a Better Understanding of the Pure Packet Routing. | Allan Borodin |
| 1991 | STOC | Competitive Paging with Locality of Reference (Preliminary Version) | Allan Borodin, Sandy Irani, Prabhakar Raghavan, Baruch Schieber |
| 1990 | FOCS | Time-Space Tradeoffs for Undirected Graph Traversal | Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa |
| 1990 | STOC | On the Power of Randomization in Online Algorithms (Extended Abstract) | Shai Ben-David, Allan Borodin, Richard M. Karp, Gbor Tardos, Avi Wigderson |
| 1990 | STOC | On the Decidability of Sparse Univariate Polynomial Interpolation (Preliminary Version) | Allan Borodin, Prasoon Tiwari |
| 1989 | STOC | Lower Bounds on the Length of Universal Traversal Sequences (Detailed Abstract) | Allan Borodin, Walter L. Ruzzo, Martin Tompa |
| 1987 | STOC | An Optimal Online Algorithm for Metrical Task Systems | Allan Borodin, Nathan Linial, Michael E. Saks |
| 1986 | ICALP | A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. | Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson |
| 1986 | STACS | A Time-Space Tradeoff for Element Distinctness. | Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson |
| 1983 | STOC | Bounds for Width Two Branching Programs | Allan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul |
| 1982 | FOCS | Fast Parallel Matrix and GCD Computations | Allan Borodin, Joachim von zur Gathen, John E. Hopcroft |
| 1982 | STOC | Routing, Merging and Sorting on Parallel Models of Computation (Extended Abstract) | Allan Borodin, John E. Hopcroft |
| 1980 | STOC | A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation | Allan Borodin, Stephen A. Cook |
| 1979 | FOCS | A Time-Space Tradeoff for Sorting on Non-Oblivious Machines | Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa |
| 1979 | FOCS | Resource Allocation with Immunity to Limited Process Failure (Preliminary Report) | Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin |
| 1974 | STOC | On the Number of Additions to Compute Specific Polynomials (Preliminary Version) | Allan Borodin, Stephen A. Cook |
| 1972 | FOCS | Fast Modular Transforms via Division | R. Moenck, Allan Borodin |
| 1970 | FOCS | On the Efficiency of Programs in Subrecursive Formalisms (Incomplete Version, Extended Abstract) | Robert L. Constable, Allan Borodin |
| 1969 | FOCS | Dense and Non-Dense Families of Complexity Classes | Allan Borodin, Robert L. Constable, John E. Hopcroft |
| 1969 | STOC | Complexity Classes of Recursive Functions and the Existence of Complexity Gaps | Allan Borodin |