Philipp Czerner

Orcid: 0000-0002-1786-9592

According to our database1, Philipp Czerner authored at least 17 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast and succinct population protocols for Presburger arithmetic.
J. Comput. Syst. Sci., March, 2024

The Expressive Power of Uniform Population Protocols with Logarithmic Space.
CoRR, 2024

Brief Announcement: The Expressive Power of Uniform Population Protocols with Logarithmic Space.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Breaking Through the Ω(n)-Space Barrier: Population Protocols Decide Double-Exponential Thresholds.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

A Resolution-Based Interactive Proof System for UNSAT.
Proceedings of the Foundations of Software Science and Computation Structures, 2024

Computing Inductive Invariants of Regular Abstraction Frameworks.
Proceedings of the 35th International Conference on Concurrency Theory, 2024

2023
Lower bounds on the state complexity of population protocols.
Distributed Comput., September, 2023

Making IP=PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms.
CoRR, 2023

Brief Announcement: Population Protocols Decide Double-exponential Thresholds.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Making sf IP=sf PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022
Leaderless Population Protocols Decide Double-exponential Thresholds.
CoRR, 2022

2021
Decision Power of Weak Asynchronous Models of Distributed Computing.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Lower Bounds on the State Complexity of Population Protocols.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Running Time Analysis of Broadcast Consensus Protocols.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

2020
Compact Oblivious Routing in Weighted Graphs.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2018
Multi-agent programming contest 2016: lampe team description.
Int. J. Agent Oriented Softw. Eng., 2018

Multi-agent programming contest 2017: lampe team description.
Ann. Math. Artif. Intell., 2018


  Loading...