default search action
Maciej Pacut
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Julien Dallot, Maciej Pacut, Marcin Bienkowski, Darya Melnyk, Stefan Schmid:
Learning Minimum Linear Arrangement of Cliques and Lines. ICDCS 2024: 175-185 - [c12]Julien Dallot, Amirmehdi Jafari Fesharaki, Maciej Pacut, Stefan Schmid:
Dependency-Aware Online Caching. INFOCOM 2024: 871-880 - [c11]Vamsi Addanki, Maciej Pacut, Stefan Schmid:
Credence: Augmenting Datacenter Switch Buffer Sharing with ML Predictions. NSDI 2024: 613-634 - [i12]Vamsi Addanki, Maciej Pacut, Stefan Schmid
:
Credence: Augmenting Datacenter Switch Buffer Sharing with ML Predictions. CoRR abs/2401.02801 (2024) - [i11]Julien Dallot, Amirmehdi Jafari Fesharaki, Maciej Pacut, Stefan Schmid
Dependency-Aware Online Caching. CoRR abs/2401.17146 (2024) - [i10]Julien Dallot, Maciej Pacut, Marcin Bienkowski, Darya Melnyk, Stefan Schmid:
Learning Minimum Linear Arrangement of Cliques and Lines. CoRR abs/2405.15963 (2024) - 2023
- [j6]Chen Avin, Ingo van Duijn, Maciej Pacut, Stefan Schmid
Self-adjusting grid networks. Inf. Comput. 292: 105038 (2023) - [c10]Yuval Emek, Yuval Gil, Maciej Pacut, Stefan Schmid
Online Algorithms with Randomly Infused Advice. ESA 2023: 44:1-44:19 - [c9]Vamsi Addanki, Maciej Pacut, Arash Pourdamghani
Self-Adjusting Partially Ordered Lists. INFOCOM 2023: 1-10 - [i9]Yuval Emek, Yuval Gil, Maciej Pacut, Stefan Schmid
Online Algorithms with Randomly Infused Advice. CoRR abs/2302.05366 (2023) - [i8]Habib Mostafaei, Maciej Pacut, Stefan Schmid
RIFO: Pushing the Efficiency of Programmable Packet Schedulers. CoRR abs/2308.07442 (2023) - 2022
- [j5]Maciej Pacut, Wenkai Dai, Alexandre Labbe, Klaus-Tycho Foerster, Stefan Schmid
Improved Scalability of Demand-Aware Datacenter Topologies With Minimal Route Lengths and Congestion. SIGMETRICS Perform. Evaluation Rev. 49(3): 35-36 (2022) - [c8]Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid
Brief Announcement: Temporal Locality in Online Algorithms. DISC 2022: 52:1-52:3 - 2021
- [j4]Maciej Pacut
Improved scalability of demand-aware datacenter topologies with minimal route lengths and congestion. Perform. Evaluation 152: 102238 (2021) - [c7]Maciej Pacut, Mahmoud Parham, Stefan Schmid
Optimal Online Balanced Graph Partitioning. INFOCOM 2021: 1-9 - [i7]Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, Aleksandr Tereshchenko:
Locality in Online Algorithms. CoRR abs/2102.09413 (2021) - [i6]Maciej Pacut, Juan Vanerio, Vamsi Addanki, Arash Pourdamghani, Gábor Rétvári, Stefan Schmid:
Online List Access with Precedence Constraints. CoRR abs/2104.08949 (2021) - [i5]Maciej Pacut, Juan Vanerio, Vamsi Addanki, Arash Pourdamghani, Gábor Rétvári, Stefan Schmid:
Self-Adjusting Packet Classification. CoRR abs/2109.15090 (2021) - 2020
- [j3]Chen Avin, Marcin Bienkowski
Dynamic Balanced Graph Partitioning. SIAM J. Discret. Math. 34(3): 1791-1812 (2020) - [c6]Marcin Bienkowski
An Optimal Algorithm for Online Multiple Knapsack. ICALP 2020: 13:1-13:17 - [c5]Maciej Pacut
Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning. PODC 2020: 461-463 - [i4]Marcin Bienkowski, Maciej Pacut, Krzysztof Piecuch:
An Optimal Algorithm for Online Multiple Knapsack. CoRR abs/2002.04543 (2020)
2010 – 2019
- 2019
- [j2]Klaus-Tycho Foerster
On the Complexity of Non-Segregated Routing in Reconfigurable Data Center Architectures. Comput. Commun. Rev. 49(2): 2-8 (2019) - 2017
- [j1]Carlo Fuerst, Maciej Pacut
Data locality and replica aware virtual cluster embeddings. Theor. Comput. Sci. 697: 37-57 (2017) - [c4]Marcin Bienkowski
Online Tree Caching. SPAA 2017: 329-338 - 2016
- [c3]Chen Avin
Online Balanced Repartitioning. DISC 2016: 243-256 - [i3]Marcin Bienkowski, Jan Marcinkowski, Maciej Pacut, Stefan Schmid, Aleksandra Spyra:
Online Tree Caching. CoRR abs/1602.08563 (2016) - 2015
- [c2]Carlo Fuerst, Maciej Pacut
How Hard Can It Be?: Understanding the Complexity of Replica Aware Virtual Cluster Embeddings. ICNP 2015: 11-21 - [i2]Carlo Fuerst, Maciej Pacut, Stefan Schmid:
Hardness of Virtual Network Embedding with Replica Selection. CoRR abs/1501.07379 (2015) - [i1]Chen Avin, Andreas Loukas, Maciej Pacut, Stefan Schmid:
Online Balanced Repartitioning. CoRR abs/1511.02074 (2015) - 2013
- [c1]Mieczyslaw Wodecki
Multi-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem. PPAM (2) 2013: 207-214
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-09-13 01:41 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: