Logowanie

Języki

  • Polski
  • English
fotopracownik

Nawigacja

Maciej Liśkiewicz

Pracownik  

2009

  1. A. Jakoby, M. Liśkiewicz, R. Reischuk, C. Schindelhauer, Improving the Average Delay of Sorting, Theoretical Computer Science, 410(11):1030-1041, 2009. (http://www.sciencedirect.com/science/j ournal/03043975)
  2. C. Hundt, M. Liśkiewicz, New Complexity Bounds for Image Matching under Rotation and Scaling, Proceedings of Symposium on Combinatorial Pattern Matching (CPM), 5577 Lecture Notes in Computer Science, 127-141. Springer, 2009. (http://www.springerlink.com/content/p056872u52433p78)
  3. C. Hundt, M. Liśkiewicz, R. Nevries, A Combinatorial Geometria Approach to Two-dimensional Robustly Pattern Matching with Scaling and Rotation, Theoretical Computer Science, 51(410):5317-5333, 2009. (http://www.sciencedirect.com/science/journal/03043975)
  4. M. Bláser, A. Jakoby, M. Liśkiewicz, B. Manthey, Privacy in Non-Private Environments, Theory of Computing Systems, 2009, DOI 10.1007/s00224-009-9243-l (electronic Online First article). (http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s00224-009-9243-1)

2008

  1. A. Jacoby, M. Liśkiewicz, A. Mądry, Susceptible Two-party Quantum Computations, Proceedings of the 2nd International Conference on Information Theoretic Security (ICITS), Vol. 5155 of Lecture Notes in Computer Science, 121-136. Springer, 2008. (http://www.springerlink.com/content/h412065054224q36)
  2. A. Jakoby, M. Liśkiewicz, R. Reischuk, Ch. Schindelhauer, Improving the Average Delay of Sorting, Theoretical Computer Science, 2008.
  3. Ch. Hundt, M. Liśkiewicz, Two-dimensional Pattern Matching with Combined Scaling and Rotation, Proceedings of the 19th Symposium on Combinatorial Pattern Matching (CPM), Vol. 5029 of Lecture Notes in Computer Science, 5-17. Springer, 2008. (http://www.springerlink.com/content/cl0p2715n9x23431)
  4. Ch. Hundt, M. Liśkiewicz, Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations, Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS), Vol. 5162 of Lecture Notes in Computer Science, 395-406. Springer, 2008. (http://www.springerlink.com/content/461663741334h402)
  5. M. Liśkiewicz, U. Wolfel, Computational Aspects of Digital Steganography, Multimedia Forensics and Security, 193-211. Information Science Reference, Hershey, New York, 2008. (http://www.igi-pub.com/reference/details.asp?id=7545)

2007

  1. A. Jakoby, M. Liśkiewicz, R. Reischuk, C. Schindelhauer, Improving the Average Delay of Sorting, Proc. 4th Annual Conference on Theory and Applications of Models of Computation (TAMC 2007), LNCS 4484, Springer- Verlag 2007, 330-341.
  2. C. Hundt, M. Liśkiewicz, On the Complexity of Affine Image Matching, in Proc. 24th International Symposium on Theoretical Aspects of Computer Science (STACS 2007), LNCS 43923, Springer-Verlag, 284-295.
  3. M. Liśkiewicz, Theory of Computing Systems (red. R. Reischuk), 41(2): (2007), Special Issue.

2006

  1. C. Hundt, M. Liśkiewicz, U. Wafel, Provably Secure Steganography and the Complexity of Sampling, Proc. 17th International Symposium on Algorithms and Computation (ISAAC 2006), LNCS 4288, 2006, 754-763.
  2. A. Jakoby, M. Liśkiewicz, A. Mądry, Using Quantum Oblivious Transfer for Cheat Sensitive Quantum Bit Commitment, ECCC Reports, TR06-085, 2006.
  3. A. Jakoby, M. Liśkiewicz, R. Reischuk, Space efficient algorithms for directed series-parallel graphs, Journal of Algorithms, Vol. 60/2, 2006, 85-114.
  4. M. Liśkiewicz, Theory of Computing Systems (red. R. Reischuk), Special Issue – Selected Papers of the Fundamentals of Computation Theory (FCT'05).
  5. M. Liśkiewicz, Multiparty Computations in Non-Private Environments, Information Transfer and Combinatorics, LNCS 4123, 2006, 1082-1084.

2005

  1. A. Jakoby, M. Liśkiewicz, Revealing Additional Information in Two-Party Computations, Proc. of the 11th Ann. Int. Conf. on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2005), LNCS 3788, 2005, 121-135.
  2. M. Liśkiewicz, U. Wölfel, On the Intractability of Inverting Geometric Distortions in Watermarking Schemes, Proc. 7th Information Hiding Workshop (IH 2005), LNCS 3727, 2005, 176-188.
  3. J. Arpe, A. Jakoby, M. Liśkiewicz, One-Way Communication Complexity of Symmetric Boolean Functions, RAIRO – Theoretical Informatics and Applications, 39(2005), 687-706.
  4. Fundamentals of Computation Theory (red. M. Liśkiewicz, R. Reischuk), Proceedings, LNCS 3623, 2005.

2004

  1. M. Bläser, A. Jakoby, M. Liśkiewicz, B. Manthey, Privacy in non-private environments, Proc. 10th Annual International Association for Cryptologic Research (IACR) ASIACRYPT 2004, LNCS 3329, Springer-Verlag 2004, 137-151.
  2. M. Liśkiewicz, H. J. Purohit, D. V. Raje, Relation of residues in the variable region of 16S rDNA sequences and their relevance to genus-specificity, Proc. 4th Workshop on Algorithms in Bioinformatics (WABI 2004), LNBI 3240, Springer-Verlag 2004, 362-373.
  3. A. Jakoby, M. Liśkiewicz, R. Reischuk, Approximating schedules for dynamic graphs efficiently, Journal on Discrete Algorithms, Vol. 2/4(2004), 471-500.
  4. M. Liśkiewicz, B. Manthey, New lower and upper bounds for the competitive ratio of transmission protocols, Information Processing Letters, 89 (2004), 297-301.

2003

  1. M. Liśkiewicz, M. Ogihara, S. Toda, The Complexity of Counting Self-avoiding Walks in Subgraphs of Two-dimensional Grids and Hypercubes, Theoretical Computer Science, 304 (2003), 129-156.
  2. J. Arpe, A. Jakoby, M. Liśkiewicz, One-Way Communication Complexity of Symmetric Boolean Functions, Proc. 14th International Symposium on Fundamentals of Computation Theory (FCT 2003), LNCS 2751, Springer-Verlag 2003, pp. 158-170.
  3. M. Liśkiewicz, M. Ogihara, S. Toda, Counting Self-avoiding Walks in Some Regular Graphs, SIGACT News, Volume 34(3), 2003, 26-39.
  4. M. Liśkiewicz, Private Computations in Networks: Topology versus Randomness, Proc. 20th International Symposium on Theoretical Aspects of Computer Science (STACS 2003), LNCS 2607, Springer-Verlag 2003, pp. 121-132.
  5. M. Bläser, A. Jakoby, M. Liśkiewicz, B. Manthey, Privacy in Non-Private Environments, ECCC Technical Report, TR03-071, ISSN 1433-8092, 2003.

2002

  1. M. Bläser, A. Jakoby, M. Liśkiewicz, B. Siebert, Private computation – 2-connected versus 1-connected networks, 22nd Annual International Association for Cryptologic Research (IACR) Crypto Conference 2002, LNCS 2442, Springer-Verlag 2002, 194-209.
  2. A. Jakoby, M. Liśkiewicz, Paths Problems in Symmetric Logarithmic Space, Proc. 29th International Colloquium on Automata, Languages, and Programming 2002, LNCS 2380, Springer-Verlag 2002, pp. 269-280.

2001

  1. A. Jakoby, M. Liśkiewicz, R. Reischuk, Dynamic Process Graphs and the Complexity of Scheduling, ECCC Reports, TR01-090, 2001.
  2. A. Jakoby, M. Liśkiewicz, The complexity of some basic problems for dynamic process graphs, Proc. 12th International Symposium on Algorithms and Computation, LNCS 2223, Springer-Verlag 2001, pp. 562-574.
  3. A. Jakoby, M. Liśkiewicz, R. Reischuk, Space efficient algorithms for series-parallel graphs, Proc. 18th International Symposium on Theoretical Aspects of Computer Science, LNCS 2010, Springer-Verlag 2001, pp. 339-352.

2000

  1. A. Jakoby, M. Liśkiewicz, R. Reischuk, The Expressive Power and Complexity of Dynamic Process Graphs, Proc. 26th International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 1928, Springer-Verlag, 2000, pp. 230-242.

1999

  1. A. Jakoby, M. Liśkiewicz, R. Reischuk, Scheduling Dynamic Graphs, Proc. 16th International Symposium on Theoretical Aspects of Computer Science, LNCS 1563, Springer-Verlag, 1999, pp. 383-392.
  2. M. Liśkiewicz, R. Reischuk, On Small Space Complexity Classes of Stochastic Turing Machines and Arthur-Merlin Games, Computational Complexity, Vol. 8, Nr. 3, 1999, pp. 274-308.

1997

  1. M. Liśkiewicz, Interactive proof systems with public coin: lower space bounds and hierarchies of complexity classes, Proc. 14th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 1200, Springer, Berlin 1997, 129-140.
  2. M. Liśkiewicz, R. Reischuk, Computing with sublogarithmic space (red. L. Hemaspaandra, A. Selman), Invited review in Complexity Theory Retrospective II, Springer, Berlin 1997, 197-224.
  3. M. Liśkiewicz, R. Reischuk, Computational limitations of stochastic Turing machines and Arthur-Merlin games with small space bounds, Proc. Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 1295, Springer, Berlin 1997, 91-107.

1996

  1. M. Liśkiewicz, R. Reischuk, Space bounds for interactive proof systems with public coins and bounded number of rounds, ICSI Technical Report TR-96-025, Berkeley 1996.
  2. M. Liśkiewicz, R. Reischuk, The sublogarithmic alternating space world, SIAM J. on Computing, 25 (1996), 828-861.

1995

  1. A. Bartkowiak, M. Liśkiewicz, A dilemma: Good model fit or stability of coefficients in the model equation, Models and Forecasts'89 - Macromodels'89, Wyd. Uniw. Łódzkiego, Łódż 1995, 281-295.
  2. M. Liśkiewicz, On the power of 1-tape off-line ATMs running in a bounded number of reversals, Mathematical Systems Theory 28 (1995), 329-339.

1994

  1. M. Liśkiewicz, R. Reischuk, The complexity world below logarithmic space, Proc. 9th Conf. Structure in Complexity Theory, IEEE Computer Society Press 1994, 64-78.

1993

  1. M. Liśkiewicz, On the relationship between deterministic time and deterministic reversal, Information Processing Letters 45 (1993), 143-146.
  2. M. Liśkiewicz, R. Reischuk, Separating the lower levels of the sublogarithmic space hierarchy (red. P. Enjalbert, A. Finkel, K. Wagner), Proc. 10th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Springer-Verlag, Berlin 1993, 16-27.

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