dblp.uni-trier.dewww.uni-trier.de

Maciej Liskiewicz Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
53EEChristian Hundt, Maciej Liskiewicz: New Complexity Bounds for Image Matching under Rotation and Scaling. CPM 2009: 127-141
52EEAndreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer: Improving the average delay of sorting. Theor. Comput. Sci. 410(11): 1030-1041 (2009)
2008
51EEChristian Hundt, Maciej Liskiewicz: Two-Dimensional Pattern Matching with Combined Scaling and Rotation. CPM 2008: 5-17
50EEAndreas Jakoby, Maciej Liskiewicz, Aleksander Madry: Susceptible Two-Party Quantum Computations. ICITS 2008: 121-136
49EEChristian Hundt, Maciej Liskiewicz: Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations. MFCS 2008: 395-406
2007
48EEChristian Hundt, Maciej Liskiewicz: On the Complexity of Affine Image Matching. STACS 2007: 284-295
47EEAndreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer: Improving the Average Delay of Sorting. TAMC 2007: 330-341
46EEChristian Hundt, Maciej Liskiewicz: A Combinatorial Geometric Approach to Linear Image Matching. Electronic Colloquium on Computational Complexity (ECCC) 14(066): (2007)
45EEMaciej Liskiewicz, Rüdiger Reischuk: Preface. Theory Comput. Syst. 41(2): 209-210 (2007)
2006
44EEAndreas Jakoby, Maciej Liskiewicz, Aleksander Madry: Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Complexity of Boolean Functions 2006
43EEMaciej Liskiewicz: Multiparty Computations in Non-private Environments. GTIT-C 2006: 1097-1099
42EEChristian Hundt, Maciej Liskiewicz, Ulrich Wölfel: Provably Secure Steganography and the Complexity of Sampling. ISAAC 2006: 754-763
41EEAndreas Jakoby, Maciej Liskiewicz, Aleksander Madry: Using quantum oblivious transfer to cheat sensitive quantum bit commitment CoRR abs/quant-ph/0605150: (2006)
40EEAndreas Jakoby, Maciej Liskiewicz, Aleksander Madry: Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment. Electronic Colloquium on Computational Complexity (ECCC) 13(085): (2006)
39EEAndreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk: Space efficient algorithms for directed series-parallel graphs. J. Algorithms 60(2): 85-114 (2006)
38EEMarkus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey: Private Computation: k-Connected versus 1-Connected Networks. J. Cryptology 19(3): 341-357 (2006)
2005
37 Maciej Liskiewicz, Rüdiger Reischuk: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings Springer 2005
36EEAndreas Jakoby, Maciej Liskiewicz: Revealing Additional Information in Two-Party Computations. ASIACRYPT 2005: 121-135
35EEMaciej Liskiewicz, Ulrich Wölfel: On the Intractability of Inverting Geometric Distortions in Watermarking Schemes. Information Hiding 2005: 176-188
2004
34EEMarkus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey: Privacy in Non-private Environments. ASIACRYPT 2004: 137-151
33EEMaciej 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
32EEMaciej Liskiewicz, Bodo Manthey: New lower and upper bounds for the competitive ratio of transmission protocols. Inf. Process. Lett. 89(6): 297-301 (2004)
31EEAndreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk: Approximating schedules for dynamic process graphs efficiently. J. Discrete Algorithms 2(4): 471-500 (2004)
2003
30EEJan Arpe, Andreas Jakoby, Maciej Liskiewicz: One-Way Communication Complexity of Symmetric Boolean Functions. FCT 2003: 158-170
29EEAndreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk: Private Computations in Networks: Topology versus Randomness. STACS 2003: 121-132
28EEMarkus 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)
27EEMarkus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey: Privacy in Non-Private Environments Electronic Colloquium on Computational Complexity (ECCC)(071): (2003)
26EEJan Arpe, Andreas Jakoby, Maciej Liskiewicz: One-Way Communication Complexity of Symmetric Boolean Functions Electronic Colloquium on Computational Complexity (ECCC)(083): (2003)
25EEMaciej 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
24EEMarkus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Siebert: Private Computation - k-Connected versus 1-Connected Networks. CRYPTO 2002: 194-209
23EEAndreas Jakoby, Maciej Liskiewicz: Paths Problems in Symmetric Logarithmic Space. ICALP 2002: 269-280
22EEAndreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk: Space Efficient Algorithms for Directed Series-Parallel Graphs Electronic Colloquium on Computational Complexity (ECCC)(021): (2002)
2001
21EEAndreas Jakoby, Maciej Liskiewicz: The Complexity of Some Basic Problems for Dynamic Process Graphs. ISAAC 2001: 562-574
20EEAndreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk: Space Efficient Algorithms for Series-Parallel Graphs. STACS 2001: 339-352
19EEAndreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk: Dynamic Process Graphs and the Complexity of Scheduling Electronic Colloquium on Computational Complexity (ECCC)(090): (2001)
2000
18EEAndreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk: The Expressive Power and Complexity of Dynamic Process Graphs. WG 2000: 230-242
1999
17EEAndreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk: Scheduling Dynamic Graphs. STACS 1999: 383-392
16EEMaciej 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
15EEMaciej Liskiewicz, Rüdiger Reischuk: Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds. MFCS 1997: 91-107
14EEMaciej 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
12EEMaciej 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
9EEMaciej 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
3EEKrzysztof 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)

Coauthor Index

1Jan Arpe [26] [30]
2Markus Bläser [24] [27] [28] [34] [38]
3Christian Hundt [42] [46] [48] [49] [51] [53]
4Andreas Jakoby [17] [18] [19] [20] [21] [22] [23] [24] [26] [27] [28] [29] [30] [31] [34] [36] [38] [39] [40] [41] [44] [47] [50] [52]
5Miroslaw Kutylowski [7]
6Krzysztof Lorys [1] [2] [3] [4] [5] [6] [7]
7Aleksander Madry [40] [41] [44] [50]
8Bodo Manthey (Bodo Siebert) [24] [27] [28] [32] [34] [38]
9Mitsunori Ogihara (Mitsunori Ogiwara) [25]
10Marek Piotrów [1]
11Hemant J. Purohit [33]
12Dhananjay V. Raje [33]
13Rüdiger Reischuk [9] [10] [12] [13] [15] [16] [17] [18] [19] [20] [22] [29] [31] [37] [39] [45] [47] [52]
14Christian Schindelhauer [47] [52]
15Seinosuke Toda [25]
16Ulrich Wölfel [35] [42]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)