default search action
Armin Heindl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j9]Armin Heindl, Gilles Pokam:
An analytic framework for performance modeling of software transactional memory. Comput. Networks 53(8): 1202-1214 (2009) - [c17]Ulf Jensen, Armin Heindl:
Comparison of Multi-service Routing Strategies for IP Core Networks. ASMTA 2009: 1-15 - [c16]Armin Heindl, Gilles Pokam:
An Analytic Model for Optimistic STM with Lazy Locking. ASMTA 2009: 339-353 - [c15]Armin Heindl, Gilles Pokam, Ali-Reza Adl-Tabatabai:
An analytic model of optimistic Software Transactional Memory. ISPASS 2009: 153-162 - [c14]Qi Zhang, Armin Heindl, Evgenia Smirni, Andreas Stathopoulos:
Comparison of Two Output Models for the BMAP/MAP/1 Departure Process. QEST 2009: 143-152 - [c13]Armin Heindl, Gilles Pokam:
Modeling software transactional memory with AnyLogic. SimuTools 2009: 10 - 2008
- [j8]Levente Bodrog, Armin Heindl, Gábor Horváth
, Miklós Telek
A Markovian canonical form of second-order matrix-exponential processes. Eur. J. Oper. Res. 190(2): 459-477 (2008) - [e2]Khalid Al-Begain, Armin Heindl, Miklós Telek:
Analytical and Stochastic Modeling Techniques and Applications, 15th International Conference, ASMTA 2008, Nicosia, Cyprus, June 4-6, 2008, Proceedings. Lecture Notes in Computer Science 5055, Springer 2008, ISBN 978-3-540-68980-5 [contents] - 2007
- [i1]Levente Bodrog, Armin Heindl, Gábor Horváth, Miklós Telek, András Horváth:
Current results and open questions on PH and MAP characterization. Numerical Methods for Structured Markov Chains 2007 - 2006
- [j7]Armin Heindl, Kenneth Mitchell, Appie van de Liefvoort:
Correlation bounds for second-order MAPs with application to queueing network decomposition. Perform. Evaluation 63(6): 553-577 (2006) - [c12]Armin Heindl, Gábor Horváth, Karsten Gross:
Explicit Inverse Characterizations of Acyclic MAPs of Second Order. EPEW 2006: 108-122 - [c11]Armin Heindl, Karsten Gross:
Analytic study of multiplexing effects in two-class queues with correlations. MMB 2006: 399-416 - [c10]Feng Chen, Falko Dressler
End-to-end performance characteristics in energy-aware wireless sensor networks. PE-WASUN 2006: 41-47 - [e1]Reinhard German, Armin Heindl:
Proceedings 13th GI/ITG Conference on Measuring, Modelling and Evaluation of Computer and Communication Systems, MMB 2006, March 27-29, 2006, Nürnberg, Germany. VDE Verlag 2006, ISBN 978-3-8007-2945-6 [contents] - 2005
- [j6]Qi Zhang, Armin Heindl, Evgenia Smirni:
Models of the departure process of a BMAP/MAP/1 queue. SIGMETRICS Perform. Evaluation Rev. 33(2): 18-20 (2005) - 2004
- [c9]Armin Heindl:
Sensitivity Analysis for MAP/MAP/1 Queues. MMB 2004: 235-244 - [c8]Armin Heindl, Qi Zhang, Evgenia Smirni:
ETAQA Truncation Models for the MAP/MAP/1 Departure Process. QEST 2004: 100-109 - 2003
- [j5]Armin Heindl:
Decomposition of general queueing networks with MMPP inputs and customer losses. Perform. Evaluation 51(2/4): 117-136 (2003) - [c7]Armin Heindl, Kenneth Mitchell, Appie van de Liefvoort:
The Correlation Region of Second-Order MAPs with Application to Queueing Network Decomposition. Computer Performance Evaluation / TOOLS 2003: 237-254 - [c6]Armin Heindl, Ernst W. Biersack:
Discrete-state and fluid stochastic petri net models for open-loop video-on-demand systems: a comparative case study. PNPM 2003: 40-49 - 2002
- [j4]Armin Heindl, Miklós Telek:
Output models of MAP/PH/1(/K) queues for an efficient network decomposition. Perform. Evaluation 49(1/4): 321-339 (2002) - [c5]Jörn Freiheit, Armin Heindl:
Novel Formulae for GSPN Aggregation. MASCOTS 2002: 209-216 - 2001
- [b1]Armin Heindl:
Traffic based decomposition of general queueing networks with correlated input processes. Technical University of Berlin, Germany, Shaker 2001, ISBN 978-3-8265-9354-3, pp. 1-177 - [j3]Armin Heindl:
Decomposition of general tandem queueing networks with MMPP input. Perform. Evaluation 44(1-4): 5-23 (2001) - [j2]Armin Heindl, Reinhard German:
Performance modeling of IEEE 802.11 wireless LANs with stochastic Petri nets. Perform. Evaluation 44(1-4): 139-164 (2001) - [c4]Armin Heindl, Miklós Telek:
MAP-Based Decomposition of Tandem Networks of ./PH/1(/K) Queues with MAP Input. MMB 2001: 179-194 - 2000
- [c3]Armin Heindl:
Decomposition of General Tandem Queueing Networks with MMPP Input. Computer Performance Evaluation / TOOLS 2000: 86-100
1990 – 1999
- 1999
- [j1]Armin Heindl, Reinhard German:
A Fourth-Order Algorithm with Automatic Stepsize Control for the Transient Analysis of DSPNs. IEEE Trans. Software Eng. 25(2): 194-206 (1999) - [c2]Reinhard German, Armin Heindl:
Performance evaluation of IEEE 802.11 wireless LANs with stochastic Petri nets. PNPM 1999: 44-53 - 1997
- [c1]Armin Heindl, Reinhard German:
A fourth-order algorithm with automatic stepsize control for the transient analysis of DSPNs. PNPM 1997: 60-69
Coauthor Index
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-08-05 20:25 CEST 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: