Computer Science · University of Michigan

Astrid Greene

Computer Science at the University of Michigan, focused on software engineering and machine learning.

View Projects

Resume

Contact

Scroll

About

Background and focus.

I study computer science at the University of Michigan, focusing on data structures, algorithms, and systems. I build software across C++ and Python, from low-level implementations to full-stack applications.

Quick facts

SchoolUniversity of Michigan
GPA3.8/4.0

Current focus

Software engineering in C++ and Python
Core CS: data structures, algorithms, systems
Designing efficient and usable applications

Experience

Roles and impact.

Software Engineer

Tech Plus Development Team

Mar 2025 – Present·Ann Arbor, MI

→Built a full-stack club platform for Tech Plus serving 300+ members and about 20 clients. Multi-page responsive frontend and backend architecture with a Node/Express-style API, REST endpoints, auth, and scalable data models for members, projects, events, and attendance.
→Built an internal portal for 300+ users with auth, protected routes, and modular dashboards for member directory, alumni graph, project assignments, attendance, and resources.
→Designed JSON-based data models with a path to migrate to PostgreSQL and cloud deployment.

Technical Analyst

Tech Plus Consulting

Jan 2026 – Present·Ann Arbor, MI

→Designed technical requirements for an internal AI policy chatbot using retrieval-augmented generation (RAG), including document ingestion, embedding, vector search, and source attribution
→Evaluated data quality, access control, and update workflows to ensure accurate, auditable, and maintainable AI responses from sanctioned policy sources

Junior Developer / Team Lead

Kode with Klossy

June 2023 – Aug 2023·New York, NY

→Led a 4-person team to design and develop a website addressing workplace discrimination
→Acted as lead debugger across front-end and back-end to support teammates and improve reliability
→Implemented a user story submission feature that collected over 100 contributions and published select narratives to spotlight underrepresented experiences

Research Assistant

Morgan State University

June 2023 – Aug 2023

→Co-authored a paper titled "Debunking The Curse of Dimensionality in a K-Nearest Neighbors Classification Problem"
→Selected as a Semi-Finalist in the Junior Science and Humanities Symposium
→Researched k-nearest neighbors and the curse of dimensionality using Python experiments
→Designed experiments on datasets with 1000+ points, varying k-values and dimensions from 2D to 15D
→Used NumPy, Scikit-learn, and Matplotlib for data generation, training, and visualization

Projects

Selected technical work.

FeaturedMarch 2026

Personal Website

Personal portfolio built with modern web tooling. Responsive layout, scroll and interaction-driven animation, and structured sections for experience, projects, and contact.

Responsive design across breakpoints
Animation-heavy UI with Framer Motion
Structured content sections with clear hierarchy

Next.jsTypeScriptTailwind CSSFramer Motion

GitHub

Nov 2025

Sudoku Solver

C++ solver for 9x9 Sudoku. Represents the board as a 9x9 grid, validates rows, columns, and 3x3 boxes, tracks candidate values for open cells, and solves via repeated constraint checks and possibility elimination.

→81-cell board with row, column, and box validity checks
→Candidate tracking and constraint propagation
→Solves NYT Easy puzzles in under a second; runtime measured with chrono

C++STLchrono

GitHub

Oct 2025

Order Book Simulator

Price-time-priority order-matching engine built with priority queues. Handles high throughput with O(log n) trade matching.

→Processed 1M+ orders and executed 760K+ trades in under 10 seconds
→74K+ orders/second throughput
→O(log n) trade matching efficiency

C++Priority QueuesData Structures

June 2025

BST-Based Map Container

Binary Search Tree with sorting invariants and an ordered Map ADT for efficient key-value storage.

→Sorting invariants, traversal logic, functors, templates, and recursion
→O(log n) insertion and lookup performance

C++BSTTemplates

May 2025

Naive Bayes Text Classifier

Multivariate Bernoulli naive Bayes classifier to classify posts by topic using log-probability scores.

→Determined labels using highest log-probability score
→Abstract data types for efficient file parsing and word-frequency detection

C++ProbabilityADTs

Oct 2021

Tic-Tac-Toe

Interactive tic-tac-toe game in Python using turtle graphics. Keyboard-controlled for both players.

→Board, Xs, and Os drawn with turtle; win and tie detection
→Scoreboard, reset, and replay with basic error checking

Pythonturtle

GitHub

Education

University of Michigan

B.S. in Computer Science, Minor in French

GPA 3.8/4.0 · University Honors

Relevant coursework

Data Structures and AlgorithmsMachine LearningComputer OrganizationObject Oriented ProgrammingDiscrete MathematicsLinear AlgebraCalculus I-II

Skills

Languages, tools, and focus areas.

Languages

C/C++
Java
Python
JavaScript/TypeScript
HTML/CSS
SQL
R

Tools & Libraries

Git
Matplotlib
NumPy
Scikit-learn
Pandas
Linux

Core Areas

Data Structures & Algorithms
Machine Learning
Retrieval-Augmented Generation
Software Development
Technical Research

Resume

Summary and download.

BS Computer Science (Minor: French) at University of Michigan. Experience in full-stack development, technical analysis, and research. Strong foundation in data structures, algorithms, and ML.

B.S. Computer Science, Minor in French, University of Michigan
Full-stack and systems-level development
Research and data-driven projects
Data structures, algorithms, and ML

Download Resume (PDF)→

Campus Involvement

GEECS

Community for women and non-binary students in EECS.

Instructional Aide

Support for Computer Organization coursework.

Math Exam Proctor

Monitor exam sessions, verify identities, and coordinate sign-in for 25–30 students per session.

Contact

Open to internships, research opportunities, and collaborative projects.