PaperOn the complexity of some geometric problems in unbounded dimensionNimrod MegiddoJournal of Symbolic Computation
PaperEfficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems *Y.Y. Li, K.S. Leung, et al.J Combin Optim
PaperBonsai trees, or how to delegate a lattice basisDavid Cash, Dennis Hofheinz, et al.Journal of Cryptology
PaperAutomated search method for AFM and profilersMichael Ray, Yves C. MartinProceedings of SPIE - The International Society for Optical Engineering