default search action
Bartlomiej Przybylski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j4]Bartlomiej Przybylski:
Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times. J. Comb. Optim. 44(1): 207-222 (2022) - [c6]Bartlomiej Przybylski, Pawel Zuk, Krzysztof Rzadca:
Divide (CPU Load) and Conquer: Semi-Flexible Cloud Resource Allocation. CCGRID 2022: 129-139 - [c5]Pawel Zuk, Bartlomiej Przybylski, Krzysztof Rzadca:
Call Scheduling to Reduce Response Time of a FaaS System. CLUSTER 2022: 172-182 - [c4]Bartlomiej Przybylski, Maciej Pawlik, Pawel Zuk, Bartlomiej Lagosz, Maciej Malawski, Krzysztof Rzadca:
Using Unused: Non-Invasive Dynamic FaaS Infrastructure with HPC-Whisk. SC 2022: 40:1-40:15 - [i6]Bartlomiej Przybylski, Pawel Zuk, Krzysztof Rzadca:
Divide (CPU Load) and Conquer: Semi-Flexible Cloud Resource Allocation. CoRR abs/2206.05035 (2022) - [i5]Pawel Zuk, Bartlomiej Przybylski, Krzysztof Rzadca:
Call Scheduling to Reduce Response Time of a FaaS System. CoRR abs/2207.13168 (2022) - [i4]Bartlomiej Przybylski, Maciej Pawlik, Pawel Zuk, Bartlomiej Lagosz, Maciej Malawski, Krzysztof Rzadca:
Using Unused: Non-Invasive Dynamic FaaS Infrastructure with HPC-Whisk. CoRR abs/2211.00717 (2022) - 2021
- [j3]Joanna Berlinska, Bartlomiej Przybylski:
Scheduling for gathering multitype data with local computations. Eur. J. Oper. Res. 294(2): 453-459 (2021) - [c3]Bartlomiej Przybylski, Pawel Zuk, Krzysztof Rzadca:
Data-driven scheduling in serverless computing to reduce response time. CCGRID 2021: 206-216 - [c2]Adrian Naruszko, Bartlomiej Przybylski, Krzysztof Rzadca:
A Log-Linear (2 +5/6)-Approximation Algorithm for Parallel Machine Scheduling with a Single Orthogonal Resource. Euro-Par 2021: 151-166 - [c1]Sascha Hunold, Bartlomiej Przybylski:
Teaching Complex Scheduling Algorithms. IPDPS Workshops 2021: 321-327 - [i3]Bartlomiej Przybylski, Pawel Zuk, Krzysztof Rzadca:
Data-driven scheduling in serverless computing to reduce response time. CoRR abs/2105.03217 (2021) - [i2]Adrian Naruszko, Bartlomiej Przybylski, Krzysztof Rzadca:
A log-linear (2+5/6)-approximation algorithm for parallel machine scheduling with a single orthogonal resource. CoRR abs/2108.13716 (2021) - 2020
- [i1]Sascha Hunold, Bartlomiej Przybylski:
Scheduling.jl - Collaborative and Reproducible Scheduling Research with Julia. CoRR abs/2003.05217 (2020)
2010 – 2019
- 2018
- [j2]Bartlomiej Przybylski:
A new model of parallel-machine scheduling with integral-based learning effect. Comput. Ind. Eng. 121: 189-194 (2018) - 2017
- [j1]Bartlomiej Przybylski:
Precedence constrained parallel-machine scheduling of position-dependent jobs. Optim. Lett. 11(7): 1273-1281 (2017)
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-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint