Part of the Theory and Algorithms Commons

Works in Theory and Algorithms

2023

Say That Again: The role of multimodal redundancy in communication and context, Brandon Javier Dormes
Cognitive Science Senior Theses

PDF

Cyclic Mixed-Radix Dense Gray Codes, Jessica Cheng
Computer Science Senior Theses

PDF

2022

Space-Efficient Algorithms and Verification Schemes for Graph Streams, Prantar Ghosh
Dartmouth College Ph.D Dissertations

PDF

A Machine-Verified Proof of Linearizability for a Queue Algorithm, Ugur Yavuz
Dartmouth College Master’s Theses

PDF

2021

Object Manipulation with Modular Planar Tensegrity Robots, Maxine Perroni-Scharf
Dartmouth College Undergraduate Theses

PDF

Counting and Sampling Small Structures in Graph and Hypergraph Data Streams, Themistoklis Haris
Dartmouth College Undergraduate Theses

PDF

2016

Improving Structure MCMC for Bayesian Networks through Markov Blanket Resampling, Chengwei Su, Mark E. Borsuk
Dartmouth Scholarship

PDF

DNR and Incomparable Turing Degrees, Minzhong Cai, Noam Greenberg, Michael Mcinerney
Dartmouth Scholarship

2015

TRiP: Tracking Rhythms in Plants, an Automated Leaf Movement Analysis Program for Circadian Period Estimation, Kathleen Greenham, Ping Lou, Sara E. Remsen, Hany Farid, C Robertson McClung
Dartmouth Scholarship

PDF

2012

Derivation of a Novel Efficient Supervised Learning Algorithm from Cortical-Subcortical Loops, Ashok Chandrashekar, Richard Granger
Dartmouth Scholarship

PDF

2004

A Subgroup Algorithm to Identify Cross-Rotation Peaks Consistent with Non-Crystallographic Symmetry, Ryan H. Lilien, Chris Bailey-Kellogg, Amy C. Anderson, Bruce R. Donald
Dartmouth Scholarship

PDF

2003

The Online Median Problem, Ramgopal R. Mettu, C. Greg Plaxton
Dartmouth Scholarship

PDF

2001

Approximation Techniques for Average Completion Time Scheduling, Chandra Chekuri, Rajeev Motwani, Balas Natarajan, Clifford Stein
Dartmouth Scholarship

PDF

1998

Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems, Thomas H. Cormen, Thomas Sundquist, Leonard F. Wisniewski
Dartmouth Scholarship

PDF

1997

Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs, J. R. Driscoll, D. M. Healy, D. N. Rockmore
Dartmouth Scholarship

PDF

1996

Low-Degree Spanning Trees of Small Weight, Samir Khuller, Balaji Raghavachari, Neal Young
Dartmouth Scholarship

PDF

1994

Improved Algorithms for Bipartite Network Flow, Ravindra K. Ahuja, James B. B. Orlin, Clifford Stein, Robert E. Tarjan
Dartmouth Scholarship

PDF