Biedl, Therese, Durocher, Stephane, Hoos, Holger H., Luan, Shuang, Saia, Jared, Young, Maxwell
he segment minimization problem consists of finding the smallest set of integer matrices that sum to a given intensity matrix, such that each summand has only one non-zero value, and the non-zeroes...
Strategic Substitution and Complimentarity in the Israel-Palestine Conflict (2008)
Aaron Clauset, Lindsay Heger, Maxwell Young, Kristian Skrede Gleditsch
Terrorism is one of many possible tactics to which actors may resort in political conflicts; however, previous studies of the strategic substitution within terrorism have primarily focused on shifts...
Reducing Communication Costs in Robust Peer-to-Peer Networks (2008)
Several recent research results describe how to design Distributed Hash Tables (DHTs) that are robust to adversarial attack via Byzantine faults. Unfortunately, all of these results require a...
Choosing a Random Peer in Chord (2008)
Valerie King, Scott Lewis, Jared Saia, Maxwell Young
We present two new algorithms, Arc Length and Peer Count, for choosing a peer uniformly at random from the set of all peers in Chord [24]. We show analytically that, in expectation, both algorithms...
Approximation Algorithms for Minimizing Segments in Radiation Therapy (2008)
Shuang Luan, Jared Saia, Maxwell Young
Intensity modulated radiation therapy (IMRT) is one of the most effective modalities for modern cancer treatment. The key to successful IMRT treatment hinges on the delivery of a two-dimensional...
Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks (2007)
King, Valerie, Phillips, Cynthia, Saia, Jared, Young, Maxwell
We address the problem of minimizing power consumption when performing reliable broadcast on a radio network under the following popular model. Each node in the network is located on a point in a two...
On the Frequency of Severe Terrorist Events (2006)
Clauset, Aaron, Young, Maxwell, Gleditsch, Kristian Skrede
In the spirit of Richardson's original (1948) study of the statistics of deadly conflicts, we study the frequency and severity of terrorist attacks worldwide since 1968. We show that these events are...
Michael J. Collins, David Kempe, Jared Saia, Maxwell Young
We consider an integer-subset representation problem motivated by a medical application in radiation therapy. We prove NP-completeness, derive nontrivial bounds, and report on the performance of a...
Scale Invariance in Global Terrorism (2005)
Clauset, Aaron, Young, Maxwell
Traditional analyses of international terrorism have not sought to explain the emergence of rare but extremely severe events. Using the tools of extremal statistics to analyze the set of terrorist...
Making chord robust to byzantine attacks (2005)
Amos Fiat, Jared Saia, Maxwell Young
Abstract. Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the network....
Making chord robust to byzantine attacks (2005)
Amos Fiat, Jared Saia, Maxwell Young
That which is not good for the swarm is not good for the bee either.
An Agent-Based Algorithm for Detecting Community Structure in Networks (2004)
Young, Maxwell, Sager, Jennifer, Csardi, Gabor, Haga, Peter
We present a simple stochastic agent-based community finding algorithm. Our algorithm is tested on network data from the Zachary karate club study, data from Victor Hugo's "Les Miserables", and data...
Self-Repairing Peer-to-Peer Networks (2004)
Csardi, Gabor, Young, Maxwell, Sager, Jennifer, Haga, Peter
In this paper we study the resilience of peer-to-peer networks to preferential attacks. We define a network model and experiment with three di erent simple repairing algorithms, out of which the so...