By Scientia Professor Toby Walsh

Conference Papers

Macintyre E; Prosser P; Smith B; Walsh T, 1998, 'Random constraint satisfaction: Theory meets practice', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 325 - 339, http://dx.doi.org/10.1007/3-540-49481-2_24

Walsh T, 1997, 'Depth-bounded discrepancy search', in IJCAI International Joint Conference on Artificial Intelligence, pp. 1388 - 1393

Gent IP; Walsh T, 1997, 'From approximate t o optimal solutions: Constructing pruning and propagation rules', in IJCAI International Joint Conference on Artificial Intelligence, pp. 1396 - 1401

Gent IP; MacIntyre E; Prosser P; Walsh T, 1997, 'Scaling of search cost', in Proceedings of the National Conference on Artificial Intelligence, pp. 315 - 320

Gent IP; MacIntyre E; Prosser P; Shaw P; Walsh T, 1997, 'The constrainedness of arc consistency', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 327 - 340, http://dx.doi.org/10.1007/bfb0017449

Bundy A; Giunchiglia F; Sebastiani R; Walsh T, 1996, 'Computing abstraction hierarchies by numerical simulation', in Proceedings of the National Conference on Artificial Intelligence, pp. 523 - 529

Gent IP; MacIntyre E; Prosser P; Walsh T, 1996, 'Constrainedness of search', in Proceedings of the National Conference on Artificial Intelligence, pp. 246 - 252

Giunchiglia F; Sebastiani R; Villafiorita A; Walsh T, 1996, 'A general purpose reasoner for abstraction', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 323 - 335, http://dx.doi.org/10.1007/3-540-61291-2_62

Gent IP; MacIntyre E; Prosser P; Smith BM; Walsh T, 1996, 'An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 179 - 193, http://dx.doi.org/10.1007/3-540-61551-2_74

Clark DA; Frank J; Gent IP; MacIntyre E; Tomov N; Walsh T, 1996, 'Local search and the number of solutions', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 119 - 133, http://dx.doi.org/10.1007/3-540-61551-2_70

Basin DA; Walsh T, 1995, 'A calculus for rippling', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 15 - 30, http://dx.doi.org/10.1007/3-540-60381-6_2

Gent IP; Macintyre E; Prosser P; Walsh T, 1995, 'Scaling effects in the csp phase transition', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 70 - 87, http://dx.doi.org/10.1007/3-540-60299-2_5

GENT IP; WALSH T, 1995, 'Unsatisfied variables in local search', in Hallam J (ed.), HYBRID PROBLEMS, HYBRID SOLUTIONS, I O S PRESS, ENGLAND, SHEFFIELD, pp. 73 - 85, presented at 10th Biennial Conference on Artificial Intelligence and the Simulation of Behaviour (AISB95), ENGLAND, SHEFFIELD, https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:A1995BD65P00007&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Walsh T, 1994, 'A divergence critic', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 14 - 28, http://dx.doi.org/10.1007/3-540-58156-1_2

Basin DA; Walsh T, 1994, 'Termination orderings for rippling', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 466 - 483, http://dx.doi.org/10.1007/3-540-58156-1_34

Gent IP; Walsh T, 1994, 'The hardest random SAT problems', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 356 - 366, http://dx.doi.org/10.1007/3-540-58467-6_31

Gent IP; Walsh T, 1993, 'Towards an understanding of hill-climbing procedures for SAT', in Proceedings of the National Conference on Artificial Intelligence, pp. 28 - 33

BASIN DA; WALSH T, 1993, 'DIFFERENCE UNIFICATION', in Bajcsy R (ed.), IJCAI-93, VOLS 1 AND 2, MORGAN KAUFMANN PUB INC, FRANCE, CHAMBERY, pp. 116 - 122, presented at 13th International Joint Conference on Artificial Intelligence (IJCAI-93), FRANCE, CHAMBERY, 28 August 1993 - 03 September 1993, https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:A1993BA18B00017&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Walsh T, 1993, 'General purpose proof plans', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 379 - 383, http://dx.doi.org/10.1007/bfb0013194

WALSH T; NUNES A; BUNDY A, 1992, 'THE USE OF PROOF PLANS TO SUM SERIES', in Kapur D (ed.), AUTOMATED DEDUCTION - CADE-11, SPRINGER-VERLAG BERLIN, NY, SARATOGA SPRINGS, pp. 325 - 339, presented at 11TH INTERNATIONAL CONF ON AUTOMATED DEDUCTION, NY, SARATOGA SPRINGS, 15 June 1992 - 18 June 1992, https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:A1992BX77G00025&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=891bb5ab6ba270e68a29b250adbe88d1

Basin D; Walsh T, 1992, 'Difference matching', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 295 - 309, http://dx.doi.org/10.1007/3-540-55602-8_173

Giunchiglia F; Walsh T, 1990, 'Use of abstraction in automatic inference', in IEE Conference Publication, pp. 365 - 370

Mayer-Eichberger V; Walsh T, 'SAT Encodings for the Car Sequencing Problem', in EPiC Series in Computing, EasyChair, pp. 15 - 1, presented at POS-13. Pragmatics of SAT 2013, http://dx.doi.org/10.29007/jrsp

Reports

Aziz H; Gaspers S; Sun Z; Walsh T, 2020, From Matching with Diversity Constraints to Matching with Regional Quotas.

Aziz H; Gaspers S; Gudmundsson J; Mackenzie S; Mattei N; Walsh T, 2015, Computational aspects of multi-winner approval voting

Aziz H; Gaspers S; Mackenzie S; Mattei N; Narodytska N; Walsh T, 2015, Equilibria under the probabilistic serial rule

Aziz H; Gaspers S; Mackenzie S; Mattei N; Narodytska N; Walsh T, 2015, Manipulating the probabilistic serial rule

Aleksandrov M; Aziz H; Gaspers S; Walsh T, 2015, Online fair division: Analysing a food bank problem

Aziz H; Gaspers S; Mattei N; Narodytska N; Walsh T, 2014, Strategic aspects of the probabilistic serial rule for the allocation of goods, http://arxiv.org/abs/1401.6523v1

Gaspers S; Kalinowski T; Narodytska N; Walsh T, 2013, Coalitional Manipulation for Schulze’s Rule

Recorded / Rendered Creative Works

Page J; Walsh T; Hulbert AP, 2017, No Problem Too Big #1 - Artificial Intelligence and Killer Robots, The Conversation, Online and as part of Speaking With podcast, Editor(s): Hulbert A, Podcast, Published: 26 May 2017, Duration: 0:45:10, Recorded / Rendered Creative Works, https://newsroom.unsw.edu.au/news/science-tech/no-problem-too-big-1-artificial-intelligence-and-killer-robots

Working Papers

Aziz H; Chan H; Lee BE; Li B; Walsh T, 2020, Facility location problem with capacity constraints: Algorithmic and mechanism design perspectives, Association for the Advancement of Artificial Intelligence (AAAI), http://dx.doi.org10.1609/aaai.v34i02.5547

Aziz H; Gaspers S; Gudmundsson J; Mackenzie S; Mattei N; Walsh T, 2014, Computational aspects of Multi-Winner approval voting, http://dx.doi.org

Aziz H; Gaspers S; Mackenzie S; Mattei N; Stursberg P; Walsh T, 2014, Fixing a balanced knockout tournament, http://dx.doi.org

Preprints

Aziz H; Lu X; Suzuki M; Vollen J; Walsh T, 2024, Fair Lotteries for Participatory Budgeting, http://dx.doi.org/10.48550/arxiv.2404.05198

Aziz H; Lu X; Suzuki M; Vollen J; Walsh T, 2023, Best-of-Both-Worlds Fairness in Committee Voting, http://dx.doi.org/10.48550/arxiv.2303.03642

Olckers M; Walsh T, 2023, Incentives to Offer Algorithmic Recourse, http://arxiv.org/abs/2301.12884v1

Littman ML; Ajunwa I; Berger G; Boutilier C; Currie M; Doshi-Velez F; Hadfield G; Horowitz MC; Isbell C; Kitano H; Levy K; Lyons T; Mitchell M; Shah J; Sloman S; Vallor S; Walsh T, 2022, Gathering Strength, Gathering Storms: The One Hundred Year Study on Artificial Intelligence (AI100) 2021 Study Panel Report, http://dx.doi.org/10.48550/arxiv.2210.15767

Olckers M; Walsh T, 2022, Manipulation and Peer Mechanisms: A Survey, http://arxiv.org/abs/2210.01984v3

Olckers M; Vidler A; Walsh T, 2022, What Type of Explanation Do Rejected Job Applicants Want? Implications for Explainable AI, http://arxiv.org/abs/2205.09649v1

Aziz H; Suksompong W; Sun Z; Walsh T, 2021, Fairness Concepts for Indivisible Items with Externalities, http://dx.doi.org/10.48550/arxiv.2110.09066

Bessiere C; Carbonnel C; Dries A; Hebrard E; Katsirelos G; Lazaar N; Narodytska N; Quimper C-G; Stergiou K; Tsouros DC; Walsh T, 2020, Partial Queries for Constraint Acquisition, http://dx.doi.org/10.48550/arxiv.2003.06649

Aziz H; Gaspers S; Sun Z; Walsh T, 2020, From Matching with Diversity Constraints to Matching with Regional Quotas, http://dx.doi.org/10.48550/arxiv.2002.06748

Frisch AM; Hnich B; Kiziltan Z; Miguel I; Walsh T, 2019, A Commentary on "Breaking Row and Column Symmetries in Matrix Models", http://dx.doi.org/10.48550/arxiv.1910.01423

Narodytska N; Kasiviswanathan SP; Ryzhyk L; Sagiv M; Walsh T, 2017, Verifying Properties of Binarized Deep Neural Networks, http://dx.doi.org/10.48550/arxiv.1709.06662

Burton E; Goldsmith J; Koenig S; Kuipers B; Mattei N; Walsh T, 2017, Ethical Considerations in Artificial Intelligence Courses, http://dx.doi.org/10.48550/arxiv.1701.07769

Abeliuk A; Aziz H; Berbeglia G; Gaspers S; Kalina P; Mattei N; Peters D; Stursberg P; Van Hentenryck P; Walsh T, 2016, Interdependent Scheduling Games

van Bevern R; Komusiewicz C; Molter H; Niedermeier R; Sorge M; Walsh T, 2016, h-Index Manipulation by Undoing Merges, http://dx.doi.org/10.48550/arxiv.1604.04827

Aziz H; Lev O; Mattei N; Rosenschein JS; Walsh T, 2016, Strategyproof Peer Selection using Randomization, Partitioning, and Apportionment, http://dx.doi.org/10.48550/arxiv.1604.03632

Bredereck R; Chen J; Niedermeier R; Walsh T, 2015, Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty, http://dx.doi.org/10.48550/arxiv.1509.02424

Back to profile page