Logowanie

Języki

  • Polski
  • English

publikacje w roku  

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

  1. M. Bieńkowski, Dynamic Page Migration with Stochastic Requests, 17th Annual ACM Symposium on Parallel in Algorithms and Architectures (SPAA), ACM Press, 2005, 270-278.
  2. M. Bieńkowski, J. Byrka, Bucket Game with Applications to Set Multicover and Dynamic Page Migration, 13th European Symposium on Algorithms (ESA), LNCS 3669, 2005, 815-826.
  3. P. Kanarek, XII Olimpiada Informatyczna, 2004/2005
  4. T. Jurdziński, F. Mraz, F. Otto, M. Platek, Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars, Fundamenta Informaticae, 64 (1-4), 2005, 217-228.
  5. T. Jurdziński, F. Otto, Shrinking Restarting Automata, 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), LNCS 3618, 2005, 532-543.
  6. M. Bieńkowski, M. Korzeniowski, Dynamic Page Migration under Brownian Motion, European Conference in Parallel Processing (Euro-Par), LNCS 3648, 2005, 962-971.
  7. M. Bieńkowski, M. Dynia, M. Korzeniowski, Improved Algorithms for Dynamic Page Migration, 22nd Symposium on Theoretical Aspects of Computer Science (STACS), LNCS 3404, 2005, 365-376.
  8. M. Bieńkowski, A. Brinkmann, M. Korzeniowski, O. Orhan, Cube Connected Cycles Based Bluetooth Scatternet Formation, 4th International Conference on Networking (ICN), LNCS 3420, 2005, 413-420.
  9. T. Jurdziński, M. Kutyłowski, J. Zatopiański, Efficient Simulation of Synchronous Systems by Multi-speed Systems, RAIRO Theoretical Informatics and Applications, 39, 2005, 401-417.
  10. T. Jurdziński, K. Loryś, Leftist Grammars and the Chomsky Hierarchy, Proceedings of 15th International Symposium Fundamentals of Computation Theory (FCT'05), LNCS 3623, 2005, 282-293.
  11. T. Jurdziński, G. Stachowiak, Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks, Theory of Computing Systems, 38 (3), 2005, 347-367.
  12. T. Jurdziński, F. Mraz, F. Otto, M. Platek, Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols, Proceedings of 9th International Conference on Developments in Language Theory (DLT'05), LNCS 3572, 2005, 284-295.
  13. M. Bieńkowski, F. Meyer auf der Heide, Page Migration in Dynamic Networks, 30th International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS 3618, 2005, 1-14.
  14. M. Bieńkowski, V. Damerow, F. Meyer auf der Heide, C. Sohler, Average case complexity of Voronoi diagrams of n sites from the unit cube, 21st European Workshop on Computational Geometry (EWCG), 2005, 167-170.
  15. M. Bieńkowski, F. Meyer auf der Heide, M. Korzeniowski, Dynamic Load Balancing in Distributed Hash Tables, 4th Annual International Workshop on Peer-To-Peer Systems (IPTPS), LNCS 3640, 2005, 217-225.
  16. M. Bieńkowski, M. Korzeniowski, Bounding Communication cost in Dynamic Load Balancing of Distributed Hash Tables, 9th International Conference on Principles of Distributed Systems (OPODIS), LNCS 3974, 2005, 381-395.
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