• Polski
  • English

Zakład Złożoności Obliczeniowej i Algorytmów - lista prac opublikowanych w roku 2009  

Division of Computational Complexity and Algorithms
papers published in 2009

  1. M. Bieńkowski, J. Byrka, M. Korzeniowski, Friedhelm Meyer auf der Heide, Optimal Algorithms for Page Migration in Dynamic Networks, Elsevier, Journal of Discrete Algorithms, vol. 7, issue 4, 545-569, 2009. ( http://www.ii.uni.wroc.pl/~mbi/papers/2009-jda-page-migration.pdf)
  2. M. Bieńkowski, M. Chrobak, C. Dürr, M. Hurand, A. Jeż, Ł. Jeż, G. Stachowiak, Collecting Weighted Items from a Dynamic Queue, 20th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1126-1135, 2009. (http://www.ii.uni.wroc.pl/~mbi/papers/2009-soda-item-collecting.pdf)
  3. M. Bieńkowski, Price Fluctuations: To Buy or to Rent, 7th Workshop on Approximation and Online Algorithms (WAOA), Springer LNCS, 2009. (http://www.ii.uni.wroc.pl/~mbi/papers/2009-waoa-price-fluctuations.pdf)
  4. P. Blaskiewicz, Z. Gołębiewski, M. Klonowski, K. Majcher, RFID System with Allowers, Seventh Annual IEEE International Conference on Pervasive Computing and Communications - Workshops (Per-Com Workshops 2009), 9-13 Marzec 2009, IEEE Computer Society, 1-6.
  5. P. Gawrychowski, A. Jeż, Hyper-minimisation made efficient, Mathematical Foundations of Computer Science 2009, Lecture Notes in Computer Science 5734/2009, 356-368, Springer Berlin/Heidelberg. (http://www.springerlink.com/content/dk21234j52u317r2)
  6. P. Gawrychowski, J. Byrka, S. Kelk, K. T. Huber, Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks, Journal of Discrete Algorithms, Volume 8, Issue 1 (March 2010), 65-75. (http://dx.doi.Org/10.1016/j.jda.2009.01.004)
  7. P. Gawrychowski, T. Gagie, Minimax trees in linear time with applications, International Workshop on Combinatorial Algorithms 2009, Lecture Notes in Computer Science 5874/2009, 278-288, Springer Berlin/Heidelberg.
  8. Z. Gołębiewski, M. Klonowski, M. Koza, M. Kutyłowski, Towards Fair Leader Election in Wireless Networks, ADHOC-NOW 2009, 8th International Conference on Ad Hoc Networks and Wireless, 23-25 Wrzesień 2009, Lecture Notes in Computer Science (LNCS), 166-179, volume 5793.
  9. J. Hromkovic, P. Kanarek, R. Klasing, K. Lorys, W. Unger, H. Wagener, On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks, SIAM Journal on Discrete Mathematics, Volume 23, 1612-1645, 2009.
  10. A. Jeż, A. Okhotin, Equations over sets of natural numbers with addition only, 26th International Symposium on Theoretical Aspects of Computer Science 2009 (STACS 2009) Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), 09001, 577-588. (http://drops.dagstuhl.de/opus/volltexte/2009/1806/)
  11. A. Jeż, A. Okhotin, One-nonterminal conjunctive grammars over a unary al-phabet, 4th International Computer Science Symposium in Russia 2009 (CSR 2009) Springer-Verlag LNCS 5675, 191-202. (http://dx.doi.org/10.1007/978-3-642-03351-3_19)
  12. A. Jeż, J. Łopuszański, On the Two-Dimensional Cow Search Problem, Elsevier, Information Processing Letters 109 (2009) 543-547. (http://dx.doi.org/10.1016/j.ipl.2009.01.020)
  13. T. Jurdziński, Probabilistic Length-Reducing Two-Pushdown Automata, Theory of Computing Systems 45(1), Springer, 2009, 74-107.
  14. M Liśkiewicz, A. Jakoby, R. Reischuk, C. Schindelhauer, Improving the Average Delay of Sorting. Theoretical Computer Science, 410(11):1030-1041, 2009. (http://www.sciencedirect.com/science/j ournal/03043975)
  15. M. Liśkiewicz, C. Hundt, New Complexity Bounds for Image Matching under Rotation and Scaling. In Proceedings of Symposium on Combinatorial Pattern Matching (CPM), 5577 Lecture Notes in Computer Science, 127-141. Springer, 2009. (http://www.springerlink.com/content/p056872u52433p78)
  16. M. Liśkiewicz, C. Hundt, R. Nevries, A Combinatorial Geometria Approach to Two-dimensional Robustly Pattern Matching with Scaling and Rotation. Theoretical Computer Science, 51(410):5317-5333, 2009. (http://www.sciencedirect.com/science/journal/03043975)
  17. M. Liśkiewicz, M. Bláser, A. Jakoby, B. Manthey, Privacy in Non-Private Environments. Theory of Computing Systems, 2009, DOI 10.1007/s00224-009-9243-l (electronic Online First article). (http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s00224-009-9243-1)
  18. K. Paluch, M. Mucha, A. Mądry, A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. APPROX-RANDOM 2009: 298-311. (http://www.springerlink.com/content/q6088qt27k751u30/)
  19. Ł. Piwowar, Cached Multi-Bounce Solution An Reconstruction For Voxel-Based Global Illumination, In Proceedings of the 4th International Conference on Computer Graphics Theory and Application, GRAPP 09, 173-178, 2009.
  20. P. Skibiński, Improving HTML Compression, Informatica 33, 363-373, October 2009 (paper).
  21. P. Skibiński, J. Swacha, The Efficient Storage of Text Documents in Digital Libraries, Information Technology and Libraries (ITAL), 28 (3), 143-153, September 2009 (abstract).
  22. P. Skibiński, J. Swacha, Dynamic, semi-dynamic and static word-based compression: a comparison of effectiveness, Metody Informatyki Stosowanej, 18, 107-118, 2009.
  23. P. Skibiński, Visually Lossless HTML Compression, Web Information Systems Engineering (WISE 2009), LNCS 5802, pp. 195-202, October 2009. (http://www.springerlink.com/content/h45886w734329481/)
  24. G. Stachowiak, Asynchronous Deterministic Rendezvous on the Line, SOFSEM 2009, LNCS 5404, 497-508.
Instytut Informatyki
Uniwersytetu Wroclawskiego
ul. Joliot-Curie 15
50-383 Wroclaw
tel.: 71 375 7800
tel.: 71 325 1271
fax: 71 375 7801
tel.: 71 375 7892
sprawy studenckie:
tel.: 71 375 7958
Redaktor strony WWW