Logowanie

Języki

  • Polski
  • English

publikacje w roku  

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

  1. Ł. Jeż, One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay, Lecture Notes in Computer Science, 2011, Volume 6942/2011, 239-250. (http://dx.doi.org/10.1007/978-3-642-23719-5_21)
  2. A. Jeż, A. Maletti, Computing All ℓ-Cover Automata Fast, Lecture Notes in Computer Science, 2011, Volume 6807/2011, 203-214. (http://dx.doi.org/10.1007/978-3-642-22256-6_19)
  3. P. Gawrychowski, A. Jeż, A. Maletti, On Minimising Automata with Errors, Lecture Notes in Computer Science, 2011, Volume 6907/2011, 327-338. (http://dx.doi.org/10.1007/978-3-642-22993-0_31)
  4. A. Jeż, A. Okhotin, Complexity of Equations over Sets of Natural Numbers, Theory of Computing Systems, Volume 48, Number 2, 319-342. (http://dx.doi.org/10.1007/s00224-009-9246-y)
  5. A. Jeż, A. Okhotin, One-Nonterminal Conjunctive Grammars over a Unary Alphabet, Theory of Computing Systems, Volume 49, Number 2, 319-342. (http://dx.doi.org/10.1007/s00224-011-9319-6)
  6. M. Bieńkowski, M. Chrobak, Ł. Jeż, Randomized competitive algorithms for online buffer management in the adaptive adversary model, Theoretical Computer Science, Volume 412, Issue 39, 2011, Pages 5121-5131. (http://dx.doi.org/10.1016/j.tcs.2011.05.015)
  7. M. Chrobak, Ł. Jeż, J. Sgall, Better Bounds for Incremental Frequency Allocation in Bipartite Graphs, Lecture Notes in Computer Science, 2011, Volume 6942/2011, 251-262. (http://dx.doi.org/10.1007/978-3-642-23719-5_22)
  8. T. Jurdziński, Growing grammars and length-reducing automata, Fundamenta Informaticae, Vol. 112, nr 2-3 (2011), 193-217. (http://www.mimuw.edu.pl/~fundam/FI/previous/abs112.html#12)
  9. A. Kisielewicz, M. Szykuła, Rainbow induced subgraphs in proper vertex colorings, Fundamenta Informaticae, Vol. 111, nr 4 (2011), 437-451.
  10. K. Paluch, Faster and simpler approximation of stable matchings, WAOA 2011.
  11. M. Bieńkowski, An optimal lower bound for buffer management in multi-queue switches, w: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms: [San Francisco, CA, January 23-25, 2011] /Dana Randall (Ed.), New York: Association for Computing Machinery, Society for Industrial and Applied Mathematics, 2011, 1295-1305. (http://www.informatik.uni-trier.de/~ley/db/conf/soda/soda2011.html)
  12. D. Arora, M. Bieńkowski, A. Feldmann, G. Schafrath, Online strategies for intra and inter provider service migration in virtual networks, Stefan Schmid 5th International Conference on Principles, Systems and Applications of IP Telecommunications (IPTcomm), 2011, 10:1-10:11, ACM. (http://doi.acm.org/10.1145/2124436.2124449)
  13. P. Gawrychowski, Chrobak normal form revisited, with applications, w Implementation and application of automata: 16th international conference, CIAA 2011, Blois, France, July 13-16, 2011, proceedings /Béatrice Bouchou-Markhoff, Pascal Caron, Jean-Marc Champarnaud, Denis Maurel (Eds.), Berlin, Heidelberg, Springer, 2011, (Lecture Notes in Computer Science, 6807) 142-153. (http://dx.doi.org/10.1007/978-3-642-22256-6_14)
  14. T. Gagie, P. Gawrychowski, S. J. Puglisi, Faster approximate pattern matching in compressed repetitive texts, w: Algorithms and computation, 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011, proceedings /Takao Asano [et al.] (eds.), Berlin, London, Springer, 2011 (Lecture notes in computer science, 7074), 653-662. (http://dx.doi.org/10.1007/978-3-642-25591-5_67)
  15. P. Gawrychowski, Optimal pattern matching in LZW compressed strings, w: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, January 23-25, 2011 /Dana Randall (Ed.), New York, Association for Computing Machinery, Society for Industrial and Applied Mathematics, 2011, 362-372. (http://www.siam.org/proceedings/soda/2011/SODA11_029_gawrychowskip.pdf)
  16. P. Gawrychowski, Pattern matching in lempel-ziv compressed strings: fast, simple, and deterministic, w: Algorithms - ESA 2011, 19th annual European symposium, Saarbrücken, Germany, September 5-9, 2011, proceedings /edited by Camil Demetrescu, Magnús M. Halldórsson, Berlin, Heidelberg, Springer, 2011 (Lecture Notes in Computer Science, 6942), 421-432. (http://dx.doi.org/10.1007/978-3-642-23719-5_36)
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