Arushi Arora
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Arushi Arora has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Frederick Reiber
Boston University, Boston, MA, USA
2 shared publications - Matthew Ferland
Dickinson College, Carlisle, PA, USA
2 shared publications - Michael Luu
University of California, Irvine, Irvine, CA, USA
2 shared publications - Michael Shindler
University of California, Irvine, Irvine, CA, USA
2 shared publications - Randy Huynh
University of California, Irvine, Irvine, CA, USA
2 shared publications - Varun Nagaraj Rao
Computer Science, Princeton University, Princeton, New Jersey, USA
2 shared publications
Latest Publications
- Open Access
- 17 January 2026
- Published by Journal of Graph Algorithms and Applications in Journal of Graph Algorithms and Applications
- Vol. 30 (1) , 237-252
Fast Schulze Voting Using Quickselect
The Schulze voting method aggregates voter preference data using maxmin-weight graph paths, achieving the Condorcet property that a candidate who would win every head-to-head contest will also win the overall election. Once the voter preferences among $m$ candidates have been arranged into an $m\times m$ matrix of pairwise election outcomes, a previous algorithm of Sornat, Vassilevska Williams and Xu (EC '21) determines the Schulze winner in randomized expected time $O(m^2\log^4 m)$. We improve this to randomized expected time $O(m^2\log m)$ using a modified version of quickselect.- 17 January 2026
- Published by Journal of Graph Algorithms and Applications in Journal of Graph Algorithms and Applications
- Vol. 30 (1) , 237-252
Open AccessFast Schulze Voting Using Quickselect
The Schulze voting method aggregates voter preference data using maxmin-weight graph paths, achieving the Condorcet property that a candidate who would win every head-to-head contest will also win the overall election. Once the voter preferences among $m$ candidates have been arranged into an $m\times m$ matrix of pairwise election outcomes, a previous algorithm of Sornat, Vassilevska Williams and Xu (EC '21) determines the Schulze winner in randomized expected time $O(m^2\log^4 m)$. We improve this to randomized expected time $O(m^2\log m)$ using a modified version of quickselect. - Open Access
- 12 February 2025
- Published by Association for Computing Machinery (ACM)
- p. 325-331
Construction and Preliminary Validation of a Dynamic Programming Concept Inventory
Concept inventories are standardized assessments that evaluate student understanding of key concepts within academic disciplines. While prevalent across STEM fields, their development lags for advanced computer science topics like dynamic programming (DP)---an algorithmic technique that poses significant conceptual challenges for undergraduates. To fill this gap, we developed and validated a Dynamic Programming Concept Inventory (DPCI). We detail the iterative process used to formulate multiple-choice questions targeting known student misconceptions about DP concepts identified through prior research studies. We discuss key decisions, tradeoffs, and challenges faced in crafting probing questions to subtly reveal these conceptual misunderstandings. We conducted a preliminary psychometric validation by administering the DPCI to 172 undergraduate CS students finding our questions to be of appropriate difficulty and effectively discriminating between differing levels of student understanding. Taken together, our validated DPCI will enable instructors to accurately assess student mastery of DP. Moreover, our approach for devising a concept inventory for an advanced theoretical computer science concept can guide future efforts to create assessments for other under-evaluated areas currently lacking coverage.
- 12 February 2025
- Published by Association for Computing Machinery (ACM)
- p. 325-331
Open AccessConstruction and Preliminary Validation of a Dynamic Programming Concept Inventory
Concept inventories are standardized assessments that evaluate student understanding of key concepts within academic disciplines. While prevalent across STEM fields, their development lags for advanced computer science topics like dynamic programming (DP)---an algorithmic technique that poses significant conceptual challenges for undergraduates. To fill this gap, we developed and validated a Dynamic Programming Concept Inventory (DPCI). We detail the iterative process used to formulate multiple-choice questions targeting known student misconceptions about DP concepts identified through prior research studies. We discuss key decisions, tradeoffs, and challenges faced in crafting probing questions to subtly reveal these conceptual misunderstandings. We conducted a preliminary psychometric validation by administering the DPCI to 172 undergraduate CS students finding our questions to be of appropriate difficulty and effectively discriminating between differing levels of student understanding. Taken together, our validated DPCI will enable instructors to accurately assess student mastery of DP. Moreover, our approach for devising a concept inventory for an advanced theoretical computer science concept can guide future efforts to create assessments for other under-evaluated areas currently lacking coverage.
- Open Access
- 2 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 284-290
What is an Algorithms Course?
- 2 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 284-290
Open AccessWhat is an Algorithms Course?