Toby Walsh
#49,178
Most Influential Person Now
British artificial intelligence researcher
Toby Walsh's AcademicInfluence.com Rankings
Toby Walshcomputer-science Degrees
Computer Science
#2204
World Rank
#2294
Historical Rank
Programming
#49
World Rank
#51
Historical Rank
Algorithms
#113
World Rank
#113
Historical Rank
Artificial Intelligence
#299
World Rank
#304
Historical Rank
Download Badge
Computer Science
Toby Walsh's Degrees
- Bachelors Computer Science University of York
Similar Degrees You Can Earn
Why Is Toby Walsh Influential?
(Suggest an Edit or Addition)According to Wikipedia, Toby Walsh is Chief Scientist at UNSW.ai, the AI Institute of UNSW Sydney. He is a Laureate fellow, and professor of artificial intelligence in the UNSW School of Computer Science and Engineering at the University of New South Wales and Data61 . He has served as Scientific Director of NICTA, Australia's centre of excellence for ICT research. He is noted for his work in artificial intelligence, especially in the areas of social choice, constraint programming and propositional satisfiability. He has served on the Executive Council of the Association for the Advancement of Artificial Intelligence.
Toby Walsh's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Handbook of Constraint Programming (2006) (1571)
- Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications (2009) (531)
- Handbook of Constraint Programming (Foundations of Artificial Intelligence) (2006) (500)
- Handbook of satisfiability (2009) (485)
- SATLIB: An Online Resource for Research on SAT (2000) (385)
- CSPLIB: A Benchmark Library for Constraints (1999) (294)
- SAT v CSP (2000) (293)
- Search in a Small World (1999) (281)
- Towards an Understanding of Hill-Climbing Procedures for SAT (1993) (271)
- Justified representation in approval-based committee voting (2014) (243)
- Breaking Row and Column Symmetries in Matrix Models (2002) (231)
- The Constrainedness of Search (1996) (219)
- A Theory of Abstraction (1992) (200)
- Principles and Practice of Constraint Programming — CP 2001: 7th International Conference, CP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings (2001) (196)
- Stochastic Constraint Programming (2002) (196)
- Benford's Law (2001) (194)
- Automated Deduction—CADE-11 (1992) (181)
- Depth-bounded Discrepancy Search (1997) (180)
- An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem (1996) (167)
- Verifying Properties of Binarized Deep Neural Networks (2017) (166)
- Random Constraint Satisfaction: Flaws and Structure (2001) (161)
- The TSP Phase Transition (1996) (161)
- Easy Problems are Sometimes Hard (1994) (159)
- How Hard Is It to Control an Election by Breaking Ties? (2013) (159)
- Computational Aspects of Multi-Winner Approval Voting (2014) (142)
- Backbones and Backdoors in Satisfiability (2005) (142)
- Proceedings of AAAI-96 (1996) (138)
- mCP Nets: Representing and Reasoning with Preferences of Multiple Agents (2004) (138)
- Uncertainty in Preference Elicitation and Aggregation (2007) (137)
- On the notion of interestingness in automated mathematical discovery (2000) (124)
- Global Constraints for Lexicographic Orderings (2002) (124)
- Fair assignment of indivisible objects under ordinal preferences (2013) (124)
- Beyond NP: the QSAT phase transition (1999) (111)
- Backbones in Optimization and Approximation (2001) (110)
- Stochastic Constraint Programming: A Scenario-Based Approach (2009) (109)
- Online Fair Division: Analysing a Food Bank Problem (2015) (109)
- Finding Diverse and Similar Solutions in Constraint Programming (2005) (107)
- PREFLIB: A Library for Preferences (2013) (106)
- PrefLib: A Library for Preferences http://www.preflib.org (2013) (105)
- Local Search and the Number of Solutions (1996) (102)
- Morphing: Combining Structure and Randomness (1999) (100)
- Ethical Considerations in Artificial Intelligence Courses (2017) (98)
- Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques (2003) (97)
- Solving Non-clausal Formulas with DPLL search (2004) (96)
- Complexity of and Algorithms for Borda Manipulation (2011) (93)
- A Short Introduction to Preferences: Between Artificial Intelligence and Social Choice (2011) (91)
- Barriers to Manipulation in Voting (2016) (90)
- An Empirical Analysis of Search in GSAT (1993) (88)
- Dominating Manipulations in Voting with Partial Information (2011) (88)
- Expert and Non-expert Opinion About Technological Unemployment (2017) (84)
- Global Grammar Constraints (2006) (83)
- Winner Determination in Sequential Majority Voting (2007) (83)
- Where Are the Really Hard Manipulation Problems? The Phase Transition in Manipulating the Veto Rule (2009) (83)
- Algorithms for Max-Min Share Fair Allocation of Indivisible Chores (2017) (81)
- Incompleteness and Incomparability in Preference Aggregation (2007) (81)
- Fair allocation of indivisible goods and chores (2019) (80)
- Aggregating Partially Ordered Preferences (2009) (80)
- Constraint Acquisition via Partial Queries (2013) (77)
- A Compression Algorithm for Large Arity Extensional Constraints (2007) (77)
- Singleton Consistencies (2000) (77)
- General Symmetry Breaking Constraints (2006) (76)
- Random Constraint Satisfaction: Theory Meets Practice (1998) (75)
- The Complexity of Global Constraints (2004) (74)
- Domain filtering consistencies for non-binary constraints (2008) (73)
- Where are the hard manipulation problems? (2010) (72)
- Phase Transitions and Annealed Theories: Number Partitioning as a Case Study (1996) (71)
- Estimating Search Tree Size (2006) (71)
- Unsatisfied Variables in Local Search (1995) (71)
- Automatic Concept Formation in Pure Mathematics (1999) (70)
- Permutation Problems and Channelling Constraints (2001) (70)
- Binary vs. non-binary constraints (2002) (70)
- Super Solutions in Constraint Programming (2004) (70)
- An Empirical Study of the Manipulability of Single Transferable Voting (2010) (69)
- Encodings of Non-Binary Constraint Satisfaction Problems (1999) (67)
- Filtering Algorithms for the NValue Constraint (2005) (67)
- The SAT Phase Transition (1994) (66)
- Online Cake Cutting (2010) (66)
- Analysis of Heuristics for Number Partitioning (1998) (65)
- Abstract Theorem Proving (1989) (63)
- Circuit Complexity and Decompositions of Global Constraints (2009) (62)
- Decomposing Global Grammar Constraints (2007) (61)
- The G12 Project: Mapping Solver Independent Models to Efficient Solutions (2005) (61)
- Modelling a Balanced Academic Curriculum Problem (2002) (61)
- Local Consistencies in SAT (2003) (58)
- Winner determination in voting trees with incomplete preferences and weighted votes (2012) (58)
- The Constrainedness of Arc Consistency (1997) (57)
- Modelling the Golomb Ruler Problem (1999) (57)
- Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems (2000) (56)
- A Divergence Critic for Inductive Proof (1996) (56)
- Hard and soft constraints for reasoning about qualitative conditional preferences (2006) (55)
- The PeerRank Method for Peer Assessment (2014) (55)
- Encodings of the Sequence Constraint (2007) (54)
- Theories of Abstraction (1997) (54)
- Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies (2010) (54)
- The Use of Proof Plans to Sum Series (1992) (53)
- Dual Modelling of Permutation and Injection Problems (2011) (52)
- The Conference Paper Assignment Problem: Using Order Weighted Averages to Assign Indivisible Goods (2017) (52)
- Restricted Manipulation in Iterative Voting: Condorcet Efficiency and Borda Score (2013) (51)
- The Difference All-Difference Makes (1999) (51)
- A Social Welfare Optimal Sequential Allocation Procedure (2013) (51)
- Propagation algorithms for lexicographic ordering constraints (2006) (50)
- The Hardest Random SAT Problems (1994) (50)
- Search on High Degree Graphs (2001) (50)
- The Satisfiability Constraint Gap (1996) (50)
- A calculus for and termination of rippling (1996) (49)
- Scaling Effects in the CSP Phase Transition (1995) (49)
- Restart Strategy Selection Using Machine Learning Techniques (2009) (49)
- SLIDE: A Useful Special Case of the CARDPATH Constraint (2008) (48)
- A Short Introduction to Preferences: Between AI and Social Choice (2011) (48)
- Preferences in Constraint Satisfaction and Optimization (2008) (48)
- Incompleteness and incomparability in preference aggregation: Complexity results (2011) (48)
- CGRASS: A System for Transforming Constraint Satisfaction Problems (2002) (47)
- Strategyproof Peer Selection: Mechanisms, Analyses, and Experiments (2016) (47)
- Strategic Behavior when Allocating Indivisible Goods Sequentially (2013) (46)
- Flow-Based Propagators for the SEQUENCE and Related Global Constraints (2008) (46)
- The Computational Impact of Partial Votes on Strategic Voting (2014) (44)
- Phase Transitions from Real Computational Problems (1995) (44)
- Manipulation complexity and gender neutrality in stable marriage procedures (2009) (43)
- Consistency and Propagation with Multiset Constraints: A Formal Viewpoint (2003) (43)
- Constraint-Based Preferential Optimization (2005) (42)
- How Not To Do It (1995) (42)
- Local Search Approaches in Stable Matching Problems (2013) (42)
- The Complexity of Reasoning with Global Constraints (2007) (41)
- Breaking Value Symmetry (2008) (39)
- Matrix Modelling (2001) (39)
- Scenario-based Stochastic Constraint Programming (2009) (39)
- Structure and Randomness (2006) (39)
- Matrix modelling: Exploiting common patterns in constraint programming (2002) (38)
- The Constrainedness Knife-Edge (1998) (38)
- Symmetry Breaking Using Value Precedence (2006) (38)
- Possible and Necessary Allocations via Sequential Mechanisms (2014) (37)
- The Backbone of the Travelling Salesperson (2005) (37)
- Automatic Invention of Integer Sequences (2000) (37)
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (2014) (36)
- Representing and Reasoning with Preferences (2007) (36)
- A translational approach to constraint answer set solving (2010) (36)
- Automatic Identification of Mathematical Concepts (2000) (36)
- Disjoint, Partition and Intersection Constraints for Set and Multiset Variables (2004) (34)
- Constraint and Variable Ordering Heuristics for Compiling Configuration Problems (2007) (34)
- Decompositions of All Different, Global Cardinality and Related Constraints (2009) (34)
- A Fixpoint Based Encoding for Bounded Model Checking (2002) (33)
- Aggregating partially ordered preferences: impossibility and possibility results (2005) (33)
- Interleaved and Discrepancy Based Search (1998) (33)
- Strategyproof peer selection using randomization, partitioning, and apportionment (2016) (33)
- Lot-based voting rules (2012) (32)
- Symmetry in matrix models (2001) (32)
- Coloured Rippling: An Extension of a Theorem Proving Heuristic (1994) (32)
- Manipulating Tournaments in Cup and Round Robin Competitions (2009) (32)
- Propagating Logical Combinations of Constraints (2005) (32)
- The Search for Satisfaction (1999) (32)
- Gathering Strength, Gathering Storms: The One Hundred Year Study on Artificial Intelligence (AI100) 2021 Study Panel Report (2022) (31)
- The Scaling of Search Cost (1997) (31)
- Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30 - August 3, 2000, Austin, Texas, USA (2000) (31)
- Symmetry Breaking Constraints: Recent Results (2012) (31)
- The Range and Roots Constraints: Specifying Counting and Occurrence Problems (2005) (31)
- Empirical Methods in AI (1998) (30)
- Difference Unification (1993) (30)
- Proceedings of the 16th international joint conference on Artificial Intelligence - IJCAI '99 (1999) (30)
- From Matching with Diversity Constraints to Matching with Regional Quotas (2019) (30)
- Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms (2010) (30)
- The Tractability of Global Constraints (2004) (29)
- Manipulation of Nanson's and Baldwin's Rules (2011) (29)
- Ties Matter: Complexity of Manipulation when Tie-Breaking with a Random Vote (2013) (29)
- Complexity of Terminating Preference Elicitation (2008) (29)
- The effective and ethical development of artificial intelligence: an opportunity to improve our wellbeing (2019) (28)
- Breaking Symmetry of Interchangeable Variables and Values (2007) (28)
- Fixing a Balanced Knockout Tournament (2014) (28)
- Reformulating Global Constraints: The Slideand RegularConstraints (2007) (28)
- Distance Constraints in Constraint Satisfaction (2007) (27)
- Difference Matching (1992) (27)
- Finding Multi-criteria Optimal Paths in Multi-modal Public Transportation Networks using the Transit Algorithm (2012) (27)
- Randomness and Structure (2006) (27)
- Is computational complexity a barrier to manipulation? (2010) (27)
- On the Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry (2010) (27)
- Symmetry-breaking answer set solving (2010) (26)
- Decomposable Constraints (1999) (26)
- Multiset Ordering Constraints (2003) (25)
- The Parameterized Complexity of Global Constraints (2008) (25)
- Possible and necessary winner problem in social polls (2013) (25)
- New Approaches to Constraint Acquisition (2016) (25)
- Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three (2011) (25)
- Online Fair Division: A Survey (2019) (25)
- Fair Division: The Computer Scientist's Perspective (2020) (24)
- Transforming and Refining Abstract Constraint Specifications (2005) (24)
- Manipulating the Probabilistic Serial Rule (2015) (23)
- Dealing with Incomplete Agents' Preferences and an Uncertain Agenda in Group Decision Making via Sequential Majority Voting (2008) (23)
- Arc Consistency and Quasigroup Completion (2006) (23)
- Mechanisms for Online Organ Matching (2017) (23)
- Local Search for Stable Marriage Problems with Ties and Incomplete Lists (2010) (23)
- A Hybrid MIP/CP Approach for Multi-activity Shift Scheduling (2012) (23)
- Decomposition of the NValue Constraint (2009) (22)
- Combining Symmetry Breaking with Other Constraints: Lexicographic Ordering with Sums (2004) (22)
- Eliminating the Weakest Link: Making Manipulation Intractable? (2012) (22)
- New algorithms for max restricted path consistency (2011) (21)
- Generating Single Peaked Votes (2015) (21)
- Two Encodings of DNNF Theories (2008) (21)
- Constraint Patterns (2003) (21)
- Tree Subsumption: Reasoning with Outlines (1992) (20)
- Candy Crush is NP-hard (2014) (20)
- Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives (2019) (20)
- Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study (1998) (20)
- The Enigma of SAT Hill-climbing Procedures (1992) (20)
- H-index manipulation by merging articles: Models, theory, and experiments (2015) (20)
- TRANSIT Routing on Video Game Maps (2012) (20)
- Among, Common and Disjoint Constraints (2005) (20)
- In Search for a SAT-friendly Binarized Neural Network Architecture (2020) (20)
- Aggregating preferences cannot be fair (2005) (19)
- Challenges in Resource and Cost Allocation (2015) (19)
- The Singularity May Never Be Near (2016) (19)
- The interface between P and NP: COL, XOR, NAE, 1-in-k, and Horn SAT (2002) (19)
- Turing's red flag (2015) (19)
- Online Estimation of SAT Solving Runtime (2008) (19)
- Equilibria Under the Probabilistic Serial Rule (2015) (19)
- A Study of Proxies for Shapley Allocations of Transport Costs (2014) (19)
- Answer Set Solving with Lazy Nogood Generation (2012) (19)
- Hybrid Modelling for Robust Solving (2004) (19)
- Agent Based Cooperative Theory Formation in Pure Mathematics (2000) (18)
- Local search algorithms on the Stable Marriage Problem: Experimental Studies (2010) (18)
- Pure Nash Equilibria in Online Fair Division (2017) (18)
- From Approximate to Optimal Solutions: Constructing Pruning and Propagation Rules (1997) (17)
- Calculating Criticalities (1996) (17)
- Control of Fair Division (2016) (17)
- Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items (2018) (17)
- Combining Symmetry Breaking and Global Constraints (2009) (16)
- Decompositions of Grammar Constraints (2008) (16)
- A Divergence Critic (1994) (16)
- Detecting and Exploiting Subproblem Tractability (2013) (16)
- Manipulating two stage voting rules (2013) (15)
- Strategic voting when aggregating partially ordered preferences (2006) (15)
- Reformulating Global Grammar Constraints (2009) (15)
- Inverse Consistencies for Non-Binary Constraints (2006) (15)
- Extensions to Proof Planning for Generating Implied Constraints (2001) (15)
- Allocation in Practice (2014) (15)
- An Empirical Study of Borda Manipulation (2010) (15)
- Controlling Elections by Replacing Candidates or Votes (2015) (15)
- Fairness Amidst Non-IID Graph Data: A Literature Review (2022) (14)
- Tetravex is NP-complete (2006) (14)
- SAT and Hybrid Models of the Car Sequencing Problem (2013) (14)
- Fixing balanced knockout and double elimination tournaments (2018) (14)
- Welfare of Sequential Allocation Mechanisms for Indivisible Goods (2015) (14)
- Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming (2001) (14)
- Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty (2015) (13)
- Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences (2013) (13)
- Manipulation and gender neutrality in stable marriage procedures (2009) (13)
- The weighted Grammar constraint (2011) (13)
- Symmetry within Solutions (2010) (13)
- Propagating Conjunctions of AllDifferent Constraints (2010) (13)
- Combining Voting Rules Together (2012) (13)
- Adaptive signal-vehicle cooperative controlling system (2011) (12)
- Equilibria in Sequential Allocation (2017) (12)
- Coalitional manipulation for Schulze's rule (2013) (12)
- Controlling Elections by Replacing Candidates or Votes (Extended Abstract) (2015) (12)
- The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables (2005) (12)
- Compact Preference Representation in Stable Marriage Problems (2009) (12)
- Fairness in Deceased Organ Matching (2018) (11)
- Breaking Symmetry with Different Orderings (2013) (11)
- Stability in Matching Problems with Weighted Preferences (2011) (11)
- Beyond Finite Domains: The All Different and Global Cardinality Constraints (2005) (11)
- Constrained CP-nets (2004) (11)
- Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), Stanford University, Stanford, CA, USA, June 29 - July 2, 2000 (2000) (11)
- Restricted Global Grammar Constraints (2009) (11)
- Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints (2009) (11)
- Greedy Algorithms for Fair Division of Mixed Manna (2019) (11)
- Approximation Algorithms for Max-Min Share Allocations of Indivisible Chores and Goods (2016) (11)
- Improving the Performance of maxRPC (2010) (10)
- Modelling Grammar Constraints with Answer Set Programming (2011) (10)
- Male optimal and unique stable marriages with partially ordered preferences (2009) (10)
- The Balance Constraint Family (2014) (10)
- Termination Orderings for Rippling (1994) (10)
- Translation-Based Constraint Answer Set Solving (2011) (10)
- Male optimality and uniqueness in stable marriage problems with partial orders (2010) (10)
- Strategic Behavior in a Decentralized Protocol for Allocating Indivisible Good (2012) (9)
- Two Algorithms for Additive and Fair Division of Mixed Manna (2020) (9)
- The Weighted CfgConstraint (2008) (9)
- Breaking symmetries in matrix models: A brief overview. (2003) (9)
- Theorem proving with definitions (1989) (9)
- Automatically Reformulating SAT-Encoded CSPs (2002) (9)
- A General Purpose Reasoner for Abstraction (1996) (9)
- The SeqBin Constraint Revisited (2012) (9)
- Computing Possible and Necessary Winners from Incomplete Partially-Ordered Preferences (2006) (9)
- 4 Constraint Programming (9)
- Cross Domain Mathematical Concept Formation (2000) (9)
- The ROOTS Constraint (2006) (9)
- Reformulating Propositional Satisfiability as Constraint Satisfaction (2000) (8)
- Fair Online Allocation of Perishable Goods and its Application to Electric Vehicle Charging (2019) (8)
- On the Complexity of Global Scheduling Constraints under Structural Restrictions (2013) (8)
- Strategic Behaviour When Allocating Indivisible Goods (2016) (8)
- The Range Constraint: Algorithms and Implementation (2006) (8)
- Adding resolution to the DPLL procedure for Boolean satisfiability (2002) (8)
- Procedural fairness in stable marriage problems (2011) (8)
- The Weighted CFG Constraint (2009) (8)
- Improved Algorithm for Finding (a, b)-Super Solutions (2005) (8)
- Symmetries of Symmetry Breaking Constraints (2009) (8)
- Possible and necessary winners in voting trees: majority graphs vs. profiles (2011) (8)
- Conflict-Driven Constraint Answer Set Solving with Lazy Nogood Generation (2011) (8)
- Computing Abstraction Hierarchies by Numerical Simulation (1996) (8)
- Breaking Generator Symmetry (2009) (8)
- Local search for stable marriage problems (2010) (8)
- Stable marriage problems with quantitative preferences (2010) (8)
- The SLIDE Meta-Constraint (2006) (7)
- Abstraction, Reformulation, and Approximation (2000) (7)
- Symposium on Abstraction, Reformulation, and Approximation (SARA-2000) (2001) (7)
- Clause Forms Generated by Bounded Model Checking (1999) (7)
- Strategy Proof Mechanisms for Facility Location in Euclidean and Manhattan Space (2020) (7)
- A Calculus for Rippling (1994) (7)
- IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 9-15, 2003 (2003) (7)
- Models of Permutation and Injection Problems (2004) (7)
- Why Channel? Multiple viewpoints for branching heuristics (2003) (7)
- Proceedings of AISB 2000 symposium on creative and cultural aspects and applications of AI and cognitive science (2000) (6)
- Weights in stable marriage problems increase manipulation opportunities (2011) (6)
- Most Competitive Mechanisms in Online Fair Division (2017) (6)
- Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies (2008) (6)
- Orbital shrinking: Theory and applications (2017) (6)
- Filtering algorithms for the multiset ordering constraint (2009) (6)
- A Short Introduction to Preferences (2011) (6)
- The Number Partition Phase Transition by (1995) (6)
- Manipulability of Single Transferable Vote (2009) (6)
- The AllDifferent Constraint with Precedences (2011) (6)
- Expected Outcomes and Manipulations in Online Fair Division (2017) (6)
- Strategy-Proofness, Envy-Freeness and Pareto Efficiency in Online Fair Division with Additive Utilities (2019) (6)
- Candy Crush's Puzzling Mathematics (2014) (6)
- The use of abstraction in automatic inference (1990) (6)
- Stability and Optimality in Matching Problems with Weighted Preferences (2011) (6)
- Satisfiability in the Year 2000 (2000) (5)
- Artificial intelligence is breaking patent law (2022) (5)
- Controlling Elections by Replacing Candidates: Theoretical and Experimental Results (2014) (5)
- Three generalizations of the FOCUS constraint (2013) (5)
- Parameterized Complexity Results in Symmetry Breaking (2010) (5)
- Strategyproof and Proportionally Fair Facility Location (2021) (5)
- A Local Search Approach to Solve Incomplete Fuzzy CSPs (2011) (5)
- Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing (2005) (5)
- Reasoning about Connectivity Constraints (2015) (5)
- Global onstraints for lexi ographi orderings ? (2002) (5)
- Finding Optimal Paths in Multi-modal Public Transportation Networks using Hub Nodes and TRANSIT algorithm (2012) (5)
- The inevitability of inconsistent abstract spaces (1993) (4)
- Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings (2005) (4)
- An Axiomatic and Empirical Analysis of Mechanisms for Online Organ Matching (2018) (4)
- Dynamic Symmetry Breaking Constraints (2008) (4)
- Automatic Generation of Implied Constraints : Initial Progress (2001) (4)
- Fair Division Minimizing Inequality (2018) (4)
- The Next Best Solution (2011) (4)
- Ranking Constraints (2016) (4)
- Symmetry in Solutions (2010) (4)
- Efficient Approximation of Well-Founded Justification and Well-Founded Domination (2013) (4)
- Venetian Elections and Lot-based Voting Rules (2011) (4)
- Models of Injection Problems (2002) (4)
- Complexity Issues in Preference Elicitation and Manipulation (2008) (4)
- Super CSPs (2003) (4)
- The Satis ability Constraint (1996) (4)
- Interdependent Scheduling Games (2016) (4)
- Monotone and Online Fair Division (2019) (4)
- A Grand Challenge for Computing Research : A Mathematical Assistant (4)
- Symmetry in Constraint Optimization (2007) (3)
- IJCAI-11 : proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, 16-22 July 2011 (2011) (3)
- Strategic aspects of the probabilistic serial rule for the allocation of goods (2014) (3)
- Symmetry Breaking for Distributed Multi-Context Systems (2011) (3)
- Strategy Proof Mechanisms for Facility Location at Limited Locations (2020) (3)
- Empirical Evaluation of Real World Tournaments (2016) (3)
- Where are the really hard manipulation problems ? The manipulation phase transition (2008) (3)
- Fairness Amidst Non-IID Graph Data: Current Achievements and Future Directions (2022) (3)
- Fairness Concepts for Indivisible Items with Externalities (2021) (3)
- Symmetry Breaking (2006) (3)
- An Incompleteness Theorem via Abstraction (1996) (3)
- HR: A System for Machine Discovery in Finite Algebras (1998) (3)
- Comparing SAT preprocessing techniques (2002) (3)
- Principles of Constraint Programming and Constraint Processing: A Review (2004) (3)
- Relational Consistencies (2001) (3)
- h-Index manipulation by undoing merges* (2016) (3)
- Theory and Applications of Satisfiability Testing – SAT 2017 (2017) (3)
- SCHOOL OF COMPUTER STUDIES Modelling the Golomb Ruler Problem 1 Introduction 2 The problem (1999) (3)
- Sequential majority voting with incomplete profiles (2007) (3)
- Winner Determination in Sequential Majority Voting with Incomplete Preferences (2006) (3)
- On Google Scholar H-Index Manipulation by Merging Articles (2014) (3)
- Partial Queries for Constraint Acquisition (2020) (3)
- Buffered Resource Constraint: Algorithms and Complexity (2014) (3)
- An Adaptive Model Restarts Heuristic (2013) (2)
- A Branch-and-Price Framework for the Maximum Covering and Patrol Routing Problem (2021) (2)
- The Meta-Turing Test (2022) (2)
- Theory and Applications of Satisfiability Testing: 8th International Conference, SAT 2005, St Andrews, Scotland, June 19-23, 2005, Proceedings (Lecture Notes in Computer Science) (2005) (2)
- Strategy Proof Mechanisms for Facility Location with Capacity Limits (2020) (2)
- Satisfiability in the Year 2000 (2004) (2)
- Modelling the Golomb Ruler (1999) (2)
- Minimal-envy Conference Paper Assignment: Formulation and a Fast Iterative Algorithm (2021) (2)
- Abstract Proof Checking: An Example Motivated by an Incompleteness Theorem (1997) (2)
- A Framework for Combining Set Variable Representations (2013) (2)
- Manipulation and Peer Mechanisms: A Survey (2022) (2)
- Tightness of Constraint Satisfaction Problems (2001) (2)
- A local search approach to solve incomplete fuzzy and weighted CSPs (2010) (2)
- Who speaks for AI? (2016) (2)
- IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011 (2011) (2)
- The RegularGcc Matrix Constraint (2012) (2)
- SAT vs CSP: a commentary (2019) (2)
- Algorithms for two variants of Satisfaction Approval Voting (2015) (2)
- The Extended Literal Encoding of SAT into CSP (2003) (2)
- The Range and Roots constraints: some applications (2006) (2)
- Algorithmic Decision Theory: 4th International Conference, ADT 2015, Lexington, KY, USA, September 27–30, 2015, Proceedings (2015) (2)
- Symmetry within and between Solutions (2010) (2)
- Random Constraint Satisfa tion : Flaws and Stru ture ? (1998) (2)
- Global constraints by composition: lexicographic ordering with sums (2003) (2)
- Fair Pairwise Exchange among Groups (2021) (2)
- Incremental Updating of the Transit Algorithm (2012) (2)
- SAT Encodings for the Car Sequencing Problem (2013) (2)
- What if… We create human-level artificial intelligence? (2016) (2)
- Reasoning about Constraint Models (2014) (2)
- Analogical Proof Planning (1998) (1)
- Expert and Non-expert Opinion About Technological Unemployment (2018) (1)
- Diierence Matching (2013) (1)
- Global Matrix Constraints ? (2011) (1)
- Abstraction, reformulation, and approximation : 4th International Symposium, SARA 2000, Horseshoe Bay, USA, July 26-29, 2000 : proceedings (2000) (1)
- Reports of the 2016 AAAI Workshop Program (2016) (1)
- CSPLib: Twenty Years On (2019) (1)
- Elicitation Strategies for Fuzzy Constraint Problems with Missing Prefer ences: an Experimental Study (2007) (1)
- Configuration (2007) (1)
- Dataset for "Fair Online Allocation of Perishable Goods and its Application to Electric Vehicle Charging" (2019) (1)
- Breaking Variable and Value Symmetry (2011) (1)
- Strategyproof Peer Selection (2016) (1)
- On The Notion Of Interestingness InAutomated Mathemati al Dis overySimon (2000) (1)
- Arc Consistency and Quasigroup CompletionPaul (1998) (1)
- Social Choice and Welfare Justified Representation in Approval-Based Committee Voting (2016) (1)
- AAAI 2002 Fall Symposium Series Reports (2002) (1)
- Will AI end privacy? How do we avoid an Orwellian future (2022) (1)
- Online Search Cost Estimation for SAT Solvers (2009) (1)
- Propagating Conjunctions of A LL D IFFERENT Constraints (1994) (1)
- Reports on the 2015 AAAI workshop series (2015) (1)
- Restricted Manipulation in Iterative Voting: Convergence and Condorcet Efficiency (2013) (1)
- Dynamic Posting of Static Symmetry Breaking Constraints (2008) (1)
- A Local Search Approach for Incomplete Soft Constraint Problems: Experimental Results on Meeting Scheduling Problems (2017) (1)
- Submission to CONSTRAINTS Stochastic Constraint Programming : A Scenario-Based Approach (2005) (1)
- Phase Transitions and Annealed Theories : Number Partitioning as a Case (1996) (1)
- A Pebble in the AI Race (2020) (1)
- Three generalizations of the FOCUS constraint (2015) (1)
- Proof Planning in Maple (2000) (1)
- Reformulation of Global Constraints in Answer Set Programming (2010) (1)
- Reports from the 2015 AAAI Workshop Program (2015) (1)
- Proceedings of the Eleventh European Conference on Artificial Intelligence, Amsterdam, The Netherlands, August 8-12, 1994 (1994) (1)
- Breaking Variable and Value Symmetry (2011) (1)
- Multiset variable representations and constraint propagation (2013) (1)
- Online Cake Cutting (published version) (2011) (1)
- Using uncertainty within computation : papers from the 2001 AAAI Fall Symposium, November 2-4, North Falmouth, Massachusetts (2001) (1)
- Preference aggregation and elicitation : tractability in the presence of incompleteness and incomparability (1)
- A Comparison of Lex Bounds for Multiset Variables in Constraint Programming (2011) (1)
- 2 a Theory of Abstraction Using Abstraction (1990) (1)
- Exploiting Constraints (2011) (1)
- Deceased Organ Matching in Australia (2017) (1)
- On the Complexity of Breaking Symmetry (2020) (1)
- Random Rank: The One and Only Strategyproof and Proportionally Fair Randomized Facility Location Mechanism (2022) (1)
- Determining winners in weighted sequential majority voting : incomplete profiles vs . majority graphs (2007) (1)
- Voting: Beyond Simple Majorities and Single-Winner Elections (Dagstuhl Seminar 17261) (2017) (1)
- Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation (2000) (1)
- Can AI invent? (2022) (1)
- C Proof of Theorem 4 . 1 a Proof of Theorem 3 . 1 (1994) (0)
- Proceedings of Ijcai-97 Workshop: Empirical Ai Programme Committee Ijcai-97 Empirical Ai Workshop 1 Four Invited Presentations Describing Problems and Successes in Empirical Studies. Comparing Apples with Oranges? Ijcai-97 Empirical Ai Workshop 2 Toby Walsh (editor) Ijcai-97 Empirical Ai Workshop 3 (1997) (0)
- Proportional Fairness in Obnoxious Facility Location (2023) (0)
- Justified representation in approval-based committee voting (2017) (0)
- GCAI-2018, 4th Global Conference on Artificial Intelligence, Luxembourg, September 18-21, 2018 (2018) (0)
- Constraints, Satisfiability, and Search (2010) (0)
- Algorithms and Experiments for Betweeness Centrality in Tree-Like Networks Bachelorarbeit (2017) (0)
- A History of Satisfiability (2007) (0)
- Ai@nicta (2012) (0)
- Satisfiability in the Year 2005 (2005) (0)
- The Range and Roots Constraints : Algorithms and Implementation (2006) (0)
- Preferences: modelling frameworks, reasoning tools, and multi-agent scenarios (2009) (0)
- Designing a Scheduling Competition ∗ (2007) (0)
- The Search for Satisfaction 1 Introduction 2 Satis ability (1999) (0)
- Learning constraints through partial queries (2023) (0)
- M A ] 12 S ep 2 01 6 Justified Representation in Approval-Based Committee Voting (2021) (0)
- 3 0 O ct 2 01 5 Turing ’ s Red Flag (2018) (0)
- Global SPACING Constraint (Technical Report) (2013) (0)
- Learning within Optimization (2013) (0)
- Online-2003 Online Constraint Solving: Handling Change and Uncertainty (2003) (0)
- Artificial Intelligence and the Courts: Artificial Intelligence Trustworthiness, and Litigation (2022) (0)
- Max-planck-institut F Ur Informatik Termination Orderings for Rippling K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses Publication Notes (2013) (0)
- StochasticConstraint Programming (2002) (0)
- N Increases. in the Region 0:40 < < (1996) (0)
- What Type of Explanation Do Rejected Job Applicants Want? Implications for Explainable AI (2022) (0)
- Adventures in Mathematical Reasoning (2020) (0)
- Association of Pacific Rim Universities ( APRU ) AI for Everyone Project Benefitting from and building trust in the technology Project Overview and Policy Statement 1 November 30 , 2018 (2019) (0)
- Two desirable fairness concepts for allocation of indivisible objects under ordinal preferences (2016) (0)
- AAAI 2002 Workshops (2002) (0)
- ECAI'92: A Methodological Malaise? (1993) (0)
- Procedural Fairness in Stable Marriage Problems (Extended Abstract) (2011) (0)
- Best-of-Both-Worlds Fairness in Committee Voting (2023) (0)
- Winner determination in voting trees with incomplete preferences and weighted votes (2011) (0)
- Experiments in Social Media (2019) (0)
- Paper Submissions for COMSOC-2012 (2010) (0)
- Las intrigantes matemáticas de Candy Crush (2015) (0)
- Multiset variable representations and constraint propagation (2013) (0)
- CHAPTER 1: INTRODUCTION (1967) (0)
- Computing Super-Schedules (2005) (0)
- SAT 2005: Satisfiability Research in the Year 2005 (2006) (0)
- Reformulating Propositional Satissability as Constraint Satisfaction (2000) (0)
- Creative Proof Planning (1994) (0)
- A General Purpose Reasoner for Abstraction a General Purpose Reasoner for Abstraction (1993) (0)
- Artificial Intelligence Applied to Assistive Technologies and Smart Environments, Papers from the 2016 AAAI Workshop, Phoenix, Arizona, USA, February 12, 2016 (2016) (0)
- 2 0 F eb 2 01 6 The Singularity May Never Be Near (2018) (0)
- Paul R. Cohen's Empirical Methods for Artificial Intelligence (1999) (0)
- Book reviews (2005) (0)
- Automatic Generation of Implied Constraints: Project Description (2000) (0)
- 13th biennial European Conference on Artificial Intelligence Workshop 1998 (1998) (0)
- Handbook of Satisfiability: Preface (2009) (0)
- The new robber barons (2018) (0)
- Artificial Intelligence The TSP phase transition (1996) (0)
- On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage (2022) (0)
- In conjunction with CADE-19, Miami, USA (2003) (0)
- The Limits of Model-based Discovery ? (2007) (0)
- Breaking Constraints Dynamically (2009) (0)
- Matrix Modelling : Exploiting Common Patterns in Constraint (2014) (0)
- KI-Community (2014) (0)
- Proceedings of Ecai-96 Workshop: Empirical Ai Programme Committee (1996) (0)
- Tree Subsumption: Reasoning with Outlines Tree Subsumption: Reasoning with Outlines (2013) (0)
- Chapter 18 Randomness and Structure (0)
- Ethical Issues in Artificial Intelligence (2020) (0)
- Chatbot revolution risks becoming a race of the reckless (2023) (0)
- Proceedings of the 4th International Conference on Algorithmic Decision Theory - Volume 9346 (2015) (0)
- The Cyclic S EQUENCE Constraint (2007) (0)
- Incentives to Offer Algorithmic Recourse (2023) (0)
- SARA 2013 Organization (2013) (0)
- General Purpose Proof Plans (1993) (0)
- Breaking Row and Column Symmetriesin Matrix (2002) (0)
- CHAT - Fast Shortest Path Queries in Road Networks [Abstract] (2013) (0)
- Controlling elections by replacing candidates for plurality and veto: theoretical and experimental results (2014) (0)
This paper list is powered by the following services:
Other Resources About Toby Walsh
What Schools Are Affiliated With Toby Walsh?
Toby Walsh is affiliated with the following schools:
What Are Toby Walsh's Academic Contributions?
Toby Walsh is most known for their academic work in the field of computer science. They are also known for their academic work in the fields of
Toby Walsh has made the following academic contributions:
