Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Dean, Brian C. - Department of Computer Science, Clemson University
Weighted Alliances in Graphs Lindsay H. Jamieson and Brian C. Dean
BEYOND SCREEN CAPTURE: CREATING EFFECTIVE MULTIMEDIA WHITEBOARD LECTURES ON A TABLET PC
The Generalized Stable Allocation Problem Brian C. Dean and Namrata Swar
Algorithms for Minimum-Cost Paths in Time-Dependent Networks with Waiting Policies
Approximation Algorithms for k-Hurdle Problems Brian C. Dean
The Generalized Stable Allocation Problem Brian C. Dean and Namrata Swar
Rank-Sensitive Priority Queues Brian C. Dean and Zachary H. Jones
Building Cartesian Trees from Free Trees Brian C. Dean Raghuveer Mohan
The Unsplittable Stable Marriage Problem Brian C. Dean, Michel X. Goemans, and Nicole Immorlica
A Simple Expected Running Time Analysis for Randomized "Divide and Conquer" Algorithms
Adaptivity and Approximation for Stochastic Packing Problems Brian C. Dean
Shortest Paths in FIFO Time-Dependent Networks: Theory and Algorithms
A Simple Expected Running Time Analysis for Randomized ``Divide and Conquer'' Algorithms
LectureScribe: A Simple Tool for Creating Animated Whiteboard Lectures Brian C. Dean
The Unsplittable Stable Marriage Problem Brian C. Dean, Michel X. Goemans, and Nicole Immorlica
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution
Finite Termination of ``Augmenting Path'' Algorithms in the Presence of Irrational Problem Data
A Linear Programming Approach for Automated Localization of Multiple Faults
An Efficient Algorithm for Batch Stability Testing John Dabney
Adaptivity and Approximation for Stochastic Packing Problems # Brian C. Dean + Michel X. Goemans # Jan Vondrak
Weighted Alliances in Graphs Lindsay H. Jamieson and Brian C. Dean
ContinuousTime Dynamic Shortest Path BRIAN C. DEAN
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
Exploring the Duality Between Skip Lists and Binary Search Trees
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
Dynamic Homework Annotation Brian C. Dean
BEYOND SCREEN CAPTURE: CREATING EFFECTIVE MULTIMEDIA WHITEBOARD LECTURES ON A TABLET PC
Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data
Shortest Paths in FIFO Time-Dependent Networks: Theory and Algorithms
Continuous-Time Dynamic Shortest Path BRIAN C. DEAN
Exploring the Duality Between Skip Lists and Binary Search Trees
Matchability and k-Maximal Matchings Brian C. Dean a, Sandra M. Hedetniemi a
CpSc 840: Design and Analysis of Algorithms Instructor: Dr. Brian Dean Spring 2011
Algorithms for MinimumCost Paths in TimeDependent Networks with Waiting Policies
Approximation Algorithms for Stochastic Scheduling Brian Christopher Dean
A LinearTime Algorithm for Broadcast Domination in John Dabney # Brian C. Dean # Stephen T. Hedetniemi #
A Linear-Time Algorithm for Broadcast Domination in John Dabney
Adaptive Stable Marriage Algorithms John Dabney
Approximation Algorithms for Stochastic Scheduling Brian Christopher Dean
Algorithms With Impact (CpSc 940: Advanced Algorithms)