![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 27 matches
- 2012
- Alireza Abdollahpouri
, Bernd E. Wolfinger:
Reducing Channel Zapping Delay in WiMAX-Based IPTV Systems. MMB/DFT 2012: 182-196 - Gergely Alpár, Lejla Batina, Roel Verdult:
Using NFC Phones for Proving Credentials. MMB/DFT 2012: 317-330 - Jonathan Bogdoll, Arnd Hartmanns
, Holger Hermanns:
Simulation and Statistical Model Checking for Modestly Nondeterministic Models. MMB/DFT 2012: 249-252 - Jean-Yves Le Boudec, Dan-Cristian Tomozei:
A Demand-Response Calculus with Perfect Batteries. MMB/DFT 2012: 273-287 - Hans Daduna, Lars Peter Saul:
Availability in Large Networks: Global Characteristics from Local Unreliability Properties. MMB/DFT 2012: 1-15 - Philipp M. Eittenberger, Udo R. Krieger:
A Workbench for Internet Traffic Analysis. MMB/DFT 2012: 240-243 - Luis María Ferrer Fioriti, Holger Hermanns:
Heuristics for Probabilistic Timed Automata with Abstraction Refinement. MMB/DFT 2012: 151-165 - Sonja Georgievska, Suzana Andova:
Probabilistic CSP: Preserving the Laws via Restricted Schedulers. MMB/DFT 2012: 136-150 - Alexander Gouberman, Martin Riedl, Johann Schuster, Markus Siegle
:
A Modelling and Analysis Environment for LARES. MMB/DFT 2012: 244-248 - Michael Hoefling, Michael Menth, Christian Kniep, Marcus Camen:
IBPM: An Open-Source-Based Framework for InifiniBand Performance Monitoring. MMB/DFT 2012: 236-239 - Kai Höfig:
Failure-Dependent Timing Analysis - A New Methodology for Probabilistic Worst-Case Execution Time Analysis. MMB/DFT 2012: 61-75 - Shu Huang, Ilia Baldine
:
Performance Evaluation of 10GE NICs with SR-IOV Support: I/O Virtualization and Network Stack Optimizations. MMB/DFT 2012: 197-205 - Nikola Ivkovic
, Dario Kresic, Kai-Steffen Hielscher
, Reinhard German:
Verifying Worst Case Delays in Controller Area Network. MMB/DFT 2012: 91-105 - Ralf Jahr, Horia Calborean, Lucian Vintan, Theo Ungerer:
Boosting Design Space Explorations with Existing or Automatically Learned Knowledge. MMB/DFT 2012: 221-235 - Marijn R. Jongerden
, Boudewijn R. Haverkort
:
Lifetime Improvement by Battery Scheduling. MMB/DFT 2012: 106-120 - Andrey Kolesnikov:
UniLoG: A Unified Load Generation Tool. MMB/DFT 2012: 253-257 - Minh Lê, Max Walter:
Bounds for Two-Terminal Network Reliability with Dependent Basic Events. MMB/DFT 2012: 31-45 - Matthias Meitner, Francesca Saglietti:
Software Reliability Testing Covering Subsystem Interactions. MMB/DFT 2012: 46-60 - Rainer Plaga, Frank Koob:
A Formal Definition and a New Security Mechanism of Physical Unclonable Functions. MMB/DFT 2012: 288-301 - Ramin Sadre, Anne Remke, Sjors Hettinga, Boudewijn R. Haverkort
:
Simulative and Analytical Evaluation for ASD-Based Embedded Software. MMB/DFT 2012: 166-181 - Arpit Sharma:
Weighted Probabilistic Equivalence Preserves ω-Regular Properties. MMB/DFT 2012: 121-135 - William Mangoua Sofack, Marc Boyer
:
Non Preemptive Static Priority with Network Calculus: Enhancement. MMB/DFT 2012: 258-272 - Sebastian Vastag:
A Calculus for SLA Delay Properties. MMB/DFT 2012: 76-90 - Kai Wang, Yuming Jiang
, Chuang Lin:
Modeling and Analysis of a P2P-VoD System Based on Stochastic Network Calculus. MMB/DFT 2012: 302-316 - Ulrich Winkler, Wasif Gilani, Alan Marshall:
Business Driven BCM SLA Translation for Service Oriented Systems. MMB/DFT 2012: 206-220 - Feng Zhang, Jinting Wang
:
Stochastic Analysis of a Finite Source Retrial Queue with Spares and Orbit Search. MMB/DFT 2012: 16-30 - Jens B. Schmitt:
Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance - 16th International GI/ITG Conference, MMB & DFT 2012, Kaiserslautern, Germany, March 19-21, 2012. Proceedings. Lecture Notes in Computer Science 7201, Springer 2012, ISBN 978-3-642-28539-4 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-05 21:06 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint