Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors (2009)
Jonathan Derryberry, Don Sheehy, Daniel D. Sleator, Maverick Woo
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension d. The Lt-norm...
Objective A summer internship position at a leading research laboratory. Education (2008)
2003- present Graduate Researcher, Carnegie Mellon UniversityWorked on auction theory problems, in particular the clearability of combinatorial auctions when bids are restricted to connected sets of...
A summer internship position at a leading research laboratory. Education (2008)
Jonathan Derryberry, Advisor Daniel Sleator
Worked on auction theory problems, in particular the clearability of combinatorial auctions when bids are restricted to connected sets of graphs in which nodes represent items for sale. Developed an...
Experimental Evaluation of Parametric Max-Flow Algorithms (2008)
Maxim Babenko, Jonathan Derryberry, Andrew Goldberg, Robert Tarjan, Yunhong Zhou
Abstract. The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single parameter....
– Revenue Coverage Optimization (2007)
Julie Ward, Krishna Venkatraman, Qi (annabelle Feng, Robert Tarjan, Yunhong Zhou, Jia Mao, ...
– Applied balancing method to non-parametric maximum flow problem with a general network topology. – Gave sufficient conditions for stopping.
A Lower Bound Framework for Binary (2005)
Search Trees With, Jonathan Derryberry, Daniel Dominic Sleator, Chengwen Chris Wang
This paper considers the problem of bounding below the cost of accessing a sequence of keys in a binary search tree. We develop a lower bound framework for this problem that applies to any binary...
A lower bound framework for binary search trees with rotations (2005)
Jonathan Derryberry, Daniel Dominic Sleator, Chengwen Chris Wang
This paper considers the problem of bounding below the cost of accessing a sequence of keys in a binary search tree. We develop a lower bound framework for this problem that applies to any binary...
Combinatorial Auctions with Structured Item Graphs (2004)
Vincent Conitzer And, Vincent Conitzer, Jonathan Derryberry, Tuomas S
allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We study the setting where there is a graph (with some desired property), with the...
Incorporating better register allocation into jikes (2003)
Jonathan Derryberry, Manfred Lau
In dynamically compiled code, it is important not only that the compiler produce fast code, but also that the compiler itself costs little overhead to the runtime application. These two competing...