Dan Chen

12 papers Journal 9Unranked 3

Year	Rank	Type	Title / Venue / Authors
2015	J	`jnl`	Reprint of: Approximating majority depth. Comput. Geom. Dan Chen, Pat Morin
2013	J	`jnl`	Absolute approximation of Tukey depth: Theory and experiments. Comput. Geom. Dan Chen, Pat Morin, Uli Wagner
2013	J	`jnl`	Approximating majority depth. Comput. Geom. Dan Chen, Pat Morin
2013	J	`jnl`	Oja centers and centers of gravity. Comput. Geom. Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin
2012	J	`jnl`	Approximating Majority Depth CoRR Dan Chen, Pat Morin
2012	—	`conf`	Approximating Majority Depth. CCCG Dan Chen, Pat Morin
2012	J	`jnl`	Memoryless routing in convex subdivisions: Random walks are optimal. Comput. Geom. Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin
2011	—	`conf`	Algorithms for Bivariate Majority Depth. CCCG Dan Chen, Pat Morin
2010	—	`conf`	Oja medians and centers of gravity. CCCG Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin
2009	J	`jnl`	A Branch and Cut Algorithm for the Halfspace Depth Problem CoRR David Bremner, Dan Chen
2009	J	`jnl`	Memoryless Routing in Convex Subdivisions: Random Walks are Optimal CoRR Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin
2008	J	`jnl`	Output-sensitive algorithms for Tukey depth and related problems. Stat. Comput. David Bremner, Dan Chen, John Iacono, Stefan Langerman, Pat Morin