Sequence-pair based placement method for hard/soft/pre-placed modules
ISPD '98 Proceedings of the 1998 international symposium on Physical design
Solving convex programs by random walks
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Floorplanning of pipelined array modules using sequence pairs
Proceedings of the 2003 international symposium on Physical design
A simple polynomial-time rescaling algorithm for solving linear programs
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Solving convex programs by random walks
Journal of the ACM (JACM)
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Logarithmic regret algorithms for online convex optimization
Machine Learning
A cutting plane method for solving KYP-SDPs
Automatica (Journal of IFAC)
A geometric characterization of "optimality-equivalent" relaxations
Journal of Global Optimization
Computing sharp bounds for hard clustering problems on trees
Discrete Applied Mathematics
Random walks on polytopes and an affine interior point method for linear programming
Proceedings of the forty-first annual ACM symposium on Theory of computing
Thin partitions: isoperimetric inequalities and a sampling algorithm for star shaped bodies
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Journal of Global Optimization
Semantic communication for simple goals is equivalent to on-line learning
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
SIAM Journal on Computing
On exact learning halfspaces with random consistent hypothesis oracle
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Logarithmic regret algorithms for online convex optimization
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming
Mathematics of Operations Research
Note: A note on approximation of a ball by polytopes
Discrete Optimization
InSite: QoE-aware video delivery from cloud data centers
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
On the complexity of model checking interval-valued discrete time Markov chains
Information Processing Letters
| Hi-index | 0.01 |