default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNihal Pekergin
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Adrien Le Coënt
, Benoît Barbot, Nihal Pekergin:
Efficient probabilistic inference in biochemical networks. Comput. Biol. Medicine 183: 109280 (2024)- 2023
- [c62]Adrien Le Coënt, Benoît Barbot, Nihal Pekergin, Cüneyt Güzelis:
Bayesian Networks as Approximations of Biochemical Networks. EPEW 2023: 216-233 - 2021
- [c61]Nihal Pekergin, Sovanna Tan:
Quantitative Analysis of Attack Defense Trees. VALUETOOLS 2021: 207-220 - 2020
- [c60]Jean-Michel Fourneau, Nihal Pekergin, Sovanna Tan:
Stochastic Bounds For Some Stochastic Optimisation Problems. VALUETOOLS 2020: 112-119
2010 – 2019
- 2019
- [c59]Loubna Echabbi, Jean-Michel Fourneau, Oussama Gacem, Houda Lotfi, Nihal Pekergin:
Stochastic Bounds for the Max Flow in a Network with Discrete Random Capacities. PASM 2019: 77-105 - 2018
- [j16]Neslihan Avcu, Nihal Pekergin, Ferhan Pekergin, Cüneyt Güzelis:
Aggregation for Computing Multi-Modal Stationary Distributions in 1-D Gene Regulatory Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 15(3): 813-827 (2018) - 2017
- [c58]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Stochastic Bounds for Switched Bernoulli Batch Arrivals Observed Through Measurements. ASMTA 2017: 1-15 - [c57]Johanne Cohen, A. Fauquette, Jean-Michel Fourneau, G. C. Noukela, Nihal Pekergin:
Convex Stochastic Bounds and Stochastic Optimisation on Graphs. PASM 2017: 23-44 - 2016
- [j15]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Performance Analysis of a Queue by Combining Stochastic Bounds, Real Traffic Traces and Histograms. Comput. J. 59(12): 1817-1830 (2016) - [j14]Marziyeh Bayati, Mohammed Dahmoune, Jean-Michel Fourneau, Nihal Pekergin, Dimitrios Vekris:
A tool based on traffic traces and stochastic monotonicity to analyze data centers and their energy consumption. EAI Endorsed Trans. Energy Web 3(10): e3 (2016) - [c56]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Stochastic Bounds and Histograms for Active Queues Management and Networks Analysis. ASMTA 2016: 1-16 - [c55]Nihal Pekergin, Sovanna Tan, Jean-Michel Fourneau:
Quantitative Attack Tree Analysis: Stochastic Bounds and Numerical Analysis. GraMSec@CSF 2016: 119-133 - [c54]Jean-Michel Fourneau, Nihal Pekergin:
Dynamic Fault Trees with Rejuvenation: Numerical Analysis and Stochastic Bounds. PASM 2016: 27-47 - 2015
- [j13]Paolo Ballarini, Benoît Barbot, Marie Duflot, Serge Haddad, Nihal Pekergin:
HASL: A new approach for performance evaluation and model checking from concepts to experimentation. Perform. Evaluation 90: 53-77 (2015) - [c53]Jaroslaw Bylina, Jean-Michel Fourneau, Marek Karwacki, Nihal Pekergin, Franck Quessette:
Stochastic Bounds for Markov Chains with the Use of GPU. CN 2015: 357-370 - [c52]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Thierry Mautor, Nihal Pekergin:
Smoothing the Input Process in a Batch Queue. ISCIS 2015: 223-232 - [c51]Neslihan Avcu, Nihal Pekergin, Ferhan Pekergin, Cüneyt Güzelis:
Numerically Efficient Analysis of a One-Dimensional Stochastic Lac Operon Model. ISCIS 2015: 261-271 - [c50]Jean-Michel Fourneau, Nihal Pekergin:
A Numerical Analysis of Dynamic Fault Trees Based on Stochastic Bounds. QEST 2015: 176-191 - 2014
- [j12]Hind Castel-Taleb, Nihal Pekergin:
Strong and weak stochastic bounds for multidimensional Markov chains. Int. J. Crit. Comput. Based Syst. 5(1/2): 148-168 (2014) - [c49]Thu-Ha Dao-Thi, Jean-Michel Fourneau, Nihal Pekergin, Franck Quessette:
Time Parallel Simulation for Dynamic Fault Trees. ISCIS 2014: 337-344 - 2013
- [c48]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Stochastic Bounds and Histograms for Network Performance Analysis. EPEW 2013: 13-27 - [c47]Farah Aït-Salaht, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
A Bounding Histogram Approach for Network Performance Analysis. HPCC/EUC 2013: 458-465 - [c46]Farah Aït-Salaht, Jean-Michel Fourneau, Nihal Pekergin:
Computing Bounds of the MTTF for a Set of Markov Chains. ISCIS 2013: 67-76 - 2012
- [j11]Nihal Pekergin:
Introduction to the Special Issue on Probability Models in Performance Analysis. Comput. J. 55(5): 512-514 (2012) - [j10]Hind Castel-Taleb, Idriss Ismael Aouled, Nihal Pekergin:
Bounding Aggregations for Transient and Stationary Performance Analysis of Subnetworks. Comput. J. 55(5): 564-576 (2012) - [j9]Joël Blot, Naïla Hayek, Ferhan Pekergin, Nihal Pekergin:
The Competition between Internet Service Qualities from a difference Game Viewpoint. IGTR 14(1) (2012) - [j8]Hind Castel-Taleb, Lynda Mokdad, Nihal Pekergin:
An algorithm approach to bounding aggregations of multidimensional Markov chains. Theor. Comput. Sci. 452: 12-20 (2012) - [c45]Nihal Pekergin, Minh-Anh Tran:
Compositional Verification of Untimed Properties for a Class of Stochastic Automata Networks. ISCIS 2012: 105-114 - [c44]Farah Aït-Salaht, Jean-Michel Fourneau, Nihal Pekergin:
Computing Entry-Wise Bounds of the Steady-State Distribution of a Set of Markov Chains. ISCIS 2012: 115-122 - [c43]Farah Aït-Salaht, Johanne Cohen, Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Accuracy vs. complexity: The stochastic bound approach. WODES 2012: 343-348 - 2011
- [j7]Diana El Rabih, Gaël Gorgo, Nihal Pekergin, Jean-Marc Vincent:
Steady state property verification of very large systems. Int. J. Crit. Comput. Based Syst. 2(3/4): 309-331 (2011) - [c42]Paolo Ballarini, Hilal Djafri, Marie Duflot, Serge Haddad, Nihal Pekergin:
Petri nets compositional modeling and verification of Flexible Manufacturing Systems. CASE 2011: 588-593 - [c41]Paolo Ballarini, Hilal Djafri, Marie Duflot, Serge Haddad, Nihal Pekergin:
COSMOS: A Statistical Model Checker for the Hybrid Automata Stochastic Logic. QEST 2011: 143-144 - [c40]Hind Castel-Taleb, Idriss Ismael Aouled, Nihal Pekergin:
Bounding techniques for transient analysis of G-networks with catastrophes. VALUETOOLS 2011: 197-206 - [c39]Paolo Ballarini, Hilal Djafri, Marie Duflot, Serge Haddad, Nihal Pekergin:
HASL: an expressive language for statistical verification of stochastic models. VALUETOOLS 2011: 306-315 - [c38]Hind Castel-Taleb, Nihal Pekergin:
On the choice of the stochastic comparison method for multidimensional Markov chains analysis. VALUETOOLS 2011: 418-424 - 2010
- [j6]Jean-Michel Fourneau, Lynda Mokdad, Nihal Pekergin:
Stochastic bounds for performance evaluation of Web services. Concurr. Comput. Pract. Exp. 22(10): 1286-1307 (2010) - [c37]Hind Castel-Taleb, Idriss Ismael Aouled, Nihal Pekergin:
Stochastic Comparisons for Performability of Telecommunication Systems. ASMTA 2010: 189-203 - [c36]Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Stochastic comparisons applied to G-Networks with catastrophes. ISCIS 2010: 57-60 - [c35]Hind Castel-Taleb, Nihal Pekergin:
Accuracy of Strong and Weak Comparisons for Network of Queues. MMB/DFT 2010: 212-226
2000 – 2009
- 2009
- [c34]Imène Kadi, Nihal Pekergin, Jean-Marc Vincent:
Different Monotonicity Definitions in Stochastic Modelling. ASMTA 2009: 144-158 - [c33]Hind Castel-Taleb, Nihal Pekergin:
Weak Stochastic Comparisons for Performability Verification. ASMTA 2009: 294-308 - [c32]Diana El Rabih, Nihal Pekergin:
Statistical Model Checking Using Perfect Simulation. ATVA 2009: 120-134 - [c31]Jean-Michel Fourneau, Imène Kadi, Nihal Pekergin:
Improving Time Parallel Simulation for Monotone Systems. DS-RT 2009: 231-234 - [c30]Hind Castel-Taleb, Nihal Pekergin:
Stochastic Monotonicity in Queueing Networks. EPEW 2009: 116-130 - [c29]Jean-Michel Fourneau, Lynda Mokdad, Nihal Pekergin:
Stochastic bounds for performance evaluation of web services. ISCC 2009: 7-12 - [c28]Serge Haddad, Nihal Pekergin:
Using Stochastic Comparison for Efficient Model Checking of Uncertain Markov Chains. QEST 2009: 177-186 - 2008
- [j5]Mouad Ben Mamoun, Jean-Michel Fourneau, Nihal Pekergin:
Analyzing Weighted Round Robin policies with a stochastic comparison approach. Comput. Oper. Res. 35(8): 2420-2431 (2008) - [c27]Mouad Ben Mamoun, Nihal Pekergin:
Model Checking of Infinite State Space Markov Chains by Stochastic Bounds. ASMTA 2008: 264-278 - [c26]Nihal Pekergin, Sana Younès:
CSRL model checking with closed-form bounding distributions. VALUETOOLS 2008: 21 - 2007
- [c25]Hind Castel, Lynda Mokdad, Nihal Pekergin:
Loss rates bounds in IP buffers by Markov chains aggregations. AICCSA 2007: 623-630 - [c24]Jean-Michel Fourneau, Lynda Mokdad, Nihal Pekergin, Samir Youcef:
Stochastic Bounds for Loss Rates. AICT 2007: 9 - [c23]Ana Busic, Nihal Pekergin:
Closed Form Absorption Time Bounds. EPEW 2007: 33-47 - [c22]Jean-Michel Fourneau, Nihal Pekergin, Sana Younès:
Censoring Markov Chains and Stochastic Bounds. EPEW 2007: 213-227 - [c21]Wolfgang E. Nagel, Bruno Gaujal, Tugrul Dayar, Nihal Pekergin:
Topic 2 Performance Prediction and Evaluation. Euro-Par 2007: 83 - [c20]Hind Castel, Lynda Mokdad, Nihal Pekergin:
Stochastic Bounds Applied to the End to End QoS in Communication Systems. MASCOTS 2007: 374-380 - [c19]Jean-Michel Fourneau, Nihal Pekergin, Sana Younès:
CUT : Combining stochastic ordering and censoring to bound steady-state rewards and first passage time. QEST 2007: 211-212 - [c18]Hind Castel-Taleb, Lynda Mokdad, Nihal Pekergin:
Aggregated bounding Markov processes applied to the analysis of tandem queues. VALUETOOLS 2007: 43 - [c17]Jean-Michel Fourneau, Imène Kadi, Nihal Pekergin, Jérôme Vienne, Jean-Marc Vincent:
Perfect simulation and monotone stochastic bounds. VALUETOOLS 2007: 65 - 2006
- [c16]Hind Castel-Taleb, Lynda Mokdad, Nihal Pekergin:
Loss rates bounds for IP switches in MPLS networks. AICCSA 2006: 208-214 - [c15]Ana Busic, Jean-Michel Fourneau, Nihal Pekergin:
Worst Case Analysis of Batch Arrivals with the Increasing Convex Ordering. EPEW 2006: 196-210 - [c14]Mouad Ben Mamoun, Nihal Pekergin, Sana Younès:
Class C Markov Chains and Transient Analysis. POSTA 2006: 177-184 - [c13]Mouad Ben Mamoun, Nihal Pekergin, Sana Younès:
Model Checking of Continuous-Time Markov Chains by Closed-Form Bounding Distributions. QEST 2006: 189-198 - 2005
- [j4]Nihal Pekergin, Tugrul Dayar, Denizhan N. Alparslan:
Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering. Eur. J. Oper. Res. 165(3): 810-825 (2005) - [c12]Nihal Pekergin, Sana Younès:
Stochastic Model Checking with Stochastic Comparison. EPEW/WS-FM 2005: 109-123 - [c11]Hind Castel-Taleb, Jean-Michel Fourneau, Nihal Pekergin:
Stochastic Bounds on Partial Ordering: Application to Memory Overflows Due to Bursty Arrivals. ISCIS 2005: 244-253 - [c10]Jean-Michel Fourneau, Nihal Pekergin, Sana Younès:
Improving Stochastic Model Checking with Stochastic Bounds. SAINT Workshops 2005: 264-267 - 2003
- [j3]Tugrul Dayar, Jean-Michel Fourneau, Nihal Pekergin:
Transforming stochastic matrices for stochastic comparison with the st-order. RAIRO Oper. Res. 37(2): 85-97 (2003) - [c9]Jean-Michel Fourneau, Mathieu Le Coz, Nihal Pekergin, Franck Quessette:
An open tool to compute stochastic bounds on steady-state distributions and rewards. MASCOTS 2003: 219- - 2002
- [j2]Mouad Ben Mamoun, Nihal Pekergin:
Stochastic delay bounds of fair queuing policies by analyzing weighted round robin-related policies. Perform. Evaluation 47(2/3): 181-196 (2002) - [c8]M. Benmammoun, Jean-Michel Fourneau, Nihal Pekergin, Alexis Troubnikoff:
An Algorithmic and Numerical Approach to Bound the Performance of High Speed Networks. MASCOTS 2002: 375-382 - [c7]Jean-Michel Fourneau, Nihal Pekergin:
An Algorithmic Approach to Stochastic Bounds. Performance 2002: 64-88
1990 – 1999
- 1999
- [j1]Nihal Pekergin:
Stochastic Performance Bounds by State Space Reduction. Perform. Evaluation 36-37(1-4): 1-17 (1999) - [c6]Nihal Pekergin:
Stochastic Bounds on Delays of Fair Queueing Algorithms. INFOCOM 1999: 1212-1219 - 1998
- [c5]O. Abuamsha, Nihal Pekergin:
Comparison of Fair Queuing Algorithms with a Stochastic Approach. MASCOTS 1998: 139-144 - 1997
- [c4]Jean-Michel Fourneau, Lynda Mokdad, Nihal Pekergin:
Bounding the Loss Rates in a Multistage ATM Switch. Computer Performance Evaluation 1997: 193-205 - 1996
- [c3]Jean-Michel Fourneau, Nihal Pekergin, H. Taleb:
Stochastic Bounds and Q0S Application To The Loss Rates in ATM Networks. ESM 1996: 861-866 - 1994
- [c2]Jean-Michel Fourneau, Nihal Pekergin, H. Taleb:
An application of stochastic ordering to the analysis of the push-out mechanism. Modelling and Evaluation of ATM Networks 1994: 227-244 - 1993
- [c1]Jean-Michel Fourneau, H. Maisonniaux, Nihal Pekergin, Véronique Vèque:
Performance Evaluation of Buffer Policies with Stochastic Automata Networks. Modelling and Evaluation of ATM Networks 1993: 433-451
Coauthor Index
aka: Hind Castel
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
