Meet ApplyKite Twin, the application assistant that learns with you

Meet your Twin, it learns with you

Your Twin learns with you

Launch week codes:30% off annual Pro20% off monthly Pro

Ends in00h00m00s

Bernhard Haeupler

Has grant

Faculty & Group Leader "Theory and Algorithms"

sofia university “st. kliment ohridski”

Bulgaria

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Recent Grants

Grant: Close

Distributed Optimization Beyond Worst-Case Topologies

Open Date: 2020-09-01

Close Date: 2025-08-31

Grant: Close

AF: Small: Distributed Optimization Beyond Worst Case Topologies

Open Date: 2019-07-15

Close Date: 2022-06-30

Grant: Close

CIF: Small: New Coding Techniques for Synchronization Errors

Open Date: 2018-10-01

Close Date: 2022-09-30

Grant: Close

CAREER: A Theory of Error Correction for Interactive Communication

Open Date: 2018-02-15

Close Date: 2023-01-31

Grant: Close

CCF-BSF: AF: Small: Coding for Distributed Computing

Open Date: 2016-08-01

Close Date: 2019-07-31

Articles (17)

Year:

2026

Year:

2026

Year:

2026

Year:

2026

Year:

2024

Year:

2024

Year:

2024

Year:

2024

Year:

2024

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Collaborators (3)

Kuan Cheng

Assistant Professor

Peking University

CHINA

View details

Nicolas Resch

Academic, Assistant Professor

University of Amsterdam

NETHERLANDS

View details

Thatchaphol Saranurak

Assistant Professor

University of Michigan

UNITED STATES

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Bernhard Haeupler

Research Interests

Make your next move.

Recent Grants

Articles (17)

A Constant-Approximation Distance Labeling Scheme under Polynomially Many Edge Failures

DAG Projections: Reducing Distance and Flow Problems to DAGs

Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers

Reviving Thorup’s Shortcut Conjecture

Circuits Resilient to Short-Circuit Errors

Low-Step Multi-commodity Flow Emulators

Polylog-Competitive Deterministic Local Routing and Scheduling

Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free

Fully Dynamic Consistent <i>k</i>-Center Clustering

Efficient Linear and Affine Codes for Correcting Insertions/Deletions

Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts

Sparse Semi-Oblivious Routing: Few Random Paths Suffice

Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances

Hop-Constrained Oblivious Routing

A Simple Deterministic Distributed Low-Diameter Clustering

Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization

Collaborators (3)

Kuan Cheng

Nicolas Resch

Thatchaphol Saranurak

Make your next move.