Benjamin Aram Berendsohn
Scholar

Benjamin Aram Berendsohn

Google Scholar ID: 32eeaz8AAAAJ
Freie Universität Berlin
AlgorithmsData StructuresCombinatorics
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
122
 
H-index
6
 
i10-index
5
 
Publications
16
 
Co-authors
0
 
Contact
CVOpen ↗
Publications
5 items
Universally Optimal Decremental Tree Minima
2026
Cited
0
Optimal antimatroid sorting
2025
Cited
0
Permutation patterns in streams
2025
Cited
0
Balanced TSP partitioning
2025
Cited
0
Optimization with Pattern-Avoiding Input
Symposium on the Theory of Computing · 2023
Cited
4
Resume (English only)
Academic Achievements
  • PhD Thesis: 'Search trees on graphs' (2024)
  • Published papers at top-tier conferences including STOC 2024, SODA 2022, ICALP 2023, MFCS 2022, SWAT 2022, ALENEX 2024, and ESA 2025
  • Published in journals such as Combinatorial Theory and Algorithmica
  • Collaborated with advisors and researchers including László Kozma, Dániel Marx, and Haim Kaplan
  • Several works build upon his Master's thesis
Co-authors
0 total
Co-authors: 0 (list not available)