The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Maciej Liskiewicz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
    Privacy in Non-private Environments. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2004, pp:137-151 [Conf]
  2. Andreas Jakoby, Maciej Liskiewicz
    Revealing Additional Information in Two-Party Computations. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:121-135 [Conf]
  3. Maciej Liskiewicz, Rüdiger Reischuk
    The Complexity World below Logarithmic Space. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:64-78 [Conf]
  4. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert
    Private Computation - k-Connected versus 1-Connected Networks. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2002, pp:194-209 [Conf]
  5. Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
    One-Way Communication Complexity of Symmetric Boolean Functions. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:158-170 [Conf]
  6. Maciej Liskiewicz, Krzysztof Lorys
    Some Time-Space Bounds for One-Tape Deterministic Turing Machines. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:297-307 [Conf]
  7. Maciej Liskiewicz, Krzysztof Lorys
    On Reversal Complexity for Alternating Turing Machines (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:618-623 [Conf]
  8. Andreas Jakoby, Maciej Liskiewicz
    Paths Problems in Symmetric Logarithmic Space. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:269-280 [Conf]
  9. Maciej Liskiewicz, Ulrich Wölfel
    On the Intractability of Inverting Geometric Distortions in Watermarking Schemes. [Citation Graph (0, 0)][DBLP]
    Information Hiding, 2005, pp:176-188 [Conf]
  10. Christian Hundt, Maciej Liskiewicz, Ulrich Wölfel
    Provably Secure Steganography and the Complexity of Sampling. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:754-763 [Conf]
  11. Andreas Jakoby, Maciej Liskiewicz
    The Complexity of Some Basic Problems for Dynamic Process Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:562-574 [Conf]
  12. Krzysztof Lorys, Maciej Liskiewicz
    Two Applications of Fürer's Counter to One-Tape Nondeterministic TMs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:445-453 [Conf]
  13. Maciej Liskiewicz, Rüdiger Reischuk
    Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:91-107 [Conf]
  14. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
    Space Efficient Algorithms for Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:339-352 [Conf]
  15. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
    Private Computations in Networks: Topology versus Randomness. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:121-132 [Conf]
  16. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
    Scheduling Dynamic Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:383-392 [Conf]
  17. Maciej Liskiewicz
    Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:129-140 [Conf]
  18. Maciej Liskiewicz, Rüdiger Reischuk
    Separating the Lower Levels of the Sublogarithmic Space Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:16-27 [Conf]
  19. Christian Hundt, Maciej Liskiewicz
    On the Complexity of Affine Image Matching. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:284-295 [Conf]
  20. Maciej Liskiewicz, Hemant J. Purohit, Dhananjay V. Raje
    Relation of Residues in the Variable Region of 16S rDNA Sequences and Their Relevance to Genus-Specificity. [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:362-373 [Conf]
  21. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
    The Expressive Power and Complexity of Dynamic Process Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:230-242 [Conf]
  22. Maciej Liskiewicz
    Multiparty Computations in Non-private Environments. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:1097-1099 [Conf]
  23. Maciej Liskiewicz, Rüdiger Reischuk
    On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:3, pp:273-307 [Journal]
  24. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
    Dynamic Process Graphs and the Complexity of Scheduling [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:090, pp:- [Journal]
  25. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
    Space Efficient Algorithms for Directed Series-Parallel Graphs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:021, pp:- [Journal]
  26. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
    Private Computation - k-connected versus 1-connected Networks [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:009, pp:- [Journal]
  27. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
    Privacy in Non-Private Environments [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:071, pp:- [Journal]
  28. Jan Arpe, Andreas Jakoby, Maciej Liskiewicz
    One-Way Communication Complexity of Symmetric Boolean Functions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:083, pp:- [Journal]
  29. Maciej Liskiewicz, Rüdiger Reischuk
    The Sublogarithmic Alternating Space World [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:5, pp:- [Journal]
  30. Maciej Liskiewicz, Bodo Manthey
    New lower and upper bounds for the competitive ratio of transmission protocols. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:6, pp:297-301 [Journal]
  31. Maciej Liskiewicz
    On the Relationship Between Deterministic Time and Deterministic Reversal. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:3, pp:143-146 [Journal]
  32. Maciej Liskiewicz, Krzysztof Lorys
    Alternating Real-Time Computations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:6, pp:311-316 [Journal]
  33. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
    Space efficient algorithms for directed series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:60, n:2, pp:85-114 [Journal]
  34. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk
    Approximating schedules for dynamic process graphs efficiently. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2004, v:2, n:4, pp:471-500 [Journal]
  35. Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey
    Private Computation: k-Connected versus 1-Connected Networks. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 2006, v:19, n:3, pp:341-357 [Journal]
  36. Maciej Liskiewicz
    On the Power of 1-Tape Off-Line ATMs Running in a Bounded Number of Reversals. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:4, pp:329-339 [Journal]
  37. Miroslaw Kutylowski, Maciej Liskiewicz, Krzysztof Lorys
    Reversal Complexity Classes for Alternating Turing Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:2, pp:207-221 [Journal]
  38. Maciej Liskiewicz, Krzysztof Lorys
    Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:3, pp:511-521 [Journal]
  39. Maciej Liskiewicz, Rüdiger Reischuk
    The Sublogarithmic Alternating Space World. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:4, pp:828-861 [Journal]
  40. Maciej Liskiewicz, Krzysztof Lorys, Marek Piotrów
    On Reversal Bounded Alternating Turing Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:54, n:, pp:331-339 [Journal]
  41. Maciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda
    The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:129-156 [Journal]
  42. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
    Improving the Average Delay of Sorting. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:330-341 [Conf]
  43. Andreas Jakoby, Maciej Liskiewicz, Aleksander Madry
    Using quantum oblivious transfer to cheat sensitive quantum bit commitment [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  44. Maciej Liskiewicz, Rüdiger Reischuk
    Preface. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:41, n:2, pp:209-210 [Journal]

  45. Two-Dimensional Pattern Matching with Combined Scaling and Rotation. [Citation Graph (, )][DBLP]


  46. New Complexity Bounds for Image Matching under Rotation and Scaling. [Citation Graph (, )][DBLP]


  47. Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. [Citation Graph (, )][DBLP]


  48. Negative selection algorithms without generating detectors. [Citation Graph (, )][DBLP]


  49. Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations. [Citation Graph (, )][DBLP]


  50. Susceptible Two-Party Quantum Computations. [Citation Graph (, )][DBLP]


  51. A Combinatorial Geometric Approach to Linear Image Matching. [Citation Graph (, )][DBLP]


  52. Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. [Citation Graph (, )][DBLP]


Search in 0.000secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002