• Polski
  • English

publikacje w roku  

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

  1. P. Gawrychowski, D. Krieger, N. Rampersad, J. Shallit, Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time, Developments, Language Theory 2008, Lecture Notes in Computer Science 5257/2008, 339-358, Springer-Verlag Berlin / Heidelberg. (http://www.springerlink.com/content/k118563r5042x586)
  2. T. Jurdziński, F. Mráz, F. Otto, M. Plátek, On the Complexity of 2-Monotone Restarting Automata, Theory Comput. Syst. 42(4), Springer, 2008, 488-518.
  3. T. Jurdziński, Leftist Grammars Are Non-primitive Recursive, Automata, Languages and Programming, 35th International Colloquium (ICALP), Springer, 2008 51-62.
  4. T. Jurdziński, The Boolean Closure of Growing Context-Sensitive Languages, Fundamenta Informaticae, IOS Press, 2008, 89(2-3), 2008, 289-305.
  5. A. Jeż, A. Okhotin, Complexity of solutions of equations over sets of natural numbers, International Symposium on Theoretical Aspects of Computer Science 2008, Internationales Begegnungs- und Forschungszentrum fiir Informatik 2008, 373-384. (http://drops.dagstuhl.de/opus/volltexte/2008/1319/pdf/22011.OkhotinAlexander.Paper.1319.pdf)
  6. T. Kavitha, K. Mehlhorn, D. Michail, K. Paluch, Õ(m2n) Algorithm for Minimum Cycle Basis of Graphs, Algorithmica 52(3), 2008, 333-349.
  7. On-Line Exploration of Trees of Known Depth by a Team of Mobile Robots, raport techniczny na stronie naszego instytutu (http://www.ii.uni.wroc.pl/cms/files/TR052008.pdf)
  8. M. Bieńkowski, A. Mądry, Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers, 8th Latin American Theoretical Informatics Symposium (LATIN), Springer, Lecture Notes in Computer Science, Vol. 4957, 2008, 252-263.
  9. J. R. Kiniry, M. Moskal, E-matching for Fun and Profit, Electronic Notes in Theoretical Computer Science (ENTCS), Elsevier Science Publishers B. V., 2008, 19-35. (http://portal.acm.org/citation.cfm?id=1371287)
  10. A. Jeż, A. Okhotin, On the computational completeness of equations over sets of natural number, International Colloquium on Automata, Languages and Programming 2008, Springer-Verlag LNCS 5126, 2008, 63-74.
  11. A. Jeż, Conjunctive grammars generate non-regular unary languages, International Journal of Foundations of Computer Science, World Scientific 19:3, 2008, 597-615.
  12. M. Grech, A. Jeż, A. Kisielewicz, Graphical complexity of products of permutation groups, Elsevier Discrete Mathematics 308, 2008, 1142-1152.
  13. P. Gawrychowski, A. Kisielewicz, 2-Synchronizing Words, Languages and Automata Theory and Applications 2008, Lecture Notes in Computer Science 5196/2008, 221-231, Springer-Verlag Berlin / Heidelberg (http://www.springerlink.com/content/77884q72958653tj)
  14. M. Bieńkowski, A. Brinkmann, M. Korzeniowski, Degree 3 Suffices: A Large-Scale Overlay for P2P Networks, 12th International Conference On Principles Of Distributed Systems (OPODIS), Springer, Lecture Notes in Computer Science, Vol. 5401, 2008, 184-196.
  15. M. Bieńkowski, M. Chrobak, Ł. Jeż, Randomized Algorithms for Buffer Management with 2-Bounded Delay, 6th Workshop on Approximation and Online Algorithms (WAOA), Springer, Lecture Notes in Computer Science, vol. 5426, 2008, 92-104. (http://dx.doi.org/10.1007/978-3-540-93980-1_8)
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