default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Kling
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c43]Christopher Hahn, Jonas Harbig, Peter Kling:
Forming Large Patterns with Local Robots in the OBLOT Model. SAND 2024: 14:1-14:20- [i23]Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Population Protocols for Exact Plurality Consensus - How a small chance of failure helps to eliminate insignificant opinions. CoRR abs/2402.06471 (2024) - [i22]Christopher Hahn, Jonas Harbig, Peter Kling:
Forming Large Patterns with Local Robots in the OBLOT Model. CoRR abs/2404.02771 (2024) - [i21]Raphael Gerlach, Sören von der Gracht, Christopher Hahn, Jonas Harbig, Peter Kling:
Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility. CoRR abs/2409.19277 (2024) - 2023
- [c42]Christoph Damerius, Peter Kling, Florian Schneider:
Improved Scheduling with a Shared Resource. COCOA (1) 2023: 154-167 - [c41]Christoph Damerius, Peter Kling, Minming Li, Chenyang Xu, Ruilong Zhang:
Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings. ESA 2023: 38:1-38:15 - [c40]Doganalp Ergenc, Florian Schneider, Peter Kling, Mathias Fischer:
Moving Target Defense for Service-Oriented Mission-Critical Networks. ICCCN 2023: 1-10 - [i20]Doganalp Ergenç, Florian Schneider, Peter Kling, Mathias Fischer:
Moving Target Defense for Service-oriented Mission-critical Networks. CoRR abs/2303.09893 (2023) - [i19]Christoph Damerius, Peter Kling, Minming Li, Chenyang Xu, Ruilong Zhang:
Scheduling with a Limited Testing Budget. CoRR abs/2306.15597 (2023) - [i18]Christoph Damerius, Peter Kling, Florian Schneider:
Improved Scheduling with a Shared Resource. CoRR abs/2310.05732 (2023) - 2022
- [j9]Jannik Castenow
, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide:
A discrete and continuous study of the Max-Chain-Formation problem. Inf. Comput. 285(Part): 104877 (2022) - [c39]Fynn Petersen-Frey, Marcus Soll, Louis Kobras, Melf Johannsen, Peter Kling, Chris Biemann:
Dataset of Student Solutions to Algorithm and Data Structure Programming Assignments. LREC 2022: 956-962 - [c38]Jannik Castenow, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide:
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility. OPODIS 2022: 15:1-15:25 - [c37]Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions. PODC 2022: 224-234 - [c36]Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Fast Consensus via the Unconstrained Undecided State Dynamics. SODA 2022: 3417-3429 - [i17]Jannik Castenow, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide:
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility. CoRR abs/2206.07567 (2022) - 2021
- [j8]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
Time-space trade-offs in population protocols for the majority problem. Distributed Comput. 34(2): 91-111 (2021) - [c35]Christoph Damerius, Dominik Kaaser, Peter Kling, Florian Schneider:
On Greedily Packing Anchored Rectangles. ICALP 2021: 61:1-61:20 - [c34]Petra Berenbrink, Tom Friedetzky, Christopher Hahn, Lukas Hintze, Dominik Kaaser, Peter Kling, Lars Nagel:
Infinite Balanced Allocation via Finite Capacities. ICDCS 2021: 965-975 - [c33]Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase:
On Minimum Generalized Manhattan Connections. WADS 2021: 85-100 - [i16]Christoph Damerius, Dominik Kaaser, Peter Kling, Florian Schneider:
On Greedily Packing Anchored Rectangles. CoRR abs/2102.08181 (2021) - [i15]Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Fast Consensus via the Unconstrained Undecided State Dynamics. CoRR abs/2103.10366 (2021) - 2020
- [c32]Christoph Damerius, Peter Kling, Minming Li, Florian Schneider, Ruilong Zhang:
Improved Scheduling with a Shared Resource via Structural Insights. COCOA 2020: 168-182 - [c31]Petra Berenbrink, George Giakkoupis, Peter Kling:
Brief Announcement: Optimal Time and Space Leader Election in Population Protocols. PODC 2020: 218-220 - [c30]Jannik Castenow, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide:
A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up. SPAA 2020: 515-517 - [c29]Jannik Castenow, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide:
A Discrete and Continuous Study of the Max-Chain-Formation Problem - Slow down to Speed Up. SSS 2020: 65-80 - [c28]Petra Berenbrink, George Giakkoupis, Peter Kling:
Optimal time and space leader election in population protocols. STOC 2020: 119-129 - [i14]Jannik Castenow, Peter Kling, Till Knollmann, Friedhelm Meyer auf der Heide:
A Discrete and Continuous Study of the Max-Chain-Formation Problem. CoRR abs/2010.02043 (2020) - [i13]Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase:
On Minimum Generalized Manhattan Connections. CoRR abs/2010.14338 (2020)
2010 – 2019
- 2019
- [c27]Florian Wilkens, Steffen Haas, Dominik Kaaser, Peter Kling, Mathias Fischer:
Towards Efficient Reconstruction of Attacker Lateral Movement. ARES 2019: 14:1-14:9 - [c26]Antonios Antoniadis, Felix Biermeier, Andrés Cristi, Christoph Damerius, Ruben Hoeksma, Dominik Kaaser, Peter Kling, Lukas Nölke:
On the Complexity of Anchored Rectangle Packing. ESA 2019: 8:1-8:14 - [c25]Petra Berenbrink, Tom Friedetzky, Dominik Kaaser, Peter Kling:
Tight & Simple Load Balancing. IPDPS 2019: 718-726 - [p1]Peter Kling, Friedhelm Meyer auf der Heide:
Continuous Protocols for Swarm Robotics. Distributed Computing by Mobile Entities 2019: 317-334 - 2018
- [j7]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Chris Wastell:
Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins. Algorithmica 80(12): 3673-3703 (2018) - [j6]Ernst Althaus, André Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jirí Sgall, Tim Süß:
Scheduling shared continuous resources on many-cores. J. Sched. 21(1): 77-92 (2018) - [c24]Petra Berenbrink, Dominik Kaaser, Peter Kling, Lena Otterbach:
Simple and Efficient Leader Election. SOSA 2018: 9:1-9:11 - [c23]Petra Berenbrink, George Giakkoupis, Peter Kling:
Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs. SODA 2018: 1715-1733 - [c22]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States. DISC 2018: 10:1-10:18 - [i12]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
Majority & Stabilization in Population Protocols. CoRR abs/1805.04586 (2018) - [i11]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
A population protocol for exact majority with O(\log5/3n) stabilization time and asymptotically optimal number of states. CoRR abs/1805.05157 (2018) - [i10]Petra Berenbrink, Tom Friedetzky, Dominik Kaaser, Peter Kling:
Simple Load Balancing. CoRR abs/1808.05389 (2018) - 2017
- [j5]Antonios Antoniadis, Neal Barcelo, Mario E. Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules. Algorithmica 79(2): 568-597 (2017) - [j4]Antonios Antoniadis, Peter Kling, Sebastian Ott, Sören Riechers:
Continuous speed scaling with variability: A simple and direct approach. Theor. Comput. Sci. 678: 1-13 (2017) - [c21]Petra Berenbrink, Peter Kling, Christopher Liaw, Abbas Mehrabian:
Tight Load Balancing Via Randomized Local Search. IPDPS 2017: 192-201 - [c20]Petra Berenbrink, Andrea Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, Emanuele Natale:
Ignore or Comply?: On Breaking Symmetry in Consensus. PODC 2017: 335-344 - [c19]Peter Kling, Alexander Mäcker, Sören Riechers, Alexander Skopalik:
Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource. SPAA 2017: 123-132 - [i9]Petra Berenbrink, Andrea Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, Emanuele Natale:
Ignore or Comply? On Breaking Symmetry in Consensus. CoRR abs/1702.04921 (2017) - [i8]Petra Berenbrink, Peter Kling, Christopher Liaw, Abbas Mehrabian:
Tight Load Balancing via Randomized Local Search. CoRR abs/1706.09997 (2017) - 2016
- [j3]Sebastian Abshoff, Peter Kling, Christine Markarian, Friedhelm Meyer auf der Heide, Peter Pietrzyk:
Towards the price of leasing online. J. Comb. Optim. 32(4): 1197-1216 (2016) - [c18]Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs:
Optimal Speed Scaling with a Solar Cell - (Extended Abstract). COCOA 2016: 521-535 - [c17]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Chris Wastell:
Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing. ESA 2016: 10:1-10:18 - [c16]Petra Berenbrink, Tom Friedetzky, George Giakkoupis, Peter Kling:
Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time. ICALP 2016: 136:1-136:14 - [c15]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Christopher Wastell:
Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract]. PODC 2016: 83-92 - [i7]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Chris Wastell:
Plurality Consensus via Shuffling: Lessons Learned from Load Balancing. CoRR abs/1602.01342 (2016) - [i6]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Chris Wastell:
Self-stabilizing Balls & Bins in Batches. CoRR abs/1603.02188 (2016) - [i5]Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs:
Optimal Speed Scaling with a Solar Cell. CoRR abs/1609.02668 (2016) - 2015
- [j2]Bastian Degener, Barbara Kempkes, Peter Kling, Friedhelm Meyer auf der Heide:
Linear and Competitive Strategies for Continuous Robot Formation Problems. ACM Trans. Parallel Comput. 2(1): 2:1-2:18 (2015) - [j1]Peter Kling, Peter Pietrzyk:
Profitable Scheduling on Multiple Speed-Scalable Processors. ACM Trans. Parallel Comput. 2(3): 19:1-19:19 (2015) - [c14]Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
On the Complexity of Speed Scaling. MFCS (2) 2015: 75-89 - 2014
- [b1]Peter Kling:
Energy-efficient scheduling algorithms. University of Paderborn, 2014, pp. 1-137 - [c13]André Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Tim Süß:
Scheduling shared continuous resources on many-cores. SPAA 2014: 128-137 - [c12]Antonios Antoniadis, Neal Barcelo, Mario E. Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules. STACS 2014: 63-74 - 2013
- [c11]Markus Happe, Friedhelm Meyer auf der Heide, Peter Kling, Marco Platzner, Christian Plessl:
On-The-Fly Computing: A novel paradigm for individualized IT services. ISORC 2013: 1-10 - [c10]Peter Kling, Peter Pietrzyk:
Profitable scheduling on multiple speed-scalable processors. SPAA 2013: 251-260 - 2012
- [c9]Peter Kling, Andreas Cord-Landwehr, Frederik Mallmann-Trenn:
Slow Down and Sleep for Profit in Online Deadline Scheduling. MedAlg 2012: 234-247 - [c8]Andreas Cord-Landwehr, Martina Hüllmann, Peter Kling, Alexander Setzer:
Basic Network Creation Games with Communication Interests. SAGT 2012: 72-83 - [c7]Peter Kling, Friedhelm Meyer auf der Heide, Peter Pietrzyk:
An Algorithm for Online Facility Leasing. SIROCCO 2012: 61-72 - [c6]Barbara Kempkes, Peter Kling, Friedhelm Meyer auf der Heide:
Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. SPAA 2012: 18-26 - [i4]Andreas Cord-Landwehr, Martina Hüllmann, Peter Kling, Alexander Setzer:
Basic Network Creation Games with Communication Interests. CoRR abs/1207.5419 (2012) - [i3]Peter Kling, Andreas Cord-Landwehr, Frederik Mallmann-Trenn:
Slow Down & Sleep for Profit in Online Deadline Scheduling. CoRR abs/1209.2848 (2012) - [i2]Peter Kling, Peter Pietrzyk:
Profitable Scheduling on Multiple Speed-Scalable Processors. CoRR abs/1209.3868 (2012) - 2011
- [c5]Andreas Cord-Landwehr, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, Sven Kurras, Marcus Märtens, Friedhelm Meyer auf der Heide, Christoph Raupach, Kamil Swierkot, Daniel Warner, Christoph Weddemann, Daniel Wonisch:
A New Approach for Analyzing Convergence Algorithms for Mobile Robots. ICALP (2) 2011: 650-661 - [c4]Joachim Gehweiler, Peter Kling, Friedhelm Meyer auf der Heide:
An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. PPAM (2) 2011: 31-40 - [c3]Andreas Cord-Landwehr, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, Sven Kurras, Marcus Märtens, Friedhelm Meyer auf der Heide, Christoph Raupach, Kamil Swierkot, Daniel Warner, Christoph Weddemann, Daniel Wonisch:
Collisionless Gathering of Robots with an Extent. SOFSEM 2011: 178-189 - [c2]Peter Kling, Friedhelm Meyer auf der Heide:
Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed. SPAA 2011: 159-166 - [i1]Patrick Briest, Bastian Degener, Barbara Kempkes, Peter Kling, Peter Pietrzyk:
A Distributed Approximation Algorithm for the Metric Uncapacitated Facility Location Problem in the Congest Model. CoRR abs/1105.1248 (2011) - 2010
- [c1]Bastian Degener, Barbara Kempkes, Peter Kling, Friedhelm Meyer auf der Heide:
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. SIROCCO 2010: 168-182
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-10-18 20:29 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:
