Dani Dorfman - Google Scholar Citations

Get my own profile

Cited by

	All	Since 2015
Citations	2	2
h-index	1	1
i10-index	0	0

Co-authors

Uri ZwickTel Aviv UniversityVerified email at tau.ac.il
Haim KaplanSchool of Computer Science, Tel Aviv UniversityVerified email at post.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

Algorithms and Data structures


Title	Cited by	Year
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	1	2018
Pairing heaps: the forward variant D Dorfman, H Kaplan, L Kozma, U Zwick arXiv preprint arXiv:1709.01152, 2017	1	2017
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		2019

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

Articles 1–3