Home > Research > Browse

Results for computational complexity

Publications & Outputs

  1. Approximation algorithms for the wafer to wafer integration problem

    Dokka, T., Bougeret, M., Boudet, V., Giroudeau, R. & C.R. Spieksma, F., 2013, Approximation and Online Algorithms: 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers. Erlebach, T. & Persiano, G. (eds.). Berlin : Springer-Verlag, Vol. 7846. p. 286-297 12 p. (Lecture Notes in Computer Science; vol. 7846).

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

  2. Towards Understanding Source Location Privacy in Wireless Sensor Networks through Fake Sources

    Jhumka, A., Bradbury, M. & Leeke, M., 6/09/2012, 2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications. IEEE, p. 760-768 9 p.

    Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

  3. Complexity results for the gap inequalities for the max-cut problem

    Galli, L., Kaparis, K. & Letchford, A. N., 05/2012, In: Operations Research Letters. 40, 3, p. 149-152 4 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  4. BCJR trellis construction for binary linear block codes

    Manoukian, H. & Honary, B., 03/1998, In: IEE Proceedings - Communications. 144, 6, p. 367-371 5 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review

  5. Array codes over rings and their trellis decoding

    Charbit, G., Manoukian, H. & Honary, B., 10/1996, In: IEE Proceedings - Communications. 143, 5, p. 241-246 6 p.

    Research output: Contribution to Journal/MagazineJournal articlepeer-review