Marcin Bienkowski

CoRR, 2024

An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement.

[BibT_eX]

[DOI]

Guy Even

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

A Subquadratic Bound for Online Bisection.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Contract Scheduling with Distributional and Multiple Advice.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Learning Minimum Linear Arrangement of Cliques and Lines.

[BibT_eX]

[DOI]

Proceedings of the 44th IEEE International Conference on Distributed Computing Systems, 2024

2023

An Improved Deterministic Algorithm for the Online Min-Sum Set Cover Problem.

[BibT_eX]

[DOI]

Mateusz Basiak

Agnieszka Tatarczuk

Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

Optimizing Reconfigurable Optical Datacenters: The Power of Randomization.

[BibT_eX]

[DOI]

David Fuchssteiner

Proceedings of the International Conference for High Performance Computing, 2023

An Improved Algorithm for Online Min-Sum Set Cover.

[BibT_eX]

[DOI]

Marcin Mucha

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

An Improved Algorithm For Online Reranking.

[BibT_eX]

[DOI]

Marcin Mucha

CoRR, 2022

Online B-Matchings for Reconfigurable Datacenters: The Power of Randomization.

[BibT_eX]

[DOI]

David Fuchssteiner

CoRR, 2022

Deterministic Self-Adjusting Tree Networks Using Rotor Walks.

[BibT_eX]

[DOI]

Proceedings of the 42nd IEEE International Conference on Distributed Computing Systems, 2022

Online Facility Location with Linear Delay.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2022

2021

New results on multi-level aggregation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Improved Analysis of Online Balanced Clustering.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.

[BibT_eX]

[DOI]

Björn Feldkord

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times.

[BibT_eX]

[DOI]

Hsiang-Hsuan Liu

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Online Dynamic B-Matching: With Applications to Reconfigurable Datacenter Networks.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2020

Dynamic Balanced Graph Partitioning.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Online Algorithms for Multilevel Aggregation.

[BibT_eX]

[DOI]

Oper. Res., 2020

A Competitive B-Matching Algorithm for Reconfigurable Datacenter Networks.

[BibT_eX]

[DOI]

CoRR, 2020

Unbounded lower bound for k-server against weak adversaries.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

An Optimal Algorithm for Online Multiple Knapsack.

[BibT_eX]

[DOI]

Maciej Pacut

Krzysztof Piecuch

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Dynamic Beats Fixed: On Phase-based Algorithms for File Migration.

[BibT_eX]

[DOI]

Marcin Mucha

ACM Trans. Algorithms, 2019

An Improved Online Algorithm for the Traveling Repairperson Problem on a Line.

[BibT_eX]

[DOI]

Hsiang-Hsuan Liu

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Better Bounds for Online Line Chasing.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

Online Aggregation of the Forwarding Information Base: Accounting for Locality and Churn.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2018

Logarithmic price of buffer downscaling on line metrics.

[BibT_eX]

[DOI]

Martin Böhm

Pawel Laskos-Grabowski

Theor. Comput. Sci., 2018

Distributed Online and Stochastic Queueing on a Multiple Access Channel.

[BibT_eX]

[DOI]

Tomasz Jurdzinski

ACM Trans. Algorithms, 2018

A Primal-Dual Online Deterministic Algorithm for Matching with Delays.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Online Service with Delay on a Line.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2018

2017

A Match in Time Saves Nine: Deterministic Online Matching with Delays.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

A Deterministic Algorithm for Online Steiner Tree Leasing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Online Tree Caching.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2016

Distributed Alarming in the On-Duty and Off-Duty Models.

[BibT_eX]

[DOI]

Leszek Gasieniec

Bernard Mans

Roger Wattenhofer

IEEE/ACM Trans. Netw., 2016

Randomized mutual exclusion on a multiple access channel.

[BibT_eX]

[DOI]

Distributed Comput., 2016

Online Algorithms for Multi-Level Aggregation.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Approximation algorithms for the joint replenishment problem with deadlines.

[BibT_eX]

[DOI]

J. Sched., 2015

A Randomized Algorithm for Online Scheduling with Interval Conflicts.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

Provable fairness for TDMA scheduling.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

2014

The Wide-Area Virtual Service Migration Problem: A Competitive Analysis Approach.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2014

An Optimal Lower Bound for Buffer Management in Multi-Queue Switches.

[BibT_eX]

[DOI]

Algorithmica, 2014

