Logowanie

Języki

  • Polski
  • English

publikacje w roku  

2013

  1. P. Woźny, Construction of dual bases, Journal of Computational and Applied Mathematics 245 (2013), 75-85. (http://dx.doi.org/10.1016/j.cam.2012.12.007)
  2. S. Lewanowicz, R. Nowak, P. Woźny, Structure relations for the bivariate big q-Jacobi polynomials, Applied Mathematics and Computation 219 (2013), 8790-8802. (http://dx.doi.org/10.1016/j.amc.2013.02.059)
  3. M. Bieńkowski, M. Chrobak, C. Dürr, M. Hurand, Ł. Jeż, A. Jeż, G. Stachowiak, Collecting Weighted Items from a Dynamic Queue, Algorithmica, January 2013, Volume 65, Issue 1, pp 60-94. (http://dx.doi.org/10.1007/s00453-011-9574-6)
  4. M. Bieńkowski, M. Chrobak, C. Dürr, M. Hurand, Ł. Jeż, G. Stachowiak, A phi-competitive algorithm for collecting items with increasing weights from a dynamic queue, Theoretical Computer Science, Volume 475, 4 March 2013, Pages 92-102. (http://dx.doi.org/10.1016/j.tcs.2012.12.046)
  5. M. M. Sysło, Learning while we are connected, WCCE 2013 : 10th IFIP World Conference on Computers in Education, Toruń, Poland, July 1-7 2013 Vol. 1, Research Papers / red. Nicholas Reynolds, Mary Webb, Valentina Dagienë, Maciej M. Sysło. - Toruń : Nicolaus Copernicus University Press, 2013.
  6. M. M. Sysło, Uczyć się będąc połączonym, IwE 2013 : X konferencja "Informatyka w Edukacji", 5-7 lipca 2013, UMK Toruń : teksty wystąpień / red. Maciej M. Sysło, Anna Beata Kwiatkowska. - Toruń : Nicolaus Copernicus University Press, 2013.
  7. Z. Płoski, Algorytmy bez tajemnic, Thomas H. Cormen ; tł. Zdzisław Płoski. - Gliwice : Helion, 2013. - 224 s.
  8. A. Bartkowiak, R. Zimroz, Efficacy of some primary discriminant functions in diagnosing planetary gearboxes, Computer Information Systems and Industrial Management : 12th IFIP TC8 International Conference, CISIM 2013, Krakow, Poland, September 25-27, 2013 : Proceedings / Khalid Saeed, Rituparna Chaki, Agostino Cortesi, Sławomir Wierzchoń (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; 8104). - S. 24-35. (http://dx.doi.org/10.1007/978-3-642-40925-7_3)
  9. M. Bieńkowski, J. Byrka, M. Chrobak, N. Dobbs, T. Nowicki, M. Sviridenko, G. Świrszcz, N. E. Young, Approximation algorithms for the joint replenishment problem with deadlines, Automata, languages, and programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8 - 12, 2013, Part I / Fedor V. Fomin, Rusinš Freivalds, Marta Kwiatkowska, David Peleg (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol. 7965).- S. 135-147. (http://dx.doi.org/10.1007/978-3-642-39206-1_12)
  10. M. Bieńkowski, J. Byrka, Ł. Jeż, M. Chrobak, J. Sgall, Online control message aggregation in chain networks, Algorithms and Data Structures : 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings / Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol. 8037). - S. 133-145. (http://dx.doi.org/10.1007/978-3-642-40104-6_1)
  11. M. Biernacka, D. Biernacki, W. Jedynak, An operational foundation for the tactic language of Coq, Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming : Madrid, Spain, September 16-18, 2013. - New York : ACM , 2013.- S. 25-36. (http://dx.doi.org/10.1145/2505879.2505890)
  12. W. Charatonik, E. Kieroński, S. Benaim, M. Benedikt, R. Lenhardt, F. Mazowiecki, J. Worrell, Complexity of two-variable logic on finite trees, Automata, languages, and programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8 - 12, 2013, Part II / Fedor V. Fomin, Rusinš Freivalds, Marta Kwiatkowska, David Peleg (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol. 7966). - S. 74-88. (http://dx.doi.org/10.1007/978-3-642-39212-2_10)
  13. W. Charatonik, P. Witkowski, Two-variable logic with counting and trees, 28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS), 2013 : 25 - 28 June 2013, New Orleans, Louisiana. - Piscataway : IEEE Computer Society, 2013. - S. 73-82. (http://doi.ieeecomputersociety.org/10.1109/LICS.2013.12)
  14. P. Gawrychowski, Alphabetic minimax trees in linear time, Computer Science - Theory and Applications : 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013, Proceedings / Andrei A. Bulatov, Arseny M. Shur (eds.). - Berlin : Springer, 2013. - (Lecture Notes in Computer Science ; 7913). - S. 36-48. (http://dx.doi.org/10.1007/978-3-642-38536-0_4)
  15. A. Jeż, Approximation of grammar-based compression via recompression, Combinatorial pattern matching : 24th annual symposium, CPM 2013, Bad Herrenalb, Germany, June 17 - 19, 2013 / Johannes Fischer, Peter Sanders (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol.7922). - S. 165-176. (http://dx.doi.org/10.1007/978-3-642-38905-4)
  16. A. Jeż, One-variable word equations in linear time, Automata, languages, and programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8 - 12, 2013, Part II / Fedor V. Fomin, Rusinš Freivalds, Marta Kwiatkowska, David Peleg (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol.7966). - S. 324-335. (http://dx.doi.org/10.1007/978-3-642-39212-2_30)
  17. A. Jeż, Recompression: a simple and powerful technique for word equations, 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) / Natacha Portier, Thomas Wilke (eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. - (LIPIcs - Leibniz International Proceedings in Informatics ; Vol.20). - S. 233-244. (http://dx.doi.org/10.4230/LIPIcs.STACS.2013.233)
  18. A. Jeż, Recompression: word equations and beyond, Developments in language theory : 17th international conference ; proceedings, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013 / Marie-Pierre Béal ; Oliver Carton (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol.7907). - S. 12-26. (http://dx.doi.org/10.1007/978-3-642-38771- 5_2)
  19. Ł. Jeż, C. Dürr, Ó. C. Vásquez, Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling, Web and Internet Economics : 9th International Conference, WINE 2013, Cambridge, MA, USA, December 11-14, 2013 : proceedings / Yiling Chen, Nicole Immorlica (eds.). - Berlin [u.a.] : Springer International Publishing, 2013. - (Lecture Notes in Computer Science ; Vol.8289).- S. 134-145. (http://dx.doi.org/10.1007/978-3-642-45046-4_12)
  20. T. Jurdziński, D. R. Kowalski, G. Stachowiak, Distributed deterministic broadcasting in wireless networks of weak devices, Automata, languages, and programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8 - 12, 2013, Part II / Fedor V. Fomin, Rusinš Freivalds, Marta Kwiatkowska, David Peleg (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol.7966). - S. 632-644. (http://dx.doi.org/10.1007/978-3- 642-39212-2_55)
  21. A. Kisielewicz, J. Kowalski, M. Szykuła, A fast algorithm finding the shortest reset words, 19th international conference ; proceedings / COCOON 2013, Hangzhou, China, June 21 - 23, 2013 / Ding-Zhu Du ; Guochuan Zhang (ed.). - Berlin ; Heidelberg : Springer, 2013. - (Lecture notes in computer science ; Vol.7936). - S. 182-196. (http://dx.doi.org/10.1007/978-3-642-38768-5_18)
  22. A. Kisielewicz, M. Szykuła, Generating small automata and the Černý conjecture, Implementation and Application of Automata : 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings / Stavros Konstantinidis (ed.). - Berlin, Heidelberg : Springer , 2013. - (Lecture Notes in Computer Science ; Vol.7982).- S. 340-348. (http://dx.doi.org/10.1007/978-3-642-39274-0_30)
  23. M. Materzok, Axiomatizing subtyped delimited continuations, Computer Science Logic 2013 (CSL 2013) / Simona Ronchi Della Rocca (ed.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. - (LIPIcs - Leibniz International Proceedings in Informatics ; Vol.23).- S. 521-539. (http://dx.doi.org/10.4230/LIPIcs.CSL.2013.521)
  24. M. Berndt-Schreiber, A. B. Kwiatkowska, A. Polewczyński, K. Skowronek, M. M. Sysło, Teacher training one the way to e-teacher qualifications, Learning while we are connected : WCCE 2013 : 10th IFIP World Conference on Computers in Education, Toruń, Poland, July 1-7 2013. Vol. 2, Practice papers / red. Nicholas Reynolds, Mary Webb, Valentina Dagienë, Maciej M. Sysło. - Toruń : Nicolaus Copernicus University Press, 2013. - S. 199-207.
  25. J. Kowalski, M. Szykuła, Game description language compiler construction, AI 2013: Advances in Artificial Intelligence : 26th Australian Joint Conference, Dunedin, New Zealand, December 1-6, 2013. Proceedings. - Cham : Springer International Publishing, 2013. - (Lecture Notes in Computer Science ; Vol.8272). - S. 234-245. (http://dx.doi.org/10.1007/978-3-319-03680-9_26)
  26. P. Guagliardo, P. Wieczorek, Query processing in data integration, Data Exchange, Integration, and Streams / Phokion G. Kolaitis and Maurizio Lenzerini and Nicole Schweikardt (Eds.). - Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. - (Dagstuhl Follow-Ups ; Vol. 5).- S. 129-160. (http://dx.doi.org/10.4230/DFU.Vol5.10452.129)
  27. A. Bartkowiak, R. Zimroz, Two simple multivariate procedures for monitoring planetary gearboxes in non-stationary operating conditions, Mechanical Systems and Signal Processing. - Vol. 38, iss. 1 (2013), s. 237-247. (http://dx.doi.org/10.1016/j.ymssp.2012.03.022)
  28. M. Bieńkowski, P. Zalewski, (1, 2)-Hamiltonian completion on a matching, International Journal of Foundations of Computer Science. - Vol. 24, no 01 (2013), s. 95-108. (http://dx.doi.org/10.1142/S0129054113500019)
  29. M. Biernacka, D. Biernacki, S. Lenglet, M. Materzok, Proving termination of evaluation for System F with control operators, Electronic Proceedings in Theoretical Computer Science. - Vol. 127 (2013), s. 15-29. (http://dx.doi.org/10.4204/EPTCS.127.2)
  30. J. Byrka, F. Grandoni, T. Rothvoss, L. Sanita, Steiner tree approximation via iterative randomized rounding, Journal of the ACM. - Vol. 60, iss. 1 (2013), nr art. 6 (33 str.). (http://dx.doi.org/10.1145/2432622.2432628)
  31. A. Barecka, W. Charatonik, Parameterized complexity of basic decision problems for tree automata, International Journal of Computer Mathematics. - Vol. 90, iss. 6 (2013), s. 1150-1170. (http://dx.doi.org/10.1080/00207160.2012.762451)
  32. A. Jeż, A. Maletti, Hyper-minimization for deterministic tree automata, International Journal of Foundations of Computer Science. - Vol. 24, iss. 06 (2013), s. 815-830. (http://dx.doi.org/10.1142/S0129054113400200)
  33. Ł. Jeż, M. Chrobak, J. Sgall, Better bounds for incremental frequency allocation in bipartite graphs, Theoretical Computer Science. - Vol.514 (2013), s. 75-83. (http://dx.doi.org/10.1016/j.tcs.2012.05.020)
  34. J. Schwartz, J. Sgall, J. Békési, Ł. Jeż, Lower bounds for online makespan minimization on a smallnumber of related machines, Journal of Scheduling. - Vol. 16, nr 5 (2013), s. 539-547. (http://dx.doi.org/10.1007/s10951-012-0288-7)
  35. Ł. Jeż, A universal randomized packet scheduling algorithm, Algorithmica. - Vol. 67, nr 4 (2013), s. 498-515. (http://dx.doi.org/10.1007/s00453-012-9700-0)
  36. W. Tarnawski, V. Kurtcuoglu, P. Lorek, M. Bodych, J. Rotter, M. Muszkieta, D. Poulikakos, M. Majkowski, A. Ferrari, Ł. Piwowar, A robust algorithm for segmenting and tracking clustered cells in time-lapse fluorescent microscopy, IEEE Journal of Biomedical and Health Informatics. - Vol. 17, iss. 4 (2013), s. 862 - 869. (http://dx.doi.org/10.1109/JBHI.2013.2262233)
  37. P. Woźny, A short note on Jacobi-Bernstein connection coefficients, Applied Mathematics and Computation. - Vol.222 (2013), s. 53-57. (http://dx.doi.org/10.1016/j.amc.2013.07.029)
  38. A. Kuusisto, J. Meyers, J. Virtema, Undecidable first-order theories of affine geometries, Logical Methods in Computer Science Vol. 9 (4:26), 2013, 1-23. (http://dx.doi.org/10.2168/LMCS-9(4:26)2013)
  39. M. Bieńkowski, S. Schmid, Competitive FIB Aggregation: Online Ski Rental on the Trie, 20th Int. Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer 2013, (Lecture Notes in Computer Science vol. 8205), s. 583-584. (http://www.ii.uni.wroc.pl/~mbi/papers/2013-sirocco-fib-compression.pdf)
  40. M. Bieńkowski, N. Sarrar, S. Schmid, S. Uhlig, Brief Announcement: Dynamic Forwarding Table Aggregation without Update Churn: The Case of Dependent Prefixes, 27th Int. Symposium on DIStributed Computing (DISC), Springer 2013, (Lecture Notes in Computer Science vol. 8179), s. 92-103. (http://www.ii.uni.wroc.pl/~mbi/papers/2013-disc-ba-fib-aggregation.pdf)
  41. D. Biernacki, S. Lenglet, Environmental Bisimulations for Delimited-Control Operators, Proceedings of the 11th Asian Symposium on Programming Languages and Systems (APLAS 2013), pp., Melbourne, Australia, Springer, 2013. - (Lecture Notes in Computer Science ; Vol. 8301). - S. 333-348. (http://dx.doi.org/ 10.1007/978-3-319-03542-0_24)
  42. L. Grocholski, Stymulowanie innowacyjności poprzez politykę podatkową, E-gospodarka Problemy, Metody, Aplikacje, Uniwersytet Szczeciński Zeszyty Naukowe nr 781 Ekonomiczne Problemy Usług nr 106, Szczecin 2013, s. 189-199, ISSN 1640-6818, ISSN 1896-382X.
  43. T. Jurdziński, G. Stachowiak, Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks, Fundamentals of Computation Theory - 19th International Symposium (FCT 2013) : Springer, 2013. - (Lecture Notes in Computer Science ; Vol.8070). - s. 195-209. (http://dx.doi.org/10.1007/978-3-642-40164-0_20)
  44. T. Jurdziński, D. R. Kowalski, M. Różański, G. Stachowiak, Distributed Randomized Broadcasting in Wireless Networks under the SINR Model. Distributed Computing, 27th International Symposium (DISC 2013), : Springer 2013. - (Lecture Notes in Computer Science Volume 8205). s. 373-387. (http://dx.doi.org/10.1007/978-3-642-41527-2_26)
  45. T. Gogacz, J. Marcinkowski, Converging to the Chase - A Tool for Finite Controllability, 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, s. 540-549. (http://doi.ieeecomputersociety.org/10.1109/LICS.2013.61)
  46. T. Gogacz, J. Marcinkowski, On the BDD/FC conjecture, Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, NY, USA - June // s. 22 - 27, ACM 2013 ISBN 978-1-4503-2066-5: 127-138.
  47. T. A. Henzinger, J. Otop, From Model Checking to Model Measuring, Concurrency Theory - 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, Springer 2013, (Lecture Notes in Computer Science Vol. ), s. 273-287. (http://dx.doi.org/ 10.1007/978-3-642-40184-8_20)
  48. J. Michaliszyn, J. Otop, Elementary Modal Logics over Transitive Structures, Computer Science Logic 2013 CSL 2013, Torino, Italy, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, vol. 23 of LIPIcs s. 563-577. (http://dx.doi.org/10.1007/978-3-642-40184-8_20)
  49. J. Otop, K. Chatterjee, T. A. Henzinger, A. Pavlogiannis, Distributed synthesis for LTL fragments, Formal Methods in Computer-Aided Design, FMCAD 2013, Portland, OR, USA, October 20-23, 2013, IEEE, s. 18-25. (https://repository.ist.ac.at/130/1/Distributed_Synthesis.pdf)
  50. K. Paluch, Capacitated Rank-Maximal Matchings, 8th International Conference on Algorithms and Complexity CIAC 2013-Springer 2013 (Lecture Notes in Computer Science Vol. 7878) 2013, s. 324-335. (http://dx.doi.org/10.1007/978-3-642-38233-8_27)
  51. P. Gawrychowski, D. Straszak, Beating O(nm) in Approximate LZW-Compressed Pattern Matching, 24th International Symposium, ISAAC 2013, Algorithms and Computation - Springer 2013 (Lecture Notes in Computer Science Vol. 8283, s. 78-88. (http://dx.doi.org/10.1007/978-3-642-45030-3_8)
  52. P. Filipiak, K. Michalak, P. Wnuk-Lipiński, Usage Patterns of Trading Rules in Stock Market Trading Strategies Optimized with Evolutionary Methods, Applications of Evolutionary Computation, Springer 2013, (Lecture Notes in Computer Science, vol. 7835), s.234-243. (http://dx.doi.org/10.1007/978-3-642-37192-9_24)
  53. W. Bożejko, M. Uchroński, M. Wodecki, Parallel neuro-tabu search algorithm for the job shop scheduling problem, Proceedings of ICAISC 2013, Springer 2013- (Lecture Notes in Artificial Intelligence Vol. 7895), s. 489-499. (http://dx.doi.org/10.1007/978-3-642-38610-7_45)
  54. W. Bożejko, M. Uchroński, Z. Hejducki, M. Rogalska, M. Wodecki, Harmonogramowanie zintegrowanego systemu transportu i montażu kompozytowych elementów mostowych w systemie Just In Time, Przegląd Budowlany 2/2013, s. 39-44, ISSN 0033-2038.
  55. W. Bożejko, Z. Hejducki, M. Uchroński, M. Wodecki, Zintegrowany proces transportu i montażu obiektu, Innowacje w zarządzaniu i inżynierii produkcji (red. R. Knosala), Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, Opole 2013, ISBN 978-83-930399-5-1, 273-285.
  56. W. Bożejko, M. Uchroński, M. Wodecki, Równoległy algorytm neuro-tabu dla problemu gniazdowego szeregowania zadań, Innowacje w zarządzaniu i inżynierii produkcji (red. R. Knosala), Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, Opole 2013, ISBN 978-83-930399-5-1, 537-547.
  57. W. Bożejko, Z. Hajducki, M. Uchroński, M. Wodecki, Scheduling of composite bridge components transportation in Just in Time system, Preprints of the IFAC Conference on Manufacturing Modeling, Management, and Control (MIM2013), 2013, 2146-2150.
  58. A. Kuusisto, Modal logic and distributed message passing automata, Computer Science Logic 2013 (CSL 2013), 452-468. (http://dx.doi.org/10.4230/LIPIcs.CSL.2013.452)
  59. P. Gawrychowski, Optimal pattern matching in LZW compressed strings, ACM Transactions on Algorithms. - Vol. 9, iss.3 (2013), nr art. 25 (17 str.). (http://dx.doi.org/10.1145/2483699.2483705)
  60. A. Jeż, A. Okhotin, Unambiguous conjunctive grammars over a one-letter alphabet, Developments in Language Theory : 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings / Marie-Pierre Béal, Olivier Carton (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture notes in computer science ; 7907). - S. 277-288. ( http://www.dx.doi.org/10.1007/978-3-642-38771-5_25)
  61. A. B. Kwiatkowska, M. M. Sysło, E-teacher standards and certificates, Learning while we are connected : WCCE 2013 : 10th IFIP World Conference on Computers in Education, Toruń, Poland, July 1-7 2013. Vol. 2, Practice papers / red. Nicholas Reynolds, Mary Webb, Valentina Dagiene, Maciej M. Sysło. - Toruń : Nicolaus Copernicus University Press, 2013. - S. 145-151.
  62. A. B. Kwiatkowska, M. M. Sysło, Ocena pracy nauczyciela i wspomaganie jego rozwoju w zakresie technologii informacyjno-komunikacyjnej, Uczyć się będąc połączonym : IwE 2013 : X konferencja "Informatyka w Edukacji", 5-7 lipca 2013, UMK Toruń : teksty wystąpień / red. Maciej M. Sysło, Anna Beata Kwiatkowska. - Toruń : Nicolaus Copernicus University Press, 2013. - S. 164-167.
  63. M. Nowicki, M. Matuszak, A. B. Kwiatkowska, P. Bała, M. M. Sysło, Teaching secondary school students programming using distance learning: a case study, Learning while we are connected : WCCE 2013 : 10th IFIP World Conference on Computers in Education, Toruń, Poland, July 1-7 2013. Vol. 2, Practice papers / red. Nicholas Reynolds, Mary Webb, Valentina Dagiene, Maciej M. Sysło. - Toruń : Nicolaus Copernicus University Press, 2013.- S. 246-254.
  64. M. Cygan, Ł. Jeż, Online Knapsack Revisited, Approximation and Online Algorithms Lecture Notes in Computer Science Volume 8447, 2014, pp 144-155. (http://link.springer.com/chapter/10.1007%2F978-3-319-08001-7_13)
  65. J. Byrka, S. Li, B. Rybicki, Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter, WAOA 2013: 85-96.
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