• Polski
  • English

publikacje w roku  

Zakład Złożoności Obliczeniowej i Analizy Algorytmów - 2009

  1. 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)
  2. 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/dk21234j52u317r)
  3. J. Byrka, P. Gawrychowski, K. T. Huber, S. Kelk, 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)
  4. T. Gagie, P. Gawrychowski, 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.
  5. 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)
  6. T. Jurdziński, Probabilistic Length-Reducing Two-Pushdown Automata, Theory of Computing Systems 45(1), Springer, 2009, 74-107.
  7. A. Jeż, 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)
  8. Ł. 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.
  9. G. Stachowiak, Asynchronous Deterministic Rendezvous on the Line, SOFSEM 2009, LNCS 5404, 497-508.
  10. J. Hromkovic, P. Kanarek, R. Klasing, K. Loryś, 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. (http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm23.html#HromkovicKKLUW09)
  11. 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/)
  12. M. Mucha, A. Mądry, K. Paluch, A 7/9 – Approximation Algorithm for the Maximum Traveling Salesman Problem, APPROX-RANDOM 2009: 298-311. (http://www.springerlink.com/content/q6088qt27k751u30/)
  13. Ch. Dürr, Ł. Jeż, N. K. Thang, Online Scheduling of Bounded Length Jobs to Maximize Throughput, 7th Workshop on Approximation and Online Algorithms (WAOA'09) Lecture Notes in Computer Science, Volume 5893, 116-127, 2009. (http://dx.doi.org/10.1007/978-3-642-12450-1_11)
  14. M. Bieńkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Ł. Jeż, A. Jeż, G. Stachowiak, Collecting weighted items from a dynamic queue, SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (http://doi.acm.org/10.1145/1496770.1496892)
  15. M. Bieńkowski, J. Byrka, F. Meyer auf der Heide, M. Korzeniowski, Optimal Algorithms for Page Migration in Dynamic Networks, Elsevier, Journal of Discrete Algorithms, vol. 7, issue 4, 545-569, 2009. (http://dx.doi.org/10.1016/j.jda.2008.07.006)
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