Conference paper
A quantitative analysis of OS noise
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Suppose we are given a (possibly redundant) system of linear equalities and linear inequalities, C, and a solved form for C, and we now delete a constraint from C. We give an algorithm to incrementally compute a solved form for this new system. The algorithm has cost O(n2) where n is the number of constraints in C, while computing the solved form directly has expected cost O(n3). To our knowledge this is the first incremental algorithm for (re)computing a solved form after deleting a constraint. © 1995.
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Eric Price, David P. Woodruff
FOCS 2011