What is he best known for?
The fields of study he is best known for:
- Algorithm
- Programming language
- Artificial intelligence
Ian P. Gent mostly deals with Algorithm, Theoretical computer science, Discrete mathematics, Satisfiability and Mathematical optimization.
In the subject of general Algorithm, his work in Boolean satisfiability problem is often linked to ENCODE and Local consistency, thereby combining diverse domains of study.
The Theoretical computer science study combines topics in areas such as Implementation, Set and Benchmark.
His Satisfiability study combines topics in areas such as Conjecture, Hill climbing and Orders of magnitude.
His Mathematical optimization research includes elements of Structure and Morphing.
His research in the fields of Binary constraint overlaps with other disciplines such as Artificial intelligence.
His most cited work include:
- SATLIB: An Online Resource for Research on SAT (261 citations)
- MINION: A Fast, Scalable, Constraint Solver (238 citations)
- CSPLIB: A Benchmark Library for Constraints (230 citations)
What are the main themes of his work throughout his whole career to date?
Ian P. Gent mainly focuses on Algorithm, Mathematical optimization, Constraint programming, Constraint satisfaction problem and Constraint satisfaction.
His study on Satisfiability and Backtracking is often connected to Symmetry breaking as part of broader study in Algorithm.
Ian P. Gent has researched Satisfiability in several fields, including Variable and Local search.
His studies examine the connections between Mathematical optimization and genetics, as well as such issues in Phase transition, with regards to Discrete mathematics.
His Local consistency study in the realm of Constraint satisfaction problem connects with subjects such as Solver, Theoretical computer science, Set and Artificial intelligence.
His work deals with themes such as Mathematical proof and Benchmark, which intersect with Theoretical computer science.
He most often published in these fields:
- Algorithm (26.87%)
- Mathematical optimization (26.12%)
- Constraint programming (24.63%)
What were the highlights of his more recent work (between 2014-2021)?
- Theoretical computer science (18.66%)
- Constraint programming (24.63%)
- Combinatorics (8.96%)
In recent papers he was focusing on the following fields of study:
His primary scientific interests are in Theoretical computer science, Constraint programming, Combinatorics, Benchmark and Constraint satisfaction problem.
His study in the field of Boolean satisfiability problem is also linked to topics like Quality.
His research brings together the fields of Constraint satisfaction and Constraint programming.
His work on Constraint logic programming, Constraint learning and Hybrid algorithm as part of general Constraint satisfaction study is frequently linked to Solver, therefore connecting diverse disciplines of science.
His Benchmark research incorporates themes from Automated theorem proving, Small set, Heuristics and Natural language.
His work on Local consistency as part of his general Constraint satisfaction problem study is frequently connected to Local search, thereby bridging the divide between different branches of science.
Between 2014 and 2021, his most popular works were:
- Automatically improving constraint models in Savile Row (24 citations)
- Complexity of n-queens completion (23 citations)
- A review of literature on parallel constraint solving (7 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Programming language
- Artificial intelligence
His primary areas of study are Theoretical computer science, Constraint satisfaction problem, Constraint programming, Algorithm and Speedup.
His research in Theoretical computer science intersects with topics in Cache, Process, Expression and Benchmark.
He studies Constraint satisfaction problem, focusing on Local consistency in particular.
His Constraint programming study frequently draws connections between related disciplines such as Constraint satisfaction.
He interconnects Software, Debugging and Inference in the investigation of issues within Algorithm.
His Solver research is multidisciplinary, incorporating perspectives in Combinatorics, Eight queens puzzle, Set and Boolean satisfiability problem.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
