 | 2009 |
|---|
| 54 |       | Christian Hundt,
Maciej Liskiewicz:
New Complexity Bounds for Image Matching under Rotation and Scaling.
CPM 2009: 127-141 |
| 53 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk,
Christian Schindelhauer:
Improving the average delay of sorting.
Theor. Comput. Sci. 410(11): 1030-1041 (2009) |
| 2008 |
|---|
| 52 | | Christian Hundt,
Maciej Liskiewicz:
Two-Dimensional Pattern Matching with Combined Scaling and Rotation.
CPM 2008: 5-17 |
| 51 | | Andreas Jakoby,
Maciej Liskiewicz,
Aleksander Madry:
Susceptible Two-Party Quantum Computations.
ICITS 2008: 121-136 |
| 50 | | Christian Hundt,
Maciej Liskiewicz:
Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations.
MFCS 2008: 395-406 |
| 2007 |
|---|
| 49 | | Christian Hundt,
Maciej Liskiewicz:
On the Complexity of Affine Image Matching.
STACS 2007: 284-295 |
| 48 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk,
Christian Schindelhauer:
Improving the Average Delay of Sorting.
TAMC 2007: 330-341 |
| 47 | | Christian Hundt,
Maciej Liskiewicz:
A Combinatorial Geometric Approach to Linear Image Matching.
Electronic Colloquium on Computational Complexity (ECCC) 14(066): (2007) |
| 46 | | Maciej Liskiewicz,
Rüdiger Reischuk:
Preface.
Theory Comput. Syst. 41(2): 209-210 (2007) |
| 2006 |
|---|
| 45 | | Andreas Jakoby,
Maciej Liskiewicz,
Aleksander Madry:
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment.
Complexity of Boolean Functions 2006 |
| 44 | | Maciej Liskiewicz:
Multiparty Computations in Non-private Environments.
GTIT-C 2006: 1097-1099 |
| 43 | | Christian Hundt,
Maciej Liskiewicz,
Ulrich Wölfel:
Provably Secure Steganography and the Complexity of Sampling.
ISAAC 2006: 754-763 |
| 42 | | Andreas Jakoby,
Maciej Liskiewicz,
Aleksander Madry:
Using quantum oblivious transfer to cheat sensitive quantum bit commitment
CoRR abs/quant-ph/0605150: (2006) |
| 41 | | Andreas Jakoby,
Maciej Liskiewicz,
Aleksander Madry:
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment.
Electronic Colloquium on Computational Complexity (ECCC) 13(085): (2006) |
| 40 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Space efficient algorithms for directed series-parallel graphs.
J. Algorithms 60(2): 85-114 (2006) |
| 39 | | Markus Bläser,
Andreas Jakoby,
Maciej Liskiewicz,
Bodo Manthey:
Private Computation: k-Connected versus 1-Connected Networks.
J. Cryptology 19(3): 341-357 (2006) |
| 2005 |
|---|
| 38 |  | Maciej Liskiewicz,
Rüdiger Reischuk:
Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings
Springer 2005 |
| 37 | | Andreas Jakoby,
Maciej Liskiewicz:
Revealing Additional Information in Two-Party Computations.
ASIACRYPT 2005: 121-135 |
| 36 | | Maciej Liskiewicz,
Ulrich Wölfel:
On the Intractability of Inverting Geometric Distortions in Watermarking Schemes.
Information Hiding 2005: 176-188 |
| 35 | | Jan Arpe,
Andreas Jakoby,
Maciej Liskiewicz:
One-way communication complexity of symmetric Boolean functions.
ITA 39(4): 687-706 (2005) |
| 2004 |
|---|
| 34 | | Markus Bläser,
Andreas Jakoby,
Maciej Liskiewicz,
Bodo Manthey:
Privacy in Non-private Environments.
ASIACRYPT 2004: 137-151 |
| 33 | | 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.
WABI 2004: 362-373 |
| 32 | | Maciej Liskiewicz,
Bodo Manthey:
New lower and upper bounds for the competitive ratio of transmission protocols.
Inf. Process. Lett. 89(6): 297-301 (2004) |
| 31 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Approximating schedules for dynamic process graphs efficiently.
J. Discrete Algorithms 2(4): 471-500 (2004) |
| 2003 |
|---|
| 30 | | Jan Arpe,
Andreas Jakoby,
Maciej Liskiewicz:
One-Way Communication Complexity of Symmetric Boolean Functions.
FCT 2003: 158-170 |
| 29 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Private Computations in Networks: Topology versus Randomness.
STACS 2003: 121-132 |
| 28 | | Markus Bläser,
Andreas Jakoby,
Maciej Liskiewicz,
Bodo Manthey:
Private Computation - k-connected versus 1-connected Networks
Electronic Colloquium on Computational Complexity (ECCC) 10(009): (2003) |
| 27 | | Markus Bläser,
Andreas Jakoby,
Maciej Liskiewicz,
Bodo Manthey:
Privacy in Non-Private Environments
Electronic Colloquium on Computational Complexity (ECCC)(071): (2003) |
| 26 | | Jan Arpe,
Andreas Jakoby,
Maciej Liskiewicz:
One-Way Communication Complexity of Symmetric Boolean Functions
Electronic Colloquium on Computational Complexity (ECCC)(083): (2003) |
| 25 | | Maciej Liskiewicz,
Mitsunori Ogihara,
Seinosuke Toda:
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
Theor. Comput. Sci. 1-3(304): 129-156 (2003) |
| 2002 |
|---|
| 24 | | Markus Bläser,
Andreas Jakoby,
Maciej Liskiewicz,
Bodo Siebert:
Private Computation - k-Connected versus 1-Connected Networks.
CRYPTO 2002: 194-209 |
| 23 | | Andreas Jakoby,
Maciej Liskiewicz:
Paths Problems in Symmetric Logarithmic Space.
ICALP 2002: 269-280 |
| 22 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Space Efficient Algorithms for Directed Series-Parallel Graphs
Electronic Colloquium on Computational Complexity (ECCC)(021): (2002) |
| 2001 |
|---|
| 21 | | Andreas Jakoby,
Maciej Liskiewicz:
The Complexity of Some Basic Problems for Dynamic Process Graphs.
ISAAC 2001: 562-574 |
| 20 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Space Efficient Algorithms for Series-Parallel Graphs.
STACS 2001: 339-352 |
| 19 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Dynamic Process Graphs and the Complexity of Scheduling
Electronic Colloquium on Computational Complexity (ECCC)(090): (2001) |
| 2000 |
|---|
| 18 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
The Expressive Power and Complexity of Dynamic Process Graphs.
WG 2000: 230-242 |
| 1999 |
|---|
| 17 | | Andreas Jakoby,
Maciej Liskiewicz,
Rüdiger Reischuk:
Scheduling Dynamic Graphs.
STACS 1999: 383-392 |
| 16 | | Maciej Liskiewicz,
Rüdiger Reischuk:
On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games.
Computational Complexity 8(3): 273-307 (1999) |
| 1997 |
|---|
| 15 | | Maciej Liskiewicz,
Rüdiger Reischuk:
Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds.
MFCS 1997: 91-107 |
| 14 | | Maciej Liskiewicz:
Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity Classes.
STACS 1997: 129-140 |
| 1996 |
|---|
| 13 | | Maciej Liskiewicz,
Rüdiger Reischuk:
The Sublogarithmic Alternating Space World.
SIAM J. Comput. 25(4): 828-861 (1996) |
| 1995 |
|---|
| 12 | | Maciej Liskiewicz,
Rüdiger Reischuk:
The Sublogarithmic Alternating Space World
Electronic Colloquium on Computational Complexity (ECCC) 2(5): (1995) |
| 11 | | Maciej Liskiewicz:
On the Power of 1-Tape Off-Line ATMs Running in a Bounded Number of Reversals.
Mathematical Systems Theory 28(4): 329-339 (1995) |
| 1994 |
|---|
| 10 | | Maciej Liskiewicz,
Rüdiger Reischuk:
The Complexity World below Logarithmic Space.
Structure in Complexity Theory Conference 1994: 64-78 |
| 1993 |
|---|
| 9 | | Maciej Liskiewicz,
Rüdiger Reischuk:
Separating the Lower Levels of the Sublogarithmic Space Hierarchy.
STACS 1993: 16-27 |
| 8 | | Maciej Liskiewicz:
On the Relationship Between Deterministic Time and Deterministic Reversal.
Inf. Process. Lett. 45(3): 143-146 (1993) |
| 1990 |
|---|
| 7 | | Miroslaw Kutylowski,
Maciej Liskiewicz,
Krzysztof Lorys:
Reversal Complexity Classes for Alternating Turing Machines.
SIAM J. Comput. 19(2): 207-221 (1990) |
| 6 | | Maciej Liskiewicz,
Krzysztof Lorys:
Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones.
SIAM J. Comput. 19(3): 511-521 (1990) |
| 1989 |
|---|
| 5 | | Maciej Liskiewicz,
Krzysztof Lorys:
Some Time-Space Bounds for One-Tape Deterministic Turing Machines.
FCT 1989: 297-307 |
| 4 | | Maciej Liskiewicz,
Krzysztof Lorys:
On Reversal Complexity for Alternating Turing Machines (Extended Abstract)
FOCS 1989: 618-623 |
| 1988 |
|---|
| 3 | | Krzysztof Lorys,
Maciej Liskiewicz:
Two Applications of Fürer's Counter to One-Tape Nondeterministic TMs.
MFCS 1988: 445-453 |
| 2 | | Maciej Liskiewicz,
Krzysztof Lorys:
Alternating Real-Time Computations.
Inf. Process. Lett. 28(6): 311-316 (1988) |
| 1987 |
|---|
| 1 | | Maciej Liskiewicz,
Krzysztof Lorys,
Marek Piotrów:
On Reversal Bounded Alternating Turing Machines.
Theor. Comput. Sci. 54: 331-339 (1987) |
