Michael Codish
Impact in
- Artificial Intelligence top 1%
- Logic, programming, and type systems
- Logic, Reasoning, and Knowledge
-
- Constraint Satisfaction and Optimization
Papers in
-
- Logic, programming, and type systems 70
- Logic, Reasoning, and Knowledge 12
- Algorithms and Data Compression 4
-
- Constraint Satisfaction and Optimization 22
- Co-authors
- Peter J. Stuckey (16 shared papers)Vitaly Lagoon (14 shared papers)Olga Ohrimenko (2 shared papers)Bart Demoen (5 shared papers)Samir Genaim (12 shared papers)Maurice Bruynooghe (11 shared papers)Ehud Y. Shapiro (6 shared papers)Peter Schneider–Kamp (13 shared papers)
In The Last Decade
Michael Codish
103 papers receiving 1.7k citations
Peers
Comparison fields: 5 of 37
- Artificial Intelligence 1.4k
- Computer Networks and Communications 353
- Computational Theory and Mathematics 238
- Hardware and Architecture 75
- Software 24
Countries citing papers authored by Michael Codish
This map shows the geographic impact of Michael Codish's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michael Codish with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Codish more than expected).
Fields of papers citing papers by Michael Codish
This network shows the impact of papers produced by Michael Codish. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michael Codish. The network helps show where Michael Codish may publish in the future.
Co-authors
The 25 scholars most cited alongside Michael Codish, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 106 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 167 | |
| 2 | 1999 | 97 | |
| 3 | 2014 | 60 | |
| 4 | 1995 | 53 | |
| 5 | 2007 | 50 | |
| 6 | 1988 | 48 | |
| 7 | 2008 | 48 | |
| 8 | 1993 | 45 | |
| 9 | 1994 | 41 | |
| 10 | 2005 | 41 | |
| 11 | 1994 | 40 | |
| 12 | 2007 | 39 | |
| 13 | Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis. | 1991 | 38 |
| 14 | Analysing logic programs using “prop”-ositional logic programs and a magic wand | 1993 | 38 |
| 15 | 1994 | 35 | |
| 16 | 1995 | 35 | |
| 17 | 2010 | 32 | |
| 18 | 1993 | 31 | |
| 19 | 2014 | 31 | |
| 20 | 2000 | 30 |
About Michael Codish
Michael Codish is a scholar working on Artificial Intelligence, Computer Networks and Communications, Computational Theory and Mathematics, Hardware and Architecture and Discrete Mathematics and Combinatorics, having authored 106 papers that have together received 1.8k indexed citations. Recurring topics across this work include Logic, programming, and type systems (70 papers), Constraint Satisfaction and Optimization (22 papers), Logic, Reasoning, and Knowledge (12 papers), Complexity and Algorithms in Graphs (6 papers), Formal Methods in Verification (6 papers), Advanced Graph Theory Research (5 papers), Graph Theory and Algorithms (4 papers) and Algorithms and Data Compression (4 papers). The work is most often cited by research in Artificial Intelligence (1.4k citations), Computer Networks and Communications (353 citations), Computational Theory and Mathematics (238 citations), Hardware and Architecture (75 citations) and Software (24 citations). Michael Codish has collaborated with scholars based in Israel, Australia and Belgium. Frequent co-authors include Peter J. Stuckey, Vitaly Lagoon, Olga Ohrimenko, Bart Demoen, Samir Genaim, Maurice Bruynooghe, Ehud Y. Shapiro, Peter Schneider–Kamp, John P. Gallagher and Dennis R. Dams. Their work appears in journals such as The Journal of Logic Programming, Theory and Practice of Logic Programming, Constraints, ACM Transactions on Programming Languages and Systems and Lecture notes in computer science.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.