Chris Okasaki
- Artificial Intelligence top 5%
- Computational Theory and Mathematics top 2%
- Computer Networks and Communications top 5%
- Hardware and Architecture top 5%
- Information Systems top 10%
- Co-authors
- Gerth Stølting BrodalPeter LeeDavid TarditiEdoardo BiagioniRobert E. TarjanHaim KaplanC. Addison Stone
- Topics
- Logic, programming, and type systems (14 papers)Parallel Computing and Optimization Techniques (12 papers)Distributed systems and fault tolerance (11 papers)
- Partner nations
- United StatesDenmarkPuerto Rico
In The Last Decade
Chris Okasaki
25 papers receiving 509 citations
Peers
Comparison fields: 5 of 48
- Artificial Intelligence 443
- Computational Theory and Mathematics 254
- Computer Networks and Communications 204
- Hardware and Architecture 196
- Information Systems 103
Countries citing papers authored by Chris Okasaki
This map shows the geographic impact of Chris Okasaki'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 Chris Okasaki with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Chris Okasaki more than expected).
Fields of papers citing papers by Chris Okasaki
This network shows the impact of papers produced by Chris Okasaki. 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 Chris Okasaki. The network helps show where Chris Okasaki may publish in the future.
Co-authorship network of co-authors of Chris Okasaki
This figure shows the co-authorship network connecting the top 25 collaborators of Chris Okasaki. A scholar is included among the top collaborators of Chris Okasaki based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Chris Okasaki. Chris Okasaki is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 2 | |
| 2 | 1 | |
| 3 | 11 | |
| 4 | 9 | |
| 5 | 21 | |
| 6 | 4 | |
| 7 | 37 | |
| 8 | 25 | |
| 9 | Views for Standard ML | 1 |
| 10 | 288 | |
| 11 | 17 | |
| 12 | Fast Mergeable Integer Maps | 30 |
| 13 | Functional Pearls - Three Algorithms on Braun Trees | 1 |
| 14 | 2 | |
| 15 | 11 | |
| 16 | 1 | |
| 17 | 10 | |
| 18 | 18 | |
| 19 | 4 | |
| 20 | 15 |
About Chris Okasaki
Chris Okasaki is a scholar working on Hardware and Architecture, Computer Networks and Communications and Artificial Intelligence, having authored 28 papers that have together received 596 indexed citations. Recurring topics across this work include Logic, programming, and type systems (14 papers), Parallel Computing and Optimization Techniques (12 papers) and Distributed systems and fault tolerance (11 papers). The work is most often cited by research in Hardware and Architecture (196 citations), Software (72 citations) and Computational Theory and Mathematics (254 citations). Chris Okasaki has collaborated with scholars based in United States, Denmark and Puerto Rico. Frequent co-authors include Gerth Stølting Brodal, Peter Lee, David Tarditi, Edoardo Biagioni, Robert E. Tarjan, Haim Kaplan and C. Addison Stone. Their work appears in journals such as SIAM Journal on Computing, ACM SIGPLAN Notices and Journal of Functional Programming.
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.