Logowanie

Języki

  • Polski
  • English

publikacje w roku  

2011

  1. 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)
  2. Ł. 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)
  3. 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)
  4. S. Lewanowicz, P. Woźny, Multi-degree reduction of tensor product Bezier surfaces with general boundary constrains, Applied Mathematics and Computation 217 (2011), 4596-4611. (http://dx.doi.org/10.1016/j.amc.2010.11.011)
  5. 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)
  6. 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)
  7. 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)
  8. 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)
  9. M. Kamburelis, Compositing Shaders in X3D, Theory and Practice of Computer Graphics, Eurographics UK Chapter Proceedings, 2011, pp. 101-108. (http://diglib.eg.org/EG/DL/LocalChapterEvents/TPCG/TPCG11)
  10. S. Lewanowicz, P. Woźny, Bezier representation of the constrained dual Bernstein polynomials, Applied Mathematics and Computation 218 (2011), 4580-4586. (http://dx.doi.org/10.1016/j.amc.2011.10.040)
  11. A. Bartkowiak, A. Szustalewicz, Lars Regression in Diagnosing Mammograms: Selection of Variables for Analysis, Colloquium Biometricum 41, 2011, 73-86. (http://tinyurl.com/73kxso2)
  12. W. Bożejko, P. Rajba, M. Wodecki, Problem dystrybucji w systemie JIT z losowymi parametrami, Komputerowo Zintegrowane Zarządzanie (red. R. Knosala), Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, (2011), 223-233.
  13. W. Bożejko, P. Uchroński, M. Wodecki, Szacowanie wartości funkcji celu w problemie gniazdowym z równoległymi maszynami, Komputerowo Zintegrowane Zarządzanie (red. R. Knosala), Oficyna Wydawnicza Polskiego Towarzystwa Zarządzania Produkcją, (2011), 234-252.
  14. W. Bożejko, M. Wodecki, Single-walk parallelization of the genetic algorithm, Proceedings of the 3rd International Conference on Agents and Artificial Intelligence, Rzym (2011), 586-590.
  15. W. Bożejko, M. Wodecki, The metodology of parallel mementic algorithms designing, Proceedings of the 3rd International Conference on Agents and Artificial Intelligence, Rzym (2011), 643-648.
  16. W. Bożejko, Z. Hejducki, M. Rogalska, M. Wodecki, Scheduling of a construction projects with a hybrid evolutionary algorithm's application, in: Evolutionary Algorithms (Eisuke Kita, ed.), InTech Publishing, (2011), 295-308.
  17. W. Bożejko, M. Uchroński, M. Wodecki, Parallel estimation of the cost function for the flexible scheduling problem, Procedia Computer Science, vol. 4, 2011, 2236-2245.
  18. W. Bożejko, Z. Hejducki, P. Rajba, M. Wodecki, Project management In building process with uncertain tasks times, Management and Production Engineering Review, vol. 2, 2011, 3-9.
  19. W. Bożejko, M. Uchroński, M. Wodecki, Równoległe szacowanie wartości funkcji celu w elastycznym problemie gniazdowym, Automatyka, Tom 15, Zeszyt 2, Wyd. AGH, Kraków 2011, 91-100.
  20. W. Bożejko, M. Wodecki, Problem rozsyłania informacji w sieciach komputerowych, Automatyka, Tom 15, Zeszyt 2, Wyd. AGH, Kraków 2011, 101-108.
  21. W. Bożejko, M. Uchroński, M. Wodecki, Parallel estimation of the cost function for the flexible scheduling problem, Proceedings of the ICCS 2011, Procedia Computer Science 4 (2011), Elsevier, 2236-2245.
  22. E. Gurbiel, G. Hardt-Olejniczak, E. Kołczyk, H. Krupicka, M. M. Sysło, Technologia informacyjna, Podręcznik dla liceum ogólnokształcącego, liceum profilowanego i technikum, s. 288, WSiP, Warszawa 2011, wyd. VIII.
  23. Praca z uczniem uzdolnionym informatycznie. Tło psychologiczno-pedagogiczne, doświadczenia i propozycje zajęć (red. M. M. Sysło), Projekt Informatyka+, WWSI, Warszawa 2011, 1-192.
  24. Podstawy algorytmiki. Zastosowania informatyki (red. M. M. Sysło), Zbiór wykładów Wszechnicy Popołudniowej, Tom 1, Projekt Informatyka+, WWSI, Warszawa 2011, 1-288.
  25. 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)
  26. A. Kisielewicz, M. Szykuła, Rainbow induced subgraphs in proper vertex colorings, Fundamenta Informaticae, Vol. 111, nr 4 (2011), 437-451.
  27. J. de Nivelle, Classical Logic with Partial Functions, J. Autom. Reasoning 47(4): 399-425 (2011).
  28. K. Paluch, Faster and simpler approximation of stable matchings, WAOA 2011.
  29. J. Marcinkowski, J. Michaliszyn, The ultimate undecidability result for the Halpern-Shoham Logic, Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, 377-386.
  30. A. Bartkowiak, Anomaly, novelty, one-class classification: a Comprehensive Introduction, International Journal of Computer Information Systems and Industrial Management Applications, Vol. 3 (2011), 61-71. (http://www.mirlabs.org/ijcisim/regular_papers_2011/Paper8.pdf)
  31. A. Bartkowiak, Command and block profiles for legitimate users of a computer network, w: Computer information systems: analysis and technologies, 10th international conference, proceedings (CISIM 2011, Kolkata, India, December 14-16, 2011) Nabendu Chaki, Agostino Cortesi (ed.), Berlin, Heidelberg: Springer, 2011, (Communications in computer and information science, 245) 295-304. (http://dx.doi.org/10.1007/978-3-642-27245-5_35)
  32. A. Bartkowiak, R. Zimroz, Investigation on spectral structure of gearbox vibration signals by principal component analysis for condition monitoring purposes, Journal of Physics, Conference Series, Vol. 305, nr 1 (2011), nr art. 012075 (10 str.), 9th International Conference on Damage Assessment of Structures (DAMAS 2011) 11-13 July 2011, St. Anne's College, University of Oxford (http://dx.doi.org/10.1088/1742-6596/305/1/012075)
  33. A. Bartkowiak, R. Zimroz, Outliers analysis and one class classification approach for planetary gearbox diagnosis, Journal of Physics: Conference Series, Vol. 305, nr 1 (2011), nr art. 012031 (10 str.), 9th International Conference on Damage Assessment of Structures (DAMAS 2011), 11-13 July 2011, St. Anne's College, University of Oxford (http://dx.doi.org/10.1088/1742-6596/305/1/012031)
  34. A. Bartkowiak, R. Zimroz, Sparse PCA for gearbox diagnostics, w: Proceedings of the Federated Conference on Computer Science and Information Systems (FedCSIS 2011), Szczecin, Poland, 18-21 September 2011, M. Ganzha, L. Macieszek, M. Paprzycki (eds.), Katowice: Polskie Towarzystwo Informatyczne, Oddział Górnośląski, 2011, 25-31 (http://tinyurl.com/7cz4mba)
  35. 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)
  36. 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)
  37. M. Biernacka, D. Biernacki, F. Sieczkowski, Automating derivations of abstract machines from reduction semantics: a generic formalization of refocusing in coq, w: Implementation and Application of Functional Languages: 22nd International Symposium, IFL 2010, Alphen aan den Rijn, The Netherlands, September 1-3, 2010, Revised Selected Papers /edited by Jurriaan Hage, Marco T. Morazán, Berlin, Heidelberg: Springer-Verlag, 2011, (Lecture Notes in Computer Science, 6647), 72-88. (http://dx.doi.org/10.1007/978-3-642-24276-2_5)
  38. M. Biernacka, D. Biernacki, S. Lenglet, Typing control operators in the CPS hierarchy, w: Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming /Peter Schneider-Kamp, Michael Hanus (Eds.), New York: ACM, 2011, 149-160. (http://dx.doi.org/10.1145/2003476.2003498)
  39. D. Biernacki, M. Materzok, Subtyping delimited continuations, w: Proceedings of the 16th ACM SIGPLAN international conference on Functional programming; ICFP 2011, Tokyo, Japan, September 19-21, 2011 /Manuel M.T. Chakravarty, Zhenjiang Hu, Olivier Danvy Eds.), New York: ACM, 2011, 81-93. (http://dx.doi.org/10.1145/2034773.2034786)
  40. A. Barecka, W. Charatonik, The parameterized complexity of chosen problems for finite automata on trees, w: Language and automata theory and applications: 5th international conference, LATA 2011, Tarragona, Spain, May 26-31, 2011, proceedings /Adrian-Horia Dediu, Shunsuke Inenaga, Carlos Martín Vide (eds.), Berlin, Springer, 2011, (Lecture Notes in Computer Science, 6638), 129-141. (http://dx.doi.org/10.1007/978-3-642-21254-3_9)
  41. 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)
  42. 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)
  43. 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)
  44. 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)
  45. E. Kieroński, Decidability issues for two-variable logics with several linear orders, w: Computer Science Logic (CSL'11), 25th International Workshop/20th Annual Conference of the EACSL / Marc Bezem ed., Wadern, Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2011 (Leibniz International Proceedings in Informatics (LIPIcs), 12), 337-351, CSL 2011, September 12-15, 2011, Bergen, Norway. (http://dx.doi.org/10.4230/LIPIcs.CSL.2011.337)
  46. E. Kieroński, J. Michaliszyn, J. Otop, Modal logics definable by universal three-variable formulas, w: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011) /Supratik Chakraborty, Amit Kumar (eds.), Wadern: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2011 (Leibniz International Proceedings in Informatics (LIPIcs), 13), 264-275, FSTTCS 2011, December 12-14, 2011, Mumbai, India. (http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.264)
  47. P. Wnuk-Lipiński, A Stock Market Decision Support System with a Hybrid Evolutionary Algorithm for Many-Core Graphics Processors, [in] Euro-Par 2010 Parallel Processing Workshops, LNCS, vol. 6586, Springer, 2011, pp. 455-462.
  48. P. Filipiak, K. Michalak, P. Wnuk-Lipiński, Infeasibility Driven Evolutionary Algorithm with ARIMAbased Prediction Mechanism, [in] Intelligent Data Engineering and Automated Learning, LNCS, vol. 6936, Springer, 2011, pp. 345-352.
  49. M. M. Sysło, Outreach to prospective informatics students, w: Informatics in schools: contributing to 21st century education, 5th International Conference on Informatics in Schools: Situation, evolution and perspectives, ISSEP 2011, Bratislava, Slovakia, October 26-29, 2011, proceedings /Ivan Kalaš, Roland T. Mittermeir (eds.), Heidelberg: Springer, 2011, (Lecture Notes in Computer Science, 7013), 56-70. (http://dx.doi.org/10.1007/978-3-642-24722-4_6)
  50. R. Küsters, T. Truderung, Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach, Journal of Automated Reasoning, Vol. 46, iss. 3-4 (2011), 325-352. (http://dx.doi.org/10.1007/s10817-010-9188-8)
  51. R. Küsters, T. Truderung, A. Vogt, Verifiability, privacy, and coercion-resistance: new insights from a case study, w: IEEE Symposium on Security and Privacy (SP), 2011, 22-25 May 2011, Berkeley/Oakland, California - Piscataway, IEEE, 2011, 538-553. (http://www.ieee-security.org/TC/SP2011/sp11-toc.html)
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