Hootan Nakhost

703 total citations · 1 hit paper
20 papers, 289 citations indexed

About

Hootan Nakhost is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computer Vision and Pattern Recognition. According to data from OpenAlex, Hootan Nakhost has authored 20 papers receiving a total of 289 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Artificial Intelligence, 8 papers in Computer Networks and Communications and 3 papers in Computer Vision and Pattern Recognition. Recurrent topics in Hootan Nakhost's work include AI-based Problem Solving and Planning (11 papers), Constraint Satisfaction and Optimization (8 papers) and Logic, Reasoning, and Knowledge (7 papers). Hootan Nakhost is often cited by papers focused on AI-based Problem Solving and Planning (11 papers), Constraint Satisfaction and Optimization (8 papers) and Logic, Reasoning, and Knowledge (7 papers). Hootan Nakhost collaborates with scholars based in Canada, United States and United Kingdom. Hootan Nakhost's co-authors include Martin Müller, Jöerg Hoffmann, Martin Mueller, Tomas Pfister, Chunliang Li, Cheng-Yu Hsieh, Yasuhisa Fujii, Alex Ratner, Ranjay Krishna and Chih‐Kuan Yeh and has published in prestigious journals such as Electronic Notes in Theoretical Computer Science, AI Communications and Neural Information Processing Systems.

In The Last Decade

Hootan Nakhost

17 papers receiving 269 citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Distilling Step-by-Step! Outperforming Larger Language Models with Less Training Data and Smaller Model Sizes

2023 108 citations Cheng-Yu Hsieh, Chunliang Li et al. profile →

Peers

Countries citing papers authored by Hootan Nakhost

Since Specialization

Citations

This map shows the geographic impact of Hootan Nakhost's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Hootan Nakhost with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hootan Nakhost more than expected).

Fields of papers citing papers by Hootan Nakhost

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Hootan Nakhost. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Hootan Nakhost. The network helps show where Hootan Nakhost may publish in the future.

Co-authorship network of co-authors of Hootan Nakhost

This figure shows the co-authorship network connecting the top 25 collaborators of Hootan Nakhost. A scholar is included among the top collaborators of Hootan Nakhost based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Hootan Nakhost. Hootan Nakhost is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	PlanGEN: A Multi-Agent Framework for Generating Planning and Reasoning Trajectories for Complex Problem Solving 2025 ·Mihir Parmar, Xin Liu, Palash Goyal, Yanfei Chen, Long Bao Le, Swaroop Mishra, Hossein Mobahi, Jindong Gu, Zifeng Wang, Hootan Nakhost, Chitta Baral, (unknown), (unknown), Hamid Palangi	0
2	Distilling Step-by-Step! Outperforming Larger Language Models with Less Training Data and Smaller Model Sizes breakdown → 2023 ·Cheng-Yu Hsieh, Chunliang Li, Chih‐Kuan Yeh, Hootan Nakhost, Yasuhisa Fujii, Alex Ratner, Ranjay Krishna, (unknown), Tomas Pfister	108
3	Universal Self-Adaptive Prompting 2023 ·(unknown), Ruoxi Sun, Hootan Nakhost, (unknown), Julian Martin Eisenschlos, Sercan Ö. Arık, Tomas Pfister	3
4	SQLPrompt: In-Context Text-to-SQL with Minimal Labeled Data 2023 ·Ruoxi Sun, Sercan Ö. Arık, Rajarishi Sinha, Hootan Nakhost, (unknown), Pengcheng Yin, Tomas Pfister	4
5	Learning and Evaluating a Differentially Private Pre-trained Language Model 2021 ·Shlomo Hoory, Amir Feder, Avichai Tendler, (unknown), (unknown), (unknown), Hootan Nakhost, Uri Stemmer, (unknown), Avinatan Hassidim, Yossi Matias	22
6	A Theoretical Framework for Studying Random Walk Planning 2021 ·Proceedings of the International Symposium on Combinatorial Search ·Hootan Nakhost, (unknown)	0
7	Learning and Evaluating a Differentially Private Pre-trained Language Model 2021 ·(unknown), Amir Feder, Avichai Tendler, Alon Cohen, (unknown), (unknown), Hootan Nakhost, Uri Stemmer, (unknown), Avinatan Hassidim, Yossi Matias	4
8	Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement 2021 ·Proceedings of the International Conference on Automated Planning and Scheduling ·Hootan Nakhost, Martin Müller	6
9	Interpretable sequence learning for COVID-19 forecasting 2020 ·Neural Information Processing Systems ·Sercan Ö. Arık, Chunliang Li, Jinsung Yoon, Rajarishi Sinha, Arkady Epshteyn, Long Tan Le, Vikas Menon, Shashank Singh, Leyou Zhang, (unknown), (unknown), Hootan Nakhost, Elli Kanal, Tomas Pfister	9
10	Integrating Module Checking and Deduction in a Formal Proof for the Perlman Spanning Tree Protocol (STP) 2020 ·TUGraz OPEN Library (Graz University of Technology) ·Hootan Nakhost, Hossein Hojjat, Marjan Sirjani	0
11	Towards a theory of random walk planning: Regress factors, fair homogeneous graphs and extensions 2014 ·AI Communications ·Hootan Nakhost, Martin Müller	1
12	Towards a second generation random walk planner: an experimental exploration 2013 ·International Joint Conference on Artificial Intelligence ·Hootan Nakhost, Martin Müller	4
13	Resource-Constrained Planning: A Monte Carlo Random Walk Approach 2012 ·Proceedings of the International Conference on Automated Planning and Scheduling ·Hootan Nakhost, Jöerg Hoffmann, Martin Mueller	45
14	Planning Via Random Walk-Driven Local Search 2012 ·Proceedings of the International Conference on Automated Planning and Scheduling ·(unknown), Hootan Nakhost, Martin Müller	14
15	A Local Monte Carlo Tree Search Approach in Deterministic Planning 2011 ·Proceedings of the AAAI Conference on Artificial Intelligence ·(unknown), Hootan Nakhost, Martin Müller	2
16	Improving Local Search for Resource-Constrained Planning 2010 ·Proceedings of the International Symposium on Combinatorial Search ·Hootan Nakhost, Jörg Hoffmann, Martin Müller	6
17	Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement - Extended Version 2010 ·University of Alberta Library ·Hootan Nakhost, Martin Müller	2
18	Improving Local Search for Resource-Constrained Planning 2010 ·University of Alberta Library ·(unknown), Jöerg Hoffmann, Hootan Nakhost	8
19	Monte-Carlo exploration for deterministic planning 2009 ·International Joint Conference on Artificial Intelligence ·Hootan Nakhost, Martin Müller	49
20	Formal Verification of the IEEE 802.1D Spanning Tree Protocol Using ExtendedRebeca 2006 ·Electronic Notes in Theoretical Computer Science ·Hossein Hojjat, Hootan Nakhost, Marjan Sirjani	2

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact