• Polski
  • English

publikacje w roku  


  1. A. Bartkowiak, A. Szustalewicz, Are amino-acids counts in yeast ORFs negative binomial?, International Journal of Biometrics, Vol. 1, No. 3, 268-297, 2009.
  2. A. Bartkowiak, Modelling Occurrence of Amino-Acids in Yeast DNA code, BERE 2009 Abstracts. Symposium on Biomathematics and Ecology Research and Education, June 13-17, 2009, Izmir University of Economics, Turkey, 19-20.
  3. A. Bartkowiak, Outliers in biometrical data – two real examples of analysis (red. K. Saeed), 2009 Int'1 Conf. on Biometrics and Kansei Engineering, ICBAKE 2009, 25-28 June 2009, Cieszyn, Poland. IEEE Computer Society Conference Publishing Services, Los Alamitos, CA, CPS Online, 1-6.
  4. A. Bartkowiak, Search for outliers in abnormal data – a case study on frequencies of amino-acids in DNA code, ACS-AISBITS, 16th Intnl. Multi-Conf Conference on Advanced Computer Systems, Artificial Intelligence, Software Technologies, Biometrics and Information Technology security, 14-16th October 2009, Szczecin-Międzyzdroje. Electronic proceedings.
  5. 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)
  6. 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)
  7. M. Biernacka, D. Biernacki, A Context-based Approach to Proving Termination of Evaluation, Proceedings of the 25th Conference on the Mathematical Foundations of Programming Semantics (MFPS25), Oxford, UK, April 2009. ENTCS 249, 169-192, 2009. (http://www.ii.uni.wroc.pl/~dabi/Publications/MFPS09/biernacka-biernacki-mfps09.pdf)
  8. M. Biernacka, D. Biernacki, Context-based Proofs of Termination for Typed Delimited-Control Operators, Proceedings of the 11th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP 2009), Coimbra, Portugal, September 2009, 289-300. (http://www.ii.uni.wroc.pl/~dabi/Publications/PPDP09/biernacka-biernacki-ppdp09.pdf)
  9. M. Biernacka, O. Danvy, Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines, Festschrift in the honour of Peter Mosses. Lecture Notes in Computer Science, 5700:162-185, September 2009. (http://www.ii.uni.wroc.pl/~mabi/scheme-festschrift09.pdf)
  10. 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.
  11. W. Charatonik, M. Gębala, M. Kutyłowski, Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wrocław, Poland, September 2-4, 2009. Proceedings, Lecture Notes in Computer Science, vol. 5699, Springer 2009, 371. (http://www.springerlink.com/content/u86775512p68/)
  12. 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)
  13. 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)
  14. 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.
  15. 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.
  16. L. Grocholski, A. Jabłoński, Rola Klastra ICT w rozwoju społeczeństwa informacyjnego, w Społeczeństwo Informacyjne: Krok naprzód, dwa kroki wstecz (red. J. Nowak, P. Sienkiewicz), PTI – Polskie Towarzystwo Informatyczne – oddział Górnośląski, Katowice 2009, Zakład Graficzny Politechniki Śląskiej w Gliwicach 227-260.
  17. L. Grocholski, A. Niemiec, Sprawa o nielegalne korzystanie z oprogramowania, Wydawnictwo Wyższej Szkoły Policyjnej w Szczytnie, 291-319, 2009.
  18. E. Gurbiel, G. Hardt-Olejniczak, E. Kołczyk, H. Krupicka, M. M. Sysło, Informatyka, Podręcznik dla ucznia gimnazjum, s. 360, WSiP, Warszawa 2009, wydanie I.
  19. E. Gurbiel, G. Hardt-Olejniczak, E. Kołczyk, H. Krupicka, M. M. Sysło, Informatyka, Podręcznik dla ucznia szkoły podstawowej, klasy 4-6, s. 160, WSiP, Warszawa 2009, wydanie XI.
  20. E. Gurbiel, G. Hardt-Olejniczak, E. Kołczyk, H. Krupicka, M. M. Sysło, Technologia informacyjna. Kształcenie w zakresie podstawowym. Podręcznik dla liceum ogólnokształcącego, liceum profilowanego i technikum, s. 288, WSIP, Warszawa 2009, wydanie VI.
  21. 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)
  22. 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/)
  23. 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)
  24. 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)
  25. T. Jurdziński, Probabilistic Length-Reducing Two-Pushdown Automata, Theory of Computing Systems 45(1), Springer, 2009, 74-107.
  26. E. Kieroński, L. Tendera, On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations, Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science Computer Science, LICS 2009: 123-132, IEEE Computer Society. (http://www.ii.uni.wroc.pl/~kiero/lics09.ps)
  27. E. Kołczyk, Examiner's Remarks on Informatics Matura Examination in Poland, Informatics in Education, Journal of Eastern and Central Europe, Volume 8, Number 2, 2009, Institute of Mathematics and Informatics, Lithuanian Academy of Sciences, Vilnius, 251-260.
  28. P. Wnuk-Lipiński, Knowledge Patterns in Evolutionary Decision Support Systems for Financial Time Series Analysis (red. M. Giacobini), Applications of Evolutionary Computing, Lecture Notes in Computer Science, vol. 5484, Springer, 2009, 203-212.
  29. A. Jakoby, M. Liśkiewicz, 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)
  30. C. Hundt, M. Liśkiewicz, New Complexity Bounds for Image Matching under Rotation and Scaling, Proceedings of Symposium on Combinatorial Pattern Matching (CPM), 5577 Lecture Notes in Computer Science, 127-141. Springer, 2009. (http://www.springerlink.com/content/p056872u52433p78)
  31. C. Hundt, M. Liśkiewicz, 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)
  32. M. Bláser, A. Jakoby, M. Liśkiewicz, 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)
  33. J. Chomicki, J. Marcinkowski, C. Molinaro, Disjunctive Databases for Representing Repairs, Annals of Mathematics and Artificial Intelligence, opublikowane on-line 29 września 2009. (http://www.springerlink.com/content/uv1440vn1205774g/)
  34. J. Marcinkowski, The cost of being co-Buchi is nonlinear, June lst 2009, journals/corr/abs-0906-0072. (http://arxiv.org/PS_cache/arxiv/pdf/0906/0906.0072v2.pdf)
  35. J. Marcinkowski, P. Wieczorek, Modulo Constraints and the Complexity of Typechecking XML Views, Theory of Computing Systems, Volume 44, Number 4, May, 2009, 620-652, Springer. (http://www.springerlink.com/content/37q886x411657733/)
  36. J. Michaliszyn, Decidability of the Guarded Fragment with the Transitive Closure, Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, LNCS 5556, 261-272, 1. (http://www.ii.uni.wroc.pl/~jmi/icalp.pdf)
  37. 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/)
  38. Ł. 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.
  39. P. Skibiński, Improving HTML Compression, Informatica 33, 363-373, October 2009 (paper).
  40. 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).
  41. P. Skibiński, J. Swacha, Dynamic, semi-dynamic and static word-based compression: a comparison of effectiveness, Metody Informatyki Stosowanej, 18, 107-118, 2009.
  42. 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)
  43. G. Stachowiak, Asynchronous Deterministic Rendezvous on the Line, SOFSEM 2009, LNCS 5404, 497-508.
  44. M. M. Sysło, e-learning w szkole, e-mentor, 28/2009, 23-31.
  45. M. M. Sysło, Wkład edukacji informatycznej do nauczania matematyki I. Podejście algorytmiczne, Nauczyciele i Matematyka plus Technologia Informacyjna, 68/2008-2009, 20-27.
  46. R. Kústers, T. Truderung, A. Vogt, Improving and Simplifying a Variant of Prêt à Voter, E-Voting and Identity, Second International Conference, Springer (LNCS 5767), 2009, 37-53, 1. (http://www.ii.uni.wroc.pl/~tt/papers/voteid09.pdf)
  47. R. Kústers, T. Truderung, An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols, IEEE Symposium on Security and Privacy, IEEE Computer Society, 2009, 251-266. (http://www.ii.uni.wroc.pl/~tt/papers/SP-2009.pdf)
  48. R. Kústers, T. Truderung, Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation, IEEE Computer Security Foundations Symposium, IEEE Computer Society, 2009, 157-171. (http://www.ii.uni.wroc.pl/~tt/papers/csf09.pdf)
  49. W. Bożejko, M. Czapiński, M. Wodecki, Równoległy algorytm hybrydowy dla problemu przepływowego z kryterium Csum, Zeszyty Naukowe AGH, Automatyka 13/2 (2009) 199-206.
  50. W. Bożejko, Z. Hajducki, M. Rogalska, M. Wodecki, Harmonogramowanie robót budowlanych z zastosowaniem algorytmu Tabu Search z rozmytymi czasami wykonania zadań, Przegląd Budowlany Nr 7-8 (2009), 76-80.
  51. M. Wodecki, Metody agregacji w problemach optymalizacji dyskretnej, Oficyna Wydawnicza Politechniki Wrocławskiej, 2009.
  52. W. Bożejko, M. Uchroński, M. Wodecki, Równoległa metaheurystyka dla problemu gniazdowego z równoległymi maszynami, Zeszyty Naukowe AGH, Automatyka 13/2 (2009) 207-213.
  53. W. Bożejko, M. Uchroński, M. Wodecki, Scatter search for a weighted tardiness flow shop problem, Multidisciplinary International Scheduling Conference MISTA 2009, Dublin, Ireland 10-12 August 2009.
  54. W. Bożejko, M. Wodecki, Metoda analizy minimów lokalnych w rozwiązywaniu pewnych problemów optymalizacji dyskretnej, Zeszyty Naukowe AGH, Automatyka 13/2 (2009) 215-222.
  55. W. Bożejko, M. Wodecki, Równoległy asynchroniczny algorytm Tabu Search dla problemu gniazdowego szeregowania zadań (red. R. Knosala), Komputerowo Zintegrowane Zarządzanie, Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, Tom I, Opole 2009, 127-136.
  56. R. Nowak, P. Woźny, Method of summation of some slowly convergent series, Applied Mathematics and Computation. 215 (4) (2009) 1622-1645. (http://dx.doi.org/10.1016/j.amc.2009.07.016)
  57. S. Lewanowicz, P. Woźny, Multi-degree reduction of Bézier curves with constraints, using dual Bernstein basis polynomials, Computer Aided Geometric Design 26 (2009), 566-579. (http://dx.doi.org/10.1016/j.cagd.2009.01.006)
  58. 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)
  59. 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)
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