BibTeX
@inproceedings{DBLP:conf/approx/FischerLNMY08,
author = {Eldar Fischer and
Oded Lachish and
Ilan Newman and
Arie Matsliah and
Orly Yahalom},
title = {On the Query Complexity of Testing Orientations for Being
Eulerian},
booktitle = {APPROX-RANDOM},
year = {2008},
pages = {402-415},
ee = {http://dx.doi.org/10.1007/978-3-540-85363-3_32},
crossref = {DBLP:conf/approx/2008},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/approx/2008,
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'e} D. P. Rolim and
Ronitt Rubinfeld},
title = {Approximation, Randomization and Combinatorial Optimization.
Algorithms and Techniques, 11th International Workshop,
APPROX 2008, and 12th International Workshop, RANDOM 2008,
Boston, MA, USA, August 25-27, 2008. Proceedings},
booktitle = {APPROX-RANDOM},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {5171},
year = {2008},
isbn = {978-3-540-85362-6},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2008-09-02 by Michael Ley (ley@uni-trier.de)