Julian Portmann

14 papers A* 3A 2B 1Journal 6Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Constant Approximation of Arboricity in Near-Optimal Sublinear Time. FOCS Jiangqi Dai, Mohsen Ghaffari, Julian Portmann
2025	J	`jnl`	Constant Approximation of Arboricity in Near-Optimal Sublinear Time. CoRR Jiangqi Dai, Mohsen Ghaffari, Julian Portmann
2023	J	`jnl`	Average Awake Complexity of MIS and Matching. CoRR Mohsen Ghaffari, Julian Portmann
2023	—	`—`	Distributed Algorithms and Techniques: Energy Efficiency, Mobile Robots, and Sublinear Centralized Algorithms. Julian Portmann
2023	A*	`conf`	Distributed MIS with Low Energy and Time Complexities. PODC Mohsen Ghaffari, Julian Portmann
2023	J	`jnl`	Distributed MIS with Low Energy and Time Complexities. CoRR Mohsen Ghaffari, Julian Portmann
2022	B	`conf`	Average Awake Complexity of MIS and Matching. SPAA Mohsen Ghaffari, Julian Portmann
2021	—	`conf`	Two Will Do: CNN With Asymmetric Loss, Self-Learning Label Correction, and Hand-Crafted Features for Imbalanced Multi-Label ECG Data Classification. CinC Cristina Gallego Vázquez, Alexander Breuss, Oriella Gnarra, Julian Portmann, Giulia Da Poian
2020	A	`conf`	Tight Bounds for Deterministic High-Dimensional Grid Exploration. DISC Sebastian Brandt, Julian Portmann, Jara Uitto
2020	J	`jnl`	Tight Bounds for Deterministic High-Dimensional Grid Exploration. CoRR Sebastian Brandt, Julian Portmann, Jara Uitto
2020	A*	`conf`	k-means++: few more steps yield constant approximation. ICML Davin Choo, Christoph Grunau, Julian Portmann, Václav Rozhon
2020	J	`jnl`	k-means++: few more steps yield constant approximation. CoRR Davin Choo, Christoph Grunau, Julian Portmann, Václav Rozhon
2019	A	`conf`	Improved Network Decompositions Using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond. DISC Mohsen Ghaffari, Julian Portmann
2019	J	`jnl`	Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond. CoRR Mohsen Ghaffari, Julian Portmann