Dani Dorfman - Google Scholar

Get my own profile

Cited by

	All	Since 2018
Citations	24	23
h-index	3	3
i10-index	1	1

0

12

6

2018201920202021202220232 1 5 4 11

Public access

1 article

0 articles

available

not available

Based on funding mandates

Co-authors

Haim KaplanSchool of Computer Science, Tel Aviv UniversityVerified email at post.tau.ac.il
Uri ZwickTel Aviv UniversityVerified email at tau.ac.il
László KozmaFreie Universität Berlin, Department of Mathematics and Computer ScienceVerified email at cs.uni-saarland.de
Seth PettieProfessor of Computer Science and Engineering, University of MichiganVerified email at umich.edu

Dani Dorfman

Dani Dorfman

Tel Aviv University

Verified email at mail.tau.ac.il - Homepage

Algorithms and Data structures


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
A faster deterministic exponential time algorithm for energy games and mean payoff games D Dorfman, H Kaplan, U Zwick 46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019	14	2019
Improved bounds for multipass pairing heaps and path-balanced binary search trees D Dorfman, H Kaplan, L Kozma, S Pettie, U Zwick arXiv preprint arXiv:1806.08692, 2018	5	2018
Expander decomposition with fewer inter-cluster edges using a spectral cut player D Agassy, D Dorfman, H Kaplan arXiv preprint arXiv:2205.10301, 2022	3	2022
Optimal energetic paths for electric cars D Dorfman, H Kaplan, RE Tarjan, U Zwick arXiv preprint arXiv:2305.19015, 2023	1	2023
Pairing heaps: the forward variant D Dorfman, H Kaplan, L Kozma, U Zwick arXiv preprint arXiv:1709.01152, 2017	1	2017

The system can't perform the operation now. Try again later.

Articles 1–5