Dilsun Kaynar

1.1k total citations
24 papers, 429 citations indexed

About

Dilsun Kaynar is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Dilsun Kaynar has authored 24 papers receiving a total of 429 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Artificial Intelligence, 12 papers in Computational Theory and Mathematics and 10 papers in Computer Networks and Communications. Recurrent topics in Dilsun Kaynar's work include Formal Methods in Verification (10 papers), Petri Nets in System Modeling (7 papers) and Security and Verification in Computing (7 papers). Dilsun Kaynar is often cited by papers focused on Formal Methods in Verification (10 papers), Petri Nets in System Modeling (7 papers) and Security and Verification in Computing (7 papers). Dilsun Kaynar collaborates with scholars based in United States, Netherlands and Italy. Dilsun Kaynar's co-authors include Nancy Lynch, Roberto Segala, Frits Vaandrager, Anupam Datta, Deepak Garg, Jason Franklin, Limin Jia, Michael Carl Tschantz, Ling Cheung and Olivier Pereira and has published in prestigious journals such as Journal of Fish Diseases, IEEE Security & Privacy and Discrete Event Dynamic Systems.

In The Last Decade

Dilsun Kaynar

22 papers receiving 409 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Dilsun Kaynar United States	12	211	197	129	105	78	24	429
Mohamad Jaber Lebanon	10	91 0.4×	180 0.9×	109 0.8×	69 0.7×	56 0.7×	28	327
Ylìès Falcone France	12	285 1.4×	275 1.4×	167 1.3×	68 0.6×	177 2.3×	40	484
Felix Klaedtke Switzerland	12	139 0.7×	253 1.3×	252 2.0×	37 0.4×	80 1.0×	32	479
Bernd Finkbeiner Germany	13	426 2.0×	385 2.0×	147 1.1×	91 0.9×	203 2.6×	74	611
Lalita Jategaonkar Jagadeesan United States	12	191 0.9×	181 0.9×	116 0.9×	78 0.7×	194 2.5×	38	451
Farhad Mehta Switzerland	3	190 0.9×	197 1.0×	79 0.6×	46 0.4×	133 1.7×	5	333
Mario Bravetti Italy	14	303 1.4×	341 1.7×	174 1.3×	50 0.5×	66 0.8×	63	529
Ansgar Fehnker Australia	10	291 1.4×	109 0.6×	68 0.5×	85 0.8×	137 1.8×	35	434
Laurent Voisin France	3	166 0.8×	163 0.8×	68 0.5×	41 0.4×	127 1.6×	4	301
Georg Weißenbacher Austria	9	236 1.1×	202 1.0×	82 0.6×	93 0.9×	218 2.8×	32	460

Countries citing papers authored by Dilsun Kaynar

Since Specialization

Citations

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

Fields of papers citing papers by Dilsun Kaynar

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Dilsun Kaynar

This figure shows the co-authorship network connecting the top 25 collaborators of Dilsun Kaynar. A scholar is included among the top collaborators of Dilsun Kaynar 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 Dilsun Kaynar. Dilsun Kaynar 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:

20 of 20 papers shown

Garg, Deepak, et al.. (2018). Logical Specification of the GLBA and HIPAA Privacy Laws (CMU-CyLab-10-007). Figshare.

Garg, Deepak, Jason Franklin, Dilsun Kaynar, & Anupam Datta. (2018). Towards a Theory of Secure Systems (CMU-CyLab-08-003). Figshare.

Datta, Anupam, et al.. (2015). Program Actions as Actual Causes: A Building Block for Accountability. 261–275. 7 indexed citations

Datta, Anupam, Jason Franklin, Deepak Garg, Limin Jia, & Dilsun Kaynar. (2011). On Adversary Models and Compositional Security. IEEE Security & Privacy. 9(3). 26–32. 12 indexed citations

Tschantz, Michael Carl, Dilsun Kaynar, & Anupam Datta. (2011). Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract). Electronic Notes in Theoretical Computer Science. 276. 61–79. 21 indexed citations

Kaynar, Dilsun, Nancy Lynch, Roberto Segala, & Frits Vaandrager. (2010). \nThe Theory of Timed I/O Automata, Second Edition. Radboud Repository (Radboud University). 7 indexed citations

Kaynar, Dilsun, Nancy Lynch, Roberto Segala, & Frits Vaandrager. (2010). The Theory of Timed I/O Automata, Second Edition. Radboud Repository (Radboud University). 1(1). 1–137. 11 indexed citations

Garg, Deepak, Jason Franklin, Dilsun Kaynar, & Anupam Datta. (2010). Compositional System Security in the Presence of Interface-Confined Adversaries (CMU-CyLab-10-004). Journal of Fish Diseases. 41(7). 1111–1116. 2 indexed citations

Garg, Deepak, et al.. (2010). Experiences in the logical specification of the HIPAA and GLBA privacy laws. 73–82. 45 indexed citations

10.

Datta, Anupam, Jason Franklin, Deepak Garg, & Dilsun Kaynar. (2009). A Logic of Secure Systems and its Application to Trusted Computing. 221–236. 46 indexed citations

11.

Canetti, Ran, Ling Cheung, Dilsun Kaynar, et al.. (2008). Analyzing Security Protocols Using Time-Bounded Task-PIOAs. Discrete Event Dynamic Systems. 18(1). 111–159. 12 indexed citations

12.

Canetti, Ran, Ling Cheung, Dilsun Kaynar, Nancy Lynch, & Olivier Pereira. (2007). Compositional Security for Task-PIOAs. Radboud Repository (Radboud University). 125–139. 4 indexed citations

13.

Kaynar, Dilsun, Nancy Lynch, Roberto Segala, & Frits Vaandrager. (2006). The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science). Morgan & Claypool Publishers eBooks. 812(2). 503–11. 38 indexed citations

14.

Canetti, Ran, Ling Cheung, Dilsun Kaynar, et al.. (2006). Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol. DSpace@MIT (Massachusetts Institute of Technology). 6 indexed citations

15.

Kaynar, Dilsun, Nancy Lynch, Roberto Segala, & Frits Vaandrager. (2006). The Theory of Timed I/O Automata. Radboud Repository (Radboud University). 26 indexed citations

16.

Canetti, Ran, Ling Cheung, Dilsun Kaynar, et al.. (2006). Using task-structured probabilistic I/O automata to analyze cryptographic protocols. HAL (Le Centre pour la Communication Scientifique Directe). 34–39. 1 indexed citations

17.

Kaynar, Dilsun, Nancy Lynch, Roberto Segala, & Frits Vaandrager. (2006). The Theory of Timed I/O Automata. 1(1). 1–114. 90 indexed citations

18.

Canetti, Ran, Ling Cheung, Dilsun Kaynar, et al.. (2005). Using Probabilistic I/O Automata to improve the analysis of cryptographic protocols. DIAL (Catholic University of Leuven). 63. 40–41. 1 indexed citations

19.

Kaynar, Dilsun, Nancy Lynch, Roberto Segala, & Frits Vaandrager. (2004). Timed I/O automata: a mathematical framework for modeling and analyzing real-time systems. 166–177. 61 indexed citations

20.

Kaynar, Dilsun, et al.. (2003). A Framework for Modeling Timed Systems with Restricted Hybrid Automata. 2 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