Logowanie

Języki

  • Polski
  • English

publikacje w roku  

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

  1. M. Bieńkowski, A. Feldmann, D. Jurca, W. Kellerer, G. Schaffrath, S. Schmid, J. Widmer, Competitive Analysis for Service Migration in VNets, 2nd ACM SIGCOMM Workshop on Virtualized Infrastructure Systems and Architectures (VISA), 2010. (http://www.ii.uni.wroc.pl/~mbi/papers/2010-visa-server-migration.pdf)
  2. M. Bieńkowski, S. Schmid, Online Function Tracking with Generalized Penalties, 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), Lecture Notes in Computer Science, Volume 6139, 359-370, 2010. (www.ii.uni.wroc.pl/~mbi/papers/2010-swat-function-tracking.pdf)
  3. J. Byrka, M. Ghodsi, A. Srinivasan, LP-rounding algorithms for facility-location problems, CoRR abs/1007.3611, 2010. (http://arxiv.org/pdf/1007.3611)
  4. 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, 65-75, 2010. (http://www.informatik.uni-trier.de/%7Eley/db/journals/jda/jda8.html#ByrkaGHK10)
  5. Ł. Jeż, A 4/3-competitive randomised algorithm for online scheduling of packets with agreeable deadlines, 27th International Symposium on Theoretical Aspects of Computer Science (STACS'10) w elektronicznej serii Leibniz International Proceedings in Informatics (LIPIcs). (http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2479)
  6. P. Gawrychowski, A. Jeż, Validating the Knuth-Morris-Pratt Failure Function, Fast and Online, 5th International Computer Science Symposium in Russia (CSR), Lecture Notes in Computer Science, Volume 6072, 132-143, 2010. (http://dx.doi.org/10.1007/978-3-642-13182-0_13)
  7. T. Gagie, P. Gawrychowski, Grammar-Based Compression in a Streaming Model, 4th International Conference on Language and Automata Theory and Applications LATA 2010, Lecture Notes in Computer Science, Volume 6031, 2010, 273-284, 2010. (http://www.springerlink.com/content/74234j01v41h4j0p/)
  8. A. Jeż, A. Okhotin, Univariate Equations Over Sets of Natural Numbers, Fundamenta Informatica, Volume 104, Number 5, 329-348, 2010. (http://dx.doi.org/10.3233/FI-2010-352)
  9. A. Jeż, A. Okhotin, Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth, Theory of Computing Systems, Volume 46, Number 1, 27-58, 2010. (http://dx.doi.org/10.1007/s00224-008-9139-5)
  10. A. Jeż, A. Okhotin, Least and Greatest Solutions of Equations over Sets of Integers, 35th International Symposiums on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, Volume 6281, 441-452, 2010. (http://dx.doi.org/10.1007/978-3-642-15155-2_39)
  11. M. Bieńkowski, M. Klonowski, M. Korzeniowski, D. R. Kowalski, Dynamic Sharing of a Multiple Access Channel, 27th Int. Symposium on Theoretical Aspects of Computer Science (STACS), pp. 83-94, 2010. (http://www.ii.uni.wroc.pl/~mbi/papers/2010-stacs-mutex.pdf)
  12. M. Bieńkowski, L. A. Gąsieniec, M. Klonowski, M. Korzeniowski, S. Schmid, Event Extent Estimation, 17th Int. Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science, Volume 6058, 57-71, 2010. (www.ii.uni.wroc.pl/~mbi/papers/2010-sirocco-events.pdf)
  13. M. Bieńkowski, A. Brinkmann, M. Klonowski, M. Korzeniowski, SkewCCC+: A Heterogeneous Distributed Hash Table, 14th Int. Conference On Principles Of Distributed Systems (OPODIS), Lecture Notes in Computer Science, Volume 6490, 219-234, 2010. (http://www.ii.uni.wroc.pl/~mbi/papers/2010-opodis-skewcccplus.pdf)
  14. A. Jeż, A. Okhotin, On Equations over Sets of Integers, 27th International Symposium on Theoretical Aspects of Computer Science (STACS) 2010 Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik, Germany Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), 09005, 477- 488, 2010. (http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2478)
  15. P. Gawrychowski, Ł. Jeż, A. Jeż, Validating the Knuth-Morris-Pratt Failure Function, Fast and Online, Lecture Notes in Computer Science, 2010, Volume 6072/2010, 132-14 (http://dx.doi.org/10.1007/978-3-642-13182-0_13)
  16. P. Gawrychowski, M. Gutan, A. Kisielewicz, On the problem of freeness of multiplicative matrix semigroups, Theoretical Computer Science, Volume 411, Issues 7-9, 1115-1120. (http://dx.doi.Org/10.1016/j.tcs.2009.12.005)
Adres:
Instytut Informatyki
Uniwersytetu Wroclawskiego
ul. Joliot-Curie 15
50-383 Wroclaw
Sekretariat
tel.: 71 375 7800
tel.: 71 325 1271
fax: 71 375 7801
sekretariat@ii.uni.wroc.pl
Dziekanat
tel.: 71 375 7892
dziekan@ii.uni.wroc.pl
sprawy studenckie:
dziekanat@ii.uni.wroc.pl
Portiernia
tel.: 71 375 7958
Redaktor strony WWW
redaktor@ii.uni.wroc.pl
Projekt
MAKOS