Nihal Pekergin

689 total citations
35 papers, 162 citations indexed

About

Nihal Pekergin is a scholar working on Computational Theory and Mathematics, Management Information Systems and Computer Networks and Communications. According to data from OpenAlex, Nihal Pekergin has authored 35 papers receiving a total of 162 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Computational Theory and Mathematics, 17 papers in Management Information Systems and 15 papers in Computer Networks and Communications. Recurrent topics in Nihal Pekergin's work include Advanced Queuing Theory Analysis (17 papers), Petri Nets in System Modeling (13 papers) and Formal Methods in Verification (10 papers). Nihal Pekergin is often cited by papers focused on Advanced Queuing Theory Analysis (17 papers), Petri Nets in System Modeling (13 papers) and Formal Methods in Verification (10 papers). Nihal Pekergin collaborates with scholars based in France, Morocco and Türkiye. Nihal Pekergin's co-authors include Paolo Ballarini, Serge Haddad, Marie Duflot, Mouad Ben Mamoun, Lynda Mokdad, Tuǧrul Dayar, Joël Blot, Naı̈la Hayek, Jean‐Michel Fourneau and Jean-Michel Fourneau and has published in prestigious journals such as European Journal of Operational Research, Computers & Operations Research and Computers in Biology and Medicine.

In The Last Decade

Nihal Pekergin

31 papers receiving 147 citations

Peers

Nihal Pekergin

CTM

CNC

MIS

MSOR

EEE

W.D. Obal United States

Vsevolod Shneer United Kingdom

Jasen Markovski Netherlands

Christian Posthoff Germany

S. Ghanta United States

Gérard Florin France

Blaise Genest France

Paritosh K. Pandya India

David K. Probst United States

Pierre-Olivier Ribet France

W.D. Obal United States

Nihal Pekergin

152 ×1.9

CTM

97 ×1.9

CNC

52 ×1.1

MIS

35 ×1.3

MSOR

34 ×1.4

EEE

Citations per year, relative to Nihal Pekergin Nihal Pekergin (= 1×) peers W.D. Obal

Countries citing papers authored by Nihal Pekergin

Since Specialization

Citations

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

Fields of papers citing papers by Nihal Pekergin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Nihal Pekergin

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

Pekergin, Nihal, et al.. (2024). Efficient probabilistic inference in biochemical networks. Computers in Biology and Medicine. 183. 109280–109280.

Fourneau, Jean‐Michel, et al.. (2020). Stochastic Bounds for the Max Flow in a Network with Discrete Random Capacities. Electronic Notes in Theoretical Computer Science. 353. 77–105.

Pekergin, Nihal. (2019). INTRODUCTION TO THE SPECIAL ISSUE ON LEARNING, OPTIMIZATION, AND THEORY OF G-NETWORKS. Probability in the Engineering and Informational Sciences. 35(1). 1–5. 2 indexed citations

Pekergin, Nihal, et al.. (2017). Aggregation for Computing Multi-Modal Stationary Distributions in 1-D Gene Regulatory Networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 15(3). 813–827. 3 indexed citations

Ballarini, Paolo, et al.. (2015). HASL: A new approach for performance evaluation and model checking from concepts to experimentation. Performance Evaluation. 90. 53–77. 17 indexed citations

Ballarini, Paolo, et al.. (2011). COSMOS: A Statistical Model Checker for the Hybrid Automata Stochastic Logic. 143–144. 16 indexed citations

Fourneau, Jean‐Michel, et al.. (2010). Stochastic bounds for performance evaluation of Web services. Concurrency and Computation Practice and Experience. 22(10). 1286–1307. 2 indexed citations

Mokdad, Lynda, et al.. (2007). Aggregated bounding Markov processes applied to the analysis of tandem queues. 43. 3 indexed citations

Mamoun, Mouad Ben, Ana Bušić, & Nihal Pekergin. (2007). GENERALIZED CLASS [Cscr ] MARKOV CHAINS AND COMPUTATION OF CLOSED-FORM BOUNDING DISTRIBUTIONS. Probability in the Engineering and Informational Sciences. 21(2). 235–260. 2 indexed citations

10.

Pekergin, Nihal, et al.. (2007). CUT : Combining stochastic ordering and censoring to bound steady-state rewards and first passage time. 31. 211–212. 5 indexed citations

11.

Mamoun, Mouad Ben, Jean-Michel Fourneau, & Nihal Pekergin. (2007). Analyzing Weighted Round Robin policies with a stochastic comparison approach. Computers & Operations Research. 35(8). 2420–2431. 2 indexed citations

12.

Mokdad, Lynda, et al.. (2007). Stochastic Bounds Applied to the End to End QoS in Communication Systems. SPIRE - Sciences Po Institutional REpository. 2459. 374–380. 2 indexed citations

13.

Dayar, Tuǧrul, et al.. (2006). Conditional steady-state bounds for a subset of states in Markov chains. Bilkent University Institutional Repository (Bilkent University). 3–es. 4 indexed citations

14.

Mokdad, Lynda, et al.. (2006). Loss rates bounds for IP switches in MPLS networks. SPIRE - Sciences Po Institutional REpository. 208–214. 4 indexed citations

15.

Mamoun, Mouad Ben & Nihal Pekergin. (2006). Computing Closed-Form Stochastic Bounds on Transient Distributions of Markov Chains. 260–263. 2 indexed citations

16.

Pekergin, Nihal, et al.. (2004). Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering. European Journal of Operational Research. 165(3). 810–825. 7 indexed citations

17.

Fourneau, Jean‐Michel, et al.. (2003). An algorithmic and numerical approach to bound the performance of high speed networks. 20. 375–382. 5 indexed citations

18.

Mamoun, Mouad Ben & Nihal Pekergin. (2002). CLOSED-FORM STOCHASTIC BOUNDS ON THE STATIONARY DISTRIBUTION OF MARKOV CHAINS. Probability in the Engineering and Informational Sciences. 16(4). 403–426. 6 indexed citations

19.

Pekergin, Nihal, et al.. (2002). Comparison of fair queuing algorithms with a stochastic approach. 139–144. 1 indexed citations

20.

Pekergin, Nihal, et al.. (1998). Réseaux généralisés multiclasses avec synchronisations cycliques. RAIRO - Operations Research. 32(3). 353–372. 1 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