Browse by Person
Up a levelBook Section
Fischer, E. and Lachish, Oded and Newman, I. and Matsliah, A. and Yahalom, O. (2008) On the query complexity of testing orientations for being Eulerian. In: Goel, A. and Jansen, K. and Rolim, J. and Rubinfeld, J. (eds.) Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science 5171. Berlin, Germany: Springer Verlag, pp. 402-415. ISBN 9783540853633.
Lachish, Oded and Newman, I. (2005) Testing periodicity. In: Chekuri, C. and Jansen, K. and Rolim, J.D.P. and Trevisan, L. (eds.) Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques. Lecture Notes in Computer Science. Springer, pp. 366-377. ISBN 9783540282396.
Flaxman, A. and Frieze, A.M. and Fenner, Trevor (2003) High degree vertices and eigenvalues in the preferential attachment graph. In: Arora, S. and Jansen, K. and Rolim, J.D.P. and Sahai, A. (eds.) Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. Lecture Notes in Computer Science 2764. Springer, pp. 264-274. ISBN 9783540451983.