The homepage you are currently on is not updated frequently.
My main interest arithmetic circuit complexity.
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems.
Mathematical Foundations of Computer Science (MFCS), 8087:219-230, 2013.
Randomness efficient testing of Sparse Black Box Identities of Unbounded Degree over the Reals.
Symposium on Theoretical Aspects of Computer Science (STACS 2011).
Average-case approximation ratio of the 2-opt algorithm for the TSP
Operations Research Letters 37:2 pages 83-84, (2009).
Copyright Notice: The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.