default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFilip Markovic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Anna Friebe
, Filip Markovic, Alessandro V. Papadopoulos, Thomas Nolte:
Efficiently bounding deadline miss probabilities of Markov chain real-time tasks. Real Time Syst. 60(3): 443-490 (2024)- 2023
- [c12]Anna Friebe, Filip Markovic, Alessandro Vittorio Papadopoulos, Thomas Nolte:
Continuous-Emission Markov Models for Real-Time Applications: Bounding Deadline Miss Probabilities. RTAS 2023: 14-26 - [c11]Sergey Bozhko, Filip Markovic, Georg von der Brüggen, Björn B. Brandenburg:
What Really is pWCET? A Rigorous Axiomatic Proposal. RTSS 2023: 13-26 - [c10]Filip Markovic, Pierre Roux, Sergey Bozhko, Alessandro V. Papadopoulos, Björn B. Brandenburg:
CTA: A Correlation-Tolerant Analysis of the Deadline-Failure Probability of Dependent Tasks. RTSS 2023: 317-330 - 2022
- [c9]Filip Markovic, Thomas Nolte, Alessandro Vittorio Papadopoulos:
Analytical Approximations in Probabilistic Analysis of Real-Time Systems. RTSS 2022: 158-171 - 2021
- [j2]Filip Markovic, Alessandro Vittorio Papadopoulos, Thomas Nolte:
On the Convolution Efficiency for Probabilistic Analysis of Real-Time Systems (Artifact). Dagstuhl Artifacts Ser. 7(1): 01:1-01:2 (2021) - [c8]Filip Markovic, Alessandro Vittorio Papadopoulos, Thomas Nolte:
On the Convolution Efficiency for Probabilistic Analysis of Real-Time Systems. ECRTS 2021: 16:1-16:22 - [c7]Shaik Mohammed Salman, Saad Mubeen, Filip Markovic, Alessandro V. Papadopoulos, Thomas Nolte:
Scheduling Elastic Applications in Compositional Real-Time Systems. ETFA 2021: 1-8 - [c6]Anna Friebe, Filip Markovic, Alessandro V. Papadopoulos, Thomas Nolte:
Adaptive Runtime Estimate of Task Execution Times using Bayesian Modeling. RTCSA 2021: 1-10 - 2020
- [b1]Filip Markovic:
Preemption-Delay Aware Schedulability Analysis of Real-Time Systems. Mälardalen University College, Västerås, Eskilstuna, Sweden, 2020 - [c5]Filip Markovic, Jan Carlson, Sebastian Altmeyer, Radu Dobrin:
Improving the Accuracy of Cache-Aware Response Time Analysis Using Preemption Partitioning. ECRTS 2020: 5:1-5:23 - [c4]Filip Markovic, Jan Carlson, Radu Dobrin:
Cache-aware response time analysis for real-time tasks with fixed preemption points. RTAS 2020: 30-42
2010 – 2019
- 2019
- [j1]Filip Markovic, Jan Carlson, Radu Dobrin:
A Comparison of Partitioning Strategies for Fixed Points Based Limited Preemptive Scheduling. IEEE Trans. Ind. Informatics 15(2): 1070-1081 (2019) - 2018
- [c3]Filip Markovic, Jan Carlson, Radu Dobrin:
Improved Cache-Related Preemption Delay Estimation for Fixed Preemption Point Scheduling. Ada-Europe 2018: 87-101 - [c2]Filip Markovic, Jan Carlson, Radu Dobrin, Björn Lisper, Abhilash Thekkilakattil:
Probabilistic Response Time Analysis for Fixed Preemption Point Selection. SIES 2018: 1-10 - 2017
- [c1]Filip Markovic, Jan Carlson, Radu Dobrin:
Tightening the Bounds on Cache-Related Preemption Delay in Fixed Preemption Point Scheduling. WCET 2017: 4:1-4:11
Coauthor Index
aka: Alessandro V. Papadopoulos
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:35 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:
