Teaching Algorithm Design: A Literature Review
Fuente:
arXiv
Saved in:
| Main Authors: | Liu, Jonathan, Poulsen, Seth, Goodwin, Erica, Chen, Hongxuan, Williams, Grace, Gertner, Yael, Franklin, Diana |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
iFlow: An Interactive Max-Flow/Min-Cut Algorithms Visualizer
by: Ye, Muyang, et al.
Published: (2024)
by: Ye, Muyang, et al.
Published: (2024)
Block-Based Pathfinding: A Minecraft System for Visualizing Graph Algorithms
by: Pirvu, Luca-Stefan, et al.
Published: (2026)
by: Pirvu, Luca-Stefan, et al.
Published: (2026)
ENS-t-SNE: Embedding Neighborhoods Simultaneously t-SNE
by: Miller, Jacob, et al.
Published: (2022)
by: Miller, Jacob, et al.
Published: (2022)
Utilizing ChatGPT in a Data Structures and Algorithms Course: A Teaching Assistant's Perspective
by: Jamie, Pooriya, et al.
Published: (2024)
by: Jamie, Pooriya, et al.
Published: (2024)
Optimizing Feature Ordering in Radar Charts for Multi-Profile Comparison
by: Dorador, Albert
Published: (2025)
by: Dorador, Albert
Published: (2025)
Improved Additive Approximation Algorithms for APSP
by: Jin, Ce, et al.
Published: (2025)
by: Jin, Ce, et al.
Published: (2025)
A Note on the Conditional Optimality of Chiba and Nishizeki's Algorithms
by: Kirkpatrick, Yael, et al.
Published: (2024)
by: Kirkpatrick, Yael, et al.
Published: (2024)
Shortest Paths in Multimode Graphs
by: Kirkpatrick, Yael, et al.
Published: (2025)
by: Kirkpatrick, Yael, et al.
Published: (2025)
New Diameter Approximations via Distance Oracle Techniques
by: Kirkpatrick, Yael, et al.
Published: (2026)
by: Kirkpatrick, Yael, et al.
Published: (2026)
Preprocessed 3SUM for Unknown Universes with Subquadratic Space
by: Kirkpatrick, Yael, et al.
Published: (2026)
by: Kirkpatrick, Yael, et al.
Published: (2026)
Beyond 2-approximation for k-Center in Graphs
by: Jin, Ce, et al.
Published: (2025)
by: Jin, Ce, et al.
Published: (2025)
Construction and Preliminary Validation of a Dynamic Programming Concept Inventory
by: Ferland, Matthew, et al.
Published: (2024)
by: Ferland, Matthew, et al.
Published: (2024)
Kernelization for $H$-Coloring
by: Berkman, Yael, et al.
Published: (2025)
by: Berkman, Yael, et al.
Published: (2025)
Streaming Algorithms for Network Design
by: Chekuri, Chandra, et al.
Published: (2025)
by: Chekuri, Chandra, et al.
Published: (2025)
A Tolerant Independent Set Tester
by: Seth, Cameron
Published: (2025)
by: Seth, Cameron
Published: (2025)
Faster Algorithms for Text-to-Pattern Hamming Distances
by: Chan, Timothy M., et al.
Published: (2023)
by: Chan, Timothy M., et al.
Published: (2023)
With a Little Help From My Friends: Exploiting Probability Distribution Advice in Algorithm Design
by: Canonne, Clément L., et al.
Published: (2025)
by: Canonne, Clément L., et al.
Published: (2025)
An Optimal Algorithm for Half-plane Hitting Set
by: Liu, Gang, et al.
Published: (2025)
by: Liu, Gang, et al.
Published: (2025)
Review of Three Algorithms That Build k-d Trees
by: Brown, Russell A.
Published: (2025)
by: Brown, Russell A.
Published: (2025)
New Graph and Hypergraph Container Lemmas with Applications in Property Testing
by: Blais, Eric, et al.
Published: (2024)
by: Blais, Eric, et al.
Published: (2024)
Testing Graph Properties with the Container Method
by: Blais, Eric, et al.
Published: (2023)
by: Blais, Eric, et al.
Published: (2023)
Approximation Algorithms for Network Design in Non-Uniform Fault Models
by: Chekuri, Chandra, et al.
Published: (2024)
by: Chekuri, Chandra, et al.
Published: (2024)
Correcting Underrepresentation and Intersectional Bias for Classification
by: Diana, Emily, et al.
Published: (2023)
by: Diana, Emily, et al.
Published: (2023)
FPT Constant Approximation Algorithms for Colorful Sum of Radii
by: Liu, Shuilian, et al.
Published: (2025)
by: Liu, Shuilian, et al.
Published: (2025)
Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)
by: Zhou, Guangyan
Published: (2026)
Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
by: Jiang, Cheng, et al.
Published: (2026)
by: Jiang, Cheng, et al.
Published: (2026)
Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies
by: Long, Yaowei, et al.
Published: (2024)
by: Long, Yaowei, et al.
Published: (2024)
Efficient Catalytic Graph Algorithms
by: Cook, James, et al.
Published: (2025)
by: Cook, James, et al.
Published: (2025)
Improved Algorithm for Permutation Testing
by: Zhang, Xiaojin
Published: (2020)
by: Zhang, Xiaojin
Published: (2020)
Approximation Algorithms for Smallest Intersecting Balls
by: Zheng, Jiaqi, et al.
Published: (2024)
by: Zheng, Jiaqi, et al.
Published: (2024)
Online Algorithms for Geometric Independent Set
by: De, Minati, et al.
Published: (2026)
by: De, Minati, et al.
Published: (2026)
Algorithms and Hardness for Estimating Statistical Similarity
by: Bhattacharyya, Arnab, et al.
Published: (2025)
by: Bhattacharyya, Arnab, et al.
Published: (2025)
Even Faster Algorithm for the Chamfer Distance
by: Feng, Ying, et al.
Published: (2025)
by: Feng, Ying, et al.
Published: (2025)
Pseudodeterministic Algorithms for Minimum Cut Problems
by: Agarwala, Aryan, et al.
Published: (2025)
by: Agarwala, Aryan, et al.
Published: (2025)
Fast Algorithms for Minimum Homology Basis
by: Dhar, Amritendu, et al.
Published: (2021)
by: Dhar, Amritendu, et al.
Published: (2021)
Sensitivity Lower Bounds for Approximaiton Algorithms
by: Fleming, Noah, et al.
Published: (2024)
by: Fleming, Noah, et al.
Published: (2024)
Algorithms for Halfplane Coverage and Related Problems
by: Wang, Haitao, et al.
Published: (2024)
by: Wang, Haitao, et al.
Published: (2024)
Algorithms for Computing Closest Points for Segments
by: Wang, Haitao
Published: (2024)
by: Wang, Haitao
Published: (2024)
Bicriteria Algorithms for Submodular Cover with Partition and Fairness Constraints
by: Chen, Wenjing, et al.
Published: (2026)
by: Chen, Wenjing, et al.
Published: (2026)
Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing
by: Chekuri, Chandra, et al.
Published: (2024)
by: Chekuri, Chandra, et al.
Published: (2024)
Similar Items
-
iFlow: An Interactive Max-Flow/Min-Cut Algorithms Visualizer
by: Ye, Muyang, et al.
Published: (2024) -
Block-Based Pathfinding: A Minecraft System for Visualizing Graph Algorithms
by: Pirvu, Luca-Stefan, et al.
Published: (2026) -
ENS-t-SNE: Embedding Neighborhoods Simultaneously t-SNE
by: Miller, Jacob, et al.
Published: (2022) -
Utilizing ChatGPT in a Data Structures and Algorithms Course: A Teaching Assistant's Perspective
by: Jamie, Pooriya, et al.
Published: (2024) -
Optimizing Feature Ordering in Radar Charts for Multi-Profile Comparison
by: Dorador, Albert
Published: (2025)