Ocan Sankur

568 total citations
16 papers, 78 citations indexed

About

Ocan Sankur is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software. According to data from OpenAlex, Ocan Sankur has authored 16 papers receiving a total of 78 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Computational Theory and Mathematics, 8 papers in Artificial Intelligence and 7 papers in Software. Recurrent topics in Ocan Sankur's work include Formal Methods in Verification (9 papers), Software Testing and Debugging Techniques (4 papers) and Robotic Path Planning Algorithms (4 papers). Ocan Sankur is often cited by papers focused on Formal Methods in Verification (9 papers), Software Testing and Debugging Techniques (4 papers) and Robotic Path Planning Algorithms (4 papers). Ocan Sankur collaborates with scholars based in France, Belgium and United Kingdom. Ocan Sankur's co-authors include Jean-François Raskin, Romain Brenguier, Patricia Bouyer, Warren Schudy, Nicolas Markey, Mickaël Randour, Guillermo A. Pérez, François Schwarzentruber, Robert Könighofer and Arno Pauly and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Information and Computation.

In The Last Decade

Ocan Sankur

15 papers receiving 75 citations

Peers

Ocan Sankur

CTM

AI

SOFTW

MSOR

CNC

Andrea Turrini China

Joachim Klein Germany

Emmanuel Filiot Belgium

S. Akshay India

Aistis Simaitis United Kingdom

Ricardo Caferra France

Alexander Nadel Israel

Daniel Kühlwein Germany

Olivier Bouissou France

Jörg Pührer Austria

Andrea Turrini China

Ocan Sankur

70 ×1.4

CTM

74 ×1.9

AI

25 ×0.9

SOFTW

6 ×0.4

MSOR

11 ×1.4

CNC

Citations per year, relative to Ocan Sankur Ocan Sankur (= 1×) peers Andrea Turrini

Countries citing papers authored by Ocan Sankur

Since Specialization

Citations

This map shows the geographic impact of Ocan Sankur'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 Ocan Sankur with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ocan Sankur more than expected).

Fields of papers citing papers by Ocan Sankur

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ocan Sankur. 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 Ocan Sankur. The network helps show where Ocan Sankur may publish in the future.

Co-authorship network of co-authors of Ocan Sankur

This figure shows the co-authorship network connecting the top 25 collaborators of Ocan Sankur. A scholar is included among the top collaborators of Ocan Sankur 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 Ocan Sankur. Ocan Sankur is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

16 of 16 papers shown

1.

Sankur, Ocan, et al.. (2023). Improved Complexity Results and an Efficient Solution for Connected Multi-Agent Path Finding. SPIRE - Sciences Po Institutional REpository. 896–904.

2.

Sankur, Ocan, et al.. (2022). Complexity of planning for connected agents in a partially known environment. Theoretical Computer Science. 941. 202–220. 2 indexed citations

3.

Sankur, Ocan, et al.. (2020). Complexity of planning for connected agents. Autonomous Agents and Multi-Agent Systems. 34(2). 4 indexed citations

4.

Sankur, Ocan, et al.. (2019). Reachability and Coverage Planning for Connected Agents. HAL (Le Centre pour la Communication Scientifique Directe). 144–150. 1 indexed citations

5.

Brenguier, Romain, Arno Pauly, Jean-François Raskin, & Ocan Sankur. (2017). Admissibility in Games with Imperfect Information (Invited Talk). DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

6.

Randour, Mickaël, Jean-François Raskin, & Ocan Sankur. (2017). Percentile queries in multi-dimensional Markov decision processes. Formal Methods in System Design. 50(2-3). 207–248. 9 indexed citations

7.

Brenguier, Romain, Jean-François Raskin, & Ocan Sankur. (2016). Assume-admissible synthesis. Acta Informatica. 54(1). 41–83. 16 indexed citations

8.

Jacobs, Swen, Roderick Bloem, Romain Brenguier, et al.. (2016). The first reactive synthesis competition (SYNTCOMP 2014). International Journal on Software Tools for Technology Transfer. 19(3). 367–390. 13 indexed citations

9.

Jacobs, Swen, Roderick Bloem, Romain Brenguier, et al.. (2016). The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results. SHILAP Revista de lepidopterología. 229. 149–177. 3 indexed citations

10.

Sankur, Ocan, Patricia Bouyer, & Nicolas Markey. (2014). Shrinking timed automata. Information and Computation. 234. 107–132. 1 indexed citations

11.

Bouyer, Patricia, Nicolas Markey, & Ocan Sankur. (2014). Robust reachability in timed automata and games: A game-based approach. Theoretical Computer Science. 563. 43–74. 2 indexed citations

12.

Brenguier, Romain, Guillermo A. Pérez, Jean-François Raskin, & Ocan Sankur. (2014). AbsSynthe: abstract synthesis from succinct safety specifications. SHILAP Revista de lepidopterología. 157. 100–116. 7 indexed citations

13.

Sankur, Ocan. (2013). THÈSE DE DOCTORAT DE L'ÉCOLE NORMALE SUPÉRIEURE DE CACHAN. 2 indexed citations

14.

Sankur, Ocan, Patricia Bouyer, & Nicolas Markey. (2011). Shrinking Timed Automata. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 6 indexed citations

15.

Sankur, Ocan, et al.. (2010). Robust Model-Checking of Timed Automata. 1 indexed citations

16.

Sankur, Ocan, et al.. (2010). Online Correlation Clustering. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 573–584. 9 indexed citations

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.

Explore authors with similar magnitude of impact