Better Approximation Bounds for the Joint Replenishment Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Competitive FIB Aggregation without Update Churn.

[BibT_eX]

[DOI]

Proceedings of the IEEE 34th International Conference on Distributed Computing Systems, 2014

Leveraging locality for FIB aggregation.

[BibT_eX]

[DOI]

Proceedings of the IEEE Global Communications Conference, 2014

2013

A <i>ϕ</i>-competitive algorithm for collecting items with increasing weights from a dynamic queue.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

(1, 2)-Hamiltonian Completion on a Matching.

[BibT_eX]

[DOI]

Pawel Zalewski

Int. J. Found. Comput. Sci., 2013

Better Approximation Bounds for the Joint Replenishment Problem.

[BibT_eX]

[DOI]

CoRR, 2013

Collecting Weighted Items from a Dynamic Queue.

[BibT_eX]

[DOI]

Algorithmica, 2013

Online Control Message Aggregation in Chain Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2013

2012

The k-resource problem in uniform metric spaces.

[BibT_eX]

[DOI]

Jaroslaw Kutylowski

Theor. Comput. Sci., 2012

Migrating and replicating data in networks.

[BibT_eX]

[DOI]

Comput. Sci. Res. Dev., 2012

Approximation Algorithms for the Joint Replenishment Problem with Deadlines

[BibT_eX]

[DOI]

Marek Chrobak

CoRR, 2012

Distributed Online and Stochastic Queuing on a Multiple Access Channel.

[BibT_eX]

[DOI]

Tomasz Jurdzinski

Proceedings of the Distributed Computing - 26th International Symposium, 2012

2011

Randomized competitive algorithms for online buffer management in the adaptive adversary model.

[BibT_eX]

[DOI]

Marek Chrobak

Theor. Comput. Sci., 2011

Online strategies for intra and inter provider service migration in virtual networks.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Principles, 2011

2010

Online Function Tracking with Generalized Penalties.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Dynamic Sharing of a Multiple Access Channel.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Event Extent Estimation.

[BibT_eX]

[DOI]

Leszek Gasieniec

Proceedings of the Structural Information and Communication Complexity, 2010

Competitive analysis for service migration in VNets.

[BibT_eX]

[DOI]

Proceedings of the Second ACM SIGCOMM Workshop on Virtualized Infrastructure Systems and Architectures, 2010

SkewCCC+: A Heterogeneous Distributed Hash Table.

[BibT_eX]

[DOI]

André Brinkmann

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

2009

Optimal algorithms for page migration in dynamic networks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2009

Price Fluctuations: To Buy or to Rent.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

2008

Generalized Whac-a-Mole

[BibT_eX]

[DOI]

CoRR, 2008

Randomized Algorithms for Buffer Management with 2-Bounded Delay.

[BibT_eX]

[DOI]

Marek Chrobak

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Degree 3 Suffices: A Large-Scale Overlay for P2P Networks.

[BibT_eX]

[DOI]

André Brinkmann

Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers.

[BibT_eX]

[DOI]

Aleksander Madry

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

The <i>k</i> -Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.

[BibT_eX]

[DOI]

Jaroslaw Kutylowski

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

2005

Page migration in dynamic networks.

[BibT_eX]

[DOI]

PhD thesis, 2005

Improved Algorithms for Dynamic Page Migration.

[BibT_eX]

[DOI]

Miroslaw Dynia

Proceedings of the STACS 2005, 2005

Dynamic page migration with stochastic requests.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Bounding Communication Cost in Dynamic Load Balancing of Distributed Hash Tables.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Page Migration in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Dynamic Load Balancing in Distributed Hash Tables.

[BibT_eX]

[DOI]

Proceedings of the Peer-to-Peer Systems IV, 4th International Workshop, 2005

Cube Connected Cycles Based Bluetooth Scatternet Formation.

[BibT_eX]

[DOI]

André Brinkmann

Orhan Orhan

Proceedings of the Networking, 2005

Average case complexity of Voronoi diagrams of n sites from the unit cube.

[BibT_eX]

[DOI]

Valentina Damerow

Christian Sohler

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Dynamic Page Migration Under Brownian Motion.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

Bucket Game with Applications to Set Multicover and Dynamic Page Migration.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

2004

Fighting against two adversaries: page migration in dynamic networks.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

2003

A practical algorithm for constructing oblivious routing schemes.

[BibT_eX]

[DOI]